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/bAnd2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:23:56,592 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:23:56,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:23:56,614 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:23:56,614 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:23:56,616 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:23:56,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:23:56,621 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:23:56,623 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:23:56,624 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:23:56,627 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:23:56,627 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:23:56,628 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:23:56,629 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:23:56,635 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:23:56,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:23:56,639 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:23:56,641 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:23:56,651 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:23:56,656 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:23:56,658 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:23:56,661 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:23:56,666 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:23:56,667 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:23:56,667 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:23:56,668 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:23:56,669 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:23:56,673 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:23:56,674 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:23:56,677 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:23:56,677 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:23:56,678 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:23:56,680 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:23:56,681 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:23:56,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:23:56,682 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:23:56,683 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:56,702 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:23:56,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:23:56,704 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:23:56,704 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:23:56,704 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:23:56,705 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:23:56,705 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:23:56,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:23:56,705 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:23:56,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:23:56,706 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:23:56,707 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:23:56,707 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:23:56,707 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:23:56,707 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:23:56,707 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:23:56,708 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:23:56,708 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:23:56,708 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:23:56,708 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:23:56,708 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:23:56,710 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:23:56,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:23:56,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:23:56,710 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:23:56,711 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:23:56,711 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:23:56,711 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:23:56,711 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:23:56,711 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:23:56,712 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:23:56,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:23:56,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:23:56,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:23:56,788 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:23:56,789 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:23:56,789 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bAnd2_true-unreach-call.i [2018-11-23 12:23:56,858 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd74e15c/5310de26163c4fd9b7eb547f7e5bb114/FLAGb50a9616a [2018-11-23 12:23:57,301 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:23:57,302 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd2_true-unreach-call.i [2018-11-23 12:23:57,308 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd74e15c/5310de26163c4fd9b7eb547f7e5bb114/FLAGb50a9616a [2018-11-23 12:23:57,698 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd74e15c/5310de26163c4fd9b7eb547f7e5bb114 [2018-11-23 12:23:57,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:23:57,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:23:57,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:23:57,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:23:57,716 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:23:57,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:57" (1/1) ... [2018-11-23 12:23:57,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65764f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:57, skipping insertion in model container [2018-11-23 12:23:57,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:57" (1/1) ... [2018-11-23 12:23:57,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:23:57,754 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:23:57,985 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:23:57,997 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:23:58,026 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:23:58,044 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:23:58,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:58 WrapperNode [2018-11-23 12:23:58,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:23:58,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:23:58,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:23:58,046 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:23:58,056 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:58" (1/1) ... [2018-11-23 12:23:58,067 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:58" (1/1) ... [2018-11-23 12:23:58,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:23:58,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:23:58,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:23:58,077 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:23:58,091 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:58" (1/1) ... [2018-11-23 12:23:58,091 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:58" (1/1) ... [2018-11-23 12:23:58,093 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:58" (1/1) ... [2018-11-23 12:23:58,093 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:58" (1/1) ... [2018-11-23 12:23:58,116 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:58" (1/1) ... [2018-11-23 12:23:58,136 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:58" (1/1) ... [2018-11-23 12:23:58,140 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:58" (1/1) ... [2018-11-23 12:23:58,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:23:58,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:23:58,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:23:58,147 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:23:58,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:58" (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:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:23:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:23:58,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:23:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:23:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2018-11-23 12:23:58,285 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2018-11-23 12:23:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:23:58,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:23:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:23:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:23:58,286 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:23:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:23:58,986 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:23:58,986 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:23:58,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:58 BoogieIcfgContainer [2018-11-23 12:23:58,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:23:58,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:23:58,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:23:58,991 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:23:58,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:23:57" (1/3) ... [2018-11-23 12:23:58,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1630e8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:58, skipping insertion in model container [2018-11-23 12:23:58,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:58" (2/3) ... [2018-11-23 12:23:58,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1630e8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:58, skipping insertion in model container [2018-11-23 12:23:58,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:58" (3/3) ... [2018-11-23 12:23:58,995 INFO L112 eAbstractionObserver]: Analyzing ICFG bAnd2_true-unreach-call.i [2018-11-23 12:23:59,004 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:23:59,012 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:23:59,030 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:23:59,066 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:23:59,067 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:23:59,067 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:23:59,067 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:23:59,067 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:23:59,067 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:23:59,068 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:23:59,068 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:23:59,068 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:23:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:23:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:23:59,093 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:59,094 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:59,096 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:59,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:59,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2018-11-23 12:23:59,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:59,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:59,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:59,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:59,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:59,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:23:59,332 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:59,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:23:59,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 12:23:59,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret13 := main(); {34#true} is VALID [2018-11-23 12:23:59,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34#true} is VALID [2018-11-23 12:23:59,347 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:23:59,348 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:59,348 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:59,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !(~i~0 < 1000); {34#true} is VALID [2018-11-23 12:23:59,349 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:59,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:23:59,350 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {34#true} {35#false} #70#return; {35#false} is VALID [2018-11-23 12:23:59,350 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:59,351 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:59,351 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:59,351 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !(~i~0 < 1000); {34#true} is VALID [2018-11-23 12:23:59,352 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:59,352 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:23:59,352 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #72#return; {35#false} is VALID [2018-11-23 12:23:59,353 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:59,353 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:23:59,353 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:23:59,354 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:59,354 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:59,354 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !(~i~0 < 1000); {34#true} is VALID [2018-11-23 12:23:59,355 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:59,355 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:23:59,355 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #74#return; {35#false} is VALID [2018-11-23 12:23:59,356 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:59,356 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:59,356 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:23:59,363 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:59,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:59,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:23:59,371 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:23:59,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:59,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:23:59,610 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:59,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:23:59,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:23:59,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:23:59,621 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:23:59,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:59,745 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 12:23:59,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:23:59,745 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:23:59,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:23:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:23:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:23:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:23:59,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 12:24:00,005 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:00,017 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:24:00,018 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:24:00,022 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:24:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:24:00,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:24:00,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:00,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:24:00,090 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:24:00,090 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:24:00,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:00,096 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:24:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:24:00,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:00,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:00,097 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:24:00,098 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:24:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:00,103 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:24:00,103 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:24:00,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:00,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:00,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:00,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:24:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:24:00,110 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 12:24:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:00,111 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:24:00,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:24:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:24:00,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:24:00,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:00,113 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:24:00,113 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:00,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:00,114 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2018-11-23 12:24:00,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:00,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:00,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:00,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:00,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:00,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2018-11-23 12:24:00,215 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:24:00,215 INFO L273 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:24:00,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #66#return; {198#true} is VALID [2018-11-23 12:24:00,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret13 := main(); {198#true} is VALID [2018-11-23 12:24:00,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {198#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:24:00,220 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= main_~i~1 0)} assume !(~i~1 < 1000); {199#false} is VALID [2018-11-23 12:24:00,220 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:24:00,220 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:24:00,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#true} assume !(~i~0 < 1000); {198#true} is VALID [2018-11-23 12:24:00,221 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:24:00,221 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:24:00,221 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {198#true} {199#false} #70#return; {199#false} is VALID [2018-11-23 12:24:00,222 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:24:00,222 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:24:00,222 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:24:00,222 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#true} assume !(~i~0 < 1000); {198#true} is VALID [2018-11-23 12:24:00,223 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:24:00,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:24:00,223 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {198#true} {199#false} #72#return; {199#false} is VALID [2018-11-23 12:24:00,224 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:24:00,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {199#false} assume !(~i~2 < 999); {199#false} is VALID [2018-11-23 12:24:00,224 INFO L273 TraceCheckUtils]: 22: Hoare triple {199#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:24:00,225 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:24:00,225 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:24:00,225 INFO L273 TraceCheckUtils]: 25: Hoare triple {198#true} assume !(~i~0 < 1000); {198#true} is VALID [2018-11-23 12:24:00,226 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:24:00,226 INFO L273 TraceCheckUtils]: 27: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:24:00,226 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {198#true} {199#false} #74#return; {199#false} is VALID [2018-11-23 12:24:00,227 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:24:00,227 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:24:00,228 INFO L273 TraceCheckUtils]: 31: Hoare triple {199#false} assume !false; {199#false} is VALID [2018-11-23 12:24:00,230 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:24:00,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:24:00,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:24:00,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:24:00,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:00,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:24:00,287 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:24:00,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:24:00,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:24:00,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:24:00,289 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 12:24:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:00,617 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:24:00,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:24:00,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:24:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:24:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:24:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:24:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:24:00,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:24:01,003 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:24:01,006 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:24:01,006 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:24:01,008 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:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:24:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:24:01,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:01,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:24:01,026 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:24:01,026 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:24:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:01,030 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:24:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:24:01,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:01,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:01,032 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:24:01,032 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:24:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:01,035 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:24:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:24:01,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:01,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:01,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:01,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:24:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:24:01,040 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:24:01,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:01,040 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:24:01,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:24:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:24:01,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:24:01,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:01,042 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:24:01,042 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:01,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:01,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2018-11-23 12:24:01,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:01,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:01,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:01,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:01,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:01,163 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:24:01,164 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:24:01,164 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:24:01,164 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:24:01,165 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret13 := main(); {362#true} is VALID [2018-11-23 12:24:01,165 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:24:01,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 1000);assume -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:24:01,166 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:24:01,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 1000); {362#true} is VALID [2018-11-23 12:24:01,166 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:24:01,167 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:24:01,168 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= bAnd_~i~0 1)} assume !(~i~0 < 1000); {363#false} is VALID [2018-11-23 12:24:01,168 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:24:01,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:24:01,169 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:24:01,169 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:24:01,169 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:24:01,169 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:24:01,170 INFO L273 TraceCheckUtils]: 18: Hoare triple {362#true} assume !(~i~0 < 1000); {362#true} is VALID [2018-11-23 12:24:01,170 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:24:01,170 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:24:01,171 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {362#true} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:24:01,171 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:24:01,171 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 999); {363#false} is VALID [2018-11-23 12:24:01,171 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:24:01,172 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:24:01,172 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:24:01,172 INFO L273 TraceCheckUtils]: 27: Hoare triple {362#true} assume !(~i~0 < 1000); {362#true} is VALID [2018-11-23 12:24:01,173 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:24:01,173 INFO L273 TraceCheckUtils]: 29: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:24:01,173 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {362#true} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:24:01,174 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:24:01,174 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:24:01,174 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:24:01,177 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:24:01,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:01,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:24:01,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:01,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:01,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:24:01,453 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:24:01,453 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:24:01,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:24:01,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret13 := main(); {362#true} is VALID [2018-11-23 12:24:01,454 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:24:01,454 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 1000);assume -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:24:01,455 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:24:01,455 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 1000); {362#true} is VALID [2018-11-23 12:24:01,455 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:24:01,459 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:24:01,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(<= bAnd_~i~0 1)} assume !(~i~0 < 1000); {363#false} is VALID [2018-11-23 12:24:01,460 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:24:01,461 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:24:01,461 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:24:01,461 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:24:01,461 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:24:01,462 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:24:01,462 INFO L273 TraceCheckUtils]: 18: Hoare triple {363#false} assume !(~i~0 < 1000); {363#false} is VALID [2018-11-23 12:24:01,462 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:24:01,463 INFO L273 TraceCheckUtils]: 20: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:24:01,463 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {363#false} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:24:01,463 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:24:01,463 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 999); {363#false} is VALID [2018-11-23 12:24:01,464 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:24:01,464 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:24:01,464 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:24:01,465 INFO L273 TraceCheckUtils]: 27: Hoare triple {363#false} assume !(~i~0 < 1000); {363#false} is VALID [2018-11-23 12:24:01,465 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:24:01,465 INFO L273 TraceCheckUtils]: 29: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:24:01,466 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {363#false} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:24:01,466 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:24:01,466 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:24:01,467 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:24:01,469 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:24:01,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:24:01,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:24:01,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:24:01,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:01,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:24:01,608 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:24:01,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:24:01,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:24:01,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:24:01,609 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2018-11-23 12:24:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:01,933 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:24:01,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:24:01,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:24:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:24:01,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:24:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:24:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:24:01,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:24:02,044 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:24:02,047 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:24:02,047 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:24:02,047 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:24:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:24:02,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:24:02,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:02,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:24:02,065 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:24:02,065 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:24:02,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:02,068 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:24:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:24:02,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:02,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:02,069 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:24:02,070 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:24:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:02,072 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:24:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:24:02,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:02,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:02,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:02,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:24:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:24:02,076 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2018-11-23 12:24:02,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:02,077 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:24:02,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:24:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:24:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:24:02,079 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:02,079 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:24:02,079 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:02,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:02,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2063023467, now seen corresponding path program 1 times [2018-11-23 12:24:02,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:02,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:02,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:02,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:02,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:02,202 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-23 12:24:02,203 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:24:02,203 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:24:02,203 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #66#return; {630#true} is VALID [2018-11-23 12:24:02,204 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret13 := main(); {630#true} is VALID [2018-11-23 12:24:02,204 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {630#true} is VALID [2018-11-23 12:24:02,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {630#true} assume !!(~i~1 < 1000);assume -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:24:02,204 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:24:02,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {630#true} assume !(~i~1 < 1000); {630#true} is VALID [2018-11-23 12:24:02,205 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:24:02,205 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:24:02,205 INFO L273 TraceCheckUtils]: 11: Hoare triple {630#true} assume !!(~i~0 < 1000);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:24:02,206 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:24:02,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {630#true} assume !(~i~0 < 1000); {630#true} is VALID [2018-11-23 12:24:02,206 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:24:02,207 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:24:02,207 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {630#true} {630#true} #70#return; {630#true} is VALID [2018-11-23 12:24:02,207 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:24:02,208 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:24:02,208 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:24:02,208 INFO L273 TraceCheckUtils]: 20: Hoare triple {630#true} assume !!(~i~0 < 1000);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:24:02,209 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:24:02,209 INFO L273 TraceCheckUtils]: 22: Hoare triple {630#true} assume !(~i~0 < 1000); {630#true} is VALID [2018-11-23 12:24:02,209 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:24:02,209 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:24:02,210 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {630#true} {630#true} #72#return; {630#true} is VALID [2018-11-23 12:24:02,216 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:24:02,218 INFO L273 TraceCheckUtils]: 27: Hoare triple {632#(= main_~i~2 0)} assume !(~i~2 < 999); {631#false} is VALID [2018-11-23 12:24:02,218 INFO L273 TraceCheckUtils]: 28: Hoare triple {631#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {631#false} is VALID [2018-11-23 12:24:02,218 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:24:02,218 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:24:02,219 INFO L273 TraceCheckUtils]: 31: Hoare triple {630#true} assume !!(~i~0 < 1000);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:24:02,219 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:24:02,219 INFO L273 TraceCheckUtils]: 33: Hoare triple {630#true} assume !(~i~0 < 1000); {630#true} is VALID [2018-11-23 12:24:02,219 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:24:02,219 INFO L273 TraceCheckUtils]: 35: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:24:02,220 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {630#true} {631#false} #74#return; {631#false} is VALID [2018-11-23 12:24:02,220 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:24:02,220 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:24:02,220 INFO L273 TraceCheckUtils]: 39: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-23 12:24:02,223 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:24:02,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:24:02,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:24:02,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:24:02,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:02,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:24:02,327 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:24:02,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:24:02,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:24:02,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:24:02,328 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 12:24:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:02,426 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:24:02,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:24:02,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:24:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:24:02,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:24:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:24:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:24:02,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 12:24:02,556 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:02,557 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:24:02,558 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:24:02,558 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:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:24:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:24:02,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:02,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:24:02,570 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:24:02,571 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:24:02,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:02,573 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:24:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:24:02,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:02,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:02,575 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:24:02,575 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:24:02,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:02,577 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:24:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:24:02,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:02,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:02,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:02,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:24:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:24:02,581 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2018-11-23 12:24:02,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:02,582 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:24:02,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:24:02,582 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:24:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:24:02,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:02,584 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:02,584 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:02,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:02,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1550668567, now seen corresponding path program 1 times [2018-11-23 12:24:02,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:02,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:02,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:02,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:02,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:02,679 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:24:02,680 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:02,680 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:24:02,680 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:24:02,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret13 := main(); {799#true} is VALID [2018-11-23 12:24:02,681 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:02,682 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:02,685 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:02,687 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 1000); {800#false} is VALID [2018-11-23 12:24:02,687 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:02,687 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:02,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#true} assume !!(~i~0 < 1000);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:02,688 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:02,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {799#true} assume !(~i~0 < 1000); {799#true} is VALID [2018-11-23 12:24:02,688 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:02,688 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:24:02,689 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {799#true} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:24:02,689 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:02,689 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:02,690 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:02,690 INFO L273 TraceCheckUtils]: 20: Hoare triple {799#true} assume !!(~i~0 < 1000);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:02,691 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:02,691 INFO L273 TraceCheckUtils]: 22: Hoare triple {799#true} assume !(~i~0 < 1000); {799#true} is VALID [2018-11-23 12:24:02,691 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:02,692 INFO L273 TraceCheckUtils]: 24: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:24:02,692 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {799#true} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:24:02,692 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:02,692 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:02,693 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:02,693 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 999); {800#false} is VALID [2018-11-23 12:24:02,693 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:24:02,694 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:02,694 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:02,694 INFO L273 TraceCheckUtils]: 33: Hoare triple {799#true} assume !!(~i~0 < 1000);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:02,694 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:02,695 INFO L273 TraceCheckUtils]: 35: Hoare triple {799#true} assume !(~i~0 < 1000); {799#true} is VALID [2018-11-23 12:24:02,695 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:02,695 INFO L273 TraceCheckUtils]: 37: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:24:02,695 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {799#true} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:24:02,696 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:02,696 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:02,696 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:24:02,701 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:02,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:02,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:02,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:02,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:03,120 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:24:03,120 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:03,121 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:24:03,121 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:24:03,121 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret13 := main(); {799#true} is VALID [2018-11-23 12:24:03,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:03,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:03,125 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:03,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 1000); {800#false} is VALID [2018-11-23 12:24:03,126 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:03,126 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:03,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {800#false} assume !!(~i~0 < 1000);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:03,127 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:03,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {800#false} assume !(~i~0 < 1000); {800#false} is VALID [2018-11-23 12:24:03,127 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:03,127 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:24:03,128 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#false} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:24:03,128 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:03,128 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:03,128 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:03,129 INFO L273 TraceCheckUtils]: 20: Hoare triple {800#false} assume !!(~i~0 < 1000);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:03,129 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:03,129 INFO L273 TraceCheckUtils]: 22: Hoare triple {800#false} assume !(~i~0 < 1000); {800#false} is VALID [2018-11-23 12:24:03,129 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:03,130 INFO L273 TraceCheckUtils]: 24: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:24:03,130 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {800#false} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:24:03,130 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:03,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:03,131 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:03,131 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 999); {800#false} is VALID [2018-11-23 12:24:03,131 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:24:03,131 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:03,131 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:03,132 INFO L273 TraceCheckUtils]: 33: Hoare triple {800#false} assume !!(~i~0 < 1000);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:03,132 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:03,132 INFO L273 TraceCheckUtils]: 35: Hoare triple {800#false} assume !(~i~0 < 1000); {800#false} is VALID [2018-11-23 12:24:03,132 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:03,132 INFO L273 TraceCheckUtils]: 37: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:24:03,133 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {800#false} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:24:03,133 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:03,133 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:03,134 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:24:03,136 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:03,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:03,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:24:03,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:24:03,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:03,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:24:03,236 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:03,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:24:03,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:24:03,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:24:03,237 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2018-11-23 12:24:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:03,437 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:24:03,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:24:03,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:24:03,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:24:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:24:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:24:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:24:03,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-23 12:24:03,509 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,511 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:24:03,511 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:24:03,512 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:03,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:24:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:24:03,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:03,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:24:03,592 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:24:03,592 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:24:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:03,595 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:24:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:24:03,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:03,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:03,596 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:24:03,596 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:24:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:03,598 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:24:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:24:03,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:03,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:03,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:03,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:24:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:24:03,602 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2018-11-23 12:24:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:03,602 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:24:03,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:24:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:24:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:24:03,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:03,604 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:03,604 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:03,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:03,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1311885621, now seen corresponding path program 2 times [2018-11-23 12:24:03,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:03,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:03,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:03,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:03,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:03,778 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:24:03,779 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:03,779 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:24:03,779 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:24:03,779 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret13 := main(); {1114#true} is VALID [2018-11-23 12:24:03,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:03,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:03,785 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:03,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:03,787 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:03,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 1000); {1115#false} is VALID [2018-11-23 12:24:03,787 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:03,788 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:03,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {1114#true} assume !!(~i~0 < 1000);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:03,788 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:03,788 INFO L273 TraceCheckUtils]: 15: Hoare triple {1114#true} assume !(~i~0 < 1000); {1114#true} is VALID [2018-11-23 12:24:03,789 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:03,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:24:03,789 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1114#true} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:24:03,789 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:03,789 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:03,790 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:03,790 INFO L273 TraceCheckUtils]: 22: Hoare triple {1114#true} assume !!(~i~0 < 1000);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:03,790 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:03,790 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#true} assume !(~i~0 < 1000); {1114#true} is VALID [2018-11-23 12:24:03,791 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:03,791 INFO L273 TraceCheckUtils]: 26: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:24:03,791 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1114#true} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:24:03,791 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:03,791 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:03,792 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:03,792 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 999); {1115#false} is VALID [2018-11-23 12:24:03,792 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:24:03,792 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:03,792 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:03,793 INFO L273 TraceCheckUtils]: 35: Hoare triple {1114#true} assume !!(~i~0 < 1000);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:03,793 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:03,793 INFO L273 TraceCheckUtils]: 37: Hoare triple {1114#true} assume !(~i~0 < 1000); {1114#true} is VALID [2018-11-23 12:24:03,793 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:03,793 INFO L273 TraceCheckUtils]: 39: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:24:03,794 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1114#true} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:24:03,794 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:03,794 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:03,794 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:24:03,796 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:03,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:03,797 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:03,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:24:03,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:24:03,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:03,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:03,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:24:03,963 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:03,963 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:24:03,963 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:24:03,964 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret13 := main(); {1114#true} is VALID [2018-11-23 12:24:03,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:03,965 INFO L273 TraceCheckUtils]: 6: Hoare triple {1137#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:03,966 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:03,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:03,970 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:03,971 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 1000); {1115#false} is VALID [2018-11-23 12:24:03,971 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:03,972 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:03,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {1115#false} assume !!(~i~0 < 1000);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:03,972 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:03,972 INFO L273 TraceCheckUtils]: 15: Hoare triple {1115#false} assume !(~i~0 < 1000); {1115#false} is VALID [2018-11-23 12:24:03,973 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:03,973 INFO L273 TraceCheckUtils]: 17: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:24:03,973 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1115#false} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:24:03,973 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:03,973 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:03,973 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:03,974 INFO L273 TraceCheckUtils]: 22: Hoare triple {1115#false} assume !!(~i~0 < 1000);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:03,974 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:03,974 INFO L273 TraceCheckUtils]: 24: Hoare triple {1115#false} assume !(~i~0 < 1000); {1115#false} is VALID [2018-11-23 12:24:03,974 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:03,974 INFO L273 TraceCheckUtils]: 26: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:24:03,975 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1115#false} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:24:03,975 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:03,975 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:03,975 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:03,975 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 999); {1115#false} is VALID [2018-11-23 12:24:03,976 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:24:03,976 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:03,976 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:03,976 INFO L273 TraceCheckUtils]: 35: Hoare triple {1115#false} assume !!(~i~0 < 1000);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:03,976 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:03,977 INFO L273 TraceCheckUtils]: 37: Hoare triple {1115#false} assume !(~i~0 < 1000); {1115#false} is VALID [2018-11-23 12:24:03,977 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:03,977 INFO L273 TraceCheckUtils]: 39: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:24:03,978 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1115#false} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:24:03,978 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:03,978 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:03,978 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:24:03,980 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:03,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:03,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:24:04,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:24:04,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:04,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:24:04,056 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:04,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:24:04,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:24:04,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:24:04,057 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-23 12:24:04,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:04,217 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 12:24:04,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:24:04,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:24:04,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:24:04,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:24:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:24:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:24:04,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:24:04,408 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:04,410 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:24:04,411 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:24:04,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:24:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:24:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:24:04,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:04,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:24:04,464 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:24:04,465 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:24:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:04,467 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:24:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:24:04,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:04,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:04,468 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:24:04,468 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:24:04,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:04,470 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:24:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:24:04,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:04,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:04,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:04,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:04,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:24:04,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:24:04,473 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2018-11-23 12:24:04,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:04,473 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:24:04,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:24:04,473 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:24:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:24:04,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:04,474 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:04,475 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:04,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:04,475 INFO L82 PathProgramCache]: Analyzing trace with hash 525258797, now seen corresponding path program 3 times [2018-11-23 12:24:04,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:04,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:04,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:04,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:04,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:05,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:24:05,068 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:05,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:24:05,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:24:05,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret13 := main(); {1446#true} is VALID [2018-11-23 12:24:05,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:05,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {1448#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:05,071 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:05,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {1449#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:05,072 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:05,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {1450#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:05,074 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:05,075 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#(<= main_~i~1 3)} assume !(~i~1 < 1000); {1447#false} is VALID [2018-11-23 12:24:05,075 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:05,075 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:05,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 1000);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:05,076 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:05,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 1000); {1446#true} is VALID [2018-11-23 12:24:05,077 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:05,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:24:05,078 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1447#false} #70#return; {1447#false} is VALID [2018-11-23 12:24:05,078 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:05,078 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:05,079 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:05,079 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 1000);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:05,079 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:05,080 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 1000); {1446#true} is VALID [2018-11-23 12:24:05,080 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:05,080 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:24:05,080 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1447#false} #72#return; {1447#false} is VALID [2018-11-23 12:24:05,081 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:05,081 INFO L273 TraceCheckUtils]: 31: Hoare triple {1447#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,081 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:05,081 INFO L273 TraceCheckUtils]: 33: Hoare triple {1447#false} assume !(~i~2 < 999); {1447#false} is VALID [2018-11-23 12:24:05,082 INFO L273 TraceCheckUtils]: 34: Hoare triple {1447#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:24:05,082 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:05,082 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:05,082 INFO L273 TraceCheckUtils]: 37: Hoare triple {1446#true} assume !!(~i~0 < 1000);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:05,083 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:05,083 INFO L273 TraceCheckUtils]: 39: Hoare triple {1446#true} assume !(~i~0 < 1000); {1446#true} is VALID [2018-11-23 12:24:05,083 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:05,083 INFO L273 TraceCheckUtils]: 41: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:24:05,084 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1446#true} {1447#false} #74#return; {1447#false} is VALID [2018-11-23 12:24:05,084 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:05,084 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:05,084 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:24:05,092 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:05,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:05,093 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:05,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:24:05,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:24:05,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:05,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:05,397 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:24:05,398 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:05,398 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:24:05,398 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:24:05,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret13 := main(); {1446#true} is VALID [2018-11-23 12:24:05,399 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1446#true} is VALID [2018-11-23 12:24:05,399 INFO L273 TraceCheckUtils]: 6: Hoare triple {1446#true} assume !!(~i~1 < 1000);assume -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:05,399 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:05,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {1446#true} assume !!(~i~1 < 1000);assume -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:05,399 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:05,399 INFO L273 TraceCheckUtils]: 10: Hoare triple {1446#true} assume !!(~i~1 < 1000);assume -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:05,400 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:05,400 INFO L273 TraceCheckUtils]: 12: Hoare triple {1446#true} assume !(~i~1 < 1000); {1446#true} is VALID [2018-11-23 12:24:05,400 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:05,400 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:05,400 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 1000);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:05,400 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:05,401 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 1000); {1446#true} is VALID [2018-11-23 12:24:05,401 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:05,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:24:05,401 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1446#true} #70#return; {1446#true} is VALID [2018-11-23 12:24:05,401 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:05,402 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:05,402 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:05,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 1000);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:05,402 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:05,402 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 1000); {1446#true} is VALID [2018-11-23 12:24:05,402 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:05,403 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:24:05,403 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1446#true} #72#return; {1446#true} is VALID [2018-11-23 12:24:05,403 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:05,403 INFO L273 TraceCheckUtils]: 31: Hoare triple {1446#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,403 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:05,404 INFO L273 TraceCheckUtils]: 33: Hoare triple {1446#true} assume !(~i~2 < 999); {1446#true} is VALID [2018-11-23 12:24:05,404 INFO L273 TraceCheckUtils]: 34: Hoare triple {1446#true} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:24:05,404 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:05,405 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:05,405 INFO L273 TraceCheckUtils]: 37: Hoare triple {1563#(<= bAnd_~i~0 1)} assume !!(~i~0 < 1000);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:05,406 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:05,406 INFO L273 TraceCheckUtils]: 39: Hoare triple {1570#(<= bAnd_~i~0 2)} assume !(~i~0 < 1000); {1447#false} is VALID [2018-11-23 12:24:05,406 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:05,407 INFO L273 TraceCheckUtils]: 41: Hoare triple {1447#false} assume true; {1447#false} is VALID [2018-11-23 12:24:05,407 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1447#false} {1446#true} #74#return; {1447#false} is VALID [2018-11-23 12:24:05,407 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:05,407 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:05,407 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:24:05,410 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:05,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:05,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:24:05,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:24:05,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:05,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:24:05,573 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:05,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:24:05,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:24:05,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:24:05,573 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-23 12:24:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:05,913 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 12:24:05,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:24:05,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:24:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:24:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:24:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:24:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:24:05,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2018-11-23 12:24:06,012 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:06,014 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:24:06,014 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:24:06,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:24:06,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:24:06,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:24:06,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:06,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:24:06,033 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:24:06,033 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:24:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:06,035 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:24:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:24:06,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:06,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:06,036 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:24:06,036 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:24:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:06,039 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:24:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:24:06,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:06,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:06,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:06,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:24:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:24:06,042 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2018-11-23 12:24:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:06,042 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:24:06,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:24:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:24:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:24:06,043 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:06,044 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:06,044 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:06,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:06,044 INFO L82 PathProgramCache]: Analyzing trace with hash -174499699, now seen corresponding path program 4 times [2018-11-23 12:24:06,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:06,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:06,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:06,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:06,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:06,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:24:06,190 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:06,190 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:24:06,190 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:24:06,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret13 := main(); {1809#true} is VALID [2018-11-23 12:24:06,191 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:06,192 INFO L273 TraceCheckUtils]: 6: Hoare triple {1811#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:06,192 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:06,193 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:06,193 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:06,194 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:06,195 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:06,196 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:06,196 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:06,197 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 1000); {1810#false} is VALID [2018-11-23 12:24:06,198 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:06,198 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:06,198 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#true} assume !!(~i~0 < 1000);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:06,199 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:06,199 INFO L273 TraceCheckUtils]: 19: Hoare triple {1809#true} assume !!(~i~0 < 1000);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:06,199 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:06,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} assume !(~i~0 < 1000); {1809#true} is VALID [2018-11-23 12:24:06,200 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:06,200 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:24:06,200 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1809#true} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:24:06,201 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:06,201 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:06,201 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:06,202 INFO L273 TraceCheckUtils]: 28: Hoare triple {1809#true} assume !!(~i~0 < 1000);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:06,202 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:06,202 INFO L273 TraceCheckUtils]: 30: Hoare triple {1809#true} assume !!(~i~0 < 1000);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:06,202 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:06,202 INFO L273 TraceCheckUtils]: 32: Hoare triple {1809#true} assume !(~i~0 < 1000); {1809#true} is VALID [2018-11-23 12:24:06,202 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:06,203 INFO L273 TraceCheckUtils]: 34: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:24:06,203 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1809#true} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:24:06,203 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:06,203 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:06,203 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:06,203 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 999); {1810#false} is VALID [2018-11-23 12:24:06,204 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:24:06,204 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:06,204 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:06,204 INFO L273 TraceCheckUtils]: 43: Hoare triple {1809#true} assume !!(~i~0 < 1000);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:06,204 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:06,205 INFO L273 TraceCheckUtils]: 45: Hoare triple {1809#true} assume !!(~i~0 < 1000);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:06,205 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:06,205 INFO L273 TraceCheckUtils]: 47: Hoare triple {1809#true} assume !(~i~0 < 1000); {1809#true} is VALID [2018-11-23 12:24:06,205 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:06,205 INFO L273 TraceCheckUtils]: 49: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:24:06,205 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1809#true} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:24:06,206 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:06,206 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:06,206 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:24:06,209 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:06,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:06,209 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:06,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:24:06,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:24:06,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:06,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:06,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:24:06,399 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:06,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:24:06,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:24:06,399 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret13 := main(); {1809#true} is VALID [2018-11-23 12:24:06,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:06,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {1834#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:06,401 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:06,402 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:06,402 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:06,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:06,403 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:06,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:06,409 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:06,410 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 1000); {1810#false} is VALID [2018-11-23 12:24:06,410 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:06,410 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:06,411 INFO L273 TraceCheckUtils]: 17: Hoare triple {1810#false} assume !!(~i~0 < 1000);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:06,411 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:06,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {1810#false} assume !!(~i~0 < 1000);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:06,411 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:06,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {1810#false} assume !(~i~0 < 1000); {1810#false} is VALID [2018-11-23 12:24:06,412 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:06,412 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:24:06,412 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1810#false} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:24:06,412 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:06,413 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:06,413 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:06,413 INFO L273 TraceCheckUtils]: 28: Hoare triple {1810#false} assume !!(~i~0 < 1000);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:06,414 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:06,414 INFO L273 TraceCheckUtils]: 30: Hoare triple {1810#false} assume !!(~i~0 < 1000);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:06,414 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:06,414 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} assume !(~i~0 < 1000); {1810#false} is VALID [2018-11-23 12:24:06,415 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:06,415 INFO L273 TraceCheckUtils]: 34: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:24:06,415 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1810#false} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:24:06,415 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:06,416 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:06,416 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:06,416 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 999); {1810#false} is VALID [2018-11-23 12:24:06,416 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:24:06,416 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:06,417 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:06,417 INFO L273 TraceCheckUtils]: 43: Hoare triple {1810#false} assume !!(~i~0 < 1000);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:06,417 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:06,417 INFO L273 TraceCheckUtils]: 45: Hoare triple {1810#false} assume !!(~i~0 < 1000);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:06,418 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:06,418 INFO L273 TraceCheckUtils]: 47: Hoare triple {1810#false} assume !(~i~0 < 1000); {1810#false} is VALID [2018-11-23 12:24:06,418 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:06,418 INFO L273 TraceCheckUtils]: 49: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:24:06,419 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1810#false} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:24:06,419 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:06,419 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:06,419 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:24:06,423 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:06,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:06,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:24:06,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:24:06,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:06,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:24:06,501 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:06,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:24:06,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:24:06,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:24:06,503 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 12:24:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:06,788 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:24:06,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:24:06,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:24:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:24:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:24:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:24:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:24:06,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2018-11-23 12:24:06,911 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:06,913 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:24:06,913 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:24:06,914 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:06,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:24:06,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:24:06,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:06,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:24:06,999 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:24:06,999 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:24:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:07,002 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:24:07,002 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:24:07,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:07,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:07,002 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:24:07,002 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:24:07,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:07,004 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:24:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:24:07,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:07,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:07,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:07,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:24:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:24:07,007 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2018-11-23 12:24:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:07,007 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:24:07,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:24:07,008 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:24:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:24:07,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:07,008 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:07,009 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:07,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:07,009 INFO L82 PathProgramCache]: Analyzing trace with hash 830152559, now seen corresponding path program 5 times [2018-11-23 12:24:07,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:07,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:07,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:07,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:07,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:07,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:24:07,291 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:07,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:24:07,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:24:07,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret13 := main(); {2206#true} is VALID [2018-11-23 12:24:07,297 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:07,297 INFO L273 TraceCheckUtils]: 6: Hoare triple {2208#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:07,298 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:07,298 INFO L273 TraceCheckUtils]: 8: Hoare triple {2209#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:07,307 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:07,316 INFO L273 TraceCheckUtils]: 10: Hoare triple {2210#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:07,317 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:07,317 INFO L273 TraceCheckUtils]: 12: Hoare triple {2211#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:07,318 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:07,318 INFO L273 TraceCheckUtils]: 14: Hoare triple {2212#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:07,318 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:07,319 INFO L273 TraceCheckUtils]: 16: Hoare triple {2213#(<= main_~i~1 5)} assume !(~i~1 < 1000); {2207#false} is VALID [2018-11-23 12:24:07,319 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:07,319 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:07,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#true} assume !!(~i~0 < 1000);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:07,319 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:07,320 INFO L273 TraceCheckUtils]: 21: Hoare triple {2206#true} assume !!(~i~0 < 1000);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:07,320 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:07,320 INFO L273 TraceCheckUtils]: 23: Hoare triple {2206#true} assume !(~i~0 < 1000); {2206#true} is VALID [2018-11-23 12:24:07,320 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:07,320 INFO L273 TraceCheckUtils]: 25: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:24:07,320 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2206#true} {2207#false} #70#return; {2207#false} is VALID [2018-11-23 12:24:07,320 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:07,321 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:07,321 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:07,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {2206#true} assume !!(~i~0 < 1000);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:07,321 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:07,321 INFO L273 TraceCheckUtils]: 32: Hoare triple {2206#true} assume !!(~i~0 < 1000);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:07,322 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:07,322 INFO L273 TraceCheckUtils]: 34: Hoare triple {2206#true} assume !(~i~0 < 1000); {2206#true} is VALID [2018-11-23 12:24:07,322 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:07,322 INFO L273 TraceCheckUtils]: 36: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:24:07,322 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2206#true} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:24:07,323 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:07,323 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:07,323 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:07,323 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 999); {2207#false} is VALID [2018-11-23 12:24:07,323 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:24:07,323 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:07,323 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:07,324 INFO L273 TraceCheckUtils]: 45: Hoare triple {2206#true} assume !!(~i~0 < 1000);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:07,324 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:07,324 INFO L273 TraceCheckUtils]: 47: Hoare triple {2206#true} assume !!(~i~0 < 1000);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:07,324 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:07,324 INFO L273 TraceCheckUtils]: 49: Hoare triple {2206#true} assume !(~i~0 < 1000); {2206#true} is VALID [2018-11-23 12:24:07,324 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:07,324 INFO L273 TraceCheckUtils]: 51: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:24:07,324 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2206#true} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:24:07,325 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:07,325 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:07,325 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:24:07,327 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:07,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:07,327 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:07,336 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:24:07,410 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:24:07,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:07,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:07,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:24:07,555 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:07,555 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:24:07,555 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:24:07,555 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret13 := main(); {2206#true} is VALID [2018-11-23 12:24:07,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2206#true} is VALID [2018-11-23 12:24:07,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {2206#true} assume !!(~i~1 < 1000);assume -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:07,555 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:07,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {2206#true} assume !!(~i~1 < 1000);assume -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:07,556 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:07,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#true} assume !!(~i~1 < 1000);assume -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:07,556 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:07,556 INFO L273 TraceCheckUtils]: 12: Hoare triple {2206#true} assume !!(~i~1 < 1000);assume -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:07,556 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:07,556 INFO L273 TraceCheckUtils]: 14: Hoare triple {2206#true} assume !!(~i~1 < 1000);assume -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:07,556 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:07,557 INFO L273 TraceCheckUtils]: 16: Hoare triple {2206#true} assume !(~i~1 < 1000); {2206#true} is VALID [2018-11-23 12:24:07,557 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:07,557 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:07,558 INFO L273 TraceCheckUtils]: 19: Hoare triple {2271#(<= bAnd_~i~0 1)} assume !!(~i~0 < 1000);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:07,558 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:07,558 INFO L273 TraceCheckUtils]: 21: Hoare triple {2278#(<= bAnd_~i~0 2)} assume !!(~i~0 < 1000);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:07,559 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:07,559 INFO L273 TraceCheckUtils]: 23: Hoare triple {2285#(<= bAnd_~i~0 3)} assume !(~i~0 < 1000); {2207#false} is VALID [2018-11-23 12:24:07,559 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:07,560 INFO L273 TraceCheckUtils]: 25: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:24:07,560 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2207#false} {2206#true} #70#return; {2207#false} is VALID [2018-11-23 12:24:07,560 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:07,560 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:07,560 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:07,560 INFO L273 TraceCheckUtils]: 30: Hoare triple {2207#false} assume !!(~i~0 < 1000);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:07,560 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:07,561 INFO L273 TraceCheckUtils]: 32: Hoare triple {2207#false} assume !!(~i~0 < 1000);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:07,561 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:07,561 INFO L273 TraceCheckUtils]: 34: Hoare triple {2207#false} assume !(~i~0 < 1000); {2207#false} is VALID [2018-11-23 12:24:07,561 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:07,561 INFO L273 TraceCheckUtils]: 36: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:24:07,561 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2207#false} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:24:07,561 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:07,562 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:07,562 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:07,562 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 999); {2207#false} is VALID [2018-11-23 12:24:07,562 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:24:07,563 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:07,563 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:07,563 INFO L273 TraceCheckUtils]: 45: Hoare triple {2207#false} assume !!(~i~0 < 1000);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:07,564 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:07,564 INFO L273 TraceCheckUtils]: 47: Hoare triple {2207#false} assume !!(~i~0 < 1000);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:07,564 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:07,564 INFO L273 TraceCheckUtils]: 49: Hoare triple {2207#false} assume !(~i~0 < 1000); {2207#false} is VALID [2018-11-23 12:24:07,564 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:07,565 INFO L273 TraceCheckUtils]: 51: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:24:07,565 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2207#false} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:24:07,565 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:07,565 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:07,565 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:24:07,567 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:07,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:07,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 12:24:07,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:24:07,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:07,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:24:07,951 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:07,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:24:07,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:24:07,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:24:07,952 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-11-23 12:24:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:08,660 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-23 12:24:08,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:24:08,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:24:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:24:08,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:24:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:24:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:24:08,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 12:24:08,740 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:08,741 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:24:08,742 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:24:08,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:24:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:24:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 12:24:08,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:08,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 12:24:08,777 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 12:24:08,777 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 12:24:08,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:08,779 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:24:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:24:08,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:08,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:08,780 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 12:24:08,780 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 12:24:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:08,789 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:24:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:24:08,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:08,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:08,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:08,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:24:08,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 12:24:08,793 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2018-11-23 12:24:08,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:08,793 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 12:24:08,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:24:08,793 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:24:08,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:24:08,794 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:08,794 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:08,794 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:08,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:08,795 INFO L82 PathProgramCache]: Analyzing trace with hash 968039375, now seen corresponding path program 6 times [2018-11-23 12:24:08,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:08,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:08,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:08,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:08,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:09,120 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:24:09,120 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:09,120 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:24:09,121 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:24:09,121 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret13 := main(); {2635#true} is VALID [2018-11-23 12:24:09,122 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:09,122 INFO L273 TraceCheckUtils]: 6: Hoare triple {2637#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:09,123 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:09,123 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:09,123 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:09,124 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:09,124 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:09,124 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:09,125 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:09,126 INFO L273 TraceCheckUtils]: 14: Hoare triple {2641#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:09,132 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:09,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {2642#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:09,133 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:09,133 INFO L273 TraceCheckUtils]: 18: Hoare triple {2643#(<= main_~i~1 6)} assume !(~i~1 < 1000); {2636#false} is VALID [2018-11-23 12:24:09,134 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:09,134 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:09,134 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 1000);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:09,134 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:09,134 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 1000);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:09,134 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:09,134 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 1000);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:09,135 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:09,135 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 1000); {2635#true} is VALID [2018-11-23 12:24:09,135 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:09,135 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:24:09,135 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2636#false} #70#return; {2636#false} is VALID [2018-11-23 12:24:09,135 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:09,135 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:09,135 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:09,136 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 1000);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:09,136 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:09,136 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 1000);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:09,136 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:09,136 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 1000);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:09,136 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:09,136 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 1000); {2635#true} is VALID [2018-11-23 12:24:09,136 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:09,137 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:24:09,137 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2636#false} #72#return; {2636#false} is VALID [2018-11-23 12:24:09,137 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:09,137 INFO L273 TraceCheckUtils]: 45: Hoare triple {2636#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:09,137 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:09,137 INFO L273 TraceCheckUtils]: 47: Hoare triple {2636#false} assume !(~i~2 < 999); {2636#false} is VALID [2018-11-23 12:24:09,137 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:24:09,137 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:09,138 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:09,138 INFO L273 TraceCheckUtils]: 51: Hoare triple {2635#true} assume !!(~i~0 < 1000);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:09,138 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:09,138 INFO L273 TraceCheckUtils]: 53: Hoare triple {2635#true} assume !!(~i~0 < 1000);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:09,138 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:09,138 INFO L273 TraceCheckUtils]: 55: Hoare triple {2635#true} assume !!(~i~0 < 1000);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:09,138 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:09,138 INFO L273 TraceCheckUtils]: 57: Hoare triple {2635#true} assume !(~i~0 < 1000); {2635#true} is VALID [2018-11-23 12:24:09,139 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:09,139 INFO L273 TraceCheckUtils]: 59: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:24:09,139 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2635#true} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:24:09,139 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:09,139 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:09,139 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:24:09,141 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:09,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:09,142 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:09,152 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:24:09,188 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:24:09,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:09,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:09,373 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:24:09,373 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:09,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:24:09,373 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:24:09,374 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret13 := main(); {2635#true} is VALID [2018-11-23 12:24:09,374 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2635#true} is VALID [2018-11-23 12:24:09,374 INFO L273 TraceCheckUtils]: 6: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -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:09,374 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:09,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -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:09,375 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:09,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -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:09,375 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:09,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -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:09,375 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:09,376 INFO L273 TraceCheckUtils]: 14: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -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:09,376 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:09,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -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:09,376 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:09,376 INFO L273 TraceCheckUtils]: 18: Hoare triple {2635#true} assume !(~i~1 < 1000); {2635#true} is VALID [2018-11-23 12:24:09,376 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:09,376 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:09,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 1000);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:09,377 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:09,377 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 1000);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:09,377 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:09,377 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 1000);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:09,377 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:09,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 1000); {2635#true} is VALID [2018-11-23 12:24:09,377 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:09,377 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:24:09,378 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2635#true} #70#return; {2635#true} is VALID [2018-11-23 12:24:09,378 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:09,378 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:09,378 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:09,378 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 1000);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:09,378 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:09,378 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 1000);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:09,378 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:09,379 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 1000);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:09,379 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:09,379 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 1000); {2635#true} is VALID [2018-11-23 12:24:09,379 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:09,379 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:24:09,379 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2635#true} #72#return; {2635#true} is VALID [2018-11-23 12:24:09,380 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:09,380 INFO L273 TraceCheckUtils]: 45: Hoare triple {2779#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:09,381 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:09,381 INFO L273 TraceCheckUtils]: 47: Hoare triple {2786#(<= main_~i~2 1)} assume !(~i~2 < 999); {2636#false} is VALID [2018-11-23 12:24:09,381 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:24:09,381 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:09,381 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:09,382 INFO L273 TraceCheckUtils]: 51: Hoare triple {2636#false} assume !!(~i~0 < 1000);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:09,382 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:09,382 INFO L273 TraceCheckUtils]: 53: Hoare triple {2636#false} assume !!(~i~0 < 1000);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:09,382 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:09,382 INFO L273 TraceCheckUtils]: 55: Hoare triple {2636#false} assume !!(~i~0 < 1000);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:09,382 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:09,383 INFO L273 TraceCheckUtils]: 57: Hoare triple {2636#false} assume !(~i~0 < 1000); {2636#false} is VALID [2018-11-23 12:24:09,383 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:09,383 INFO L273 TraceCheckUtils]: 59: Hoare triple {2636#false} assume true; {2636#false} is VALID [2018-11-23 12:24:09,383 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2636#false} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:24:09,383 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:09,384 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:09,384 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:24:09,386 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:09,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:09,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:24:09,417 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:24:09,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:09,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:24:09,548 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:09,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:24:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:24:09,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:24:09,549 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-11-23 12:24:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:09,939 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:24:09,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:24:09,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:24:09,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:24:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:24:09,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:24:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:24:09,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:24:10,067 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:10,069 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:24:10,069 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:24:10,070 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:10,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:24:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:24:10,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:10,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:24:10,095 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:24:10,095 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:24:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:10,098 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:24:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:24:10,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:10,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:10,099 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:24:10,099 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:24:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:10,101 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:24:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:24:10,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:10,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:10,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:10,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:10,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:24:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 12:24:10,104 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2018-11-23 12:24:10,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:10,104 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 12:24:10,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:24:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:24:10,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:24:10,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:10,105 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:10,106 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:10,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:10,106 INFO L82 PathProgramCache]: Analyzing trace with hash -117250513, now seen corresponding path program 7 times [2018-11-23 12:24:10,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:10,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:10,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:10,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:10,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:10,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:24:10,295 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:10,296 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:24:10,296 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:24:10,296 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret13 := main(); {3111#true} is VALID [2018-11-23 12:24:10,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:10,297 INFO L273 TraceCheckUtils]: 6: Hoare triple {3113#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:10,298 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:10,298 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:10,299 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:10,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:10,300 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:10,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:10,302 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:10,302 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:10,303 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:10,303 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:10,304 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:10,305 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:10,305 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:10,306 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 1000); {3112#false} is VALID [2018-11-23 12:24:10,306 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:10,307 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:10,307 INFO L273 TraceCheckUtils]: 23: Hoare triple {3111#true} assume !!(~i~0 < 1000);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:10,307 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:10,307 INFO L273 TraceCheckUtils]: 25: Hoare triple {3111#true} assume !!(~i~0 < 1000);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:10,307 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:10,307 INFO L273 TraceCheckUtils]: 27: Hoare triple {3111#true} assume !!(~i~0 < 1000);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:10,308 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:10,308 INFO L273 TraceCheckUtils]: 29: Hoare triple {3111#true} assume !(~i~0 < 1000); {3111#true} is VALID [2018-11-23 12:24:10,308 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:10,308 INFO L273 TraceCheckUtils]: 31: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:24:10,309 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3111#true} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:24:10,309 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:10,309 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:10,309 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:10,309 INFO L273 TraceCheckUtils]: 36: Hoare triple {3111#true} assume !!(~i~0 < 1000);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:10,310 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:10,310 INFO L273 TraceCheckUtils]: 38: Hoare triple {3111#true} assume !!(~i~0 < 1000);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:10,310 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:10,310 INFO L273 TraceCheckUtils]: 40: Hoare triple {3111#true} assume !!(~i~0 < 1000);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:10,310 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:10,310 INFO L273 TraceCheckUtils]: 42: Hoare triple {3111#true} assume !(~i~0 < 1000); {3111#true} is VALID [2018-11-23 12:24:10,311 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:10,311 INFO L273 TraceCheckUtils]: 44: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:24:10,311 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3111#true} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:24:10,311 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:10,311 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:10,311 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:10,312 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:10,312 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:10,312 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 999); {3112#false} is VALID [2018-11-23 12:24:10,312 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:24:10,312 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:10,313 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:10,313 INFO L273 TraceCheckUtils]: 55: Hoare triple {3111#true} assume !!(~i~0 < 1000);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:10,313 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:10,313 INFO L273 TraceCheckUtils]: 57: Hoare triple {3111#true} assume !!(~i~0 < 1000);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:10,313 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:10,313 INFO L273 TraceCheckUtils]: 59: Hoare triple {3111#true} assume !!(~i~0 < 1000);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:10,313 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:10,314 INFO L273 TraceCheckUtils]: 61: Hoare triple {3111#true} assume !(~i~0 < 1000); {3111#true} is VALID [2018-11-23 12:24:10,314 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:10,314 INFO L273 TraceCheckUtils]: 63: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:24:10,314 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3111#true} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:24:10,314 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:10,314 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:10,315 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:24:10,318 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:10,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:10,318 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:10,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:10,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:10,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:24:10,521 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:10,521 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:24:10,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:24:10,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret13 := main(); {3111#true} is VALID [2018-11-23 12:24:10,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:10,523 INFO L273 TraceCheckUtils]: 6: Hoare triple {3139#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:10,524 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:10,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:10,525 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:10,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:10,527 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:10,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:10,528 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:10,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:10,529 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:10,530 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:10,531 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:10,531 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:10,532 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:10,533 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 1000); {3112#false} is VALID [2018-11-23 12:24:10,533 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:10,534 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:10,534 INFO L273 TraceCheckUtils]: 23: Hoare triple {3112#false} assume !!(~i~0 < 1000);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:10,534 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:10,534 INFO L273 TraceCheckUtils]: 25: Hoare triple {3112#false} assume !!(~i~0 < 1000);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:10,535 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:10,535 INFO L273 TraceCheckUtils]: 27: Hoare triple {3112#false} assume !!(~i~0 < 1000);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:10,535 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:10,535 INFO L273 TraceCheckUtils]: 29: Hoare triple {3112#false} assume !(~i~0 < 1000); {3112#false} is VALID [2018-11-23 12:24:10,536 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:10,536 INFO L273 TraceCheckUtils]: 31: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:24:10,536 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3112#false} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:24:10,536 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:10,536 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:10,536 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:10,536 INFO L273 TraceCheckUtils]: 36: Hoare triple {3112#false} assume !!(~i~0 < 1000);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:10,537 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:10,537 INFO L273 TraceCheckUtils]: 38: Hoare triple {3112#false} assume !!(~i~0 < 1000);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:10,537 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:10,537 INFO L273 TraceCheckUtils]: 40: Hoare triple {3112#false} assume !!(~i~0 < 1000);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:10,537 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:10,537 INFO L273 TraceCheckUtils]: 42: Hoare triple {3112#false} assume !(~i~0 < 1000); {3112#false} is VALID [2018-11-23 12:24:10,538 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:10,538 INFO L273 TraceCheckUtils]: 44: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:24:10,538 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3112#false} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:24:10,538 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:10,538 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:10,538 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:10,538 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:10,538 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:10,539 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 999); {3112#false} is VALID [2018-11-23 12:24:10,539 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:24:10,539 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:10,539 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:10,539 INFO L273 TraceCheckUtils]: 55: Hoare triple {3112#false} assume !!(~i~0 < 1000);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:10,539 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:10,539 INFO L273 TraceCheckUtils]: 57: Hoare triple {3112#false} assume !!(~i~0 < 1000);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:10,539 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:10,540 INFO L273 TraceCheckUtils]: 59: Hoare triple {3112#false} assume !!(~i~0 < 1000);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:10,540 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:10,540 INFO L273 TraceCheckUtils]: 61: Hoare triple {3112#false} assume !(~i~0 < 1000); {3112#false} is VALID [2018-11-23 12:24:10,540 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:10,540 INFO L273 TraceCheckUtils]: 63: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:24:10,540 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3112#false} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:24:10,540 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:10,540 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:10,540 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:24:10,543 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:10,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:10,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:24:10,562 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:24:10,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:10,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:24:10,616 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:10,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:24:10,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:24:10,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:24:10,617 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2018-11-23 12:24:10,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:10,850 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 12:24:10,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:24:10,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:24:10,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:10,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:24:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:24:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:24:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:24:10,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-23 12:24:10,920 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:10,922 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:24:10,922 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:24:10,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:24:10,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:24:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 12:24:10,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:10,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 12:24:10,950 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 12:24:10,951 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 12:24:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:10,952 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:24:10,952 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:24:10,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:10,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:10,952 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 12:24:10,952 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 12:24:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:10,954 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:24:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:24:10,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:10,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:10,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:10,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:24:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 12:24:10,956 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2018-11-23 12:24:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:10,957 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 12:24:10,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:24:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:24:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:24:10,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:10,958 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:10,958 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:10,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:10,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1594227089, now seen corresponding path program 8 times [2018-11-23 12:24:10,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:10,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:10,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:10,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:10,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:11,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:24:11,323 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:11,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:24:11,324 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:24:11,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret13 := main(); {3609#true} is VALID [2018-11-23 12:24:11,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:11,325 INFO L273 TraceCheckUtils]: 6: Hoare triple {3611#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:11,326 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:11,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:11,327 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:11,328 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:11,328 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:11,329 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:11,329 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:11,330 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:11,331 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:11,331 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:11,332 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:11,333 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:11,333 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:11,334 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:11,335 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:11,335 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 1000); {3610#false} is VALID [2018-11-23 12:24:11,336 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:11,336 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:11,336 INFO L273 TraceCheckUtils]: 25: Hoare triple {3609#true} assume !!(~i~0 < 1000);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:11,336 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:11,336 INFO L273 TraceCheckUtils]: 27: Hoare triple {3609#true} assume !!(~i~0 < 1000);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:11,336 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:11,337 INFO L273 TraceCheckUtils]: 29: Hoare triple {3609#true} assume !!(~i~0 < 1000);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:11,337 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:11,337 INFO L273 TraceCheckUtils]: 31: Hoare triple {3609#true} assume !(~i~0 < 1000); {3609#true} is VALID [2018-11-23 12:24:11,337 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:11,337 INFO L273 TraceCheckUtils]: 33: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:24:11,338 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3609#true} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:24:11,338 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:11,338 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:11,338 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:11,338 INFO L273 TraceCheckUtils]: 38: Hoare triple {3609#true} assume !!(~i~0 < 1000);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:11,339 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:11,339 INFO L273 TraceCheckUtils]: 40: Hoare triple {3609#true} assume !!(~i~0 < 1000);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:11,339 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:11,339 INFO L273 TraceCheckUtils]: 42: Hoare triple {3609#true} assume !!(~i~0 < 1000);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:11,339 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:11,340 INFO L273 TraceCheckUtils]: 44: Hoare triple {3609#true} assume !(~i~0 < 1000); {3609#true} is VALID [2018-11-23 12:24:11,340 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:11,340 INFO L273 TraceCheckUtils]: 46: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:24:11,340 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3609#true} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:24:11,340 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:11,341 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:11,341 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:11,341 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:11,341 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:11,341 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 999); {3610#false} is VALID [2018-11-23 12:24:11,341 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:24:11,342 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:11,342 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:11,342 INFO L273 TraceCheckUtils]: 57: Hoare triple {3609#true} assume !!(~i~0 < 1000);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:11,342 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:11,342 INFO L273 TraceCheckUtils]: 59: Hoare triple {3609#true} assume !!(~i~0 < 1000);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:11,342 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:11,342 INFO L273 TraceCheckUtils]: 61: Hoare triple {3609#true} assume !!(~i~0 < 1000);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:11,343 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:11,343 INFO L273 TraceCheckUtils]: 63: Hoare triple {3609#true} assume !(~i~0 < 1000); {3609#true} is VALID [2018-11-23 12:24:11,343 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:11,343 INFO L273 TraceCheckUtils]: 65: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:24:11,343 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3609#true} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:24:11,343 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:11,343 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:11,343 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:24:11,346 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:11,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:11,347 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:11,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:24:11,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:24:11,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:11,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:11,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:24:11,566 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:11,566 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:24:11,567 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:24:11,567 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret13 := main(); {3609#true} is VALID [2018-11-23 12:24:11,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:11,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {3638#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:11,569 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:11,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:11,570 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:11,570 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:11,570 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:11,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:11,572 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:11,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:11,573 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:11,573 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:11,574 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:11,575 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:11,575 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:11,576 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:11,577 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:11,577 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 1000); {3610#false} is VALID [2018-11-23 12:24:11,578 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:11,578 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:11,578 INFO L273 TraceCheckUtils]: 25: Hoare triple {3610#false} assume !!(~i~0 < 1000);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:11,578 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:11,578 INFO L273 TraceCheckUtils]: 27: Hoare triple {3610#false} assume !!(~i~0 < 1000);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:11,579 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:11,579 INFO L273 TraceCheckUtils]: 29: Hoare triple {3610#false} assume !!(~i~0 < 1000);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:11,579 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:11,579 INFO L273 TraceCheckUtils]: 31: Hoare triple {3610#false} assume !(~i~0 < 1000); {3610#false} is VALID [2018-11-23 12:24:11,579 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:11,580 INFO L273 TraceCheckUtils]: 33: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:24:11,580 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3610#false} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:24:11,580 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:11,580 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:11,580 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:11,581 INFO L273 TraceCheckUtils]: 38: Hoare triple {3610#false} assume !!(~i~0 < 1000);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:11,581 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:11,581 INFO L273 TraceCheckUtils]: 40: Hoare triple {3610#false} assume !!(~i~0 < 1000);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:11,581 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:11,581 INFO L273 TraceCheckUtils]: 42: Hoare triple {3610#false} assume !!(~i~0 < 1000);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:11,581 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:11,582 INFO L273 TraceCheckUtils]: 44: Hoare triple {3610#false} assume !(~i~0 < 1000); {3610#false} is VALID [2018-11-23 12:24:11,582 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:11,582 INFO L273 TraceCheckUtils]: 46: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:24:11,582 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3610#false} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:24:11,582 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:11,582 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:11,582 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:11,582 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:11,583 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:11,583 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 999); {3610#false} is VALID [2018-11-23 12:24:11,583 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:24:11,583 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:11,583 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:11,583 INFO L273 TraceCheckUtils]: 57: Hoare triple {3610#false} assume !!(~i~0 < 1000);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:11,583 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:11,583 INFO L273 TraceCheckUtils]: 59: Hoare triple {3610#false} assume !!(~i~0 < 1000);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:11,584 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:11,584 INFO L273 TraceCheckUtils]: 61: Hoare triple {3610#false} assume !!(~i~0 < 1000);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:11,584 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:11,584 INFO L273 TraceCheckUtils]: 63: Hoare triple {3610#false} assume !(~i~0 < 1000); {3610#false} is VALID [2018-11-23 12:24:11,584 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:11,584 INFO L273 TraceCheckUtils]: 65: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:24:11,584 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3610#false} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:24:11,584 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:11,584 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:11,585 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:24:11,589 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:11,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:11,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:24:11,608 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:24:11,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:11,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:24:11,666 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:11,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:24:11,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:24:11,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:24:11,667 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2018-11-23 12:24:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:11,844 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-23 12:24:11,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:24:11,845 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:24:11,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:24:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:24:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:24:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:24:11,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:24:11,931 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:11,933 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:24:11,933 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:24:11,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:24:11,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:24:11,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:24:11,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:11,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:24:11,952 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:24:11,952 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:24:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:11,955 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:24:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:24:11,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:11,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:11,956 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:24:11,956 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:24:11,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:11,958 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:24:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:24:11,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:11,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:11,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:11,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:24:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 12:24:11,960 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2018-11-23 12:24:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:11,961 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 12:24:11,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:24:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:24:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:24:11,962 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:11,962 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:11,962 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:11,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:11,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1351728243, now seen corresponding path program 9 times [2018-11-23 12:24:11,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:11,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:11,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:11,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:12,227 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:24:12,228 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:12,228 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:24:12,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:24:12,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret13 := main(); {4124#true} is VALID [2018-11-23 12:24:12,229 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:12,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {4126#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:12,230 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:12,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {4127#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:12,231 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:12,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {4128#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:12,232 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:12,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {4129#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:12,233 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:12,233 INFO L273 TraceCheckUtils]: 14: Hoare triple {4130#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:12,234 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:12,234 INFO L273 TraceCheckUtils]: 16: Hoare triple {4131#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:12,235 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:12,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {4132#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:12,236 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:12,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {4133#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:12,238 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:12,238 INFO L273 TraceCheckUtils]: 22: Hoare triple {4134#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:12,239 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:12,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {4135#(<= main_~i~1 9)} assume !(~i~1 < 1000); {4125#false} is VALID [2018-11-23 12:24:12,240 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:12,240 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:12,240 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 1000);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:12,240 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:12,240 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 1000);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:12,241 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:12,241 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 1000);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:12,241 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:12,241 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 1000); {4124#true} is VALID [2018-11-23 12:24:12,241 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:12,242 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:24:12,242 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4125#false} #70#return; {4125#false} is VALID [2018-11-23 12:24:12,242 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:12,242 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:12,242 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:12,243 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 1000);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:12,243 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:12,243 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 1000);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:12,243 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:12,243 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 1000);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:12,244 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:12,244 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 1000); {4124#true} is VALID [2018-11-23 12:24:12,244 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:12,244 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:24:12,244 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4125#false} #72#return; {4125#false} is VALID [2018-11-23 12:24:12,244 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:12,244 INFO L273 TraceCheckUtils]: 51: Hoare triple {4125#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:12,244 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:12,245 INFO L273 TraceCheckUtils]: 53: Hoare triple {4125#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:12,245 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:12,245 INFO L273 TraceCheckUtils]: 55: Hoare triple {4125#false} assume !(~i~2 < 999); {4125#false} is VALID [2018-11-23 12:24:12,245 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:24:12,245 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:12,245 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:12,245 INFO L273 TraceCheckUtils]: 59: Hoare triple {4124#true} assume !!(~i~0 < 1000);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:12,245 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:12,246 INFO L273 TraceCheckUtils]: 61: Hoare triple {4124#true} assume !!(~i~0 < 1000);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:12,246 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:12,246 INFO L273 TraceCheckUtils]: 63: Hoare triple {4124#true} assume !!(~i~0 < 1000);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:12,246 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:12,246 INFO L273 TraceCheckUtils]: 65: Hoare triple {4124#true} assume !(~i~0 < 1000); {4124#true} is VALID [2018-11-23 12:24:12,246 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:12,246 INFO L273 TraceCheckUtils]: 67: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:24:12,246 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4124#true} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:24:12,247 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:12,247 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:12,247 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:24:12,249 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:12,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:12,249 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:12,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:24:12,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:24:12,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:12,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:12,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:24:12,447 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:12,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:24:12,447 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:24:12,447 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret13 := main(); {4124#true} is VALID [2018-11-23 12:24:12,448 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4124#true} is VALID [2018-11-23 12:24:12,448 INFO L273 TraceCheckUtils]: 6: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -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:12,448 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:12,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -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:12,448 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:12,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -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:12,449 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:12,449 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -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:12,449 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:12,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -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:12,449 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:12,449 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -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:12,450 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:12,450 INFO L273 TraceCheckUtils]: 18: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -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:12,450 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:12,450 INFO L273 TraceCheckUtils]: 20: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -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:12,450 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:12,450 INFO L273 TraceCheckUtils]: 22: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -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:12,450 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:12,450 INFO L273 TraceCheckUtils]: 24: Hoare triple {4124#true} assume !(~i~1 < 1000); {4124#true} is VALID [2018-11-23 12:24:12,451 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:12,451 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:12,451 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 1000);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:12,451 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:12,451 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 1000);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:12,451 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:12,451 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 1000);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:12,451 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:12,452 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 1000); {4124#true} is VALID [2018-11-23 12:24:12,452 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:12,452 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:24:12,452 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4124#true} #70#return; {4124#true} is VALID [2018-11-23 12:24:12,452 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:12,452 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:12,452 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:12,452 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 1000);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:12,452 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:12,453 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 1000);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:12,453 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:12,453 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 1000);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:12,453 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:12,453 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 1000); {4124#true} is VALID [2018-11-23 12:24:12,453 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:12,453 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:24:12,453 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4124#true} #72#return; {4124#true} is VALID [2018-11-23 12:24:12,454 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:12,454 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:12,455 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:12,455 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:12,456 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:12,456 INFO L273 TraceCheckUtils]: 55: Hoare triple {4303#(<= main_~i~2 2)} assume !(~i~2 < 999); {4125#false} is VALID [2018-11-23 12:24:12,456 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:24:12,456 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:12,456 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:12,456 INFO L273 TraceCheckUtils]: 59: Hoare triple {4125#false} assume !!(~i~0 < 1000);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:12,457 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:12,457 INFO L273 TraceCheckUtils]: 61: Hoare triple {4125#false} assume !!(~i~0 < 1000);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:12,457 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:12,457 INFO L273 TraceCheckUtils]: 63: Hoare triple {4125#false} assume !!(~i~0 < 1000);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:12,457 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:12,457 INFO L273 TraceCheckUtils]: 65: Hoare triple {4125#false} assume !(~i~0 < 1000); {4125#false} is VALID [2018-11-23 12:24:12,458 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:12,458 INFO L273 TraceCheckUtils]: 67: Hoare triple {4125#false} assume true; {4125#false} is VALID [2018-11-23 12:24:12,458 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4125#false} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:24:12,458 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:12,458 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:12,459 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:24:12,463 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:12,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:12,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:24:12,483 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:24:12,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:12,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:24:12,561 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:12,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:24:12,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:24:12,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:24:12,562 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2018-11-23 12:24:13,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:13,007 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-23 12:24:13,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:24:13,007 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:24:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:24:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:24:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:24:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:24:13,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2018-11-23 12:24:13,094 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:13,096 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:24:13,096 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:24:13,097 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:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:24:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 12:24:13,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:13,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2018-11-23 12:24:13,125 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2018-11-23 12:24:13,125 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2018-11-23 12:24:13,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:13,127 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:24:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:24:13,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:13,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:13,128 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2018-11-23 12:24:13,128 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2018-11-23 12:24:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:13,130 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:24:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:24:13,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:13,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:13,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:13,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:24:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-23 12:24:13,132 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2018-11-23 12:24:13,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:13,132 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-23 12:24:13,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:24:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 12:24:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:24:13,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:13,134 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:13,134 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:13,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:13,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1743973331, now seen corresponding path program 10 times [2018-11-23 12:24:13,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:13,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:13,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:13,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:13,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:13,502 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:24:13,503 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:13,503 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:24:13,503 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:24:13,503 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret13 := main(); {4671#true} is VALID [2018-11-23 12:24:13,504 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:13,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {4673#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:13,505 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:13,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {4674#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:13,506 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:13,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {4675#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:13,507 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:13,508 INFO L273 TraceCheckUtils]: 12: Hoare triple {4676#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:13,509 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:13,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {4677#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:13,510 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:13,511 INFO L273 TraceCheckUtils]: 16: Hoare triple {4678#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:13,512 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:13,512 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:13,513 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:13,514 INFO L273 TraceCheckUtils]: 20: Hoare triple {4680#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:13,515 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:13,515 INFO L273 TraceCheckUtils]: 22: Hoare triple {4681#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:13,516 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:13,517 INFO L273 TraceCheckUtils]: 24: Hoare triple {4682#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:13,518 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:13,518 INFO L273 TraceCheckUtils]: 26: Hoare triple {4683#(<= main_~i~1 10)} assume !(~i~1 < 1000); {4672#false} is VALID [2018-11-23 12:24:13,519 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:13,519 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:13,519 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 1000);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:13,519 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:13,520 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 1000);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:13,520 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:13,520 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 1000);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:13,521 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:13,521 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 1000); {4671#true} is VALID [2018-11-23 12:24:13,521 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:13,521 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:24:13,521 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4672#false} #70#return; {4672#false} is VALID [2018-11-23 12:24:13,522 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:13,522 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:13,522 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:13,522 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 1000);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:13,522 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:13,522 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 1000);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:13,522 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:13,523 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 1000);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:13,523 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:13,523 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 1000); {4671#true} is VALID [2018-11-23 12:24:13,523 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:13,523 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:24:13,523 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4672#false} #72#return; {4672#false} is VALID [2018-11-23 12:24:13,524 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:13,524 INFO L273 TraceCheckUtils]: 53: Hoare triple {4672#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:13,524 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:13,524 INFO L273 TraceCheckUtils]: 55: Hoare triple {4672#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:13,524 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:13,524 INFO L273 TraceCheckUtils]: 57: Hoare triple {4672#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:13,524 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:13,525 INFO L273 TraceCheckUtils]: 59: Hoare triple {4672#false} assume !(~i~2 < 999); {4672#false} is VALID [2018-11-23 12:24:13,525 INFO L273 TraceCheckUtils]: 60: Hoare triple {4672#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:24:13,525 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:13,525 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:13,525 INFO L273 TraceCheckUtils]: 63: Hoare triple {4671#true} assume !!(~i~0 < 1000);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:13,525 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:13,526 INFO L273 TraceCheckUtils]: 65: Hoare triple {4671#true} assume !!(~i~0 < 1000);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:13,526 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:13,526 INFO L273 TraceCheckUtils]: 67: Hoare triple {4671#true} assume !!(~i~0 < 1000);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:13,526 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:13,526 INFO L273 TraceCheckUtils]: 69: Hoare triple {4671#true} assume !(~i~0 < 1000); {4671#true} is VALID [2018-11-23 12:24:13,526 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:13,526 INFO L273 TraceCheckUtils]: 71: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:24:13,527 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4671#true} {4672#false} #74#return; {4672#false} is VALID [2018-11-23 12:24:13,527 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:13,527 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:13,527 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:24:13,533 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:13,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:13,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:13,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:24:13,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:24:13,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:13,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:13,818 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:24:13,819 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:13,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:24:13,819 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:24:13,819 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret13 := main(); {4671#true} is VALID [2018-11-23 12:24:13,819 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4671#true} is VALID [2018-11-23 12:24:13,820 INFO L273 TraceCheckUtils]: 6: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -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:13,820 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:13,820 INFO L273 TraceCheckUtils]: 8: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -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:13,820 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:13,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -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:13,821 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:13,821 INFO L273 TraceCheckUtils]: 12: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -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:13,821 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:13,821 INFO L273 TraceCheckUtils]: 14: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -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:13,822 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:13,822 INFO L273 TraceCheckUtils]: 16: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -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:13,822 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:13,822 INFO L273 TraceCheckUtils]: 18: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -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:13,822 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:13,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -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:13,822 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:13,822 INFO L273 TraceCheckUtils]: 22: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -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:13,823 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:13,823 INFO L273 TraceCheckUtils]: 24: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -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:13,823 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:13,823 INFO L273 TraceCheckUtils]: 26: Hoare triple {4671#true} assume !(~i~1 < 1000); {4671#true} is VALID [2018-11-23 12:24:13,823 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:13,823 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:13,823 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 1000);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:13,823 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:13,823 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 1000);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:13,824 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:13,824 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 1000);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:13,824 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:13,824 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 1000); {4671#true} is VALID [2018-11-23 12:24:13,824 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:13,824 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:24:13,824 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4671#true} #70#return; {4671#true} is VALID [2018-11-23 12:24:13,824 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:13,825 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:13,825 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:13,825 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 1000);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:13,825 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:13,825 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 1000);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:13,825 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:13,825 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 1000);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:13,825 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:13,826 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 1000); {4671#true} is VALID [2018-11-23 12:24:13,826 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:13,826 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:24:13,826 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4671#true} #72#return; {4671#true} is VALID [2018-11-23 12:24:13,826 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:13,826 INFO L273 TraceCheckUtils]: 53: Hoare triple {4671#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:13,826 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:13,826 INFO L273 TraceCheckUtils]: 55: Hoare triple {4671#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:13,827 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:13,827 INFO L273 TraceCheckUtils]: 57: Hoare triple {4671#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:13,827 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:13,827 INFO L273 TraceCheckUtils]: 59: Hoare triple {4671#true} assume !(~i~2 < 999); {4671#true} is VALID [2018-11-23 12:24:13,827 INFO L273 TraceCheckUtils]: 60: Hoare triple {4671#true} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:24:13,827 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:13,828 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:13,828 INFO L273 TraceCheckUtils]: 63: Hoare triple {4873#(<= bAnd_~i~0 1)} assume !!(~i~0 < 1000);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:13,828 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:13,829 INFO L273 TraceCheckUtils]: 65: Hoare triple {4880#(<= bAnd_~i~0 2)} assume !!(~i~0 < 1000);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:13,829 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:13,830 INFO L273 TraceCheckUtils]: 67: Hoare triple {4887#(<= bAnd_~i~0 3)} assume !!(~i~0 < 1000);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:13,830 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:13,830 INFO L273 TraceCheckUtils]: 69: Hoare triple {4894#(<= bAnd_~i~0 4)} assume !(~i~0 < 1000); {4672#false} is VALID [2018-11-23 12:24:13,831 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:13,831 INFO L273 TraceCheckUtils]: 71: Hoare triple {4672#false} assume true; {4672#false} is VALID [2018-11-23 12:24:13,831 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4672#false} {4671#true} #74#return; {4672#false} is VALID [2018-11-23 12:24:13,831 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:13,831 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:13,831 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:24:13,834 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:13,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:13,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2018-11-23 12:24:13,854 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:24:13,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:13,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:24:13,921 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:13,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:24:13,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:24:13,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:24:13,923 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2018-11-23 12:24:14,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:14,398 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-11-23 12:24:14,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:24:14,399 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:24:14,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:24:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:24:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:24:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:24:14,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 12:24:14,795 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:14,797 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:24:14,797 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:24:14,798 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:14,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:24:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 12:24:14,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:14,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 12:24:14,824 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 12:24:14,824 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 12:24:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:14,827 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:24:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:24:14,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:14,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:14,827 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 12:24:14,827 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 12:24:14,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:14,829 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:24:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:24:14,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:14,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:14,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:14,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:24:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 12:24:14,831 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2018-11-23 12:24:14,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:14,832 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 12:24:14,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:24:14,832 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 12:24:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 12:24:14,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:14,833 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:14,833 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:14,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:14,834 INFO L82 PathProgramCache]: Analyzing trace with hash -506591693, now seen corresponding path program 11 times [2018-11-23 12:24:14,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:14,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:14,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:14,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:14,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:16,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:24:16,056 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:16,056 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:24:16,056 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:24:16,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret13 := main(); {5255#true} is VALID [2018-11-23 12:24:16,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:16,061 INFO L273 TraceCheckUtils]: 6: Hoare triple {5257#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:16,062 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:16,062 INFO L273 TraceCheckUtils]: 8: Hoare triple {5258#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:16,062 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:16,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {5259#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:16,063 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:16,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {5260#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:16,064 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:16,064 INFO L273 TraceCheckUtils]: 14: Hoare triple {5261#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:16,065 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:16,065 INFO L273 TraceCheckUtils]: 16: Hoare triple {5262#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:16,066 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:16,066 INFO L273 TraceCheckUtils]: 18: Hoare triple {5263#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:16,067 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:16,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {5264#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:16,069 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:16,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {5265#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:16,070 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:16,070 INFO L273 TraceCheckUtils]: 24: Hoare triple {5266#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:16,071 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:16,072 INFO L273 TraceCheckUtils]: 26: Hoare triple {5267#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:16,072 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:16,073 INFO L273 TraceCheckUtils]: 28: Hoare triple {5268#(<= main_~i~1 11)} assume !(~i~1 < 1000); {5256#false} is VALID [2018-11-23 12:24:16,073 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:16,073 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:16,074 INFO L273 TraceCheckUtils]: 31: Hoare triple {5255#true} assume !!(~i~0 < 1000);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:16,074 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:16,074 INFO L273 TraceCheckUtils]: 33: Hoare triple {5255#true} assume !!(~i~0 < 1000);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:16,074 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:16,074 INFO L273 TraceCheckUtils]: 35: Hoare triple {5255#true} assume !!(~i~0 < 1000);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:16,075 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:16,075 INFO L273 TraceCheckUtils]: 37: Hoare triple {5255#true} assume !!(~i~0 < 1000);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:16,075 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:16,075 INFO L273 TraceCheckUtils]: 39: Hoare triple {5255#true} assume !(~i~0 < 1000); {5255#true} is VALID [2018-11-23 12:24:16,075 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:16,076 INFO L273 TraceCheckUtils]: 41: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:24:16,076 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5255#true} {5256#false} #70#return; {5256#false} is VALID [2018-11-23 12:24:16,076 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:16,076 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:16,077 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:16,077 INFO L273 TraceCheckUtils]: 46: Hoare triple {5255#true} assume !!(~i~0 < 1000);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:16,077 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:16,077 INFO L273 TraceCheckUtils]: 48: Hoare triple {5255#true} assume !!(~i~0 < 1000);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:16,077 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:16,077 INFO L273 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~i~0 < 1000);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:16,077 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:16,078 INFO L273 TraceCheckUtils]: 52: Hoare triple {5255#true} assume !!(~i~0 < 1000);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:16,078 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:16,078 INFO L273 TraceCheckUtils]: 54: Hoare triple {5255#true} assume !(~i~0 < 1000); {5255#true} is VALID [2018-11-23 12:24:16,078 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:16,078 INFO L273 TraceCheckUtils]: 56: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:24:16,079 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5255#true} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:24:16,079 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:16,079 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:16,079 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:16,079 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:16,079 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:16,080 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:16,080 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:16,080 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 999); {5256#false} is VALID [2018-11-23 12:24:16,080 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:24:16,080 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:16,080 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:16,081 INFO L273 TraceCheckUtils]: 69: Hoare triple {5255#true} assume !!(~i~0 < 1000);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:16,081 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:16,081 INFO L273 TraceCheckUtils]: 71: Hoare triple {5255#true} assume !!(~i~0 < 1000);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:16,081 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:16,081 INFO L273 TraceCheckUtils]: 73: Hoare triple {5255#true} assume !!(~i~0 < 1000);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:16,081 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:16,082 INFO L273 TraceCheckUtils]: 75: Hoare triple {5255#true} assume !!(~i~0 < 1000);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:16,082 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:16,082 INFO L273 TraceCheckUtils]: 77: Hoare triple {5255#true} assume !(~i~0 < 1000); {5255#true} is VALID [2018-11-23 12:24:16,082 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:16,082 INFO L273 TraceCheckUtils]: 79: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:24:16,082 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5255#true} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:24:16,083 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:16,083 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:16,083 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:24:16,087 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:16,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:16,087 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:16,102 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:24:16,218 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 12:24:16,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:16,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:16,377 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:24:16,377 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:16,378 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:24:16,378 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:24:16,378 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret13 := main(); {5255#true} is VALID [2018-11-23 12:24:16,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5255#true} is VALID [2018-11-23 12:24:16,379 INFO L273 TraceCheckUtils]: 6: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -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:16,379 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:16,379 INFO L273 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -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:16,379 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:16,379 INFO L273 TraceCheckUtils]: 10: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -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:16,379 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:16,380 INFO L273 TraceCheckUtils]: 12: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -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:16,380 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:16,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -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:16,380 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:16,380 INFO L273 TraceCheckUtils]: 16: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -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:16,381 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:16,381 INFO L273 TraceCheckUtils]: 18: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -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:16,381 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:16,381 INFO L273 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -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:16,381 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:16,381 INFO L273 TraceCheckUtils]: 22: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -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:16,382 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:16,382 INFO L273 TraceCheckUtils]: 24: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -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:16,382 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:16,382 INFO L273 TraceCheckUtils]: 26: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -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:16,382 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:16,382 INFO L273 TraceCheckUtils]: 28: Hoare triple {5255#true} assume !(~i~1 < 1000); {5255#true} is VALID [2018-11-23 12:24:16,383 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:16,401 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:16,402 INFO L273 TraceCheckUtils]: 31: Hoare triple {5362#(<= bAnd_~i~0 1)} assume !!(~i~0 < 1000);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:16,403 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:16,403 INFO L273 TraceCheckUtils]: 33: Hoare triple {5369#(<= bAnd_~i~0 2)} assume !!(~i~0 < 1000);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:16,403 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:16,404 INFO L273 TraceCheckUtils]: 35: Hoare triple {5376#(<= bAnd_~i~0 3)} assume !!(~i~0 < 1000);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:16,404 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:16,404 INFO L273 TraceCheckUtils]: 37: Hoare triple {5383#(<= bAnd_~i~0 4)} assume !!(~i~0 < 1000);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:16,405 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:16,405 INFO L273 TraceCheckUtils]: 39: Hoare triple {5390#(<= bAnd_~i~0 5)} assume !(~i~0 < 1000); {5256#false} is VALID [2018-11-23 12:24:16,405 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:16,406 INFO L273 TraceCheckUtils]: 41: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:24:16,406 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5256#false} {5255#true} #70#return; {5256#false} is VALID [2018-11-23 12:24:16,406 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:16,406 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:16,406 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:16,406 INFO L273 TraceCheckUtils]: 46: Hoare triple {5256#false} assume !!(~i~0 < 1000);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:16,406 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:16,406 INFO L273 TraceCheckUtils]: 48: Hoare triple {5256#false} assume !!(~i~0 < 1000);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:16,407 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:16,407 INFO L273 TraceCheckUtils]: 50: Hoare triple {5256#false} assume !!(~i~0 < 1000);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:16,407 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:16,407 INFO L273 TraceCheckUtils]: 52: Hoare triple {5256#false} assume !!(~i~0 < 1000);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:16,407 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:16,408 INFO L273 TraceCheckUtils]: 54: Hoare triple {5256#false} assume !(~i~0 < 1000); {5256#false} is VALID [2018-11-23 12:24:16,408 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:16,408 INFO L273 TraceCheckUtils]: 56: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:24:16,408 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5256#false} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:24:16,408 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:16,409 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:16,409 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:16,409 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:16,409 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:16,409 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:16,410 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:16,410 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 999); {5256#false} is VALID [2018-11-23 12:24:16,410 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:24:16,410 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:16,410 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:16,411 INFO L273 TraceCheckUtils]: 69: Hoare triple {5256#false} assume !!(~i~0 < 1000);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:16,411 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:16,411 INFO L273 TraceCheckUtils]: 71: Hoare triple {5256#false} assume !!(~i~0 < 1000);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:16,411 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:16,411 INFO L273 TraceCheckUtils]: 73: Hoare triple {5256#false} assume !!(~i~0 < 1000);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:16,411 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:16,411 INFO L273 TraceCheckUtils]: 75: Hoare triple {5256#false} assume !!(~i~0 < 1000);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:16,411 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:16,412 INFO L273 TraceCheckUtils]: 77: Hoare triple {5256#false} assume !(~i~0 < 1000); {5256#false} is VALID [2018-11-23 12:24:16,412 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:16,412 INFO L273 TraceCheckUtils]: 79: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:24:16,412 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5256#false} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:24:16,412 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:16,413 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:16,413 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:24:16,416 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:16,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:16,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-23 12:24:16,448 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:24:16,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:16,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:24:16,537 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:16,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:24:16,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:24:16,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:24:16,538 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2018-11-23 12:24:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:17,007 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-23 12:24:17,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:24:17,007 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:24:17,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:24:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:24:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:24:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:24:17,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2018-11-23 12:24:17,658 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:17,660 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:24:17,660 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:24:17,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:24:17,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:24:17,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 12:24:17,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:17,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 12:24:17,690 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 12:24:17,690 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 12:24:17,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:17,693 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:24:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:24:17,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:17,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:17,694 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 12:24:17,694 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 12:24:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:17,696 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:24:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:24:17,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:17,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:17,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:17,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:24:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 12:24:17,697 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2018-11-23 12:24:17,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:17,698 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 12:24:17,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:24:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 12:24:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:24:17,699 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:17,699 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:17,699 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:17,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:17,699 INFO L82 PathProgramCache]: Analyzing trace with hash -416573805, now seen corresponding path program 12 times [2018-11-23 12:24:17,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:17,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:17,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:17,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:17,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:17,969 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:24:17,969 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:17,969 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:24:17,969 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:24:17,969 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret13 := main(); {5888#true} is VALID [2018-11-23 12:24:17,970 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:17,970 INFO L273 TraceCheckUtils]: 6: Hoare triple {5890#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:17,971 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:17,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {5891#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:17,972 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:17,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {5892#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:17,972 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:17,973 INFO L273 TraceCheckUtils]: 12: Hoare triple {5893#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:17,973 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:17,974 INFO L273 TraceCheckUtils]: 14: Hoare triple {5894#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:17,974 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:17,975 INFO L273 TraceCheckUtils]: 16: Hoare triple {5895#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:17,976 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:17,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {5896#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:17,977 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:17,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {5897#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:17,978 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:17,979 INFO L273 TraceCheckUtils]: 22: Hoare triple {5898#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:17,979 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:17,980 INFO L273 TraceCheckUtils]: 24: Hoare triple {5899#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:17,981 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:17,981 INFO L273 TraceCheckUtils]: 26: Hoare triple {5900#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:17,982 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:17,982 INFO L273 TraceCheckUtils]: 28: Hoare triple {5901#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:17,983 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:17,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {5902#(<= main_~i~1 12)} assume !(~i~1 < 1000); {5889#false} is VALID [2018-11-23 12:24:17,984 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:17,984 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:17,984 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:17,984 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:17,985 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:17,985 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:17,985 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:17,985 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:17,985 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:17,986 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:17,986 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:17,986 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:17,986 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 1000); {5888#true} is VALID [2018-11-23 12:24:17,986 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:17,986 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:24:17,987 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5889#false} #70#return; {5889#false} is VALID [2018-11-23 12:24:17,987 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:17,987 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:17,987 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:17,987 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:17,987 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:17,987 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:17,987 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:17,988 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:17,988 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:17,988 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:17,988 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:17,988 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:17,988 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:17,988 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 1000); {5888#true} is VALID [2018-11-23 12:24:17,988 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:17,988 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:24:17,989 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5889#false} #72#return; {5889#false} is VALID [2018-11-23 12:24:17,989 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:17,989 INFO L273 TraceCheckUtils]: 65: Hoare triple {5889#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:17,989 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:17,989 INFO L273 TraceCheckUtils]: 67: Hoare triple {5889#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:17,989 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:17,989 INFO L273 TraceCheckUtils]: 69: Hoare triple {5889#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:17,989 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:17,989 INFO L273 TraceCheckUtils]: 71: Hoare triple {5889#false} assume !(~i~2 < 999); {5889#false} is VALID [2018-11-23 12:24:17,990 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:24:17,990 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:17,990 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:17,990 INFO L273 TraceCheckUtils]: 75: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:17,990 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:17,990 INFO L273 TraceCheckUtils]: 77: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:17,990 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:17,990 INFO L273 TraceCheckUtils]: 79: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:17,991 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:17,991 INFO L273 TraceCheckUtils]: 81: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:17,991 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:17,991 INFO L273 TraceCheckUtils]: 83: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:17,991 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:17,991 INFO L273 TraceCheckUtils]: 85: Hoare triple {5888#true} assume !(~i~0 < 1000); {5888#true} is VALID [2018-11-23 12:24:17,991 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:17,991 INFO L273 TraceCheckUtils]: 87: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:24:17,991 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5888#true} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:24:17,992 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:17,992 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:17,992 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:24:17,995 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:17,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:17,996 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:18,004 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:24:18,169 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:24:18,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:18,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:18,614 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:24:18,614 INFO L273 TraceCheckUtils]: 1: Hoare triple {5888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5888#true} is VALID [2018-11-23 12:24:18,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:24:18,615 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:24:18,615 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret13 := main(); {5888#true} is VALID [2018-11-23 12:24:18,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5888#true} is VALID [2018-11-23 12:24:18,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -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:18,615 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:18,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -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:18,615 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:18,616 INFO L273 TraceCheckUtils]: 10: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -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:18,616 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:18,616 INFO L273 TraceCheckUtils]: 12: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -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:18,616 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:18,616 INFO L273 TraceCheckUtils]: 14: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -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:18,617 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:18,617 INFO L273 TraceCheckUtils]: 16: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -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:18,617 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:18,617 INFO L273 TraceCheckUtils]: 18: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -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:18,617 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:18,617 INFO L273 TraceCheckUtils]: 20: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -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:18,617 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:18,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -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:18,617 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:18,618 INFO L273 TraceCheckUtils]: 24: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -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:18,618 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:18,618 INFO L273 TraceCheckUtils]: 26: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -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:18,618 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:18,618 INFO L273 TraceCheckUtils]: 28: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -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:18,618 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:18,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {5888#true} assume !(~i~1 < 1000); {5888#true} is VALID [2018-11-23 12:24:18,618 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:18,619 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:18,619 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:18,619 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:18,619 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:18,619 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:18,619 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:18,619 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:18,619 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:18,619 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:18,620 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:18,620 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:18,620 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 1000); {5888#true} is VALID [2018-11-23 12:24:18,620 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:18,620 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:24:18,620 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5888#true} #70#return; {5888#true} is VALID [2018-11-23 12:24:18,620 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:18,620 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:18,620 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:18,621 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:18,621 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:18,621 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:18,621 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:18,621 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:18,621 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:18,621 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:18,621 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:18,622 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 1000);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:18,622 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:18,622 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 1000); {5888#true} is VALID [2018-11-23 12:24:18,622 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:18,622 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:24:18,622 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5888#true} #72#return; {5888#true} is VALID [2018-11-23 12:24:18,623 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:18,624 INFO L273 TraceCheckUtils]: 65: Hoare triple {6098#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:18,624 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:18,624 INFO L273 TraceCheckUtils]: 67: Hoare triple {6105#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:18,625 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:18,625 INFO L273 TraceCheckUtils]: 69: Hoare triple {6112#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:18,626 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:18,627 INFO L273 TraceCheckUtils]: 71: Hoare triple {6119#(<= main_~i~2 3)} assume !(~i~2 < 999); {5889#false} is VALID [2018-11-23 12:24:18,627 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:24:18,627 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:18,627 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:18,628 INFO L273 TraceCheckUtils]: 75: Hoare triple {5889#false} assume !!(~i~0 < 1000);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:18,628 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:18,628 INFO L273 TraceCheckUtils]: 77: Hoare triple {5889#false} assume !!(~i~0 < 1000);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:18,628 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:18,629 INFO L273 TraceCheckUtils]: 79: Hoare triple {5889#false} assume !!(~i~0 < 1000);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:18,629 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:18,629 INFO L273 TraceCheckUtils]: 81: Hoare triple {5889#false} assume !!(~i~0 < 1000);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:18,630 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:18,630 INFO L273 TraceCheckUtils]: 83: Hoare triple {5889#false} assume !!(~i~0 < 1000);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:18,630 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:18,631 INFO L273 TraceCheckUtils]: 85: Hoare triple {5889#false} assume !(~i~0 < 1000); {5889#false} is VALID [2018-11-23 12:24:18,631 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:18,631 INFO L273 TraceCheckUtils]: 87: Hoare triple {5889#false} assume true; {5889#false} is VALID [2018-11-23 12:24:18,631 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5889#false} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:24:18,631 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:18,632 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:18,632 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:24:18,639 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:18,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:18,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-11-23 12:24:18,659 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:24:18,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:18,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:24:18,733 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:18,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:24:18,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:24:18,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:24:18,734 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2018-11-23 12:24:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:19,304 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-23 12:24:19,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:24:19,304 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:24:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:24:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:24:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:24:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:24:19,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 87 transitions. [2018-11-23 12:24:19,760 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:19,762 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:24:19,762 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:24:19,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:24:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:24:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:24:19,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:19,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:24:19,787 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:24:19,787 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:24:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:19,790 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:24:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:24:19,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:19,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:19,791 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:24:19,791 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:24:19,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:19,794 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:24:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:24:19,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:19,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:19,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:19,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:24:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 12:24:19,797 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2018-11-23 12:24:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:19,797 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 12:24:19,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:24:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:24:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:24:19,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:19,799 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:19,799 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:19,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:19,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1508563187, now seen corresponding path program 13 times [2018-11-23 12:24:19,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:19,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:19,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:19,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:19,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:20,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:24:20,466 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:20,466 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:24:20,466 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:24:20,466 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret13 := main(); {6568#true} is VALID [2018-11-23 12:24:20,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:20,467 INFO L273 TraceCheckUtils]: 6: Hoare triple {6570#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:20,468 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:20,468 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:20,468 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:20,469 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:20,469 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:20,469 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:20,470 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:20,470 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:20,471 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:20,472 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:20,472 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:20,473 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:20,474 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:20,474 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:20,475 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:20,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:20,476 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:20,477 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:20,478 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:20,478 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:20,479 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:20,479 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:20,480 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:20,481 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:20,482 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:20,482 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 1000); {6569#false} is VALID [2018-11-23 12:24:20,482 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:20,483 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:20,483 INFO L273 TraceCheckUtils]: 35: Hoare triple {6568#true} assume !!(~i~0 < 1000);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:20,483 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:20,483 INFO L273 TraceCheckUtils]: 37: Hoare triple {6568#true} assume !!(~i~0 < 1000);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:20,483 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:20,484 INFO L273 TraceCheckUtils]: 39: Hoare triple {6568#true} assume !!(~i~0 < 1000);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:20,484 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:20,484 INFO L273 TraceCheckUtils]: 41: Hoare triple {6568#true} assume !!(~i~0 < 1000);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:20,484 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:20,484 INFO L273 TraceCheckUtils]: 43: Hoare triple {6568#true} assume !!(~i~0 < 1000);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:20,485 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:20,485 INFO L273 TraceCheckUtils]: 45: Hoare triple {6568#true} assume !(~i~0 < 1000); {6568#true} is VALID [2018-11-23 12:24:20,485 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:20,485 INFO L273 TraceCheckUtils]: 47: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:24:20,485 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6568#true} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:24:20,486 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:20,486 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:20,486 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:20,486 INFO L273 TraceCheckUtils]: 52: Hoare triple {6568#true} assume !!(~i~0 < 1000);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:20,486 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:20,486 INFO L273 TraceCheckUtils]: 54: Hoare triple {6568#true} assume !!(~i~0 < 1000);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:20,487 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:20,487 INFO L273 TraceCheckUtils]: 56: Hoare triple {6568#true} assume !!(~i~0 < 1000);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:20,487 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:20,487 INFO L273 TraceCheckUtils]: 58: Hoare triple {6568#true} assume !!(~i~0 < 1000);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:20,487 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:20,487 INFO L273 TraceCheckUtils]: 60: Hoare triple {6568#true} assume !!(~i~0 < 1000);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:20,487 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:20,487 INFO L273 TraceCheckUtils]: 62: Hoare triple {6568#true} assume !(~i~0 < 1000); {6568#true} is VALID [2018-11-23 12:24:20,487 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:20,488 INFO L273 TraceCheckUtils]: 64: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:24:20,488 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6568#true} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:24:20,488 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:20,488 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:20,488 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:20,488 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:20,488 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:20,488 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:20,488 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:20,489 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:20,489 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:20,489 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 999); {6569#false} is VALID [2018-11-23 12:24:20,489 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:24:20,489 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:20,489 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:20,489 INFO L273 TraceCheckUtils]: 79: Hoare triple {6568#true} assume !!(~i~0 < 1000);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:20,489 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:20,490 INFO L273 TraceCheckUtils]: 81: Hoare triple {6568#true} assume !!(~i~0 < 1000);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:20,490 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:20,490 INFO L273 TraceCheckUtils]: 83: Hoare triple {6568#true} assume !!(~i~0 < 1000);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:20,490 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:20,490 INFO L273 TraceCheckUtils]: 85: Hoare triple {6568#true} assume !!(~i~0 < 1000);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:20,490 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:20,490 INFO L273 TraceCheckUtils]: 87: Hoare triple {6568#true} assume !!(~i~0 < 1000);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:20,490 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:20,490 INFO L273 TraceCheckUtils]: 89: Hoare triple {6568#true} assume !(~i~0 < 1000); {6568#true} is VALID [2018-11-23 12:24:20,491 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:20,491 INFO L273 TraceCheckUtils]: 91: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:24:20,491 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6568#true} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:24:20,491 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:20,491 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:20,491 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:24:20,495 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:20,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:20,496 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:20,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:20,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:20,956 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:24:20,957 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:20,957 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:24:20,957 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:24:20,957 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret13 := main(); {6568#true} is VALID [2018-11-23 12:24:20,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:20,958 INFO L273 TraceCheckUtils]: 6: Hoare triple {6602#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:20,959 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:20,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:20,960 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:20,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:20,961 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:20,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:20,961 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:20,962 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:20,963 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:20,963 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:20,964 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:20,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:20,965 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:20,966 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:20,967 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:20,967 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:20,968 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:20,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:20,969 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:20,970 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:20,971 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:20,971 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:20,972 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:20,973 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:20,973 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:20,974 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 1000); {6569#false} is VALID [2018-11-23 12:24:20,974 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:20,974 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:20,975 INFO L273 TraceCheckUtils]: 35: Hoare triple {6569#false} assume !!(~i~0 < 1000);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:20,975 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:20,975 INFO L273 TraceCheckUtils]: 37: Hoare triple {6569#false} assume !!(~i~0 < 1000);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:20,975 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:20,975 INFO L273 TraceCheckUtils]: 39: Hoare triple {6569#false} assume !!(~i~0 < 1000);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:20,976 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:20,976 INFO L273 TraceCheckUtils]: 41: Hoare triple {6569#false} assume !!(~i~0 < 1000);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:20,976 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:20,976 INFO L273 TraceCheckUtils]: 43: Hoare triple {6569#false} assume !!(~i~0 < 1000);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:20,976 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:20,977 INFO L273 TraceCheckUtils]: 45: Hoare triple {6569#false} assume !(~i~0 < 1000); {6569#false} is VALID [2018-11-23 12:24:20,977 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:20,977 INFO L273 TraceCheckUtils]: 47: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:24:20,977 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6569#false} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:24:20,977 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:20,977 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:20,978 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:20,978 INFO L273 TraceCheckUtils]: 52: Hoare triple {6569#false} assume !!(~i~0 < 1000);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:20,978 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:20,978 INFO L273 TraceCheckUtils]: 54: Hoare triple {6569#false} assume !!(~i~0 < 1000);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:20,978 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:20,978 INFO L273 TraceCheckUtils]: 56: Hoare triple {6569#false} assume !!(~i~0 < 1000);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:20,978 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:20,978 INFO L273 TraceCheckUtils]: 58: Hoare triple {6569#false} assume !!(~i~0 < 1000);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:20,978 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:20,979 INFO L273 TraceCheckUtils]: 60: Hoare triple {6569#false} assume !!(~i~0 < 1000);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:20,979 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:20,979 INFO L273 TraceCheckUtils]: 62: Hoare triple {6569#false} assume !(~i~0 < 1000); {6569#false} is VALID [2018-11-23 12:24:20,979 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:20,979 INFO L273 TraceCheckUtils]: 64: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:24:20,979 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6569#false} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:24:20,979 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:20,979 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:20,979 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:20,980 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:20,980 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:20,980 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:20,980 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:20,980 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:20,980 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:20,980 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 999); {6569#false} is VALID [2018-11-23 12:24:20,980 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:24:20,980 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:20,981 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:20,981 INFO L273 TraceCheckUtils]: 79: Hoare triple {6569#false} assume !!(~i~0 < 1000);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:20,981 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:20,981 INFO L273 TraceCheckUtils]: 81: Hoare triple {6569#false} assume !!(~i~0 < 1000);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:20,981 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:20,981 INFO L273 TraceCheckUtils]: 83: Hoare triple {6569#false} assume !!(~i~0 < 1000);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:20,981 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:20,981 INFO L273 TraceCheckUtils]: 85: Hoare triple {6569#false} assume !!(~i~0 < 1000);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:20,982 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:20,982 INFO L273 TraceCheckUtils]: 87: Hoare triple {6569#false} assume !!(~i~0 < 1000);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:20,982 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:20,982 INFO L273 TraceCheckUtils]: 89: Hoare triple {6569#false} assume !(~i~0 < 1000); {6569#false} is VALID [2018-11-23 12:24:20,982 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:20,982 INFO L273 TraceCheckUtils]: 91: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:24:20,982 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6569#false} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:24:20,982 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:20,982 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:20,983 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:24:20,987 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:21,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:21,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:24:21,007 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:24:21,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:21,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:24:21,077 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:21,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:24:21,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:24:21,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:24:21,078 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2018-11-23 12:24:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:21,753 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 12:24:21,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:24:21,753 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:24:21,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:24:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:24:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:24:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:24:21,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2018-11-23 12:24:22,232 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:22,235 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:24:22,236 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:24:22,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:24:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:24:22,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:24:22,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:22,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:24:22,266 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:24:22,266 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:24:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:22,269 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:24:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:24:22,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:22,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:22,270 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:24:22,270 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:24:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:22,272 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:24:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:24:22,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:22,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:22,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:22,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:24:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 12:24:22,275 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2018-11-23 12:24:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:22,275 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 12:24:22,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:24:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:24:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 12:24:22,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:22,277 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:22,277 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:22,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:22,277 INFO L82 PathProgramCache]: Analyzing trace with hash 737731925, now seen corresponding path program 14 times [2018-11-23 12:24:22,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:22,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:22,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:22,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:22,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:23,033 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:24:23,033 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:23,034 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:24:23,034 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:24:23,034 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret13 := main(); {7268#true} is VALID [2018-11-23 12:24:23,035 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:23,035 INFO L273 TraceCheckUtils]: 6: Hoare triple {7270#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:23,036 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:23,036 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:23,037 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:23,037 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:23,038 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:23,038 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:23,039 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:23,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:23,040 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:23,041 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:23,042 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:23,042 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:23,043 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:23,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:23,045 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:23,045 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:23,046 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:23,047 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:23,048 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:23,048 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:23,049 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:23,050 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:23,051 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:23,051 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:23,052 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:23,053 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:23,054 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:23,055 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 1000); {7269#false} is VALID [2018-11-23 12:24:23,055 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:23,055 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:23,055 INFO L273 TraceCheckUtils]: 37: Hoare triple {7268#true} assume !!(~i~0 < 1000);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:23,056 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:23,056 INFO L273 TraceCheckUtils]: 39: Hoare triple {7268#true} assume !!(~i~0 < 1000);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:23,056 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:23,056 INFO L273 TraceCheckUtils]: 41: Hoare triple {7268#true} assume !!(~i~0 < 1000);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:23,057 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:23,057 INFO L273 TraceCheckUtils]: 43: Hoare triple {7268#true} assume !!(~i~0 < 1000);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:23,057 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:23,057 INFO L273 TraceCheckUtils]: 45: Hoare triple {7268#true} assume !!(~i~0 < 1000);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:23,058 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:23,058 INFO L273 TraceCheckUtils]: 47: Hoare triple {7268#true} assume !(~i~0 < 1000); {7268#true} is VALID [2018-11-23 12:24:23,058 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:23,058 INFO L273 TraceCheckUtils]: 49: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:24:23,059 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7268#true} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:24:23,059 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:23,059 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:23,059 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:23,059 INFO L273 TraceCheckUtils]: 54: Hoare triple {7268#true} assume !!(~i~0 < 1000);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:23,060 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:23,060 INFO L273 TraceCheckUtils]: 56: Hoare triple {7268#true} assume !!(~i~0 < 1000);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:23,060 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:23,060 INFO L273 TraceCheckUtils]: 58: Hoare triple {7268#true} assume !!(~i~0 < 1000);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:23,060 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:23,060 INFO L273 TraceCheckUtils]: 60: Hoare triple {7268#true} assume !!(~i~0 < 1000);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:23,061 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:23,061 INFO L273 TraceCheckUtils]: 62: Hoare triple {7268#true} assume !!(~i~0 < 1000);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:23,061 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:23,061 INFO L273 TraceCheckUtils]: 64: Hoare triple {7268#true} assume !(~i~0 < 1000); {7268#true} is VALID [2018-11-23 12:24:23,061 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:23,061 INFO L273 TraceCheckUtils]: 66: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:24:23,061 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7268#true} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:24:23,062 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:23,062 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:23,062 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:23,062 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:23,062 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:23,062 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:23,063 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:23,063 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:23,063 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:23,063 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 999); {7269#false} is VALID [2018-11-23 12:24:23,063 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:24:23,063 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:23,063 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:23,064 INFO L273 TraceCheckUtils]: 81: Hoare triple {7268#true} assume !!(~i~0 < 1000);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:23,064 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:23,064 INFO L273 TraceCheckUtils]: 83: Hoare triple {7268#true} assume !!(~i~0 < 1000);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:23,064 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:23,064 INFO L273 TraceCheckUtils]: 85: Hoare triple {7268#true} assume !!(~i~0 < 1000);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:23,064 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:23,064 INFO L273 TraceCheckUtils]: 87: Hoare triple {7268#true} assume !!(~i~0 < 1000);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:23,065 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:23,065 INFO L273 TraceCheckUtils]: 89: Hoare triple {7268#true} assume !!(~i~0 < 1000);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:23,065 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:23,065 INFO L273 TraceCheckUtils]: 91: Hoare triple {7268#true} assume !(~i~0 < 1000); {7268#true} is VALID [2018-11-23 12:24:23,065 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:23,065 INFO L273 TraceCheckUtils]: 93: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:24:23,066 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7268#true} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:24:23,066 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:23,066 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:23,066 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:24:23,075 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:23,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:23,076 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:23,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:24:23,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:24:23,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:23,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:23,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:24:23,587 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:23,587 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:24:23,587 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:24:23,587 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret13 := main(); {7268#true} is VALID [2018-11-23 12:24:23,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:23,589 INFO L273 TraceCheckUtils]: 6: Hoare triple {7303#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:23,589 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:23,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:23,593 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:23,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:23,595 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:23,596 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:23,596 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:23,598 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:23,600 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:23,600 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:23,602 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:23,602 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:23,604 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:23,604 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:23,606 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:23,606 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:23,609 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:23,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:23,612 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:23,612 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:23,614 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:23,614 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:23,614 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:23,616 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:23,618 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:23,618 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:23,620 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:23,620 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 1000); {7269#false} is VALID [2018-11-23 12:24:23,620 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:23,620 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:23,620 INFO L273 TraceCheckUtils]: 37: Hoare triple {7269#false} assume !!(~i~0 < 1000);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:23,621 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:23,621 INFO L273 TraceCheckUtils]: 39: Hoare triple {7269#false} assume !!(~i~0 < 1000);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:23,621 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:23,621 INFO L273 TraceCheckUtils]: 41: Hoare triple {7269#false} assume !!(~i~0 < 1000);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:23,621 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:23,621 INFO L273 TraceCheckUtils]: 43: Hoare triple {7269#false} assume !!(~i~0 < 1000);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:23,621 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:23,621 INFO L273 TraceCheckUtils]: 45: Hoare triple {7269#false} assume !!(~i~0 < 1000);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:23,621 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:23,622 INFO L273 TraceCheckUtils]: 47: Hoare triple {7269#false} assume !(~i~0 < 1000); {7269#false} is VALID [2018-11-23 12:24:23,622 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:23,622 INFO L273 TraceCheckUtils]: 49: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:24:23,622 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7269#false} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:24:23,622 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:23,622 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:23,622 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:23,622 INFO L273 TraceCheckUtils]: 54: Hoare triple {7269#false} assume !!(~i~0 < 1000);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:23,623 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:23,623 INFO L273 TraceCheckUtils]: 56: Hoare triple {7269#false} assume !!(~i~0 < 1000);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:23,623 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:23,623 INFO L273 TraceCheckUtils]: 58: Hoare triple {7269#false} assume !!(~i~0 < 1000);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:23,623 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:23,623 INFO L273 TraceCheckUtils]: 60: Hoare triple {7269#false} assume !!(~i~0 < 1000);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:23,623 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:23,623 INFO L273 TraceCheckUtils]: 62: Hoare triple {7269#false} assume !!(~i~0 < 1000);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:23,623 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:23,624 INFO L273 TraceCheckUtils]: 64: Hoare triple {7269#false} assume !(~i~0 < 1000); {7269#false} is VALID [2018-11-23 12:24:23,624 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:23,624 INFO L273 TraceCheckUtils]: 66: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:24:23,624 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7269#false} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:24:23,624 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:23,624 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:23,624 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:23,624 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:23,625 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:23,625 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:23,625 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:23,625 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:23,625 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:23,625 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 999); {7269#false} is VALID [2018-11-23 12:24:23,625 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:24:23,625 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:23,625 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:23,626 INFO L273 TraceCheckUtils]: 81: Hoare triple {7269#false} assume !!(~i~0 < 1000);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:23,626 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:23,626 INFO L273 TraceCheckUtils]: 83: Hoare triple {7269#false} assume !!(~i~0 < 1000);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:23,626 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:23,626 INFO L273 TraceCheckUtils]: 85: Hoare triple {7269#false} assume !!(~i~0 < 1000);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:23,626 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:23,626 INFO L273 TraceCheckUtils]: 87: Hoare triple {7269#false} assume !!(~i~0 < 1000);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:23,626 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:23,626 INFO L273 TraceCheckUtils]: 89: Hoare triple {7269#false} assume !!(~i~0 < 1000);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:23,627 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:23,627 INFO L273 TraceCheckUtils]: 91: Hoare triple {7269#false} assume !(~i~0 < 1000); {7269#false} is VALID [2018-11-23 12:24:23,627 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:23,627 INFO L273 TraceCheckUtils]: 93: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:24:23,627 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7269#false} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:24:23,627 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:23,627 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:23,627 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:24:23,632 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:23,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:23,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:24:23,652 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:24:23,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:23,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:24:23,772 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:23,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:24:23,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:24:23,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:24:23,773 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2018-11-23 12:24:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:24,287 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 12:24:24,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:24:24,287 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:24:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:24:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:24:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:24:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:24:24,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2018-11-23 12:24:24,382 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:24,384 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:24:24,384 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:24:24,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:24:24,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:24:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 12:24:24,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:24,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 12:24:24,416 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 12:24:24,417 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 12:24:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:24,418 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:24:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:24:24,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:24,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:24,419 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 12:24:24,419 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 12:24:24,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:24,421 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:24:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:24:24,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:24,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:24,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:24,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:24:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 12:24:24,424 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2018-11-23 12:24:24,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:24,424 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 12:24:24,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:24:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 12:24:24,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:24:24,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:24,425 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:24,425 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:24,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:24,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1296735945, now seen corresponding path program 15 times [2018-11-23 12:24:24,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:24,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:24,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:24,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:24,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:25,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:24:25,488 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:25,488 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:24:25,489 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:24:25,489 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret13 := main(); {7985#true} is VALID [2018-11-23 12:24:25,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:25,490 INFO L273 TraceCheckUtils]: 6: Hoare triple {7987#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:25,490 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:25,491 INFO L273 TraceCheckUtils]: 8: Hoare triple {7988#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:25,491 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:25,491 INFO L273 TraceCheckUtils]: 10: Hoare triple {7989#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:25,492 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:25,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {7990#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:25,493 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:25,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {7991#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:25,494 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:25,494 INFO L273 TraceCheckUtils]: 16: Hoare triple {7992#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:25,495 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:25,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {7993#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:25,496 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:25,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {7994#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:25,498 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:25,498 INFO L273 TraceCheckUtils]: 22: Hoare triple {7995#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:25,499 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:25,499 INFO L273 TraceCheckUtils]: 24: Hoare triple {7996#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:25,500 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:25,501 INFO L273 TraceCheckUtils]: 26: Hoare triple {7997#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:25,501 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:25,502 INFO L273 TraceCheckUtils]: 28: Hoare triple {7998#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:25,503 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:25,503 INFO L273 TraceCheckUtils]: 30: Hoare triple {7999#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:25,504 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:25,505 INFO L273 TraceCheckUtils]: 32: Hoare triple {8000#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:25,506 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:25,506 INFO L273 TraceCheckUtils]: 34: Hoare triple {8001#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:25,507 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:25,508 INFO L273 TraceCheckUtils]: 36: Hoare triple {8002#(<= main_~i~1 15)} assume !(~i~1 < 1000); {7986#false} is VALID [2018-11-23 12:24:25,508 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:25,508 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:25,508 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,508 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:25,509 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,509 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:25,509 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,509 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:25,509 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,510 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:25,510 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,510 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:25,510 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 1000); {7985#true} is VALID [2018-11-23 12:24:25,510 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:25,511 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:24:25,511 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7986#false} #70#return; {7986#false} is VALID [2018-11-23 12:24:25,511 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:25,511 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:25,511 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:25,511 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,511 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:25,511 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,512 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:25,512 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,512 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:25,512 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,512 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:25,512 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,512 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:25,512 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 1000); {7985#true} is VALID [2018-11-23 12:24:25,512 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:25,513 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:24:25,513 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7986#false} #72#return; {7986#false} is VALID [2018-11-23 12:24:25,513 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:25,513 INFO L273 TraceCheckUtils]: 71: Hoare triple {7986#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25,513 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:25,513 INFO L273 TraceCheckUtils]: 73: Hoare triple {7986#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25,513 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:25,513 INFO L273 TraceCheckUtils]: 75: Hoare triple {7986#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25,514 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:25,514 INFO L273 TraceCheckUtils]: 77: Hoare triple {7986#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25,514 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:25,514 INFO L273 TraceCheckUtils]: 79: Hoare triple {7986#false} assume !(~i~2 < 999); {7986#false} is VALID [2018-11-23 12:24:25,514 INFO L273 TraceCheckUtils]: 80: Hoare triple {7986#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:24:25,514 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:25,514 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:25,514 INFO L273 TraceCheckUtils]: 83: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,514 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:25,515 INFO L273 TraceCheckUtils]: 85: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,515 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:25,515 INFO L273 TraceCheckUtils]: 87: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,515 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:25,515 INFO L273 TraceCheckUtils]: 89: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,515 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:25,515 INFO L273 TraceCheckUtils]: 91: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,515 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:25,515 INFO L273 TraceCheckUtils]: 93: Hoare triple {7985#true} assume !(~i~0 < 1000); {7985#true} is VALID [2018-11-23 12:24:25,516 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:25,516 INFO L273 TraceCheckUtils]: 95: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:24:25,516 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7985#true} {7986#false} #74#return; {7986#false} is VALID [2018-11-23 12:24:25,516 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:25,516 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:25,516 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:24:25,521 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:25,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:25,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:24:25,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:24:25,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:25,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:25,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:24:25,804 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:25,804 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:24:25,805 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:24:25,805 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret13 := main(); {7985#true} is VALID [2018-11-23 12:24:25,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7985#true} is VALID [2018-11-23 12:24:25,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -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:25,805 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:25,805 INFO L273 TraceCheckUtils]: 8: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -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:25,806 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:25,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -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:25,806 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:25,806 INFO L273 TraceCheckUtils]: 12: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -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:25,806 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:25,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -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:25,806 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:25,806 INFO L273 TraceCheckUtils]: 16: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -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:25,806 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:25,807 INFO L273 TraceCheckUtils]: 18: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -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:25,807 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:25,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -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:25,807 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:25,807 INFO L273 TraceCheckUtils]: 22: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -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:25,807 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:25,807 INFO L273 TraceCheckUtils]: 24: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -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:25,807 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:25,808 INFO L273 TraceCheckUtils]: 26: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -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:25,808 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:25,808 INFO L273 TraceCheckUtils]: 28: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -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:25,808 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:25,808 INFO L273 TraceCheckUtils]: 30: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -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:25,808 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:25,808 INFO L273 TraceCheckUtils]: 32: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -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:25,808 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:25,808 INFO L273 TraceCheckUtils]: 34: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -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:25,809 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:25,809 INFO L273 TraceCheckUtils]: 36: Hoare triple {7985#true} assume !(~i~1 < 1000); {7985#true} is VALID [2018-11-23 12:24:25,809 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:25,809 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:25,809 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,809 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:25,809 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,809 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:25,810 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,810 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:25,810 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,810 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:25,810 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,810 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:25,810 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 1000); {7985#true} is VALID [2018-11-23 12:24:25,810 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:25,810 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:24:25,811 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7985#true} #70#return; {7985#true} is VALID [2018-11-23 12:24:25,811 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:25,811 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:25,811 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:25,811 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,811 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:25,811 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,811 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:25,812 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,812 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:25,812 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,812 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:25,812 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 1000);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:25,812 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:25,812 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 1000); {7985#true} is VALID [2018-11-23 12:24:25,812 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:25,812 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:24:25,813 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7985#true} #72#return; {7985#true} is VALID [2018-11-23 12:24:25,813 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:25,813 INFO L273 TraceCheckUtils]: 71: Hoare triple {7985#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25,813 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:25,813 INFO L273 TraceCheckUtils]: 73: Hoare triple {7985#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25,813 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:25,813 INFO L273 TraceCheckUtils]: 75: Hoare triple {7985#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25,813 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:25,813 INFO L273 TraceCheckUtils]: 77: Hoare triple {7985#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25,814 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:25,814 INFO L273 TraceCheckUtils]: 79: Hoare triple {7985#true} assume !(~i~2 < 999); {7985#true} is VALID [2018-11-23 12:24:25,814 INFO L273 TraceCheckUtils]: 80: Hoare triple {7985#true} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:24:25,814 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:25,814 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:25,815 INFO L273 TraceCheckUtils]: 83: Hoare triple {8252#(<= bAnd_~i~0 1)} assume !!(~i~0 < 1000);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:25,815 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:25,816 INFO L273 TraceCheckUtils]: 85: Hoare triple {8259#(<= bAnd_~i~0 2)} assume !!(~i~0 < 1000);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:25,816 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:25,816 INFO L273 TraceCheckUtils]: 87: Hoare triple {8266#(<= bAnd_~i~0 3)} assume !!(~i~0 < 1000);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:25,817 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:25,817 INFO L273 TraceCheckUtils]: 89: Hoare triple {8273#(<= bAnd_~i~0 4)} assume !!(~i~0 < 1000);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:25,818 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:25,819 INFO L273 TraceCheckUtils]: 91: Hoare triple {8280#(<= bAnd_~i~0 5)} assume !!(~i~0 < 1000);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:25,819 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:25,820 INFO L273 TraceCheckUtils]: 93: Hoare triple {8287#(<= bAnd_~i~0 6)} assume !(~i~0 < 1000); {7986#false} is VALID [2018-11-23 12:24:25,820 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:25,820 INFO L273 TraceCheckUtils]: 95: Hoare triple {7986#false} assume true; {7986#false} is VALID [2018-11-23 12:24:25,821 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7986#false} {7985#true} #74#return; {7986#false} is VALID [2018-11-23 12:24:25,821 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:25,821 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:25,821 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:24:25,826 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:25,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:25,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2018-11-23 12:24:25,846 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:24:25,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:25,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:24:25,970 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:25,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:24:25,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:24:25,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:24:25,971 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2018-11-23 12:24:26,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:26,330 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-23 12:24:26,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:24:26,331 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:24:26,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:24:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:24:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:24:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:24:26,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 100 transitions. [2018-11-23 12:24:26,442 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:26,444 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:24:26,444 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:24:26,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:24:26,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:24:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:24:26,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:26,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 12:24:26,483 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 12:24:26,483 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 12:24:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:26,485 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:24:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:24:26,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:26,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:26,486 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 12:24:26,486 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 12:24:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:26,487 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:24:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:24:26,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:26,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:26,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:26,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:24:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 12:24:26,490 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2018-11-23 12:24:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:26,490 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 12:24:26,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:24:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 12:24:26,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:24:26,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:26,492 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:26,492 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:26,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:26,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1648969321, now seen corresponding path program 16 times [2018-11-23 12:24:26,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:26,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:26,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:26,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:26,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:26,906 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:24:26,906 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:26,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:24:26,906 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:24:26,906 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret13 := main(); {8737#true} is VALID [2018-11-23 12:24:26,907 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:26,907 INFO L273 TraceCheckUtils]: 6: Hoare triple {8739#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:26,907 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:26,908 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:26,908 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:26,909 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:26,909 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:26,909 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:26,910 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:26,910 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:26,910 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:26,911 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:26,911 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:26,912 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:26,913 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:26,913 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:26,914 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:26,914 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:26,915 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:26,916 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:26,916 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:26,917 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:26,918 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:26,918 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:26,919 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:26,919 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:26,920 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:26,921 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:26,922 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:26,922 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:26,923 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:26,923 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:26,924 INFO L273 TraceCheckUtils]: 37: Hoare triple {8754#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8755#(<= main_~i~1 16)} is VALID [2018-11-23 12:24:26,925 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 1000); {8738#false} is VALID [2018-11-23 12:24:26,925 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:26,925 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:26,925 INFO L273 TraceCheckUtils]: 41: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,926 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:26,926 INFO L273 TraceCheckUtils]: 43: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,926 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:26,926 INFO L273 TraceCheckUtils]: 45: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,926 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:26,927 INFO L273 TraceCheckUtils]: 47: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,927 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:26,927 INFO L273 TraceCheckUtils]: 49: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,927 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:26,927 INFO L273 TraceCheckUtils]: 51: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,928 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:26,928 INFO L273 TraceCheckUtils]: 53: Hoare triple {8737#true} assume !(~i~0 < 1000); {8737#true} is VALID [2018-11-23 12:24:26,928 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:26,928 INFO L273 TraceCheckUtils]: 55: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:24:26,928 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8737#true} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:24:26,928 INFO L273 TraceCheckUtils]: 57: Hoare triple {8738#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:24:26,928 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:26,928 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:26,928 INFO L273 TraceCheckUtils]: 60: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,929 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:26,929 INFO L273 TraceCheckUtils]: 62: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,929 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:26,929 INFO L273 TraceCheckUtils]: 64: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,929 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:26,929 INFO L273 TraceCheckUtils]: 66: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,929 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:26,929 INFO L273 TraceCheckUtils]: 68: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,929 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:26,930 INFO L273 TraceCheckUtils]: 70: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,930 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:26,930 INFO L273 TraceCheckUtils]: 72: Hoare triple {8737#true} assume !(~i~0 < 1000); {8737#true} is VALID [2018-11-23 12:24:26,930 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:26,930 INFO L273 TraceCheckUtils]: 74: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:24:26,930 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8737#true} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:24:26,930 INFO L273 TraceCheckUtils]: 76: Hoare triple {8738#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8738#false} is VALID [2018-11-23 12:24:26,930 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26,931 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:26,931 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26,931 INFO L273 TraceCheckUtils]: 80: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:24:26,931 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26,931 INFO L273 TraceCheckUtils]: 82: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:24:26,931 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26,931 INFO L273 TraceCheckUtils]: 84: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:24:26,931 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 999); {8738#false} is VALID [2018-11-23 12:24:26,931 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:24:26,932 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:26,932 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:26,932 INFO L273 TraceCheckUtils]: 89: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,932 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:26,932 INFO L273 TraceCheckUtils]: 91: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,932 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:26,932 INFO L273 TraceCheckUtils]: 93: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,932 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:26,932 INFO L273 TraceCheckUtils]: 95: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,933 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:26,933 INFO L273 TraceCheckUtils]: 97: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,933 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:26,933 INFO L273 TraceCheckUtils]: 99: Hoare triple {8737#true} assume !!(~i~0 < 1000);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:26,933 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:26,933 INFO L273 TraceCheckUtils]: 101: Hoare triple {8737#true} assume !(~i~0 < 1000); {8737#true} is VALID [2018-11-23 12:24:26,933 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:26,933 INFO L273 TraceCheckUtils]: 103: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:24:26,933 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8737#true} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:24:26,934 INFO L273 TraceCheckUtils]: 105: Hoare triple {8738#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8738#false} is VALID [2018-11-23 12:24:26,934 INFO L273 TraceCheckUtils]: 106: Hoare triple {8738#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8738#false} is VALID [2018-11-23 12:24:26,934 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:24:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:24:26,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:26,939 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:26,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:24:26,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:24:26,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:27,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:27,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:24:27,209 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:27,210 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:24:27,210 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:24:27,210 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret13 := main(); {8737#true} is VALID [2018-11-23 12:24:27,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:27,214 INFO L273 TraceCheckUtils]: 6: Hoare triple {8774#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:27,215 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:27,215 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:27,215 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:27,216 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:27,216 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:27,217 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:27,218 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:27,218 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:27,219 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:27,219 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:27,220 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:27,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:27,221 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:27,222 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:27,223 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:27,223 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:27,224 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:27,224 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:27,225 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:27,226 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:27,226 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:27,227 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:27,228 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:27,228 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:27,229 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:27,230 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:27,230 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:27,231 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:27,232 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:27,232 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:27,233 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:27,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 1000); {8738#false} is VALID [2018-11-23 12:24:27,234 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:27,234 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:27,234 INFO L273 TraceCheckUtils]: 41: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,234 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:27,235 INFO L273 TraceCheckUtils]: 43: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,235 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:27,235 INFO L273 TraceCheckUtils]: 45: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,235 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:27,235 INFO L273 TraceCheckUtils]: 47: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,236 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:27,236 INFO L273 TraceCheckUtils]: 49: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,236 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:27,236 INFO L273 TraceCheckUtils]: 51: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,236 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:27,236 INFO L273 TraceCheckUtils]: 53: Hoare triple {8738#false} assume !(~i~0 < 1000); {8738#false} is VALID [2018-11-23 12:24:27,236 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:27,237 INFO L273 TraceCheckUtils]: 55: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:24:27,237 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8738#false} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:24:27,237 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:27,237 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:27,237 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:27,237 INFO L273 TraceCheckUtils]: 60: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,237 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:27,237 INFO L273 TraceCheckUtils]: 62: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,237 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:27,238 INFO L273 TraceCheckUtils]: 64: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,238 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:27,238 INFO L273 TraceCheckUtils]: 66: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,238 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:27,238 INFO L273 TraceCheckUtils]: 68: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,238 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:27,238 INFO L273 TraceCheckUtils]: 70: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,238 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:27,238 INFO L273 TraceCheckUtils]: 72: Hoare triple {8738#false} assume !(~i~0 < 1000); {8738#false} is VALID [2018-11-23 12:24:27,239 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:27,239 INFO L273 TraceCheckUtils]: 74: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:24:27,239 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8738#false} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:24:27,239 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:27,239 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:27,239 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:27,239 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:27,239 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:27,239 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:27,240 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:27,240 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:27,240 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:27,240 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 999); {8738#false} is VALID [2018-11-23 12:24:27,240 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:24:27,240 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:27,240 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:27,240 INFO L273 TraceCheckUtils]: 89: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,240 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:27,241 INFO L273 TraceCheckUtils]: 91: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,241 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:27,241 INFO L273 TraceCheckUtils]: 93: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,241 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:27,241 INFO L273 TraceCheckUtils]: 95: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,241 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:27,241 INFO L273 TraceCheckUtils]: 97: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,241 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:27,242 INFO L273 TraceCheckUtils]: 99: Hoare triple {8738#false} assume !!(~i~0 < 1000);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:27,242 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:27,242 INFO L273 TraceCheckUtils]: 101: Hoare triple {8738#false} assume !(~i~0 < 1000); {8738#false} is VALID [2018-11-23 12:24:27,242 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:27,242 INFO L273 TraceCheckUtils]: 103: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:24:27,242 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8738#false} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:24:27,242 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:27,242 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:27,242 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:24:27,248 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:27,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:27,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:24:27,267 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:24:27,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:27,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:24:27,339 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:27,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:24:27,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:24:27,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:24:27,341 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2018-11-23 12:24:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:27,837 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-23 12:24:27,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:24:27,837 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:24:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:24:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:24:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:24:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:24:27,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 86 transitions. [2018-11-23 12:24:28,036 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:28,039 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:24:28,039 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:24:28,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:24:28,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:24:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 12:24:28,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:28,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 12:24:28,073 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 12:24:28,073 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 12:24:28,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:28,074 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:24:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:24:28,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:28,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:28,075 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 12:24:28,075 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 12:24:28,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:28,076 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:24:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:24:28,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:28,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:28,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:28,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:24:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 12:24:28,079 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2018-11-23 12:24:28,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:28,079 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 12:24:28,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:24:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:24:28,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 12:24:28,080 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:28,080 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:28,081 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:28,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:28,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1027293945, now seen corresponding path program 17 times [2018-11-23 12:24:28,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:28,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:28,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:28,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:28,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:28,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:24:28,414 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:28,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:24:28,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:24:28,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret13 := main(); {9519#true} is VALID [2018-11-23 12:24:28,415 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:28,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {9521#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:28,417 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:28,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {9522#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:28,417 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:28,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {9523#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:28,418 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:28,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {9524#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:28,419 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:28,419 INFO L273 TraceCheckUtils]: 14: Hoare triple {9525#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:28,420 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:28,421 INFO L273 TraceCheckUtils]: 16: Hoare triple {9526#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:28,421 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:28,422 INFO L273 TraceCheckUtils]: 18: Hoare triple {9527#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:28,423 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:28,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {9528#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:28,424 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:28,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {9529#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:28,425 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:28,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {9530#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:28,426 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:28,429 INFO L273 TraceCheckUtils]: 26: Hoare triple {9531#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:28,430 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:28,430 INFO L273 TraceCheckUtils]: 28: Hoare triple {9532#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:28,431 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:28,431 INFO L273 TraceCheckUtils]: 30: Hoare triple {9533#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:28,431 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:28,432 INFO L273 TraceCheckUtils]: 32: Hoare triple {9534#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:28,432 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:28,433 INFO L273 TraceCheckUtils]: 34: Hoare triple {9535#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:28,433 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:28,434 INFO L273 TraceCheckUtils]: 36: Hoare triple {9536#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:28,435 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:28,435 INFO L273 TraceCheckUtils]: 38: Hoare triple {9537#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:28,436 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:28,437 INFO L273 TraceCheckUtils]: 40: Hoare triple {9538#(<= main_~i~1 17)} assume !(~i~1 < 1000); {9520#false} is VALID [2018-11-23 12:24:28,437 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:28,437 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:28,437 INFO L273 TraceCheckUtils]: 43: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,437 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:28,438 INFO L273 TraceCheckUtils]: 45: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,438 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:28,438 INFO L273 TraceCheckUtils]: 47: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,438 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:28,438 INFO L273 TraceCheckUtils]: 49: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,439 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:28,439 INFO L273 TraceCheckUtils]: 51: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,439 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:28,439 INFO L273 TraceCheckUtils]: 53: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,439 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:28,440 INFO L273 TraceCheckUtils]: 55: Hoare triple {9519#true} assume !(~i~0 < 1000); {9519#true} is VALID [2018-11-23 12:24:28,440 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:28,440 INFO L273 TraceCheckUtils]: 57: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:24:28,440 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9519#true} {9520#false} #70#return; {9520#false} is VALID [2018-11-23 12:24:28,440 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:28,441 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:28,441 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:28,441 INFO L273 TraceCheckUtils]: 62: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,441 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:28,441 INFO L273 TraceCheckUtils]: 64: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,441 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:28,442 INFO L273 TraceCheckUtils]: 66: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,442 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:28,442 INFO L273 TraceCheckUtils]: 68: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,442 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:28,442 INFO L273 TraceCheckUtils]: 70: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,442 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:28,442 INFO L273 TraceCheckUtils]: 72: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,442 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:28,442 INFO L273 TraceCheckUtils]: 74: Hoare triple {9519#true} assume !(~i~0 < 1000); {9519#true} is VALID [2018-11-23 12:24:28,443 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:28,443 INFO L273 TraceCheckUtils]: 76: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:24:28,443 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9519#true} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:24:28,443 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:28,443 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28,443 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:28,443 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28,443 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:28,443 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28,444 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:28,444 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28,444 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:28,444 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 999); {9520#false} is VALID [2018-11-23 12:24:28,444 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:24:28,444 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:28,444 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:28,444 INFO L273 TraceCheckUtils]: 91: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,445 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:28,445 INFO L273 TraceCheckUtils]: 93: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,445 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:28,445 INFO L273 TraceCheckUtils]: 95: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,445 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:28,445 INFO L273 TraceCheckUtils]: 97: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,445 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:28,445 INFO L273 TraceCheckUtils]: 99: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,445 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:28,446 INFO L273 TraceCheckUtils]: 101: Hoare triple {9519#true} assume !!(~i~0 < 1000);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:28,446 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:28,446 INFO L273 TraceCheckUtils]: 103: Hoare triple {9519#true} assume !(~i~0 < 1000); {9519#true} is VALID [2018-11-23 12:24:28,446 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:28,446 INFO L273 TraceCheckUtils]: 105: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:24:28,446 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9519#true} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:24:28,446 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:28,446 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:28,447 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:24:28,452 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:28,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:28,452 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:28,463 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:24:28,894 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-23 12:24:28,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:28,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:29,170 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:24:29,171 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:29,171 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:24:29,172 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:24:29,172 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret13 := main(); {9519#true} is VALID [2018-11-23 12:24:29,172 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9519#true} is VALID [2018-11-23 12:24:29,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,173 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:29,173 INFO L273 TraceCheckUtils]: 8: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,173 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:29,174 INFO L273 TraceCheckUtils]: 10: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,174 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:29,174 INFO L273 TraceCheckUtils]: 12: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,174 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:29,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,174 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:29,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,175 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:29,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,175 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:29,175 INFO L273 TraceCheckUtils]: 20: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,176 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:29,176 INFO L273 TraceCheckUtils]: 22: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,176 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:29,176 INFO L273 TraceCheckUtils]: 24: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,176 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:29,176 INFO L273 TraceCheckUtils]: 26: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,177 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:29,177 INFO L273 TraceCheckUtils]: 28: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,177 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:29,177 INFO L273 TraceCheckUtils]: 30: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,177 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:29,177 INFO L273 TraceCheckUtils]: 32: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,178 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:29,178 INFO L273 TraceCheckUtils]: 34: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,178 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:29,178 INFO L273 TraceCheckUtils]: 36: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,178 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:29,178 INFO L273 TraceCheckUtils]: 38: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -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:29,179 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:29,179 INFO L273 TraceCheckUtils]: 40: Hoare triple {9519#true} assume !(~i~1 < 1000); {9519#true} is VALID [2018-11-23 12:24:29,179 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:29,193 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:29,205 INFO L273 TraceCheckUtils]: 43: Hoare triple {9668#(<= bAnd_~i~0 1)} assume !!(~i~0 < 1000);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:29,206 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:29,206 INFO L273 TraceCheckUtils]: 45: Hoare triple {9675#(<= bAnd_~i~0 2)} assume !!(~i~0 < 1000);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:29,206 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:29,207 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= bAnd_~i~0 3)} assume !!(~i~0 < 1000);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:29,207 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:29,208 INFO L273 TraceCheckUtils]: 49: Hoare triple {9689#(<= bAnd_~i~0 4)} assume !!(~i~0 < 1000);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:29,208 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:29,208 INFO L273 TraceCheckUtils]: 51: Hoare triple {9696#(<= bAnd_~i~0 5)} assume !!(~i~0 < 1000);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:29,209 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:29,210 INFO L273 TraceCheckUtils]: 53: Hoare triple {9703#(<= bAnd_~i~0 6)} assume !!(~i~0 < 1000);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:29,210 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:29,211 INFO L273 TraceCheckUtils]: 55: Hoare triple {9710#(<= bAnd_~i~0 7)} assume !(~i~0 < 1000); {9520#false} is VALID [2018-11-23 12:24:29,211 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:29,211 INFO L273 TraceCheckUtils]: 57: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:24:29,212 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9520#false} {9519#true} #70#return; {9520#false} is VALID [2018-11-23 12:24:29,212 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:29,212 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:29,212 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:29,212 INFO L273 TraceCheckUtils]: 62: Hoare triple {9520#false} assume !!(~i~0 < 1000);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:29,213 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:29,213 INFO L273 TraceCheckUtils]: 64: Hoare triple {9520#false} assume !!(~i~0 < 1000);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:29,213 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:29,213 INFO L273 TraceCheckUtils]: 66: Hoare triple {9520#false} assume !!(~i~0 < 1000);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:29,213 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:29,214 INFO L273 TraceCheckUtils]: 68: Hoare triple {9520#false} assume !!(~i~0 < 1000);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:29,214 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:29,214 INFO L273 TraceCheckUtils]: 70: Hoare triple {9520#false} assume !!(~i~0 < 1000);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:29,214 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:29,214 INFO L273 TraceCheckUtils]: 72: Hoare triple {9520#false} assume !!(~i~0 < 1000);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:29,214 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:29,214 INFO L273 TraceCheckUtils]: 74: Hoare triple {9520#false} assume !(~i~0 < 1000); {9520#false} is VALID [2018-11-23 12:24:29,214 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:29,215 INFO L273 TraceCheckUtils]: 76: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:24:29,215 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9520#false} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:24:29,215 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:29,215 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29,215 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:29,215 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29,215 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:29,215 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29,215 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:29,216 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29,216 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:29,216 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 999); {9520#false} is VALID [2018-11-23 12:24:29,216 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:24:29,216 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:29,216 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:29,216 INFO L273 TraceCheckUtils]: 91: Hoare triple {9520#false} assume !!(~i~0 < 1000);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:29,216 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:29,217 INFO L273 TraceCheckUtils]: 93: Hoare triple {9520#false} assume !!(~i~0 < 1000);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:29,217 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:29,217 INFO L273 TraceCheckUtils]: 95: Hoare triple {9520#false} assume !!(~i~0 < 1000);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:29,217 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:29,217 INFO L273 TraceCheckUtils]: 97: Hoare triple {9520#false} assume !!(~i~0 < 1000);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:29,217 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:29,217 INFO L273 TraceCheckUtils]: 99: Hoare triple {9520#false} assume !!(~i~0 < 1000);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:29,217 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:29,217 INFO L273 TraceCheckUtils]: 101: Hoare triple {9520#false} assume !!(~i~0 < 1000);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:29,218 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:29,218 INFO L273 TraceCheckUtils]: 103: Hoare triple {9520#false} assume !(~i~0 < 1000); {9520#false} is VALID [2018-11-23 12:24:29,218 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:29,218 INFO L273 TraceCheckUtils]: 105: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:24:29,218 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9520#false} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:24:29,218 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:29,218 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:29,218 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:24:29,223 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:29,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:29,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-23 12:24:29,245 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:24:29,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:29,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:24:29,345 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:29,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:24:29,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:24:29,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:24:29,347 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2018-11-23 12:24:30,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:30,580 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-11-23 12:24:30,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:24:30,580 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:24:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:24:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:24:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:24:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:24:30,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 106 transitions. [2018-11-23 12:24:30,757 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:30,758 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:24:30,759 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:24:30,759 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:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:24:30,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 12:24:30,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:30,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 12:24:30,797 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 12:24:30,797 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 12:24:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:30,800 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:24:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:24:30,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:30,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:30,800 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 12:24:30,801 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 12:24:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:30,802 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:24:30,802 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:24:30,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:30,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:30,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:30,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:24:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 12:24:30,805 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2018-11-23 12:24:30,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:30,805 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 12:24:30,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:24:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:24:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:24:30,806 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:30,806 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:30,807 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:30,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:30,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1680928935, now seen corresponding path program 18 times [2018-11-23 12:24:30,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:30,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:30,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:30,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:30,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:31,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:24:31,749 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:31,749 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:24:31,749 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:24:31,750 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret13 := main(); {10337#true} is VALID [2018-11-23 12:24:31,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:31,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {10339#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:31,751 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:31,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {10340#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:31,752 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:31,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {10341#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:31,753 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:31,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {10342#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:31,753 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:31,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {10343#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:31,755 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:31,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {10344#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:31,756 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:31,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {10345#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:31,757 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:31,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {10346#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:31,760 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:31,762 INFO L273 TraceCheckUtils]: 22: Hoare triple {10347#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:31,763 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:31,763 INFO L273 TraceCheckUtils]: 24: Hoare triple {10348#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:31,764 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:31,764 INFO L273 TraceCheckUtils]: 26: Hoare triple {10349#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:31,764 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:31,765 INFO L273 TraceCheckUtils]: 28: Hoare triple {10350#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:31,766 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:31,766 INFO L273 TraceCheckUtils]: 30: Hoare triple {10351#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:31,770 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:31,770 INFO L273 TraceCheckUtils]: 32: Hoare triple {10352#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:31,770 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:31,771 INFO L273 TraceCheckUtils]: 34: Hoare triple {10353#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:31,771 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:31,771 INFO L273 TraceCheckUtils]: 36: Hoare triple {10354#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:31,772 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:31,772 INFO L273 TraceCheckUtils]: 38: Hoare triple {10355#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:31,773 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:31,773 INFO L273 TraceCheckUtils]: 40: Hoare triple {10356#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:31,774 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:31,775 INFO L273 TraceCheckUtils]: 42: Hoare triple {10357#(<= main_~i~1 18)} assume !(~i~1 < 1000); {10338#false} is VALID [2018-11-23 12:24:31,775 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:31,775 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:31,775 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,775 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:31,776 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,776 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:31,776 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,776 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:31,776 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,777 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:31,777 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,777 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:31,777 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,777 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:31,777 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,778 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:31,778 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 1000); {10337#true} is VALID [2018-11-23 12:24:31,778 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:31,778 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:24:31,778 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10338#false} #70#return; {10338#false} is VALID [2018-11-23 12:24:31,778 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:31,778 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:31,778 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:31,779 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,779 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:31,779 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,779 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:31,779 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,779 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:31,779 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,779 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:31,779 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,780 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:31,780 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,780 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:31,780 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,780 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:31,780 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 1000); {10337#true} is VALID [2018-11-23 12:24:31,780 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:31,780 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:24:31,781 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10338#false} #72#return; {10338#false} is VALID [2018-11-23 12:24:31,781 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:31,781 INFO L273 TraceCheckUtils]: 85: Hoare triple {10338#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31,781 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:31,781 INFO L273 TraceCheckUtils]: 87: Hoare triple {10338#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31,781 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:31,781 INFO L273 TraceCheckUtils]: 89: Hoare triple {10338#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31,781 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:31,781 INFO L273 TraceCheckUtils]: 91: Hoare triple {10338#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31,782 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:31,782 INFO L273 TraceCheckUtils]: 93: Hoare triple {10338#false} assume !(~i~2 < 999); {10338#false} is VALID [2018-11-23 12:24:31,782 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:24:31,782 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:31,782 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:31,782 INFO L273 TraceCheckUtils]: 97: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,782 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:31,782 INFO L273 TraceCheckUtils]: 99: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,782 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:31,783 INFO L273 TraceCheckUtils]: 101: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,783 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:31,783 INFO L273 TraceCheckUtils]: 103: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,783 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:31,783 INFO L273 TraceCheckUtils]: 105: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,783 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:31,783 INFO L273 TraceCheckUtils]: 107: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,783 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:31,784 INFO L273 TraceCheckUtils]: 109: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:31,784 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:31,784 INFO L273 TraceCheckUtils]: 111: Hoare triple {10337#true} assume !(~i~0 < 1000); {10337#true} is VALID [2018-11-23 12:24:31,784 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:31,784 INFO L273 TraceCheckUtils]: 113: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:24:31,784 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10337#true} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:24:31,784 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:31,784 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:31,784 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:24:31,791 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:31,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:31,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:31,799 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:24:32,026 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:24:32,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:32,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:32,219 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:24:32,220 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:32,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:24:32,220 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:24:32,220 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret13 := main(); {10337#true} is VALID [2018-11-23 12:24:32,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10337#true} is VALID [2018-11-23 12:24:32,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,221 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:32,221 INFO L273 TraceCheckUtils]: 8: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,221 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:32,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,222 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:32,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,222 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:32,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,222 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:32,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,223 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:32,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,223 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:32,223 INFO L273 TraceCheckUtils]: 20: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,224 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:32,224 INFO L273 TraceCheckUtils]: 22: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,224 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:32,224 INFO L273 TraceCheckUtils]: 24: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,224 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:32,224 INFO L273 TraceCheckUtils]: 26: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,224 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:32,224 INFO L273 TraceCheckUtils]: 28: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,224 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:32,225 INFO L273 TraceCheckUtils]: 30: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,225 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:32,225 INFO L273 TraceCheckUtils]: 32: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,225 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:32,225 INFO L273 TraceCheckUtils]: 34: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,225 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:32,225 INFO L273 TraceCheckUtils]: 36: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,225 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:32,225 INFO L273 TraceCheckUtils]: 38: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,226 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:32,226 INFO L273 TraceCheckUtils]: 40: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -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:32,226 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:32,226 INFO L273 TraceCheckUtils]: 42: Hoare triple {10337#true} assume !(~i~1 < 1000); {10337#true} is VALID [2018-11-23 12:24:32,226 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:32,226 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:32,226 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:32,226 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:32,226 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:32,227 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:32,227 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:32,227 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:32,227 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:32,227 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:32,227 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:32,227 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:32,227 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:32,227 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:32,228 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:32,228 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:32,228 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 1000); {10337#true} is VALID [2018-11-23 12:24:32,228 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:32,228 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:24:32,228 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10337#true} #70#return; {10337#true} is VALID [2018-11-23 12:24:32,228 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:32,228 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:32,229 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:32,229 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:32,229 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:32,229 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:32,229 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:32,229 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:32,229 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:32,229 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:32,229 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:32,230 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:32,230 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:32,230 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:32,230 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:32,230 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 1000);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:32,230 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:32,230 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 1000); {10337#true} is VALID [2018-11-23 12:24:32,230 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:32,230 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:24:32,231 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10337#true} #72#return; {10337#true} is VALID [2018-11-23 12:24:32,231 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:32,231 INFO L273 TraceCheckUtils]: 85: Hoare triple {10613#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:32,232 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:32,232 INFO L273 TraceCheckUtils]: 87: Hoare triple {10620#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:32,233 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:32,233 INFO L273 TraceCheckUtils]: 89: Hoare triple {10627#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:32,233 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:32,234 INFO L273 TraceCheckUtils]: 91: Hoare triple {10634#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:32,235 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:32,235 INFO L273 TraceCheckUtils]: 93: Hoare triple {10641#(<= main_~i~2 4)} assume !(~i~2 < 999); {10338#false} is VALID [2018-11-23 12:24:32,235 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:24:32,236 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:32,236 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:32,236 INFO L273 TraceCheckUtils]: 97: Hoare triple {10338#false} assume !!(~i~0 < 1000);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:32,236 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:32,236 INFO L273 TraceCheckUtils]: 99: Hoare triple {10338#false} assume !!(~i~0 < 1000);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:32,237 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:32,237 INFO L273 TraceCheckUtils]: 101: Hoare triple {10338#false} assume !!(~i~0 < 1000);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:32,237 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:32,237 INFO L273 TraceCheckUtils]: 103: Hoare triple {10338#false} assume !!(~i~0 < 1000);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:32,237 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:32,237 INFO L273 TraceCheckUtils]: 105: Hoare triple {10338#false} assume !!(~i~0 < 1000);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:32,238 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:32,238 INFO L273 TraceCheckUtils]: 107: Hoare triple {10338#false} assume !!(~i~0 < 1000);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:32,238 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:32,238 INFO L273 TraceCheckUtils]: 109: Hoare triple {10338#false} assume !!(~i~0 < 1000);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:32,238 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:32,238 INFO L273 TraceCheckUtils]: 111: Hoare triple {10338#false} assume !(~i~0 < 1000); {10338#false} is VALID [2018-11-23 12:24:32,238 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:32,238 INFO L273 TraceCheckUtils]: 113: Hoare triple {10338#false} assume true; {10338#false} is VALID [2018-11-23 12:24:32,238 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10338#false} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:24:32,239 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:32,239 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:32,239 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:24:32,244 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:32,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:32,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2018-11-23 12:24:32,264 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:24:32,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:32,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:24:32,355 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:32,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:24:32,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:24:32,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:24:32,356 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2018-11-23 12:24:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:33,204 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-11-23 12:24:33,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:24:33,204 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:24:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:24:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:24:33,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:24:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:24:33,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 101 transitions. [2018-11-23 12:24:33,467 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:33,469 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:24:33,469 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 12:24:33,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:24:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 12:24:33,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-23 12:24:33,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:33,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 85 states. [2018-11-23 12:24:33,504 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 85 states. [2018-11-23 12:24:33,504 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 85 states. [2018-11-23 12:24:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:33,506 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:24:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:24:33,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:33,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:33,507 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 87 states. [2018-11-23 12:24:33,507 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 87 states. [2018-11-23 12:24:33,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:33,508 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:24:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:24:33,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:33,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:33,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:33,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:24:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-23 12:24:33,510 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2018-11-23 12:24:33,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:33,510 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-23 12:24:33,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:24:33,510 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-23 12:24:33,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 12:24:33,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:33,511 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:33,511 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:33,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:33,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1116806727, now seen corresponding path program 19 times [2018-11-23 12:24:33,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:33,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:33,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:33,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:33,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:34,585 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:24:34,586 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:34,586 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:24:34,586 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:24:34,587 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret13 := main(); {11201#true} is VALID [2018-11-23 12:24:34,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:34,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {11203#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:34,588 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:34,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:34,589 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:34,589 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:34,590 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:34,590 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:34,590 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:34,591 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:34,592 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:34,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:34,593 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:34,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:34,594 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:34,595 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:34,595 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:34,596 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:34,597 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:34,597 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:34,598 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:34,599 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:34,599 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:34,600 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:34,601 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:34,601 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:34,602 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:34,602 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:34,603 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:34,604 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:34,604 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:34,605 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:34,606 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:34,606 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:34,607 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:34,607 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:34,608 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:34,609 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:34,610 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:34,610 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 1000); {11202#false} is VALID [2018-11-23 12:24:34,610 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:34,611 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:34,611 INFO L273 TraceCheckUtils]: 47: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,611 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:34,611 INFO L273 TraceCheckUtils]: 49: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,611 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:34,612 INFO L273 TraceCheckUtils]: 51: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,612 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:34,612 INFO L273 TraceCheckUtils]: 53: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,612 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:34,612 INFO L273 TraceCheckUtils]: 55: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,613 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:34,613 INFO L273 TraceCheckUtils]: 57: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,613 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:34,613 INFO L273 TraceCheckUtils]: 59: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,613 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:34,614 INFO L273 TraceCheckUtils]: 61: Hoare triple {11201#true} assume !(~i~0 < 1000); {11201#true} is VALID [2018-11-23 12:24:34,614 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:34,614 INFO L273 TraceCheckUtils]: 63: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:24:34,614 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11201#true} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:24:34,614 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:34,615 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:34,615 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:34,615 INFO L273 TraceCheckUtils]: 68: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,615 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:34,615 INFO L273 TraceCheckUtils]: 70: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,615 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:34,615 INFO L273 TraceCheckUtils]: 72: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,616 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:34,616 INFO L273 TraceCheckUtils]: 74: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,616 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:34,616 INFO L273 TraceCheckUtils]: 76: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,616 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:34,616 INFO L273 TraceCheckUtils]: 78: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,616 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:34,616 INFO L273 TraceCheckUtils]: 80: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,616 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:34,617 INFO L273 TraceCheckUtils]: 82: Hoare triple {11201#true} assume !(~i~0 < 1000); {11201#true} is VALID [2018-11-23 12:24:34,617 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:34,617 INFO L273 TraceCheckUtils]: 84: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:24:34,617 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11201#true} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:24:34,617 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:34,617 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:34,617 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:34,617 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:34,618 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:34,618 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:34,618 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:34,618 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:34,618 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:34,618 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:34,618 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:34,618 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 999); {11202#false} is VALID [2018-11-23 12:24:34,618 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:24:34,619 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:34,619 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:34,619 INFO L273 TraceCheckUtils]: 101: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,619 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:34,619 INFO L273 TraceCheckUtils]: 103: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,619 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:34,619 INFO L273 TraceCheckUtils]: 105: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,619 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:34,619 INFO L273 TraceCheckUtils]: 107: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,620 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:34,620 INFO L273 TraceCheckUtils]: 109: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,620 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:34,620 INFO L273 TraceCheckUtils]: 111: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,620 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:34,620 INFO L273 TraceCheckUtils]: 113: Hoare triple {11201#true} assume !!(~i~0 < 1000);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:34,620 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:34,620 INFO L273 TraceCheckUtils]: 115: Hoare triple {11201#true} assume !(~i~0 < 1000); {11201#true} is VALID [2018-11-23 12:24:34,620 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:34,621 INFO L273 TraceCheckUtils]: 117: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:24:34,621 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11201#true} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:24:34,621 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:34,621 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:34,621 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:24:34,628 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:34,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:34,628 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:34,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:34,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:35,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:24:35,051 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:35,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:24:35,052 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:24:35,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret13 := main(); {11201#true} is VALID [2018-11-23 12:24:35,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:35,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {11241#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:35,054 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:35,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:35,055 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:35,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:35,055 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:35,056 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:35,056 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:35,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:35,058 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:35,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:35,059 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:35,059 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:35,060 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:35,061 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:35,061 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:35,062 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:35,062 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:35,063 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:35,064 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:35,064 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:35,065 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:35,066 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:35,066 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:35,067 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:35,068 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:35,068 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:35,069 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:35,069 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:35,070 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:35,071 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:35,072 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:35,072 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:35,073 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:35,073 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:35,074 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:35,075 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:35,075 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:35,076 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 1000); {11202#false} is VALID [2018-11-23 12:24:35,076 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:35,076 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:35,077 INFO L273 TraceCheckUtils]: 47: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,077 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:35,077 INFO L273 TraceCheckUtils]: 49: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,077 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:35,077 INFO L273 TraceCheckUtils]: 51: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,078 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:35,078 INFO L273 TraceCheckUtils]: 53: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,078 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:35,078 INFO L273 TraceCheckUtils]: 55: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,078 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:35,079 INFO L273 TraceCheckUtils]: 57: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,079 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:35,079 INFO L273 TraceCheckUtils]: 59: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,079 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:35,079 INFO L273 TraceCheckUtils]: 61: Hoare triple {11202#false} assume !(~i~0 < 1000); {11202#false} is VALID [2018-11-23 12:24:35,079 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:35,079 INFO L273 TraceCheckUtils]: 63: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:24:35,079 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11202#false} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:24:35,080 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:35,080 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:35,080 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:35,080 INFO L273 TraceCheckUtils]: 68: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,080 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:35,080 INFO L273 TraceCheckUtils]: 70: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,080 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:35,080 INFO L273 TraceCheckUtils]: 72: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,081 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:35,081 INFO L273 TraceCheckUtils]: 74: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,081 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:35,081 INFO L273 TraceCheckUtils]: 76: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,081 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:35,081 INFO L273 TraceCheckUtils]: 78: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,081 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:35,081 INFO L273 TraceCheckUtils]: 80: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,081 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:35,082 INFO L273 TraceCheckUtils]: 82: Hoare triple {11202#false} assume !(~i~0 < 1000); {11202#false} is VALID [2018-11-23 12:24:35,082 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:35,082 INFO L273 TraceCheckUtils]: 84: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:24:35,082 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11202#false} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:24:35,082 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:35,082 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:35,082 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:35,082 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:35,082 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:35,083 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:35,083 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:35,083 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:35,083 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:35,083 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:35,083 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:35,083 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 999); {11202#false} is VALID [2018-11-23 12:24:35,083 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:24:35,084 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:35,084 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:35,084 INFO L273 TraceCheckUtils]: 101: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,084 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:35,084 INFO L273 TraceCheckUtils]: 103: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,084 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:35,084 INFO L273 TraceCheckUtils]: 105: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,084 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:35,084 INFO L273 TraceCheckUtils]: 107: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,085 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:35,085 INFO L273 TraceCheckUtils]: 109: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,085 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:35,085 INFO L273 TraceCheckUtils]: 111: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,085 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:35,085 INFO L273 TraceCheckUtils]: 113: Hoare triple {11202#false} assume !!(~i~0 < 1000);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:35,085 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:35,085 INFO L273 TraceCheckUtils]: 115: Hoare triple {11202#false} assume !(~i~0 < 1000); {11202#false} is VALID [2018-11-23 12:24:35,086 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:35,086 INFO L273 TraceCheckUtils]: 117: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:24:35,086 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11202#false} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:24:35,086 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:35,086 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:35,086 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:24:35,093 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:35,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:35,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:24:35,113 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:24:35,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:35,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:24:35,188 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:35,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:24:35,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:24:35,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:24:35,190 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2018-11-23 12:24:35,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:35,829 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-23 12:24:35,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:24:35,829 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:24:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:24:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:24:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:24:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:24:35,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 92 transitions. [2018-11-23 12:24:35,920 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:35,922 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:24:35,923 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:24:35,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:24:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:24:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 12:24:35,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:35,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 12:24:35,956 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 12:24:35,956 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 12:24:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:35,958 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:24:35,958 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:24:35,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:35,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:35,959 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 12:24:35,959 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 12:24:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:35,960 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:24:35,960 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:24:35,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:35,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:35,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:35,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:24:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-23 12:24:35,963 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2018-11-23 12:24:35,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:35,963 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-23 12:24:35,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:24:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:24:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:24:35,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:35,965 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:35,965 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:35,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:35,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1211213925, now seen corresponding path program 20 times [2018-11-23 12:24:35,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:35,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:35,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:35,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:35,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:36,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:24:36,660 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:36,661 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:24:36,661 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:24:36,661 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret13 := main(); {12084#true} is VALID [2018-11-23 12:24:36,661 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:36,661 INFO L273 TraceCheckUtils]: 6: Hoare triple {12086#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:36,662 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:36,662 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:36,663 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:36,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:36,664 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:36,665 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:36,666 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:36,666 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:36,667 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:36,667 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:36,668 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:36,669 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:36,670 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:36,670 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:36,671 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:36,672 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:36,672 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:36,673 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:36,674 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:36,674 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:36,675 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:36,675 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:36,676 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:36,677 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:36,678 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:36,678 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:36,679 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:36,679 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:36,680 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:36,681 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:36,681 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:36,682 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:36,683 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:36,683 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:36,684 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:36,685 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:36,685 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:36,686 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:36,687 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:36,687 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 1000); {12085#false} is VALID [2018-11-23 12:24:36,688 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:36,688 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:36,688 INFO L273 TraceCheckUtils]: 49: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,688 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:36,688 INFO L273 TraceCheckUtils]: 51: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,689 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:36,689 INFO L273 TraceCheckUtils]: 53: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,689 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:36,689 INFO L273 TraceCheckUtils]: 55: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,689 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:36,690 INFO L273 TraceCheckUtils]: 57: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,690 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:36,690 INFO L273 TraceCheckUtils]: 59: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,690 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:36,690 INFO L273 TraceCheckUtils]: 61: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,690 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:36,690 INFO L273 TraceCheckUtils]: 63: Hoare triple {12084#true} assume !(~i~0 < 1000); {12084#true} is VALID [2018-11-23 12:24:36,690 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:36,691 INFO L273 TraceCheckUtils]: 65: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:24:36,691 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12084#true} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:24:36,691 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:36,691 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:36,691 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:36,691 INFO L273 TraceCheckUtils]: 70: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,691 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:36,691 INFO L273 TraceCheckUtils]: 72: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,692 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:36,692 INFO L273 TraceCheckUtils]: 74: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,692 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:36,692 INFO L273 TraceCheckUtils]: 76: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,692 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:36,692 INFO L273 TraceCheckUtils]: 78: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,692 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:36,693 INFO L273 TraceCheckUtils]: 80: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,693 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:36,693 INFO L273 TraceCheckUtils]: 82: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,693 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:36,693 INFO L273 TraceCheckUtils]: 84: Hoare triple {12084#true} assume !(~i~0 < 1000); {12084#true} is VALID [2018-11-23 12:24:36,694 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:36,694 INFO L273 TraceCheckUtils]: 86: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:24:36,694 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12084#true} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:24:36,694 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:36,694 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:36,694 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:36,695 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:36,695 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:36,695 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:36,695 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:36,695 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:36,695 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:36,696 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:36,696 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:36,696 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 999); {12085#false} is VALID [2018-11-23 12:24:36,696 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:24:36,696 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:36,697 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:36,697 INFO L273 TraceCheckUtils]: 103: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,697 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:36,697 INFO L273 TraceCheckUtils]: 105: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,697 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:36,697 INFO L273 TraceCheckUtils]: 107: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,698 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:36,698 INFO L273 TraceCheckUtils]: 109: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,698 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:36,698 INFO L273 TraceCheckUtils]: 111: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,698 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:36,699 INFO L273 TraceCheckUtils]: 113: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,699 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:36,699 INFO L273 TraceCheckUtils]: 115: Hoare triple {12084#true} assume !!(~i~0 < 1000);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:36,699 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:36,699 INFO L273 TraceCheckUtils]: 117: Hoare triple {12084#true} assume !(~i~0 < 1000); {12084#true} is VALID [2018-11-23 12:24:36,699 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:36,700 INFO L273 TraceCheckUtils]: 119: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:24:36,700 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12084#true} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:24:36,700 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:36,700 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:36,700 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:24:36,710 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:36,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:36,710 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:36,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:24:36,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:24:36,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:36,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:37,036 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:24:37,037 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:37,037 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:24:37,037 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:24:37,037 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret13 := main(); {12084#true} is VALID [2018-11-23 12:24:37,038 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:37,039 INFO L273 TraceCheckUtils]: 6: Hoare triple {12125#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:37,039 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:37,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:37,040 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:37,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:37,041 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:37,041 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:37,042 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:37,042 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:37,043 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:37,044 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:37,044 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:37,045 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:37,046 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:37,046 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:37,047 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:37,047 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:37,048 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:37,048 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:37,049 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:37,050 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:37,050 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:37,051 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:37,052 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:37,052 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:37,053 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:37,053 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:37,054 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:37,054 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:37,055 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:37,056 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:37,056 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:37,057 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:37,058 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:37,058 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:37,059 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:37,059 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:37,060 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:37,061 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:37,061 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:37,062 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 1000); {12085#false} is VALID [2018-11-23 12:24:37,062 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:37,063 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:37,063 INFO L273 TraceCheckUtils]: 49: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,063 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:37,063 INFO L273 TraceCheckUtils]: 51: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,063 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:37,063 INFO L273 TraceCheckUtils]: 53: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,064 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:37,064 INFO L273 TraceCheckUtils]: 55: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,064 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:37,064 INFO L273 TraceCheckUtils]: 57: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,064 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:37,065 INFO L273 TraceCheckUtils]: 59: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,065 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:37,065 INFO L273 TraceCheckUtils]: 61: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,065 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:37,065 INFO L273 TraceCheckUtils]: 63: Hoare triple {12085#false} assume !(~i~0 < 1000); {12085#false} is VALID [2018-11-23 12:24:37,065 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:37,065 INFO L273 TraceCheckUtils]: 65: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:24:37,065 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12085#false} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:24:37,066 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:37,066 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:37,066 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:37,066 INFO L273 TraceCheckUtils]: 70: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,066 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:37,066 INFO L273 TraceCheckUtils]: 72: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,066 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:37,066 INFO L273 TraceCheckUtils]: 74: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,066 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:37,067 INFO L273 TraceCheckUtils]: 76: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,067 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:37,067 INFO L273 TraceCheckUtils]: 78: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,067 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:37,067 INFO L273 TraceCheckUtils]: 80: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,067 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:37,067 INFO L273 TraceCheckUtils]: 82: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,067 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:37,067 INFO L273 TraceCheckUtils]: 84: Hoare triple {12085#false} assume !(~i~0 < 1000); {12085#false} is VALID [2018-11-23 12:24:37,068 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:37,068 INFO L273 TraceCheckUtils]: 86: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:24:37,068 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12085#false} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:24:37,068 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:37,068 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:37,068 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:37,068 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:37,068 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:37,068 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:37,069 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:37,069 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:37,069 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:37,069 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:37,069 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:37,069 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 999); {12085#false} is VALID [2018-11-23 12:24:37,069 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:24:37,069 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:37,069 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:37,070 INFO L273 TraceCheckUtils]: 103: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,070 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:37,070 INFO L273 TraceCheckUtils]: 105: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,070 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:37,070 INFO L273 TraceCheckUtils]: 107: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,070 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:37,070 INFO L273 TraceCheckUtils]: 109: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,070 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:37,070 INFO L273 TraceCheckUtils]: 111: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,071 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:37,071 INFO L273 TraceCheckUtils]: 113: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,071 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:37,071 INFO L273 TraceCheckUtils]: 115: Hoare triple {12085#false} assume !!(~i~0 < 1000);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:37,071 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:37,071 INFO L273 TraceCheckUtils]: 117: Hoare triple {12085#false} assume !(~i~0 < 1000); {12085#false} is VALID [2018-11-23 12:24:37,071 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:37,071 INFO L273 TraceCheckUtils]: 119: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:24:37,071 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12085#false} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:24:37,072 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:37,072 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:37,072 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:24:37,080 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:37,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:37,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:24:37,100 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:24:37,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:37,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:24:37,184 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:37,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:24:37,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:24:37,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:24:37,185 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2018-11-23 12:24:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:37,626 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-23 12:24:37,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:24:37,627 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:24:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:24:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:24:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:24:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:24:37,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 94 transitions. [2018-11-23 12:24:37,788 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:37,790 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:24:37,790 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:24:37,791 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:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:24:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 12:24:37,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:37,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 12:24:37,831 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 12:24:37,831 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 12:24:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:37,833 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:24:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:24:37,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:37,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:37,834 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 12:24:37,834 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 12:24:37,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:37,836 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:24:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:24:37,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:37,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:37,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:37,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:24:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-23 12:24:37,839 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-23 12:24:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:37,840 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-23 12:24:37,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:24:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-23 12:24:37,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:24:37,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:37,841 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:37,841 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:37,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:37,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1742217987, now seen corresponding path program 21 times [2018-11-23 12:24:37,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:37,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:37,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:37,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:37,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:38,304 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:24:38,304 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:38,305 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:24:38,305 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:24:38,305 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret13 := main(); {12984#true} is VALID [2018-11-23 12:24:38,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:38,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {12986#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:38,348 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:38,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {12987#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:38,371 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:38,380 INFO L273 TraceCheckUtils]: 10: Hoare triple {12988#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:38,389 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:38,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {12989#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:38,414 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:38,426 INFO L273 TraceCheckUtils]: 14: Hoare triple {12990#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:38,440 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:38,449 INFO L273 TraceCheckUtils]: 16: Hoare triple {12991#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:38,461 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:38,474 INFO L273 TraceCheckUtils]: 18: Hoare triple {12992#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:38,486 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:38,499 INFO L273 TraceCheckUtils]: 20: Hoare triple {12993#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:38,512 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:38,524 INFO L273 TraceCheckUtils]: 22: Hoare triple {12994#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:38,537 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:38,549 INFO L273 TraceCheckUtils]: 24: Hoare triple {12995#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:38,569 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:38,578 INFO L273 TraceCheckUtils]: 26: Hoare triple {12996#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:38,590 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:38,603 INFO L273 TraceCheckUtils]: 28: Hoare triple {12997#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:38,615 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:38,617 INFO L273 TraceCheckUtils]: 30: Hoare triple {12998#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:38,617 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:38,619 INFO L273 TraceCheckUtils]: 32: Hoare triple {12999#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:38,619 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:38,622 INFO L273 TraceCheckUtils]: 34: Hoare triple {13000#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:38,622 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:38,622 INFO L273 TraceCheckUtils]: 36: Hoare triple {13001#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:38,623 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:38,623 INFO L273 TraceCheckUtils]: 38: Hoare triple {13002#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:38,624 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:38,624 INFO L273 TraceCheckUtils]: 40: Hoare triple {13003#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:38,624 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:38,625 INFO L273 TraceCheckUtils]: 42: Hoare triple {13004#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:38,625 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:38,625 INFO L273 TraceCheckUtils]: 44: Hoare triple {13005#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:38,626 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:38,627 INFO L273 TraceCheckUtils]: 46: Hoare triple {13006#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:38,627 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:38,628 INFO L273 TraceCheckUtils]: 48: Hoare triple {13007#(<= main_~i~1 21)} assume !(~i~1 < 1000); {12985#false} is VALID [2018-11-23 12:24:38,628 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:38,628 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:38,629 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,629 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:38,629 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,629 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:38,629 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,630 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:38,630 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,630 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:38,630 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,630 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:38,630 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,631 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:38,631 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,631 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:38,631 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 1000); {12984#true} is VALID [2018-11-23 12:24:38,631 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:38,631 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:24:38,631 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12985#false} #70#return; {12985#false} is VALID [2018-11-23 12:24:38,631 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:38,632 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:38,632 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:38,632 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,632 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:38,632 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,632 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:38,632 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,632 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:38,632 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,633 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:38,633 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,633 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:38,633 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,633 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:38,633 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,633 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:38,633 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 1000); {12984#true} is VALID [2018-11-23 12:24:38,633 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:38,634 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:24:38,634 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12985#false} #72#return; {12985#false} is VALID [2018-11-23 12:24:38,634 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:38,634 INFO L273 TraceCheckUtils]: 91: Hoare triple {12985#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:38,634 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:38,634 INFO L273 TraceCheckUtils]: 93: Hoare triple {12985#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:38,634 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:38,634 INFO L273 TraceCheckUtils]: 95: Hoare triple {12985#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:38,634 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:38,635 INFO L273 TraceCheckUtils]: 97: Hoare triple {12985#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:38,635 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:38,635 INFO L273 TraceCheckUtils]: 99: Hoare triple {12985#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:38,635 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:38,635 INFO L273 TraceCheckUtils]: 101: Hoare triple {12985#false} assume !(~i~2 < 999); {12985#false} is VALID [2018-11-23 12:24:38,635 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:24:38,635 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:38,635 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:38,635 INFO L273 TraceCheckUtils]: 105: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,636 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:38,636 INFO L273 TraceCheckUtils]: 107: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,636 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:38,636 INFO L273 TraceCheckUtils]: 109: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,636 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:38,636 INFO L273 TraceCheckUtils]: 111: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,636 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:38,636 INFO L273 TraceCheckUtils]: 113: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,636 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:38,637 INFO L273 TraceCheckUtils]: 115: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,637 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:38,637 INFO L273 TraceCheckUtils]: 117: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:38,637 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:38,637 INFO L273 TraceCheckUtils]: 119: Hoare triple {12984#true} assume !(~i~0 < 1000); {12984#true} is VALID [2018-11-23 12:24:38,637 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:38,637 INFO L273 TraceCheckUtils]: 121: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:24:38,637 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12984#true} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:24:38,637 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:38,638 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:38,638 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:24:38,645 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:38,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:38,645 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:38,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:24:38,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:24:38,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:38,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:39,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:24:39,273 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:39,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:24:39,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:24:39,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret13 := main(); {12984#true} is VALID [2018-11-23 12:24:39,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12984#true} is VALID [2018-11-23 12:24:39,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,274 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:39,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,274 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:39,274 INFO L273 TraceCheckUtils]: 10: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,275 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:39,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,275 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:39,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,275 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:39,275 INFO L273 TraceCheckUtils]: 16: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,275 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:39,275 INFO L273 TraceCheckUtils]: 18: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,276 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:39,276 INFO L273 TraceCheckUtils]: 20: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,276 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:39,276 INFO L273 TraceCheckUtils]: 22: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,276 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:39,276 INFO L273 TraceCheckUtils]: 24: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,276 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:39,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,277 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:39,277 INFO L273 TraceCheckUtils]: 28: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,277 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:39,277 INFO L273 TraceCheckUtils]: 30: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,277 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:39,277 INFO L273 TraceCheckUtils]: 32: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,278 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:39,278 INFO L273 TraceCheckUtils]: 34: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,278 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:39,278 INFO L273 TraceCheckUtils]: 36: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,278 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:39,278 INFO L273 TraceCheckUtils]: 38: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,278 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:39,279 INFO L273 TraceCheckUtils]: 40: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,279 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:39,279 INFO L273 TraceCheckUtils]: 42: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,279 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:39,279 INFO L273 TraceCheckUtils]: 44: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,279 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:39,280 INFO L273 TraceCheckUtils]: 46: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -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:39,280 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:39,280 INFO L273 TraceCheckUtils]: 48: Hoare triple {12984#true} assume !(~i~1 < 1000); {12984#true} is VALID [2018-11-23 12:24:39,280 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:39,280 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:39,280 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:39,280 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:39,280 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:39,281 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:39,281 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:39,281 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:39,281 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:39,281 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:39,281 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:39,281 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:39,281 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:39,281 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:39,282 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:39,282 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:39,282 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 1000); {12984#true} is VALID [2018-11-23 12:24:39,282 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:39,282 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:24:39,282 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12984#true} #70#return; {12984#true} is VALID [2018-11-23 12:24:39,282 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:39,282 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:39,282 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:39,283 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:39,283 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:39,283 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:39,283 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:39,283 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:39,283 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:39,284 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:39,284 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:39,284 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:39,284 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:39,284 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:39,284 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:39,285 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 1000);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:39,285 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:39,285 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 1000); {12984#true} is VALID [2018-11-23 12:24:39,285 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:39,285 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:24:39,285 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12984#true} #72#return; {12984#true} is VALID [2018-11-23 12:24:39,287 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:39,288 INFO L273 TraceCheckUtils]: 91: Hoare triple {13281#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:39,288 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:39,289 INFO L273 TraceCheckUtils]: 93: Hoare triple {13288#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:39,289 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:39,289 INFO L273 TraceCheckUtils]: 95: Hoare triple {13295#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:39,290 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:39,291 INFO L273 TraceCheckUtils]: 97: Hoare triple {13302#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:39,291 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:39,292 INFO L273 TraceCheckUtils]: 99: Hoare triple {13309#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:39,293 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:39,293 INFO L273 TraceCheckUtils]: 101: Hoare triple {13316#(<= main_~i~2 5)} assume !(~i~2 < 999); {12985#false} is VALID [2018-11-23 12:24:39,293 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:24:39,294 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:39,294 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:39,294 INFO L273 TraceCheckUtils]: 105: Hoare triple {12985#false} assume !!(~i~0 < 1000);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:39,294 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:39,294 INFO L273 TraceCheckUtils]: 107: Hoare triple {12985#false} assume !!(~i~0 < 1000);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:39,295 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:39,295 INFO L273 TraceCheckUtils]: 109: Hoare triple {12985#false} assume !!(~i~0 < 1000);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:39,295 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:39,295 INFO L273 TraceCheckUtils]: 111: Hoare triple {12985#false} assume !!(~i~0 < 1000);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:39,295 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:39,296 INFO L273 TraceCheckUtils]: 113: Hoare triple {12985#false} assume !!(~i~0 < 1000);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:39,296 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:39,296 INFO L273 TraceCheckUtils]: 115: Hoare triple {12985#false} assume !!(~i~0 < 1000);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:39,296 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:39,296 INFO L273 TraceCheckUtils]: 117: Hoare triple {12985#false} assume !!(~i~0 < 1000);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:39,297 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:39,297 INFO L273 TraceCheckUtils]: 119: Hoare triple {12985#false} assume !(~i~0 < 1000); {12985#false} is VALID [2018-11-23 12:24:39,297 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:39,297 INFO L273 TraceCheckUtils]: 121: Hoare triple {12985#false} assume true; {12985#false} is VALID [2018-11-23 12:24:39,297 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12985#false} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:24:39,297 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:39,297 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:39,297 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:24:39,304 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:39,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:39,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2018-11-23 12:24:39,323 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:24:39,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:39,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:24:39,431 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:39,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:24:39,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:24:39,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:24:39,432 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2018-11-23 12:24:40,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:40,011 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-11-23 12:24:40,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:24:40,011 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:24:40,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:24:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:24:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:24:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:24:40,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 109 transitions. [2018-11-23 12:24:40,141 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:40,143 INFO L225 Difference]: With dead ends: 135 [2018-11-23 12:24:40,143 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:24:40,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:24:40,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:24:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-23 12:24:40,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:40,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 93 states. [2018-11-23 12:24:40,189 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 93 states. [2018-11-23 12:24:40,190 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 93 states. [2018-11-23 12:24:40,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:40,192 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:24:40,192 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:24:40,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:40,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:40,193 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 95 states. [2018-11-23 12:24:40,193 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 95 states. [2018-11-23 12:24:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:40,194 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:24:40,194 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:24:40,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:40,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:40,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:40,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 12:24:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-11-23 12:24:40,197 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2018-11-23 12:24:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:40,197 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-11-23 12:24:40,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:24:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-23 12:24:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:24:40,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:40,199 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:40,199 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:40,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:40,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2078845859, now seen corresponding path program 22 times [2018-11-23 12:24:40,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:40,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:40,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:40,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:40,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:40,775 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:24:40,775 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:40,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:24:40,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:24:40,776 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret13 := main(); {13919#true} is VALID [2018-11-23 12:24:40,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:40,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {13921#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:40,778 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:40,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:40,779 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:40,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:40,780 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:40,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:40,782 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:40,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:40,783 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:40,784 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:40,784 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:40,785 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:40,785 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:40,786 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:40,787 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:40,787 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:40,788 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:40,789 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:40,789 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:40,790 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:40,791 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:40,791 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:40,792 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:40,792 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:40,793 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:40,794 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:40,794 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:40,795 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:40,797 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:40,797 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:40,798 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:40,798 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:40,799 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:40,800 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:40,800 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:40,801 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:40,802 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:40,802 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:40,803 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:40,803 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:40,804 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:40,805 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:40,805 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:40,806 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 1000); {13920#false} is VALID [2018-11-23 12:24:40,806 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:40,807 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:40,807 INFO L273 TraceCheckUtils]: 53: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,807 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:40,807 INFO L273 TraceCheckUtils]: 55: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,807 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:40,807 INFO L273 TraceCheckUtils]: 57: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,808 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:40,808 INFO L273 TraceCheckUtils]: 59: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,808 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:40,808 INFO L273 TraceCheckUtils]: 61: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,808 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:40,809 INFO L273 TraceCheckUtils]: 63: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,809 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:40,809 INFO L273 TraceCheckUtils]: 65: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,809 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:40,809 INFO L273 TraceCheckUtils]: 67: Hoare triple {13919#true} assume !(~i~0 < 1000); {13919#true} is VALID [2018-11-23 12:24:40,810 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:40,810 INFO L273 TraceCheckUtils]: 69: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:24:40,810 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13919#true} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:24:40,810 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:40,810 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:40,810 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:40,811 INFO L273 TraceCheckUtils]: 74: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,811 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:40,811 INFO L273 TraceCheckUtils]: 76: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,811 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:40,811 INFO L273 TraceCheckUtils]: 78: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,811 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:40,811 INFO L273 TraceCheckUtils]: 80: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,811 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:40,811 INFO L273 TraceCheckUtils]: 82: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,812 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:40,812 INFO L273 TraceCheckUtils]: 84: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,812 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:40,812 INFO L273 TraceCheckUtils]: 86: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,812 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:40,812 INFO L273 TraceCheckUtils]: 88: Hoare triple {13919#true} assume !(~i~0 < 1000); {13919#true} is VALID [2018-11-23 12:24:40,812 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:40,812 INFO L273 TraceCheckUtils]: 90: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:24:40,812 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13919#true} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:24:40,813 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:40,813 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:40,813 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:40,813 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:40,813 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:40,813 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:40,813 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:40,813 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:40,813 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:40,814 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:40,814 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:40,814 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:40,814 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:40,814 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 999); {13920#false} is VALID [2018-11-23 12:24:40,814 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:24:40,814 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:40,814 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:40,814 INFO L273 TraceCheckUtils]: 109: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,815 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:40,815 INFO L273 TraceCheckUtils]: 111: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,815 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:40,815 INFO L273 TraceCheckUtils]: 113: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,815 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:40,815 INFO L273 TraceCheckUtils]: 115: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,816 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:40,816 INFO L273 TraceCheckUtils]: 117: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,816 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:40,816 INFO L273 TraceCheckUtils]: 119: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,816 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:40,816 INFO L273 TraceCheckUtils]: 121: Hoare triple {13919#true} assume !!(~i~0 < 1000);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:40,816 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:40,817 INFO L273 TraceCheckUtils]: 123: Hoare triple {13919#true} assume !(~i~0 < 1000); {13919#true} is VALID [2018-11-23 12:24:40,817 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:40,817 INFO L273 TraceCheckUtils]: 125: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:24:40,817 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13919#true} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:24:40,817 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:40,817 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:40,818 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:24:40,826 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:40,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:40,826 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:40,835 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:24:40,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:24:40,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:40,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:41,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:24:41,231 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:41,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:24:41,232 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:24:41,232 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret13 := main(); {13919#true} is VALID [2018-11-23 12:24:41,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:41,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {13962#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:41,234 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:41,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:41,235 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:41,235 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:41,235 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:41,236 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:41,236 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:41,236 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:41,237 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:41,238 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:41,238 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:41,239 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:41,240 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:41,240 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:41,241 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:41,241 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:41,242 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:41,243 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:41,243 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:41,244 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:41,245 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:41,245 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:41,246 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:41,247 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:41,247 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:41,248 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:41,249 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:41,249 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:41,250 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:41,250 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:41,251 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:41,251 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:41,252 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:41,253 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:41,253 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:41,254 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:41,255 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:41,255 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:41,256 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:41,256 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:41,257 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:41,257 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:41,258 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:41,259 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 1000); {13920#false} is VALID [2018-11-23 12:24:41,259 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:41,259 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:41,259 INFO L273 TraceCheckUtils]: 53: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,260 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:41,260 INFO L273 TraceCheckUtils]: 55: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,260 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:41,260 INFO L273 TraceCheckUtils]: 57: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,260 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:41,260 INFO L273 TraceCheckUtils]: 59: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,261 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:41,261 INFO L273 TraceCheckUtils]: 61: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,261 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:41,261 INFO L273 TraceCheckUtils]: 63: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,261 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:41,261 INFO L273 TraceCheckUtils]: 65: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,262 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:41,262 INFO L273 TraceCheckUtils]: 67: Hoare triple {13920#false} assume !(~i~0 < 1000); {13920#false} is VALID [2018-11-23 12:24:41,262 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:41,262 INFO L273 TraceCheckUtils]: 69: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:24:41,262 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13920#false} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:24:41,262 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:41,262 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:41,262 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:41,262 INFO L273 TraceCheckUtils]: 74: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,263 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:41,263 INFO L273 TraceCheckUtils]: 76: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,263 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:41,263 INFO L273 TraceCheckUtils]: 78: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,263 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:41,263 INFO L273 TraceCheckUtils]: 80: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,263 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:41,263 INFO L273 TraceCheckUtils]: 82: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,263 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:41,264 INFO L273 TraceCheckUtils]: 84: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,264 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:41,264 INFO L273 TraceCheckUtils]: 86: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,264 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:41,264 INFO L273 TraceCheckUtils]: 88: Hoare triple {13920#false} assume !(~i~0 < 1000); {13920#false} is VALID [2018-11-23 12:24:41,264 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:41,264 INFO L273 TraceCheckUtils]: 90: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:24:41,264 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13920#false} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:24:41,264 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:41,265 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:41,265 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:41,265 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:41,265 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:41,265 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:41,265 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:41,265 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:41,265 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:41,265 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:41,265 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:41,266 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:41,266 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:41,266 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 999); {13920#false} is VALID [2018-11-23 12:24:41,266 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:24:41,266 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:41,266 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:41,266 INFO L273 TraceCheckUtils]: 109: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,266 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:41,266 INFO L273 TraceCheckUtils]: 111: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,267 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:41,267 INFO L273 TraceCheckUtils]: 113: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,267 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:41,267 INFO L273 TraceCheckUtils]: 115: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,267 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:41,267 INFO L273 TraceCheckUtils]: 117: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,267 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:41,267 INFO L273 TraceCheckUtils]: 119: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,267 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:41,268 INFO L273 TraceCheckUtils]: 121: Hoare triple {13920#false} assume !!(~i~0 < 1000);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:41,268 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:41,268 INFO L273 TraceCheckUtils]: 123: Hoare triple {13920#false} assume !(~i~0 < 1000); {13920#false} is VALID [2018-11-23 12:24:41,268 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:41,268 INFO L273 TraceCheckUtils]: 125: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:24:41,268 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13920#false} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:24:41,268 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:41,268 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:41,268 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:24:41,277 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:41,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:41,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:24:41,295 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:24:41,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:41,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:24:41,440 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:41,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:24:41,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:24:41,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:24:41,442 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2018-11-23 12:24:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:42,400 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 12:24:42,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:24:42,401 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:24:42,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:24:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:24:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:24:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:24:42,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 98 transitions. [2018-11-23 12:24:42,498 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:42,500 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:24:42,501 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:24:42,501 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:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:24:42,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-23 12:24:42,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:42,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-23 12:24:42,544 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-23 12:24:42,544 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-23 12:24:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:42,547 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:24:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:24:42,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:42,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:42,548 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-23 12:24:42,548 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-23 12:24:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:42,550 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:24:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:24:42,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:42,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:42,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:42,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:24:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-23 12:24:42,553 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2018-11-23 12:24:42,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:42,554 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-23 12:24:42,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:24:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:24:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 12:24:42,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:42,555 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:42,555 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:42,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash -627324865, now seen corresponding path program 23 times [2018-11-23 12:24:42,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:42,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:42,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:42,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:44,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:24:44,490 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:44,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:24:44,490 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:24:44,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret13 := main(); {14872#true} is VALID [2018-11-23 12:24:44,493 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:44,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {14874#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:44,493 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:44,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {14875#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:44,494 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:44,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {14876#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:44,495 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:44,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {14877#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:44,496 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:44,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {14878#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:44,496 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:44,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {14879#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:44,498 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:44,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {14880#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:44,499 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:44,499 INFO L273 TraceCheckUtils]: 20: Hoare triple {14881#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:44,500 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:44,500 INFO L273 TraceCheckUtils]: 22: Hoare triple {14882#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:44,501 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:44,502 INFO L273 TraceCheckUtils]: 24: Hoare triple {14883#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:44,502 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:44,503 INFO L273 TraceCheckUtils]: 26: Hoare triple {14884#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:44,503 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:44,504 INFO L273 TraceCheckUtils]: 28: Hoare triple {14885#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:44,505 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:44,505 INFO L273 TraceCheckUtils]: 30: Hoare triple {14886#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:44,506 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:44,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {14887#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:44,507 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:44,507 INFO L273 TraceCheckUtils]: 34: Hoare triple {14888#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:44,508 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:44,509 INFO L273 TraceCheckUtils]: 36: Hoare triple {14889#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:44,509 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:44,510 INFO L273 TraceCheckUtils]: 38: Hoare triple {14890#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:44,511 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:44,511 INFO L273 TraceCheckUtils]: 40: Hoare triple {14891#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:44,512 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:44,512 INFO L273 TraceCheckUtils]: 42: Hoare triple {14892#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:44,513 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:44,513 INFO L273 TraceCheckUtils]: 44: Hoare triple {14893#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:44,514 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:44,515 INFO L273 TraceCheckUtils]: 46: Hoare triple {14894#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:44,515 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:44,516 INFO L273 TraceCheckUtils]: 48: Hoare triple {14895#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:44,516 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:44,517 INFO L273 TraceCheckUtils]: 50: Hoare triple {14896#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:44,518 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:44,518 INFO L273 TraceCheckUtils]: 52: Hoare triple {14897#(<= main_~i~1 23)} assume !(~i~1 < 1000); {14873#false} is VALID [2018-11-23 12:24:44,518 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:44,519 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:44,519 INFO L273 TraceCheckUtils]: 55: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,519 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:44,519 INFO L273 TraceCheckUtils]: 57: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,519 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:44,519 INFO L273 TraceCheckUtils]: 59: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,520 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:44,520 INFO L273 TraceCheckUtils]: 61: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,520 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:44,520 INFO L273 TraceCheckUtils]: 63: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,520 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:44,521 INFO L273 TraceCheckUtils]: 65: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,521 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:44,521 INFO L273 TraceCheckUtils]: 67: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,521 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:44,521 INFO L273 TraceCheckUtils]: 69: Hoare triple {14872#true} assume !(~i~0 < 1000); {14872#true} is VALID [2018-11-23 12:24:44,521 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:44,521 INFO L273 TraceCheckUtils]: 71: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:24:44,521 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14872#true} {14873#false} #70#return; {14873#false} is VALID [2018-11-23 12:24:44,521 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:44,522 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:44,522 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:44,522 INFO L273 TraceCheckUtils]: 76: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,522 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:44,522 INFO L273 TraceCheckUtils]: 78: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,522 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:44,522 INFO L273 TraceCheckUtils]: 80: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,522 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:44,522 INFO L273 TraceCheckUtils]: 82: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,523 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:44,523 INFO L273 TraceCheckUtils]: 84: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,523 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:44,523 INFO L273 TraceCheckUtils]: 86: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,523 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:44,523 INFO L273 TraceCheckUtils]: 88: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,523 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:44,523 INFO L273 TraceCheckUtils]: 90: Hoare triple {14872#true} assume !(~i~0 < 1000); {14872#true} is VALID [2018-11-23 12:24:44,523 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:44,524 INFO L273 TraceCheckUtils]: 92: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:24:44,524 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14872#true} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:24:44,524 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:44,524 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:44,524 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:44,524 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:44,524 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:44,524 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:44,524 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:44,525 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:44,525 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:44,525 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:44,525 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:44,525 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:44,525 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:44,525 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 999); {14873#false} is VALID [2018-11-23 12:24:44,525 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:24:44,525 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:44,525 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:44,526 INFO L273 TraceCheckUtils]: 111: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,526 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:44,526 INFO L273 TraceCheckUtils]: 113: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,526 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:44,526 INFO L273 TraceCheckUtils]: 115: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,526 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:44,526 INFO L273 TraceCheckUtils]: 117: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,526 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:44,526 INFO L273 TraceCheckUtils]: 119: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,527 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:44,527 INFO L273 TraceCheckUtils]: 121: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,527 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:44,527 INFO L273 TraceCheckUtils]: 123: Hoare triple {14872#true} assume !!(~i~0 < 1000);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:44,527 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:44,527 INFO L273 TraceCheckUtils]: 125: Hoare triple {14872#true} assume !(~i~0 < 1000); {14872#true} is VALID [2018-11-23 12:24:44,527 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:44,527 INFO L273 TraceCheckUtils]: 127: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:24:44,527 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14872#true} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:24:44,528 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:44,528 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:44,528 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:24:44,536 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:44,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:44,536 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:44,546 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:24:47,470 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-23 12:24:47,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:47,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:48,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:24:48,325 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:48,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:24:48,325 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:24:48,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret13 := main(); {14872#true} is VALID [2018-11-23 12:24:48,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14872#true} is VALID [2018-11-23 12:24:48,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,326 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:48,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,326 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:48,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,327 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:48,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,327 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:48,327 INFO L273 TraceCheckUtils]: 14: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,328 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:48,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,328 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:48,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,328 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:48,328 INFO L273 TraceCheckUtils]: 20: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,328 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:48,328 INFO L273 TraceCheckUtils]: 22: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,329 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:48,329 INFO L273 TraceCheckUtils]: 24: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,329 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:48,329 INFO L273 TraceCheckUtils]: 26: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,329 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:48,329 INFO L273 TraceCheckUtils]: 28: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,329 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:48,329 INFO L273 TraceCheckUtils]: 30: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,329 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:48,329 INFO L273 TraceCheckUtils]: 32: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,330 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:48,330 INFO L273 TraceCheckUtils]: 34: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,330 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:48,330 INFO L273 TraceCheckUtils]: 36: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,330 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:48,330 INFO L273 TraceCheckUtils]: 38: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,330 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:48,330 INFO L273 TraceCheckUtils]: 40: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,330 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:48,331 INFO L273 TraceCheckUtils]: 42: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,331 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:48,331 INFO L273 TraceCheckUtils]: 44: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,331 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:48,331 INFO L273 TraceCheckUtils]: 46: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,331 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:48,331 INFO L273 TraceCheckUtils]: 48: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,331 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:48,331 INFO L273 TraceCheckUtils]: 50: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -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:48,332 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:48,332 INFO L273 TraceCheckUtils]: 52: Hoare triple {14872#true} assume !(~i~1 < 1000); {14872#true} is VALID [2018-11-23 12:24:48,332 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:48,332 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:48,332 INFO L273 TraceCheckUtils]: 55: Hoare triple {15063#(<= bAnd_~i~0 1)} assume !!(~i~0 < 1000);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:48,333 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:48,333 INFO L273 TraceCheckUtils]: 57: Hoare triple {15070#(<= bAnd_~i~0 2)} assume !!(~i~0 < 1000);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:48,334 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:48,334 INFO L273 TraceCheckUtils]: 59: Hoare triple {15077#(<= bAnd_~i~0 3)} assume !!(~i~0 < 1000);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:48,334 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:48,335 INFO L273 TraceCheckUtils]: 61: Hoare triple {15084#(<= bAnd_~i~0 4)} assume !!(~i~0 < 1000);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:48,335 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:48,336 INFO L273 TraceCheckUtils]: 63: Hoare triple {15091#(<= bAnd_~i~0 5)} assume !!(~i~0 < 1000);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:48,337 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:48,337 INFO L273 TraceCheckUtils]: 65: Hoare triple {15098#(<= bAnd_~i~0 6)} assume !!(~i~0 < 1000);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:48,338 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:48,338 INFO L273 TraceCheckUtils]: 67: Hoare triple {15105#(<= bAnd_~i~0 7)} assume !!(~i~0 < 1000);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:48,339 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:48,340 INFO L273 TraceCheckUtils]: 69: Hoare triple {15112#(<= bAnd_~i~0 8)} assume !(~i~0 < 1000); {14873#false} is VALID [2018-11-23 12:24:48,340 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:48,340 INFO L273 TraceCheckUtils]: 71: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:24:48,340 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14873#false} {14872#true} #70#return; {14873#false} is VALID [2018-11-23 12:24:48,340 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:48,341 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:48,341 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:48,341 INFO L273 TraceCheckUtils]: 76: Hoare triple {14873#false} assume !!(~i~0 < 1000);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:48,341 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:48,341 INFO L273 TraceCheckUtils]: 78: Hoare triple {14873#false} assume !!(~i~0 < 1000);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:48,341 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:48,342 INFO L273 TraceCheckUtils]: 80: Hoare triple {14873#false} assume !!(~i~0 < 1000);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:48,342 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:48,342 INFO L273 TraceCheckUtils]: 82: Hoare triple {14873#false} assume !!(~i~0 < 1000);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:48,342 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:48,342 INFO L273 TraceCheckUtils]: 84: Hoare triple {14873#false} assume !!(~i~0 < 1000);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:48,342 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:48,343 INFO L273 TraceCheckUtils]: 86: Hoare triple {14873#false} assume !!(~i~0 < 1000);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:48,343 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:48,343 INFO L273 TraceCheckUtils]: 88: Hoare triple {14873#false} assume !!(~i~0 < 1000);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:48,343 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:48,343 INFO L273 TraceCheckUtils]: 90: Hoare triple {14873#false} assume !(~i~0 < 1000); {14873#false} is VALID [2018-11-23 12:24:48,343 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:48,344 INFO L273 TraceCheckUtils]: 92: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:24:48,344 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14873#false} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:24:48,344 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:48,344 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:48,344 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:48,345 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:48,345 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:48,345 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:48,345 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:48,345 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:48,345 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:48,345 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:48,345 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:48,346 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:48,346 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:48,346 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 999); {14873#false} is VALID [2018-11-23 12:24:48,346 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:24:48,346 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:48,346 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:48,346 INFO L273 TraceCheckUtils]: 111: Hoare triple {14873#false} assume !!(~i~0 < 1000);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:48,346 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:48,346 INFO L273 TraceCheckUtils]: 113: Hoare triple {14873#false} assume !!(~i~0 < 1000);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:48,346 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:48,347 INFO L273 TraceCheckUtils]: 115: Hoare triple {14873#false} assume !!(~i~0 < 1000);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:48,347 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:48,347 INFO L273 TraceCheckUtils]: 117: Hoare triple {14873#false} assume !!(~i~0 < 1000);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:48,347 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:48,347 INFO L273 TraceCheckUtils]: 119: Hoare triple {14873#false} assume !!(~i~0 < 1000);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:48,347 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:48,347 INFO L273 TraceCheckUtils]: 121: Hoare triple {14873#false} assume !!(~i~0 < 1000);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:48,347 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:48,347 INFO L273 TraceCheckUtils]: 123: Hoare triple {14873#false} assume !!(~i~0 < 1000);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:48,348 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:48,348 INFO L273 TraceCheckUtils]: 125: Hoare triple {14873#false} assume !(~i~0 < 1000); {14873#false} is VALID [2018-11-23 12:24:48,348 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:48,348 INFO L273 TraceCheckUtils]: 127: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:24:48,348 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14873#false} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:24:48,348 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:48,348 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:48,348 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:24:48,355 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:48,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:48,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2018-11-23 12:24:48,376 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:24:48,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:48,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:24:48,474 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:48,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:24:48,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:24:48,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:24:48,475 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2018-11-23 12:24:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:49,453 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-11-23 12:24:49,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:24:49,453 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:24:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:24:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:24:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:24:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:24:49,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 120 transitions. [2018-11-23 12:24:49,693 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:49,695 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:24:49,695 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:24:49,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:24:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:24:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-23 12:24:49,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:49,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2018-11-23 12:24:49,766 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2018-11-23 12:24:49,767 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2018-11-23 12:24:49,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:49,768 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:24:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:24:49,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:49,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:49,769 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2018-11-23 12:24:49,769 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2018-11-23 12:24:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:49,771 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:24:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:24:49,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:49,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:49,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:49,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 12:24:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-11-23 12:24:49,773 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2018-11-23 12:24:49,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:49,774 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-11-23 12:24:49,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:24:49,774 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-23 12:24:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-23 12:24:49,775 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:49,775 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:49,775 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:49,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:49,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1976094561, now seen corresponding path program 24 times [2018-11-23 12:24:49,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:49,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:49,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:49,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:49,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:50,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:24:50,553 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:50,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:24:50,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:24:50,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret13 := main(); {15862#true} is VALID [2018-11-23 12:24:50,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:50,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {15864#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:50,555 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:50,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {15865#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:50,556 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:50,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {15866#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:50,556 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:50,557 INFO L273 TraceCheckUtils]: 12: Hoare triple {15867#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:50,557 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:50,558 INFO L273 TraceCheckUtils]: 14: Hoare triple {15868#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:50,558 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:50,559 INFO L273 TraceCheckUtils]: 16: Hoare triple {15869#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:50,560 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:50,560 INFO L273 TraceCheckUtils]: 18: Hoare triple {15870#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:50,561 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:50,561 INFO L273 TraceCheckUtils]: 20: Hoare triple {15871#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:50,562 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:50,562 INFO L273 TraceCheckUtils]: 22: Hoare triple {15872#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:50,563 INFO L273 TraceCheckUtils]: 23: Hoare triple {15872#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15873#(<= main_~i~1 9)} is VALID [2018-11-23 12:24:50,564 INFO L273 TraceCheckUtils]: 24: Hoare triple {15873#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:50,567 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:50,567 INFO L273 TraceCheckUtils]: 26: Hoare triple {15874#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:50,568 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:50,568 INFO L273 TraceCheckUtils]: 28: Hoare triple {15875#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:50,568 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:50,569 INFO L273 TraceCheckUtils]: 30: Hoare triple {15876#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:50,569 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:50,569 INFO L273 TraceCheckUtils]: 32: Hoare triple {15877#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:50,570 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:50,570 INFO L273 TraceCheckUtils]: 34: Hoare triple {15878#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:50,571 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:50,571 INFO L273 TraceCheckUtils]: 36: Hoare triple {15879#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:50,572 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:50,572 INFO L273 TraceCheckUtils]: 38: Hoare triple {15880#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:50,573 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:50,573 INFO L273 TraceCheckUtils]: 40: Hoare triple {15881#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:50,574 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:50,574 INFO L273 TraceCheckUtils]: 42: Hoare triple {15882#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:50,575 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:50,576 INFO L273 TraceCheckUtils]: 44: Hoare triple {15883#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:50,576 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:50,577 INFO L273 TraceCheckUtils]: 46: Hoare triple {15884#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:50,577 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:50,578 INFO L273 TraceCheckUtils]: 48: Hoare triple {15885#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:50,579 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:50,579 INFO L273 TraceCheckUtils]: 50: Hoare triple {15886#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:50,580 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:50,580 INFO L273 TraceCheckUtils]: 52: Hoare triple {15887#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:50,581 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:50,582 INFO L273 TraceCheckUtils]: 54: Hoare triple {15888#(<= main_~i~1 24)} assume !(~i~1 < 1000); {15863#false} is VALID [2018-11-23 12:24:50,582 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:50,582 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:50,582 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,582 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:50,583 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,583 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:50,583 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,583 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:50,583 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,583 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:50,584 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,584 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:50,584 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,584 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:50,584 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,584 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:50,585 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,585 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:50,585 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 1000); {15862#true} is VALID [2018-11-23 12:24:50,585 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:50,585 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:24:50,585 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15863#false} #70#return; {15863#false} is VALID [2018-11-23 12:24:50,585 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:50,586 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:50,586 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:50,586 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,586 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:50,586 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,586 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:50,586 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,586 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:50,586 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,587 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:50,587 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,587 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:50,587 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,587 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:50,587 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,587 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:50,587 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,587 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:50,588 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 1000); {15862#true} is VALID [2018-11-23 12:24:50,588 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:50,588 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:24:50,588 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15863#false} #72#return; {15863#false} is VALID [2018-11-23 12:24:50,588 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:50,588 INFO L273 TraceCheckUtils]: 101: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:50,588 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:50,588 INFO L273 TraceCheckUtils]: 103: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:50,588 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:50,588 INFO L273 TraceCheckUtils]: 105: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:50,589 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:50,589 INFO L273 TraceCheckUtils]: 107: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:50,589 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:50,589 INFO L273 TraceCheckUtils]: 109: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:50,589 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:50,589 INFO L273 TraceCheckUtils]: 111: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:50,589 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:50,589 INFO L273 TraceCheckUtils]: 113: Hoare triple {15863#false} assume !(~i~2 < 999); {15863#false} is VALID [2018-11-23 12:24:50,589 INFO L273 TraceCheckUtils]: 114: Hoare triple {15863#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:24:50,590 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:50,590 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:50,590 INFO L273 TraceCheckUtils]: 117: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,590 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:50,590 INFO L273 TraceCheckUtils]: 119: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,590 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:50,590 INFO L273 TraceCheckUtils]: 121: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,590 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:50,590 INFO L273 TraceCheckUtils]: 123: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,591 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:50,591 INFO L273 TraceCheckUtils]: 125: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,591 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:50,591 INFO L273 TraceCheckUtils]: 127: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,591 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:50,591 INFO L273 TraceCheckUtils]: 129: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,591 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:50,591 INFO L273 TraceCheckUtils]: 131: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:50,591 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:50,591 INFO L273 TraceCheckUtils]: 133: Hoare triple {15862#true} assume !(~i~0 < 1000); {15862#true} is VALID [2018-11-23 12:24:50,592 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:50,592 INFO L273 TraceCheckUtils]: 135: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:24:50,592 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15862#true} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:24:50,592 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:50,592 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:50,592 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:24:50,601 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:50,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:50,601 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:50,610 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:24:51,246 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-23 12:24:51,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:51,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:51,501 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:24:51,502 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:51,502 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:24:51,502 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:24:51,502 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret13 := main(); {15862#true} is VALID [2018-11-23 12:24:51,502 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15862#true} is VALID [2018-11-23 12:24:51,503 INFO L273 TraceCheckUtils]: 6: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,503 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:51,503 INFO L273 TraceCheckUtils]: 8: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,503 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:51,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,504 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:51,504 INFO L273 TraceCheckUtils]: 12: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,504 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:51,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,504 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:51,504 INFO L273 TraceCheckUtils]: 16: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,504 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:51,504 INFO L273 TraceCheckUtils]: 18: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,505 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:51,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,505 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:51,505 INFO L273 TraceCheckUtils]: 22: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,505 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:51,505 INFO L273 TraceCheckUtils]: 24: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,505 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:51,505 INFO L273 TraceCheckUtils]: 26: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,505 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:51,506 INFO L273 TraceCheckUtils]: 28: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,506 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:51,506 INFO L273 TraceCheckUtils]: 30: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,506 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:51,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,506 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:51,506 INFO L273 TraceCheckUtils]: 34: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,506 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:51,506 INFO L273 TraceCheckUtils]: 36: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,506 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:51,507 INFO L273 TraceCheckUtils]: 38: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,507 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:51,507 INFO L273 TraceCheckUtils]: 40: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,507 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:51,507 INFO L273 TraceCheckUtils]: 42: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,507 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:51,507 INFO L273 TraceCheckUtils]: 44: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,507 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:51,507 INFO L273 TraceCheckUtils]: 46: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,508 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:51,508 INFO L273 TraceCheckUtils]: 48: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,508 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:51,508 INFO L273 TraceCheckUtils]: 50: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,508 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:51,508 INFO L273 TraceCheckUtils]: 52: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -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:51,508 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:51,508 INFO L273 TraceCheckUtils]: 54: Hoare triple {15862#true} assume !(~i~1 < 1000); {15862#true} is VALID [2018-11-23 12:24:51,508 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:51,509 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:51,509 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,509 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:51,509 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,509 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:51,509 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,509 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:51,509 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,509 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:51,509 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,510 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:51,510 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,510 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:51,510 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,510 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:51,510 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,510 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:51,510 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 1000); {15862#true} is VALID [2018-11-23 12:24:51,510 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:51,511 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:24:51,511 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15862#true} #70#return; {15862#true} is VALID [2018-11-23 12:24:51,511 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:51,511 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:51,511 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:51,511 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,511 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:51,511 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,511 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:51,512 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,512 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:51,512 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,512 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:51,512 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,512 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:51,512 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,512 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:51,512 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,513 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:51,513 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 1000);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:51,513 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:51,513 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 1000); {15862#true} is VALID [2018-11-23 12:24:51,513 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:51,513 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:24:51,513 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15862#true} #72#return; {15862#true} is VALID [2018-11-23 12:24:51,514 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:51,514 INFO L273 TraceCheckUtils]: 101: Hoare triple {16192#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:51,515 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:51,515 INFO L273 TraceCheckUtils]: 103: Hoare triple {16199#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:51,515 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:51,516 INFO L273 TraceCheckUtils]: 105: Hoare triple {16206#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:51,516 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:51,517 INFO L273 TraceCheckUtils]: 107: Hoare triple {16213#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:51,517 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:51,518 INFO L273 TraceCheckUtils]: 109: Hoare triple {16220#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:51,519 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:51,519 INFO L273 TraceCheckUtils]: 111: Hoare triple {16227#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:51,520 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:51,520 INFO L273 TraceCheckUtils]: 113: Hoare triple {16234#(<= main_~i~2 6)} assume !(~i~2 < 999); {15863#false} is VALID [2018-11-23 12:24:51,521 INFO L273 TraceCheckUtils]: 114: Hoare triple {15863#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:24:51,521 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:51,521 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:51,521 INFO L273 TraceCheckUtils]: 117: Hoare triple {15863#false} assume !!(~i~0 < 1000);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:51,521 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:51,522 INFO L273 TraceCheckUtils]: 119: Hoare triple {15863#false} assume !!(~i~0 < 1000);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:51,522 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:51,522 INFO L273 TraceCheckUtils]: 121: Hoare triple {15863#false} assume !!(~i~0 < 1000);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:51,522 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:51,522 INFO L273 TraceCheckUtils]: 123: Hoare triple {15863#false} assume !!(~i~0 < 1000);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:51,522 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:51,523 INFO L273 TraceCheckUtils]: 125: Hoare triple {15863#false} assume !!(~i~0 < 1000);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:51,523 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:51,523 INFO L273 TraceCheckUtils]: 127: Hoare triple {15863#false} assume !!(~i~0 < 1000);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:51,523 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:51,523 INFO L273 TraceCheckUtils]: 129: Hoare triple {15863#false} assume !!(~i~0 < 1000);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:51,523 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:51,524 INFO L273 TraceCheckUtils]: 131: Hoare triple {15863#false} assume !!(~i~0 < 1000);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:51,524 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:51,524 INFO L273 TraceCheckUtils]: 133: Hoare triple {15863#false} assume !(~i~0 < 1000); {15863#false} is VALID [2018-11-23 12:24:51,524 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:51,524 INFO L273 TraceCheckUtils]: 135: Hoare triple {15863#false} assume true; {15863#false} is VALID [2018-11-23 12:24:51,524 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15863#false} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:24:51,524 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:51,524 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:51,525 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:24:51,532 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:51,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:51,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2018-11-23 12:24:51,553 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2018-11-23 12:24:51,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:51,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:24:52,191 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:52,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:24:52,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:24:52,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:24:52,192 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 34 states. [2018-11-23 12:24:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:53,121 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-11-23 12:24:53,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:24:53,121 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2018-11-23 12:24:53,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:24:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-23 12:24:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:24:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-23 12:24:53,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 117 transitions. [2018-11-23 12:24:53,246 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:53,248 INFO L225 Difference]: With dead ends: 149 [2018-11-23 12:24:53,248 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 12:24:53,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:24:53,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 12:24:53,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-23 12:24:53,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:53,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 103 states. [2018-11-23 12:24:53,302 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 103 states. [2018-11-23 12:24:53,302 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 103 states. [2018-11-23 12:24:53,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:53,304 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:24:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:24:53,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:53,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:53,304 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 105 states. [2018-11-23 12:24:53,304 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 105 states. [2018-11-23 12:24:53,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:53,306 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:24:53,306 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:24:53,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:53,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:53,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:53,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 12:24:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-11-23 12:24:53,309 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 140 [2018-11-23 12:24:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:53,309 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-11-23 12:24:53,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:24:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 12:24:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-23 12:24:53,310 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:53,310 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:53,311 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:53,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:53,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1521279999, now seen corresponding path program 25 times [2018-11-23 12:24:53,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:53,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:53,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:53,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:53,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:54,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {16899#true} call ULTIMATE.init(); {16899#true} is VALID [2018-11-23 12:24:54,198 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:54,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:24:54,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16899#true} {16899#true} #66#return; {16899#true} is VALID [2018-11-23 12:24:54,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {16899#true} call #t~ret13 := main(); {16899#true} is VALID [2018-11-23 12:24:54,200 INFO L273 TraceCheckUtils]: 5: Hoare triple {16899#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:54,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {16901#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:54,202 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:54,202 INFO L273 TraceCheckUtils]: 8: Hoare triple {16902#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:54,204 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:54,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {16903#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:54,207 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:54,207 INFO L273 TraceCheckUtils]: 12: Hoare triple {16904#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:54,210 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:54,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {16905#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:54,213 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:54,213 INFO L273 TraceCheckUtils]: 16: Hoare triple {16906#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:54,215 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:54,215 INFO L273 TraceCheckUtils]: 18: Hoare triple {16907#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:54,217 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:54,217 INFO L273 TraceCheckUtils]: 20: Hoare triple {16908#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:54,220 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:54,220 INFO L273 TraceCheckUtils]: 22: Hoare triple {16909#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:54,222 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:54,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {16910#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:54,225 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:54,225 INFO L273 TraceCheckUtils]: 26: Hoare triple {16911#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:54,228 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:54,228 INFO L273 TraceCheckUtils]: 28: Hoare triple {16912#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:54,231 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:54,231 INFO L273 TraceCheckUtils]: 30: Hoare triple {16913#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:54,234 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:54,234 INFO L273 TraceCheckUtils]: 32: Hoare triple {16914#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:54,237 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:54,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {16915#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:54,240 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:54,240 INFO L273 TraceCheckUtils]: 36: Hoare triple {16916#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:54,243 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:54,243 INFO L273 TraceCheckUtils]: 38: Hoare triple {16917#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:54,245 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:54,245 INFO L273 TraceCheckUtils]: 40: Hoare triple {16918#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:54,248 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:54,248 INFO L273 TraceCheckUtils]: 42: Hoare triple {16919#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:54,250 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:54,250 INFO L273 TraceCheckUtils]: 44: Hoare triple {16920#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:54,253 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:54,253 INFO L273 TraceCheckUtils]: 46: Hoare triple {16921#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:54,256 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:54,256 INFO L273 TraceCheckUtils]: 48: Hoare triple {16922#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:54,258 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:54,258 INFO L273 TraceCheckUtils]: 50: Hoare triple {16923#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:54,260 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:54,260 INFO L273 TraceCheckUtils]: 52: Hoare triple {16924#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:54,263 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:54,263 INFO L273 TraceCheckUtils]: 54: Hoare triple {16925#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:54,265 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:54,265 INFO L273 TraceCheckUtils]: 56: Hoare triple {16926#(<= main_~i~1 25)} assume !(~i~1 < 1000); {16900#false} is VALID [2018-11-23 12:24:54,265 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:54,265 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:54,265 INFO L273 TraceCheckUtils]: 59: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,266 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:54,266 INFO L273 TraceCheckUtils]: 61: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,266 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:54,266 INFO L273 TraceCheckUtils]: 63: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,266 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:54,266 INFO L273 TraceCheckUtils]: 65: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,266 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:54,266 INFO L273 TraceCheckUtils]: 67: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,266 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:54,266 INFO L273 TraceCheckUtils]: 69: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,267 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:54,267 INFO L273 TraceCheckUtils]: 71: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,267 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:54,267 INFO L273 TraceCheckUtils]: 73: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,267 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:54,267 INFO L273 TraceCheckUtils]: 75: Hoare triple {16899#true} assume !(~i~0 < 1000); {16899#true} is VALID [2018-11-23 12:24:54,267 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:54,267 INFO L273 TraceCheckUtils]: 77: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:24:54,267 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16899#true} {16900#false} #70#return; {16900#false} is VALID [2018-11-23 12:24:54,268 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:54,268 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:54,268 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:54,268 INFO L273 TraceCheckUtils]: 82: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,268 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:54,268 INFO L273 TraceCheckUtils]: 84: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,268 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:54,268 INFO L273 TraceCheckUtils]: 86: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,268 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:54,269 INFO L273 TraceCheckUtils]: 88: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,269 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:54,269 INFO L273 TraceCheckUtils]: 90: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,269 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:54,269 INFO L273 TraceCheckUtils]: 92: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,269 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:54,269 INFO L273 TraceCheckUtils]: 94: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,269 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:54,269 INFO L273 TraceCheckUtils]: 96: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,270 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:54,270 INFO L273 TraceCheckUtils]: 98: Hoare triple {16899#true} assume !(~i~0 < 1000); {16899#true} is VALID [2018-11-23 12:24:54,270 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:54,270 INFO L273 TraceCheckUtils]: 100: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:24:54,270 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16899#true} {16900#false} #72#return; {16900#false} is VALID [2018-11-23 12:24:54,270 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:54,270 INFO L273 TraceCheckUtils]: 103: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:54,270 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:54,270 INFO L273 TraceCheckUtils]: 105: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:54,270 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:54,271 INFO L273 TraceCheckUtils]: 107: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:54,271 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:54,271 INFO L273 TraceCheckUtils]: 109: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:54,271 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:54,271 INFO L273 TraceCheckUtils]: 111: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:54,271 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:54,271 INFO L273 TraceCheckUtils]: 113: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:54,271 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:54,271 INFO L273 TraceCheckUtils]: 115: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:54,272 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:54,272 INFO L273 TraceCheckUtils]: 117: Hoare triple {16900#false} assume !(~i~2 < 999); {16900#false} is VALID [2018-11-23 12:24:54,272 INFO L273 TraceCheckUtils]: 118: Hoare triple {16900#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:24:54,272 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:54,272 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:54,272 INFO L273 TraceCheckUtils]: 121: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,272 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:54,272 INFO L273 TraceCheckUtils]: 123: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,272 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:54,273 INFO L273 TraceCheckUtils]: 125: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,273 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:54,273 INFO L273 TraceCheckUtils]: 127: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,273 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:54,273 INFO L273 TraceCheckUtils]: 129: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,273 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:54,273 INFO L273 TraceCheckUtils]: 131: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,273 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:54,273 INFO L273 TraceCheckUtils]: 133: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,274 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:54,274 INFO L273 TraceCheckUtils]: 135: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:54,274 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:54,274 INFO L273 TraceCheckUtils]: 137: Hoare triple {16899#true} assume !(~i~0 < 1000); {16899#true} is VALID [2018-11-23 12:24:54,274 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:54,274 INFO L273 TraceCheckUtils]: 139: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:24:54,274 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16899#true} {16900#false} #74#return; {16900#false} is VALID [2018-11-23 12:24:54,274 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:54,274 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:54,275 INFO L273 TraceCheckUtils]: 143: Hoare triple {16900#false} assume !false; {16900#false} is VALID [2018-11-23 12:24:54,284 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:54,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:54,284 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:54,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:54,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:55,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {16899#true} call ULTIMATE.init(); {16899#true} is VALID [2018-11-23 12:24:55,508 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:55,508 INFO L273 TraceCheckUtils]: 2: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:24:55,508 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16899#true} {16899#true} #66#return; {16899#true} is VALID [2018-11-23 12:24:55,509 INFO L256 TraceCheckUtils]: 4: Hoare triple {16899#true} call #t~ret13 := main(); {16899#true} is VALID [2018-11-23 12:24:55,509 INFO L273 TraceCheckUtils]: 5: Hoare triple {16899#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:55,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {16945#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:55,511 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:55,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {16902#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:55,511 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:55,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {16903#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:55,512 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:55,512 INFO L273 TraceCheckUtils]: 12: Hoare triple {16904#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:55,513 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:55,513 INFO L273 TraceCheckUtils]: 14: Hoare triple {16905#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:55,514 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:55,514 INFO L273 TraceCheckUtils]: 16: Hoare triple {16906#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:55,515 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:55,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {16907#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:55,516 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:55,517 INFO L273 TraceCheckUtils]: 20: Hoare triple {16908#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:55,518 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:55,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {16909#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:55,519 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:55,519 INFO L273 TraceCheckUtils]: 24: Hoare triple {16910#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:55,520 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:55,521 INFO L273 TraceCheckUtils]: 26: Hoare triple {16911#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:55,521 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:55,522 INFO L273 TraceCheckUtils]: 28: Hoare triple {16912#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:55,523 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:55,523 INFO L273 TraceCheckUtils]: 30: Hoare triple {16913#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:55,524 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:55,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {16914#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:55,525 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:55,526 INFO L273 TraceCheckUtils]: 34: Hoare triple {16915#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:55,526 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:55,527 INFO L273 TraceCheckUtils]: 36: Hoare triple {16916#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:55,528 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:55,528 INFO L273 TraceCheckUtils]: 38: Hoare triple {16917#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:55,529 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:55,529 INFO L273 TraceCheckUtils]: 40: Hoare triple {16918#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:55,530 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:55,530 INFO L273 TraceCheckUtils]: 42: Hoare triple {16919#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:55,531 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:55,532 INFO L273 TraceCheckUtils]: 44: Hoare triple {16920#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:55,532 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:55,533 INFO L273 TraceCheckUtils]: 46: Hoare triple {16921#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:55,534 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:55,534 INFO L273 TraceCheckUtils]: 48: Hoare triple {16922#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:55,535 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:55,535 INFO L273 TraceCheckUtils]: 50: Hoare triple {16923#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:55,536 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:55,537 INFO L273 TraceCheckUtils]: 52: Hoare triple {16924#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:55,537 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:55,538 INFO L273 TraceCheckUtils]: 54: Hoare triple {16925#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:55,538 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:55,539 INFO L273 TraceCheckUtils]: 56: Hoare triple {16926#(<= main_~i~1 25)} assume !(~i~1 < 1000); {16900#false} is VALID [2018-11-23 12:24:55,539 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:55,539 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:55,540 INFO L273 TraceCheckUtils]: 59: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,540 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:55,540 INFO L273 TraceCheckUtils]: 61: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,540 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:55,540 INFO L273 TraceCheckUtils]: 63: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,540 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:55,541 INFO L273 TraceCheckUtils]: 65: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,541 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:55,541 INFO L273 TraceCheckUtils]: 67: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,541 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:55,541 INFO L273 TraceCheckUtils]: 69: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,541 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:55,542 INFO L273 TraceCheckUtils]: 71: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,542 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:55,542 INFO L273 TraceCheckUtils]: 73: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,542 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:55,542 INFO L273 TraceCheckUtils]: 75: Hoare triple {16900#false} assume !(~i~0 < 1000); {16900#false} is VALID [2018-11-23 12:24:55,542 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:55,542 INFO L273 TraceCheckUtils]: 77: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:24:55,542 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16900#false} {16900#false} #70#return; {16900#false} is VALID [2018-11-23 12:24:55,542 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:55,543 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:55,543 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:55,543 INFO L273 TraceCheckUtils]: 82: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,543 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:55,543 INFO L273 TraceCheckUtils]: 84: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,543 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:55,543 INFO L273 TraceCheckUtils]: 86: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,543 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:55,543 INFO L273 TraceCheckUtils]: 88: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,544 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:55,544 INFO L273 TraceCheckUtils]: 90: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,544 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:55,544 INFO L273 TraceCheckUtils]: 92: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,544 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:55,544 INFO L273 TraceCheckUtils]: 94: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,544 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:55,544 INFO L273 TraceCheckUtils]: 96: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,544 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:55,544 INFO L273 TraceCheckUtils]: 98: Hoare triple {16900#false} assume !(~i~0 < 1000); {16900#false} is VALID [2018-11-23 12:24:55,545 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:55,545 INFO L273 TraceCheckUtils]: 100: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:24:55,545 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16900#false} {16900#false} #72#return; {16900#false} is VALID [2018-11-23 12:24:55,545 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:55,545 INFO L273 TraceCheckUtils]: 103: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:55,545 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:55,545 INFO L273 TraceCheckUtils]: 105: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:55,545 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:55,545 INFO L273 TraceCheckUtils]: 107: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:55,546 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:55,546 INFO L273 TraceCheckUtils]: 109: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:55,546 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:55,546 INFO L273 TraceCheckUtils]: 111: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:55,546 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:55,546 INFO L273 TraceCheckUtils]: 113: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:55,546 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:55,546 INFO L273 TraceCheckUtils]: 115: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:55,546 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:55,547 INFO L273 TraceCheckUtils]: 117: Hoare triple {16900#false} assume !(~i~2 < 999); {16900#false} is VALID [2018-11-23 12:24:55,547 INFO L273 TraceCheckUtils]: 118: Hoare triple {16900#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:24:55,547 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:55,547 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:55,547 INFO L273 TraceCheckUtils]: 121: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,547 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:55,547 INFO L273 TraceCheckUtils]: 123: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,547 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:55,547 INFO L273 TraceCheckUtils]: 125: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,547 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:55,548 INFO L273 TraceCheckUtils]: 127: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,548 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:55,548 INFO L273 TraceCheckUtils]: 129: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,548 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:55,548 INFO L273 TraceCheckUtils]: 131: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,548 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:55,548 INFO L273 TraceCheckUtils]: 133: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,548 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:55,548 INFO L273 TraceCheckUtils]: 135: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:55,549 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:55,549 INFO L273 TraceCheckUtils]: 137: Hoare triple {16900#false} assume !(~i~0 < 1000); {16900#false} is VALID [2018-11-23 12:24:55,549 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:55,549 INFO L273 TraceCheckUtils]: 139: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:24:55,549 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16900#false} {16900#false} #74#return; {16900#false} is VALID [2018-11-23 12:24:55,549 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:55,549 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:55,549 INFO L273 TraceCheckUtils]: 143: Hoare triple {16900#false} assume !false; {16900#false} is VALID [2018-11-23 12:24:55,560 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:55,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:55,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:24:55,579 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:24:55,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:55,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:24:55,665 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:55,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:24:55,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:24:55,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:24:55,667 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2018-11-23 12:24:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:56,366 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-23 12:24:56,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:24:56,366 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:24:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:24:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:24:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:24:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:24:56,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 104 transitions. [2018-11-23 12:24:56,463 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:56,465 INFO L225 Difference]: With dead ends: 152 [2018-11-23 12:24:56,466 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:24:56,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:24:56,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:24:56,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-23 12:24:56,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:56,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 105 states. [2018-11-23 12:24:56,503 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 105 states. [2018-11-23 12:24:56,503 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 105 states. [2018-11-23 12:24:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:56,505 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:24:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:24:56,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:56,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:56,506 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 106 states. [2018-11-23 12:24:56,506 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 106 states. [2018-11-23 12:24:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:56,507 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:24:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:24:56,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:56,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:56,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:56,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 12:24:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-23 12:24:56,510 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2018-11-23 12:24:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:56,511 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-23 12:24:56,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:24:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:24:56,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 12:24:56,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:56,512 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:56,512 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:56,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:56,513 INFO L82 PathProgramCache]: Analyzing trace with hash -559946655, now seen corresponding path program 26 times [2018-11-23 12:24:56,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:56,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:56,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:56,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:56,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:57,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {17953#true} call ULTIMATE.init(); {17953#true} is VALID [2018-11-23 12:24:57,228 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:57,229 INFO L273 TraceCheckUtils]: 2: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:24:57,229 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17953#true} {17953#true} #66#return; {17953#true} is VALID [2018-11-23 12:24:57,229 INFO L256 TraceCheckUtils]: 4: Hoare triple {17953#true} call #t~ret13 := main(); {17953#true} is VALID [2018-11-23 12:24:57,229 INFO L273 TraceCheckUtils]: 5: Hoare triple {17953#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:57,230 INFO L273 TraceCheckUtils]: 6: Hoare triple {17955#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:57,231 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:57,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {17956#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:57,232 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:57,232 INFO L273 TraceCheckUtils]: 10: Hoare triple {17957#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:57,233 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:57,233 INFO L273 TraceCheckUtils]: 12: Hoare triple {17958#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:57,233 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:57,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {17959#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:57,234 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:57,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {17960#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:57,236 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:57,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {17961#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:57,237 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:57,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {17962#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:57,238 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:57,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {17963#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:57,239 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:57,240 INFO L273 TraceCheckUtils]: 24: Hoare triple {17964#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:57,241 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:57,241 INFO L273 TraceCheckUtils]: 26: Hoare triple {17965#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:57,242 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:57,242 INFO L273 TraceCheckUtils]: 28: Hoare triple {17966#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:57,243 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:57,244 INFO L273 TraceCheckUtils]: 30: Hoare triple {17967#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:57,244 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:57,245 INFO L273 TraceCheckUtils]: 32: Hoare triple {17968#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:57,246 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:57,246 INFO L273 TraceCheckUtils]: 34: Hoare triple {17969#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:57,247 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:57,247 INFO L273 TraceCheckUtils]: 36: Hoare triple {17970#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:57,248 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:57,249 INFO L273 TraceCheckUtils]: 38: Hoare triple {17971#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:57,249 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:57,250 INFO L273 TraceCheckUtils]: 40: Hoare triple {17972#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:57,251 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:57,251 INFO L273 TraceCheckUtils]: 42: Hoare triple {17973#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:57,252 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:57,253 INFO L273 TraceCheckUtils]: 44: Hoare triple {17974#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:57,253 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:57,254 INFO L273 TraceCheckUtils]: 46: Hoare triple {17975#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:57,255 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:57,255 INFO L273 TraceCheckUtils]: 48: Hoare triple {17976#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:57,256 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:57,256 INFO L273 TraceCheckUtils]: 50: Hoare triple {17977#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:57,257 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:57,258 INFO L273 TraceCheckUtils]: 52: Hoare triple {17978#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:57,258 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:57,259 INFO L273 TraceCheckUtils]: 54: Hoare triple {17979#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:57,260 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:57,260 INFO L273 TraceCheckUtils]: 56: Hoare triple {17980#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:57,261 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:57,261 INFO L273 TraceCheckUtils]: 58: Hoare triple {17981#(<= main_~i~1 26)} assume !(~i~1 < 1000); {17954#false} is VALID [2018-11-23 12:24:57,262 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:57,262 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:57,262 INFO L273 TraceCheckUtils]: 61: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,262 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:57,262 INFO L273 TraceCheckUtils]: 63: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,263 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:57,263 INFO L273 TraceCheckUtils]: 65: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,263 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:57,263 INFO L273 TraceCheckUtils]: 67: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,263 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:57,264 INFO L273 TraceCheckUtils]: 69: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,264 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:57,264 INFO L273 TraceCheckUtils]: 71: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,264 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:57,264 INFO L273 TraceCheckUtils]: 73: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,265 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:57,265 INFO L273 TraceCheckUtils]: 75: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,265 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:57,265 INFO L273 TraceCheckUtils]: 77: Hoare triple {17953#true} assume !(~i~0 < 1000); {17953#true} is VALID [2018-11-23 12:24:57,265 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:57,265 INFO L273 TraceCheckUtils]: 79: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:24:57,265 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17953#true} {17954#false} #70#return; {17954#false} is VALID [2018-11-23 12:24:57,265 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:57,265 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:57,266 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:57,266 INFO L273 TraceCheckUtils]: 84: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,266 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:57,266 INFO L273 TraceCheckUtils]: 86: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,266 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:57,266 INFO L273 TraceCheckUtils]: 88: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,266 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:57,266 INFO L273 TraceCheckUtils]: 90: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,267 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:57,267 INFO L273 TraceCheckUtils]: 92: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,267 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:57,267 INFO L273 TraceCheckUtils]: 94: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,267 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:57,267 INFO L273 TraceCheckUtils]: 96: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,267 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:57,267 INFO L273 TraceCheckUtils]: 98: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,267 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:57,267 INFO L273 TraceCheckUtils]: 100: Hoare triple {17953#true} assume !(~i~0 < 1000); {17953#true} is VALID [2018-11-23 12:24:57,268 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:57,268 INFO L273 TraceCheckUtils]: 102: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:24:57,268 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17953#true} {17954#false} #72#return; {17954#false} is VALID [2018-11-23 12:24:57,268 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:57,268 INFO L273 TraceCheckUtils]: 105: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:57,268 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:57,268 INFO L273 TraceCheckUtils]: 107: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:57,268 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:57,268 INFO L273 TraceCheckUtils]: 109: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:57,269 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:57,269 INFO L273 TraceCheckUtils]: 111: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:57,269 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:57,269 INFO L273 TraceCheckUtils]: 113: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:57,269 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:57,269 INFO L273 TraceCheckUtils]: 115: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:57,269 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:57,269 INFO L273 TraceCheckUtils]: 117: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:57,269 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:57,270 INFO L273 TraceCheckUtils]: 119: Hoare triple {17954#false} assume !(~i~2 < 999); {17954#false} is VALID [2018-11-23 12:24:57,270 INFO L273 TraceCheckUtils]: 120: Hoare triple {17954#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:24:57,270 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:57,270 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:57,270 INFO L273 TraceCheckUtils]: 123: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,270 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:57,270 INFO L273 TraceCheckUtils]: 125: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,270 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:57,270 INFO L273 TraceCheckUtils]: 127: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,270 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:57,271 INFO L273 TraceCheckUtils]: 129: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,271 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:57,271 INFO L273 TraceCheckUtils]: 131: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,271 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:57,271 INFO L273 TraceCheckUtils]: 133: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,271 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:57,271 INFO L273 TraceCheckUtils]: 135: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,271 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:57,271 INFO L273 TraceCheckUtils]: 137: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:57,272 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:57,272 INFO L273 TraceCheckUtils]: 139: Hoare triple {17953#true} assume !(~i~0 < 1000); {17953#true} is VALID [2018-11-23 12:24:57,272 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:57,272 INFO L273 TraceCheckUtils]: 141: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:24:57,272 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17953#true} {17954#false} #74#return; {17954#false} is VALID [2018-11-23 12:24:57,272 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:57,272 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:57,272 INFO L273 TraceCheckUtils]: 145: Hoare triple {17954#false} assume !false; {17954#false} is VALID [2018-11-23 12:24:57,282 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:57,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:57,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:57,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:24:57,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:24:57,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:57,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:57,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {17953#true} call ULTIMATE.init(); {17953#true} is VALID [2018-11-23 12:24:57,673 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:57,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:24:57,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17953#true} {17953#true} #66#return; {17953#true} is VALID [2018-11-23 12:24:57,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {17953#true} call #t~ret13 := main(); {17953#true} is VALID [2018-11-23 12:24:57,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {17953#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:57,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {18000#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:57,676 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:57,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {17956#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:57,677 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:57,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {17957#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:57,678 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:57,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {17958#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:57,680 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:57,680 INFO L273 TraceCheckUtils]: 14: Hoare triple {17959#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:57,681 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:57,682 INFO L273 TraceCheckUtils]: 16: Hoare triple {17960#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:57,682 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:57,683 INFO L273 TraceCheckUtils]: 18: Hoare triple {17961#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:57,684 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:57,685 INFO L273 TraceCheckUtils]: 20: Hoare triple {17962#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:57,685 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:57,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {17963#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:57,687 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:57,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {17964#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:57,688 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:57,689 INFO L273 TraceCheckUtils]: 26: Hoare triple {17965#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:57,690 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:57,690 INFO L273 TraceCheckUtils]: 28: Hoare triple {17966#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:57,691 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:57,692 INFO L273 TraceCheckUtils]: 30: Hoare triple {17967#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:57,693 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:57,693 INFO L273 TraceCheckUtils]: 32: Hoare triple {17968#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:57,694 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:57,695 INFO L273 TraceCheckUtils]: 34: Hoare triple {17969#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:57,695 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:57,696 INFO L273 TraceCheckUtils]: 36: Hoare triple {17970#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:57,697 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:57,697 INFO L273 TraceCheckUtils]: 38: Hoare triple {17971#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:57,698 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:57,699 INFO L273 TraceCheckUtils]: 40: Hoare triple {17972#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:57,700 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:57,700 INFO L273 TraceCheckUtils]: 42: Hoare triple {17973#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:57,701 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:57,701 INFO L273 TraceCheckUtils]: 44: Hoare triple {17974#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:57,702 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:57,703 INFO L273 TraceCheckUtils]: 46: Hoare triple {17975#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:57,703 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:57,704 INFO L273 TraceCheckUtils]: 48: Hoare triple {17976#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:57,705 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:57,705 INFO L273 TraceCheckUtils]: 50: Hoare triple {17977#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:57,706 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:57,706 INFO L273 TraceCheckUtils]: 52: Hoare triple {17978#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:57,707 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:57,708 INFO L273 TraceCheckUtils]: 54: Hoare triple {17979#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:57,708 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:57,709 INFO L273 TraceCheckUtils]: 56: Hoare triple {17980#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:57,709 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:57,710 INFO L273 TraceCheckUtils]: 58: Hoare triple {17981#(<= main_~i~1 26)} assume !(~i~1 < 1000); {17954#false} is VALID [2018-11-23 12:24:57,710 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:57,710 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:57,711 INFO L273 TraceCheckUtils]: 61: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,711 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:57,711 INFO L273 TraceCheckUtils]: 63: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,711 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:57,711 INFO L273 TraceCheckUtils]: 65: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,712 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:57,712 INFO L273 TraceCheckUtils]: 67: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,712 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:57,712 INFO L273 TraceCheckUtils]: 69: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,712 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:57,713 INFO L273 TraceCheckUtils]: 71: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,713 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:57,713 INFO L273 TraceCheckUtils]: 73: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,713 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:57,713 INFO L273 TraceCheckUtils]: 75: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,713 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:57,713 INFO L273 TraceCheckUtils]: 77: Hoare triple {17954#false} assume !(~i~0 < 1000); {17954#false} is VALID [2018-11-23 12:24:57,714 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:57,714 INFO L273 TraceCheckUtils]: 79: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:24:57,714 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17954#false} {17954#false} #70#return; {17954#false} is VALID [2018-11-23 12:24:57,714 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:57,714 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:57,714 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:57,714 INFO L273 TraceCheckUtils]: 84: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,715 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:57,715 INFO L273 TraceCheckUtils]: 86: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,715 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:57,715 INFO L273 TraceCheckUtils]: 88: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,715 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:57,715 INFO L273 TraceCheckUtils]: 90: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,715 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:57,716 INFO L273 TraceCheckUtils]: 92: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,716 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:57,716 INFO L273 TraceCheckUtils]: 94: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,716 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:57,716 INFO L273 TraceCheckUtils]: 96: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,716 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:57,716 INFO L273 TraceCheckUtils]: 98: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,717 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:57,717 INFO L273 TraceCheckUtils]: 100: Hoare triple {17954#false} assume !(~i~0 < 1000); {17954#false} is VALID [2018-11-23 12:24:57,717 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:57,717 INFO L273 TraceCheckUtils]: 102: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:24:57,717 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17954#false} {17954#false} #72#return; {17954#false} is VALID [2018-11-23 12:24:57,717 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:57,717 INFO L273 TraceCheckUtils]: 105: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:57,717 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:57,718 INFO L273 TraceCheckUtils]: 107: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:57,718 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:57,718 INFO L273 TraceCheckUtils]: 109: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:57,718 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:57,718 INFO L273 TraceCheckUtils]: 111: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:57,718 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:57,718 INFO L273 TraceCheckUtils]: 113: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:57,719 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:57,719 INFO L273 TraceCheckUtils]: 115: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:57,719 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:57,719 INFO L273 TraceCheckUtils]: 117: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:57,719 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:57,719 INFO L273 TraceCheckUtils]: 119: Hoare triple {17954#false} assume !(~i~2 < 999); {17954#false} is VALID [2018-11-23 12:24:57,719 INFO L273 TraceCheckUtils]: 120: Hoare triple {17954#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:24:57,720 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:57,720 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:57,720 INFO L273 TraceCheckUtils]: 123: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,720 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:57,720 INFO L273 TraceCheckUtils]: 125: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,720 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:57,720 INFO L273 TraceCheckUtils]: 127: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,721 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:57,721 INFO L273 TraceCheckUtils]: 129: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,721 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:57,721 INFO L273 TraceCheckUtils]: 131: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,721 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:57,721 INFO L273 TraceCheckUtils]: 133: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,721 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:57,722 INFO L273 TraceCheckUtils]: 135: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,722 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:57,722 INFO L273 TraceCheckUtils]: 137: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:57,722 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:57,722 INFO L273 TraceCheckUtils]: 139: Hoare triple {17954#false} assume !(~i~0 < 1000); {17954#false} is VALID [2018-11-23 12:24:57,722 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:57,722 INFO L273 TraceCheckUtils]: 141: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:24:57,723 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17954#false} {17954#false} #74#return; {17954#false} is VALID [2018-11-23 12:24:57,723 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:57,723 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:57,723 INFO L273 TraceCheckUtils]: 145: Hoare triple {17954#false} assume !false; {17954#false} is VALID [2018-11-23 12:24:57,744 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:57,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:57,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:24:57,763 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:24:57,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:57,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:24:57,872 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:57,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:24:57,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:24:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:24:57,874 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2018-11-23 12:24:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:58,709 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-11-23 12:24:58,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:24:58,709 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:24:58,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:58,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:24:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:24:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:24:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:24:58,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 106 transitions. [2018-11-23 12:24:58,852 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:58,854 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:24:58,854 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:24:58,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:24:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:24:58,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-23 12:24:58,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:58,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-23 12:24:58,904 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-23 12:24:58,904 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-23 12:24:58,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:58,906 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:24:58,906 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:24:58,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:58,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:58,907 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-23 12:24:58,907 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-23 12:24:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:58,909 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:24:58,909 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:24:58,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:58,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:58,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:58,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:24:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-23 12:24:58,912 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2018-11-23 12:24:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:58,912 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-23 12:24:58,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:24:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:24:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:24:58,913 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:58,913 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:58,914 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:58,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:58,914 INFO L82 PathProgramCache]: Analyzing trace with hash 835998787, now seen corresponding path program 27 times [2018-11-23 12:24:58,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:58,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:58,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:58,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:58,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:59,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {19024#true} call ULTIMATE.init(); {19024#true} is VALID [2018-11-23 12:24:59,841 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:59,842 INFO L273 TraceCheckUtils]: 2: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:24:59,842 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19024#true} {19024#true} #66#return; {19024#true} is VALID [2018-11-23 12:24:59,842 INFO L256 TraceCheckUtils]: 4: Hoare triple {19024#true} call #t~ret13 := main(); {19024#true} is VALID [2018-11-23 12:24:59,843 INFO L273 TraceCheckUtils]: 5: Hoare triple {19024#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:59,843 INFO L273 TraceCheckUtils]: 6: Hoare triple {19026#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:59,844 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:59,844 INFO L273 TraceCheckUtils]: 8: Hoare triple {19027#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:59,844 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:59,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {19028#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:59,845 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:59,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {19029#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:59,846 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:59,846 INFO L273 TraceCheckUtils]: 14: Hoare triple {19030#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:59,847 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:59,847 INFO L273 TraceCheckUtils]: 16: Hoare triple {19031#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:59,848 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:59,849 INFO L273 TraceCheckUtils]: 18: Hoare triple {19032#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:59,849 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:59,850 INFO L273 TraceCheckUtils]: 20: Hoare triple {19033#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:59,850 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:59,851 INFO L273 TraceCheckUtils]: 22: Hoare triple {19034#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:59,852 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:59,852 INFO L273 TraceCheckUtils]: 24: Hoare triple {19035#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:59,853 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:59,854 INFO L273 TraceCheckUtils]: 26: Hoare triple {19036#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:59,854 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:59,855 INFO L273 TraceCheckUtils]: 28: Hoare triple {19037#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:59,855 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:59,856 INFO L273 TraceCheckUtils]: 30: Hoare triple {19038#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:59,857 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:59,857 INFO L273 TraceCheckUtils]: 32: Hoare triple {19039#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:59,858 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:59,858 INFO L273 TraceCheckUtils]: 34: Hoare triple {19040#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:59,859 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:59,860 INFO L273 TraceCheckUtils]: 36: Hoare triple {19041#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:59,860 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:59,861 INFO L273 TraceCheckUtils]: 38: Hoare triple {19042#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:59,862 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:59,862 INFO L273 TraceCheckUtils]: 40: Hoare triple {19043#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:59,863 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:59,864 INFO L273 TraceCheckUtils]: 42: Hoare triple {19044#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:59,864 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:59,865 INFO L273 TraceCheckUtils]: 44: Hoare triple {19045#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:59,865 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:59,866 INFO L273 TraceCheckUtils]: 46: Hoare triple {19046#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:59,867 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:59,867 INFO L273 TraceCheckUtils]: 48: Hoare triple {19047#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:59,868 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:59,869 INFO L273 TraceCheckUtils]: 50: Hoare triple {19048#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:59,869 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:59,870 INFO L273 TraceCheckUtils]: 52: Hoare triple {19049#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:59,870 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:59,871 INFO L273 TraceCheckUtils]: 54: Hoare triple {19050#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:59,872 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:59,872 INFO L273 TraceCheckUtils]: 56: Hoare triple {19051#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:59,873 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:59,874 INFO L273 TraceCheckUtils]: 58: Hoare triple {19052#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:59,874 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:59,875 INFO L273 TraceCheckUtils]: 60: Hoare triple {19053#(<= main_~i~1 27)} assume !(~i~1 < 1000); {19025#false} is VALID [2018-11-23 12:24:59,875 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:59,875 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:59,876 INFO L273 TraceCheckUtils]: 63: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,876 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:59,876 INFO L273 TraceCheckUtils]: 65: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,876 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:59,876 INFO L273 TraceCheckUtils]: 67: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,876 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:59,877 INFO L273 TraceCheckUtils]: 69: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,877 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:59,877 INFO L273 TraceCheckUtils]: 71: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,877 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:59,877 INFO L273 TraceCheckUtils]: 73: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,878 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:59,878 INFO L273 TraceCheckUtils]: 75: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,878 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:59,878 INFO L273 TraceCheckUtils]: 77: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,878 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:59,878 INFO L273 TraceCheckUtils]: 79: Hoare triple {19024#true} assume !(~i~0 < 1000); {19024#true} is VALID [2018-11-23 12:24:59,879 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:59,879 INFO L273 TraceCheckUtils]: 81: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:24:59,879 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19024#true} {19025#false} #70#return; {19025#false} is VALID [2018-11-23 12:24:59,879 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:59,879 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:59,879 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:59,879 INFO L273 TraceCheckUtils]: 86: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,879 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:59,879 INFO L273 TraceCheckUtils]: 88: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,880 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:59,880 INFO L273 TraceCheckUtils]: 90: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,880 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:59,880 INFO L273 TraceCheckUtils]: 92: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,880 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:59,880 INFO L273 TraceCheckUtils]: 94: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,880 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:59,880 INFO L273 TraceCheckUtils]: 96: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,880 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:59,881 INFO L273 TraceCheckUtils]: 98: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,881 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:59,881 INFO L273 TraceCheckUtils]: 100: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,881 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:59,881 INFO L273 TraceCheckUtils]: 102: Hoare triple {19024#true} assume !(~i~0 < 1000); {19024#true} is VALID [2018-11-23 12:24:59,881 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:59,881 INFO L273 TraceCheckUtils]: 104: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:24:59,881 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19024#true} {19025#false} #72#return; {19025#false} is VALID [2018-11-23 12:24:59,881 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:59,881 INFO L273 TraceCheckUtils]: 107: Hoare triple {19025#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:59,882 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:59,882 INFO L273 TraceCheckUtils]: 109: Hoare triple {19025#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:59,882 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:59,882 INFO L273 TraceCheckUtils]: 111: Hoare triple {19025#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:59,882 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:59,882 INFO L273 TraceCheckUtils]: 113: Hoare triple {19025#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:59,882 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:59,882 INFO L273 TraceCheckUtils]: 115: Hoare triple {19025#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:59,882 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:59,882 INFO L273 TraceCheckUtils]: 117: Hoare triple {19025#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:59,883 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:59,883 INFO L273 TraceCheckUtils]: 119: Hoare triple {19025#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:59,883 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:59,883 INFO L273 TraceCheckUtils]: 121: Hoare triple {19025#false} assume !(~i~2 < 999); {19025#false} is VALID [2018-11-23 12:24:59,883 INFO L273 TraceCheckUtils]: 122: Hoare triple {19025#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:24:59,883 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:59,883 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:59,883 INFO L273 TraceCheckUtils]: 125: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,883 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:59,884 INFO L273 TraceCheckUtils]: 127: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,884 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:59,884 INFO L273 TraceCheckUtils]: 129: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,884 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:59,884 INFO L273 TraceCheckUtils]: 131: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,884 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:59,884 INFO L273 TraceCheckUtils]: 133: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,884 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:59,884 INFO L273 TraceCheckUtils]: 135: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,884 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:59,885 INFO L273 TraceCheckUtils]: 137: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,885 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:59,885 INFO L273 TraceCheckUtils]: 139: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:59,885 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:59,885 INFO L273 TraceCheckUtils]: 141: Hoare triple {19024#true} assume !(~i~0 < 1000); {19024#true} is VALID [2018-11-23 12:24:59,885 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:59,885 INFO L273 TraceCheckUtils]: 143: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:24:59,885 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19024#true} {19025#false} #74#return; {19025#false} is VALID [2018-11-23 12:24:59,885 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:59,886 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:59,886 INFO L273 TraceCheckUtils]: 147: Hoare triple {19025#false} assume !false; {19025#false} is VALID [2018-11-23 12:24:59,896 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:59,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:59,896 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:59,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:25:00,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:25:00,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:25:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:00,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:00,445 INFO L256 TraceCheckUtils]: 0: Hoare triple {19024#true} call ULTIMATE.init(); {19024#true} is VALID [2018-11-23 12:25:00,446 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:25:00,446 INFO L273 TraceCheckUtils]: 2: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:25:00,446 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19024#true} {19024#true} #66#return; {19024#true} is VALID [2018-11-23 12:25:00,446 INFO L256 TraceCheckUtils]: 4: Hoare triple {19024#true} call #t~ret13 := main(); {19024#true} is VALID [2018-11-23 12:25:00,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {19024#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19024#true} is VALID [2018-11-23 12:25:00,447 INFO L273 TraceCheckUtils]: 6: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,447 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:25:00,447 INFO L273 TraceCheckUtils]: 8: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,447 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:25:00,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,447 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:25:00,448 INFO L273 TraceCheckUtils]: 12: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,448 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:25:00,448 INFO L273 TraceCheckUtils]: 14: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,448 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:25:00,448 INFO L273 TraceCheckUtils]: 16: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,448 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:25:00,448 INFO L273 TraceCheckUtils]: 18: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,448 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:25:00,449 INFO L273 TraceCheckUtils]: 20: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,449 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:25:00,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,449 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:25:00,449 INFO L273 TraceCheckUtils]: 24: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,449 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:25:00,449 INFO L273 TraceCheckUtils]: 26: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,449 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:25:00,449 INFO L273 TraceCheckUtils]: 28: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,449 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:25:00,450 INFO L273 TraceCheckUtils]: 30: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,450 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:25:00,450 INFO L273 TraceCheckUtils]: 32: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,450 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:25:00,450 INFO L273 TraceCheckUtils]: 34: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,450 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:25:00,450 INFO L273 TraceCheckUtils]: 36: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,450 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:25:00,450 INFO L273 TraceCheckUtils]: 38: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,450 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:25:00,451 INFO L273 TraceCheckUtils]: 40: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,451 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:25:00,451 INFO L273 TraceCheckUtils]: 42: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,451 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:25:00,451 INFO L273 TraceCheckUtils]: 44: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,451 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:25:00,451 INFO L273 TraceCheckUtils]: 46: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,451 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:25:00,451 INFO L273 TraceCheckUtils]: 48: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,452 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:25:00,452 INFO L273 TraceCheckUtils]: 50: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,452 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:25:00,452 INFO L273 TraceCheckUtils]: 52: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,452 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:25:00,452 INFO L273 TraceCheckUtils]: 54: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,452 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:25:00,452 INFO L273 TraceCheckUtils]: 56: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,452 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:25:00,452 INFO L273 TraceCheckUtils]: 58: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:25:00,453 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:25:00,453 INFO L273 TraceCheckUtils]: 60: Hoare triple {19024#true} assume !(~i~1 < 1000); {19024#true} is VALID [2018-11-23 12:25:00,453 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:25:00,453 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:25:00,453 INFO L273 TraceCheckUtils]: 63: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,453 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:25:00,453 INFO L273 TraceCheckUtils]: 65: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,453 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:25:00,453 INFO L273 TraceCheckUtils]: 67: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,454 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:25:00,454 INFO L273 TraceCheckUtils]: 69: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,454 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:25:00,454 INFO L273 TraceCheckUtils]: 71: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,454 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:25:00,454 INFO L273 TraceCheckUtils]: 73: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,454 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:25:00,454 INFO L273 TraceCheckUtils]: 75: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,454 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:25:00,454 INFO L273 TraceCheckUtils]: 77: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,455 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:25:00,455 INFO L273 TraceCheckUtils]: 79: Hoare triple {19024#true} assume !(~i~0 < 1000); {19024#true} is VALID [2018-11-23 12:25:00,455 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:25:00,455 INFO L273 TraceCheckUtils]: 81: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:25:00,455 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19024#true} {19024#true} #70#return; {19024#true} is VALID [2018-11-23 12:25:00,455 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:25:00,455 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:25:00,455 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:25:00,455 INFO L273 TraceCheckUtils]: 86: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,456 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:25:00,456 INFO L273 TraceCheckUtils]: 88: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,456 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:25:00,456 INFO L273 TraceCheckUtils]: 90: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,456 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:25:00,456 INFO L273 TraceCheckUtils]: 92: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,456 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:25:00,456 INFO L273 TraceCheckUtils]: 94: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,456 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:25:00,457 INFO L273 TraceCheckUtils]: 96: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,457 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:25:00,457 INFO L273 TraceCheckUtils]: 98: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,457 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:25:00,457 INFO L273 TraceCheckUtils]: 100: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:25:00,457 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:25:00,457 INFO L273 TraceCheckUtils]: 102: Hoare triple {19024#true} assume !(~i~0 < 1000); {19024#true} is VALID [2018-11-23 12:25:00,457 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:25:00,457 INFO L273 TraceCheckUtils]: 104: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:25:00,457 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19024#true} {19024#true} #72#return; {19024#true} is VALID [2018-11-23 12:25:00,458 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:25:00,458 INFO L273 TraceCheckUtils]: 107: Hoare triple {19375#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:00,459 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:25:00,459 INFO L273 TraceCheckUtils]: 109: Hoare triple {19382#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:00,460 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:25:00,460 INFO L273 TraceCheckUtils]: 111: Hoare triple {19389#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:00,460 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:25:00,461 INFO L273 TraceCheckUtils]: 113: Hoare triple {19396#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:00,461 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:25:00,462 INFO L273 TraceCheckUtils]: 115: Hoare triple {19403#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:00,462 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:25:00,463 INFO L273 TraceCheckUtils]: 117: Hoare triple {19410#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:00,463 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:25:00,464 INFO L273 TraceCheckUtils]: 119: Hoare triple {19417#(<= main_~i~2 6)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:00,465 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:25:00,465 INFO L273 TraceCheckUtils]: 121: Hoare triple {19424#(<= main_~i~2 7)} assume !(~i~2 < 999); {19025#false} is VALID [2018-11-23 12:25:00,465 INFO L273 TraceCheckUtils]: 122: Hoare triple {19025#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:25:00,466 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:25:00,466 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:25:00,466 INFO L273 TraceCheckUtils]: 125: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:25:00,466 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:25:00,466 INFO L273 TraceCheckUtils]: 127: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:25:00,467 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:25:00,467 INFO L273 TraceCheckUtils]: 129: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:25:00,467 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:25:00,467 INFO L273 TraceCheckUtils]: 131: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:25:00,467 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:25:00,468 INFO L273 TraceCheckUtils]: 133: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:25:00,468 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:25:00,468 INFO L273 TraceCheckUtils]: 135: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:25:00,468 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:25:00,468 INFO L273 TraceCheckUtils]: 137: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:25:00,469 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:25:00,469 INFO L273 TraceCheckUtils]: 139: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:25:00,469 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:25:00,469 INFO L273 TraceCheckUtils]: 141: Hoare triple {19025#false} assume !(~i~0 < 1000); {19025#false} is VALID [2018-11-23 12:25:00,469 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:25:00,469 INFO L273 TraceCheckUtils]: 143: Hoare triple {19025#false} assume true; {19025#false} is VALID [2018-11-23 12:25:00,469 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19025#false} {19025#false} #74#return; {19025#false} is VALID [2018-11-23 12:25:00,470 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:25:00,470 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:25:00,470 INFO L273 TraceCheckUtils]: 147: Hoare triple {19025#false} assume !false; {19025#false} is VALID [2018-11-23 12:25:00,481 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:25:00,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:00,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2018-11-23 12:25:00,502 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:25:00,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:00,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:25:00,847 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:25:00,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:25:00,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:25:00,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:25:00,849 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2018-11-23 12:25:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:01,829 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-11-23 12:25:01,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:25:01,829 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:25:01,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:25:01,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:25:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:25:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:25:01,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 125 transitions. [2018-11-23 12:25:01,952 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:25:01,954 INFO L225 Difference]: With dead ends: 159 [2018-11-23 12:25:01,954 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 12:25:01,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:25:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 12:25:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-23 12:25:02,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:02,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 111 states. [2018-11-23 12:25:02,113 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 111 states. [2018-11-23 12:25:02,113 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 111 states. [2018-11-23 12:25:02,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:02,116 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:25:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:25:02,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:02,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:02,116 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 113 states. [2018-11-23 12:25:02,117 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 113 states. [2018-11-23 12:25:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:02,118 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:25:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:25:02,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:02,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:02,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:02,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 12:25:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-11-23 12:25:02,121 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2018-11-23 12:25:02,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:02,122 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-11-23 12:25:02,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:25:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-11-23 12:25:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-23 12:25:02,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:02,123 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:25:02,123 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:02,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:02,124 INFO L82 PathProgramCache]: Analyzing trace with hash 894020771, now seen corresponding path program 28 times [2018-11-23 12:25:02,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:02,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:02,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:02,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:25:02,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:02,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {20132#true} call ULTIMATE.init(); {20132#true} is VALID [2018-11-23 12:25:02,930 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:25:02,930 INFO L273 TraceCheckUtils]: 2: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:25:02,930 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20132#true} {20132#true} #66#return; {20132#true} is VALID [2018-11-23 12:25:02,930 INFO L256 TraceCheckUtils]: 4: Hoare triple {20132#true} call #t~ret13 := main(); {20132#true} is VALID [2018-11-23 12:25:02,931 INFO L273 TraceCheckUtils]: 5: Hoare triple {20132#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:25:02,931 INFO L273 TraceCheckUtils]: 6: Hoare triple {20134#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:25:02,932 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:25:02,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {20135#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:25:02,933 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:25:02,933 INFO L273 TraceCheckUtils]: 10: Hoare triple {20136#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:25:02,934 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:25:02,934 INFO L273 TraceCheckUtils]: 12: Hoare triple {20137#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:25:02,934 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:25:02,935 INFO L273 TraceCheckUtils]: 14: Hoare triple {20138#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:25:02,936 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:25:02,936 INFO L273 TraceCheckUtils]: 16: Hoare triple {20139#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:25:02,937 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:25:02,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {20140#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:25:02,938 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:25:02,939 INFO L273 TraceCheckUtils]: 20: Hoare triple {20141#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:25:02,939 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:25:02,940 INFO L273 TraceCheckUtils]: 22: Hoare triple {20142#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:25:02,941 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:25:02,941 INFO L273 TraceCheckUtils]: 24: Hoare triple {20143#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:25:02,942 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:25:02,942 INFO L273 TraceCheckUtils]: 26: Hoare triple {20144#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:25:02,943 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:25:02,944 INFO L273 TraceCheckUtils]: 28: Hoare triple {20145#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:25:02,944 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:25:02,945 INFO L273 TraceCheckUtils]: 30: Hoare triple {20146#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:25:02,946 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:25:02,946 INFO L273 TraceCheckUtils]: 32: Hoare triple {20147#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:25:02,947 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:25:02,947 INFO L273 TraceCheckUtils]: 34: Hoare triple {20148#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:25:02,948 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:25:02,949 INFO L273 TraceCheckUtils]: 36: Hoare triple {20149#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:25:02,949 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:25:02,950 INFO L273 TraceCheckUtils]: 38: Hoare triple {20150#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:25:02,951 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:25:02,951 INFO L273 TraceCheckUtils]: 40: Hoare triple {20151#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:25:02,952 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:25:02,952 INFO L273 TraceCheckUtils]: 42: Hoare triple {20152#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:25:02,953 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:25:02,954 INFO L273 TraceCheckUtils]: 44: Hoare triple {20153#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:25:02,954 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:25:02,955 INFO L273 TraceCheckUtils]: 46: Hoare triple {20154#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:25:02,956 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:25:02,956 INFO L273 TraceCheckUtils]: 48: Hoare triple {20155#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:25:02,957 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:25:02,957 INFO L273 TraceCheckUtils]: 50: Hoare triple {20156#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:25:02,958 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:25:02,959 INFO L273 TraceCheckUtils]: 52: Hoare triple {20157#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:25:02,959 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:25:02,960 INFO L273 TraceCheckUtils]: 54: Hoare triple {20158#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:25:02,960 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:25:02,961 INFO L273 TraceCheckUtils]: 56: Hoare triple {20159#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:25:02,962 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:25:02,962 INFO L273 TraceCheckUtils]: 58: Hoare triple {20160#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:25:02,963 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:25:02,964 INFO L273 TraceCheckUtils]: 60: Hoare triple {20161#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:25:02,964 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:25:02,965 INFO L273 TraceCheckUtils]: 62: Hoare triple {20162#(<= main_~i~1 28)} assume !(~i~1 < 1000); {20133#false} is VALID [2018-11-23 12:25:02,965 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:25:02,965 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:25:02,966 INFO L273 TraceCheckUtils]: 65: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,966 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:25:02,966 INFO L273 TraceCheckUtils]: 67: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,966 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:25:02,966 INFO L273 TraceCheckUtils]: 69: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,966 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:25:02,967 INFO L273 TraceCheckUtils]: 71: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,967 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:25:02,967 INFO L273 TraceCheckUtils]: 73: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,967 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:25:02,967 INFO L273 TraceCheckUtils]: 75: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,968 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:25:02,968 INFO L273 TraceCheckUtils]: 77: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,968 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:25:02,968 INFO L273 TraceCheckUtils]: 79: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,968 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:25:02,968 INFO L273 TraceCheckUtils]: 81: Hoare triple {20132#true} assume !(~i~0 < 1000); {20132#true} is VALID [2018-11-23 12:25:02,968 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:25:02,968 INFO L273 TraceCheckUtils]: 83: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:25:02,968 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20132#true} {20133#false} #70#return; {20133#false} is VALID [2018-11-23 12:25:02,968 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:25:02,969 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:25:02,969 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:25:02,969 INFO L273 TraceCheckUtils]: 88: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,969 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:25:02,969 INFO L273 TraceCheckUtils]: 90: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,969 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:25:02,969 INFO L273 TraceCheckUtils]: 92: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,969 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:25:02,969 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,969 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:25:02,970 INFO L273 TraceCheckUtils]: 96: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,970 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:25:02,970 INFO L273 TraceCheckUtils]: 98: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,970 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:25:02,970 INFO L273 TraceCheckUtils]: 100: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,970 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:25:02,970 INFO L273 TraceCheckUtils]: 102: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,970 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:25:02,970 INFO L273 TraceCheckUtils]: 104: Hoare triple {20132#true} assume !(~i~0 < 1000); {20132#true} is VALID [2018-11-23 12:25:02,971 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:25:02,971 INFO L273 TraceCheckUtils]: 106: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:25:02,971 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20132#true} {20133#false} #72#return; {20133#false} is VALID [2018-11-23 12:25:02,971 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:25:02,971 INFO L273 TraceCheckUtils]: 109: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:02,971 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:25:02,971 INFO L273 TraceCheckUtils]: 111: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:02,971 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:25:02,971 INFO L273 TraceCheckUtils]: 113: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:02,971 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:25:02,972 INFO L273 TraceCheckUtils]: 115: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:02,972 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:25:02,972 INFO L273 TraceCheckUtils]: 117: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:02,972 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:25:02,972 INFO L273 TraceCheckUtils]: 119: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:02,972 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:25:02,972 INFO L273 TraceCheckUtils]: 121: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:02,973 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:25:02,973 INFO L273 TraceCheckUtils]: 123: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:02,973 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:25:02,973 INFO L273 TraceCheckUtils]: 125: Hoare triple {20133#false} assume !(~i~2 < 999); {20133#false} is VALID [2018-11-23 12:25:02,973 INFO L273 TraceCheckUtils]: 126: Hoare triple {20133#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {20133#false} is VALID [2018-11-23 12:25:02,973 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:25:02,974 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:25:02,974 INFO L273 TraceCheckUtils]: 129: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,974 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:25:02,974 INFO L273 TraceCheckUtils]: 131: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,974 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:25:02,974 INFO L273 TraceCheckUtils]: 133: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,975 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:25:02,975 INFO L273 TraceCheckUtils]: 135: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,975 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:25:02,975 INFO L273 TraceCheckUtils]: 137: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,975 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:25:02,975 INFO L273 TraceCheckUtils]: 139: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,976 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:25:02,976 INFO L273 TraceCheckUtils]: 141: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,976 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:25:02,976 INFO L273 TraceCheckUtils]: 143: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:02,976 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:25:02,976 INFO L273 TraceCheckUtils]: 145: Hoare triple {20132#true} assume !(~i~0 < 1000); {20132#true} is VALID [2018-11-23 12:25:02,977 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:25:02,977 INFO L273 TraceCheckUtils]: 147: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:25:02,977 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20132#true} {20133#false} #74#return; {20133#false} is VALID [2018-11-23 12:25:02,977 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:25:02,977 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:25:02,977 INFO L273 TraceCheckUtils]: 151: Hoare triple {20133#false} assume !false; {20133#false} is VALID [2018-11-23 12:25:02,992 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:25:02,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:02,992 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:25:03,007 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:25:03,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:25:03,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:25:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:03,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:03,410 INFO L256 TraceCheckUtils]: 0: Hoare triple {20132#true} call ULTIMATE.init(); {20132#true} is VALID [2018-11-23 12:25:03,411 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:25:03,411 INFO L273 TraceCheckUtils]: 2: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:25:03,411 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20132#true} {20132#true} #66#return; {20132#true} is VALID [2018-11-23 12:25:03,411 INFO L256 TraceCheckUtils]: 4: Hoare triple {20132#true} call #t~ret13 := main(); {20132#true} is VALID [2018-11-23 12:25:03,412 INFO L273 TraceCheckUtils]: 5: Hoare triple {20132#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20132#true} is VALID [2018-11-23 12:25:03,412 INFO L273 TraceCheckUtils]: 6: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,412 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:25:03,412 INFO L273 TraceCheckUtils]: 8: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,412 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:25:03,413 INFO L273 TraceCheckUtils]: 10: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,413 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:25:03,413 INFO L273 TraceCheckUtils]: 12: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,413 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:25:03,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,413 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:25:03,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,414 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:25:03,414 INFO L273 TraceCheckUtils]: 18: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,414 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:25:03,414 INFO L273 TraceCheckUtils]: 20: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,414 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:25:03,414 INFO L273 TraceCheckUtils]: 22: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,414 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:25:03,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,414 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:25:03,415 INFO L273 TraceCheckUtils]: 26: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,415 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:25:03,415 INFO L273 TraceCheckUtils]: 28: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,415 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:25:03,415 INFO L273 TraceCheckUtils]: 30: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,415 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:25:03,415 INFO L273 TraceCheckUtils]: 32: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,415 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:25:03,415 INFO L273 TraceCheckUtils]: 34: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,415 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:25:03,416 INFO L273 TraceCheckUtils]: 36: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,416 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:25:03,416 INFO L273 TraceCheckUtils]: 38: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,416 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:25:03,416 INFO L273 TraceCheckUtils]: 40: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,416 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:25:03,416 INFO L273 TraceCheckUtils]: 42: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,416 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:25:03,416 INFO L273 TraceCheckUtils]: 44: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,417 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:25:03,417 INFO L273 TraceCheckUtils]: 46: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,417 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:25:03,417 INFO L273 TraceCheckUtils]: 48: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,417 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:25:03,417 INFO L273 TraceCheckUtils]: 50: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,417 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:25:03,417 INFO L273 TraceCheckUtils]: 52: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,417 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:25:03,417 INFO L273 TraceCheckUtils]: 54: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,418 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:25:03,418 INFO L273 TraceCheckUtils]: 56: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,418 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:25:03,418 INFO L273 TraceCheckUtils]: 58: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,418 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:25:03,418 INFO L273 TraceCheckUtils]: 60: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:25:03,418 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:25:03,418 INFO L273 TraceCheckUtils]: 62: Hoare triple {20132#true} assume !(~i~1 < 1000); {20132#true} is VALID [2018-11-23 12:25:03,418 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:25:03,418 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:25:03,419 INFO L273 TraceCheckUtils]: 65: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,419 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:25:03,419 INFO L273 TraceCheckUtils]: 67: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,419 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:25:03,419 INFO L273 TraceCheckUtils]: 69: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,419 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:25:03,419 INFO L273 TraceCheckUtils]: 71: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,419 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:25:03,419 INFO L273 TraceCheckUtils]: 73: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,420 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:25:03,420 INFO L273 TraceCheckUtils]: 75: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,420 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:25:03,420 INFO L273 TraceCheckUtils]: 77: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,420 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:25:03,420 INFO L273 TraceCheckUtils]: 79: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,420 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:25:03,420 INFO L273 TraceCheckUtils]: 81: Hoare triple {20132#true} assume !(~i~0 < 1000); {20132#true} is VALID [2018-11-23 12:25:03,420 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:25:03,420 INFO L273 TraceCheckUtils]: 83: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:25:03,421 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20132#true} {20132#true} #70#return; {20132#true} is VALID [2018-11-23 12:25:03,421 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:25:03,421 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:25:03,421 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:25:03,421 INFO L273 TraceCheckUtils]: 88: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,421 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:25:03,421 INFO L273 TraceCheckUtils]: 90: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,422 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:25:03,422 INFO L273 TraceCheckUtils]: 92: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,422 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:25:03,422 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,422 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:25:03,422 INFO L273 TraceCheckUtils]: 96: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,422 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:25:03,422 INFO L273 TraceCheckUtils]: 98: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,422 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:25:03,423 INFO L273 TraceCheckUtils]: 100: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,423 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:25:03,423 INFO L273 TraceCheckUtils]: 102: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:25:03,423 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:25:03,423 INFO L273 TraceCheckUtils]: 104: Hoare triple {20132#true} assume !(~i~0 < 1000); {20132#true} is VALID [2018-11-23 12:25:03,423 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:25:03,423 INFO L273 TraceCheckUtils]: 106: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:25:03,423 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20132#true} {20132#true} #72#return; {20132#true} is VALID [2018-11-23 12:25:03,423 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:25:03,424 INFO L273 TraceCheckUtils]: 109: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:03,424 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:25:03,424 INFO L273 TraceCheckUtils]: 111: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:03,424 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:25:03,424 INFO L273 TraceCheckUtils]: 113: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:03,424 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:25:03,424 INFO L273 TraceCheckUtils]: 115: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:03,424 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:25:03,424 INFO L273 TraceCheckUtils]: 117: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:03,424 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:25:03,425 INFO L273 TraceCheckUtils]: 119: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:03,425 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:25:03,425 INFO L273 TraceCheckUtils]: 121: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:03,425 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:25:03,425 INFO L273 TraceCheckUtils]: 123: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:03,425 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:25:03,425 INFO L273 TraceCheckUtils]: 125: Hoare triple {20132#true} assume !(~i~2 < 999); {20132#true} is VALID [2018-11-23 12:25:03,425 INFO L273 TraceCheckUtils]: 126: Hoare triple {20132#true} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {20132#true} is VALID [2018-11-23 12:25:03,425 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:25:03,426 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:25:03,426 INFO L273 TraceCheckUtils]: 129: Hoare triple {20550#(<= bAnd_~i~0 1)} assume !!(~i~0 < 1000);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:25:03,427 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:25:03,427 INFO L273 TraceCheckUtils]: 131: Hoare triple {20557#(<= bAnd_~i~0 2)} assume !!(~i~0 < 1000);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:25:03,427 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:25:03,428 INFO L273 TraceCheckUtils]: 133: Hoare triple {20564#(<= bAnd_~i~0 3)} assume !!(~i~0 < 1000);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:25:03,428 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:25:03,428 INFO L273 TraceCheckUtils]: 135: Hoare triple {20571#(<= bAnd_~i~0 4)} assume !!(~i~0 < 1000);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:25:03,429 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:25:03,429 INFO L273 TraceCheckUtils]: 137: Hoare triple {20578#(<= bAnd_~i~0 5)} assume !!(~i~0 < 1000);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:25:03,430 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:25:03,430 INFO L273 TraceCheckUtils]: 139: Hoare triple {20585#(<= bAnd_~i~0 6)} assume !!(~i~0 < 1000);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:25:03,431 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:25:03,431 INFO L273 TraceCheckUtils]: 141: Hoare triple {20592#(<= bAnd_~i~0 7)} assume !!(~i~0 < 1000);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:25:03,432 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:25:03,433 INFO L273 TraceCheckUtils]: 143: Hoare triple {20599#(<= bAnd_~i~0 8)} assume !!(~i~0 < 1000);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:25:03,433 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:25:03,434 INFO L273 TraceCheckUtils]: 145: Hoare triple {20606#(<= bAnd_~i~0 9)} assume !(~i~0 < 1000); {20133#false} is VALID [2018-11-23 12:25:03,434 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:25:03,434 INFO L273 TraceCheckUtils]: 147: Hoare triple {20133#false} assume true; {20133#false} is VALID [2018-11-23 12:25:03,434 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20133#false} {20132#true} #74#return; {20133#false} is VALID [2018-11-23 12:25:03,435 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:25:03,435 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:25:03,435 INFO L273 TraceCheckUtils]: 151: Hoare triple {20133#false} assume !false; {20133#false} is VALID [2018-11-23 12:25:03,446 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:25:03,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:03,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2018-11-23 12:25:03,466 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:25:03,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:03,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:25:03,610 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:25:03,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:25:03,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:25:03,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:25:03,612 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2018-11-23 12:25:04,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:04,221 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-11-23 12:25:04,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:25:04,221 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:25:04,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:25:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:25:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:25:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:25:04,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 132 transitions. [2018-11-23 12:25:04,350 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:25:04,352 INFO L225 Difference]: With dead ends: 165 [2018-11-23 12:25:04,352 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:25:04,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:25:04,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:25:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-23 12:25:04,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:04,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 115 states. [2018-11-23 12:25:04,580 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 115 states. [2018-11-23 12:25:04,580 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 115 states. [2018-11-23 12:25:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:04,582 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:25:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:25:04,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:04,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:04,583 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 117 states. [2018-11-23 12:25:04,583 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 117 states. [2018-11-23 12:25:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:04,585 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:25:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:25:04,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:04,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:04,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:04,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:04,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 12:25:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2018-11-23 12:25:04,588 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2018-11-23 12:25:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:04,589 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-11-23 12:25:04,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:25:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:25:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 12:25:04,590 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:04,590 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:25:04,590 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:04,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:04,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1573539069, now seen corresponding path program 29 times [2018-11-23 12:25:04,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:04,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:04,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:04,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:25:04,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:05,177 INFO L256 TraceCheckUtils]: 0: Hoare triple {21277#true} call ULTIMATE.init(); {21277#true} is VALID [2018-11-23 12:25:05,177 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:05,177 INFO L273 TraceCheckUtils]: 2: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:25:05,178 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21277#true} {21277#true} #66#return; {21277#true} is VALID [2018-11-23 12:25:05,178 INFO L256 TraceCheckUtils]: 4: Hoare triple {21277#true} call #t~ret13 := main(); {21277#true} is VALID [2018-11-23 12:25:05,178 INFO L273 TraceCheckUtils]: 5: Hoare triple {21277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:25:05,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {21279#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:25:05,179 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:25:05,180 INFO L273 TraceCheckUtils]: 8: Hoare triple {21280#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:25:05,181 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:25:05,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {21281#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:25:05,182 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:25:05,182 INFO L273 TraceCheckUtils]: 12: Hoare triple {21282#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:25:05,183 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:25:05,184 INFO L273 TraceCheckUtils]: 14: Hoare triple {21283#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:25:05,184 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:25:05,185 INFO L273 TraceCheckUtils]: 16: Hoare triple {21284#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:25:05,185 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:25:05,186 INFO L273 TraceCheckUtils]: 18: Hoare triple {21285#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:25:05,187 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:25:05,187 INFO L273 TraceCheckUtils]: 20: Hoare triple {21286#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:25:05,188 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:25:05,188 INFO L273 TraceCheckUtils]: 22: Hoare triple {21287#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:25:05,189 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:25:05,189 INFO L273 TraceCheckUtils]: 24: Hoare triple {21288#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:25:05,190 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:25:05,191 INFO L273 TraceCheckUtils]: 26: Hoare triple {21289#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:25:05,191 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:25:05,192 INFO L273 TraceCheckUtils]: 28: Hoare triple {21290#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:25:05,193 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:25:05,193 INFO L273 TraceCheckUtils]: 30: Hoare triple {21291#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:25:05,194 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:25:05,194 INFO L273 TraceCheckUtils]: 32: Hoare triple {21292#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:25:05,195 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:25:05,196 INFO L273 TraceCheckUtils]: 34: Hoare triple {21293#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:25:05,196 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:25:05,197 INFO L273 TraceCheckUtils]: 36: Hoare triple {21294#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:25:05,198 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:25:05,198 INFO L273 TraceCheckUtils]: 38: Hoare triple {21295#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:25:05,199 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:25:05,199 INFO L273 TraceCheckUtils]: 40: Hoare triple {21296#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:25:05,200 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:25:05,201 INFO L273 TraceCheckUtils]: 42: Hoare triple {21297#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:25:05,201 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:25:05,202 INFO L273 TraceCheckUtils]: 44: Hoare triple {21298#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:25:05,203 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:25:05,203 INFO L273 TraceCheckUtils]: 46: Hoare triple {21299#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:25:05,204 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:25:05,204 INFO L273 TraceCheckUtils]: 48: Hoare triple {21300#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:25:05,205 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:25:05,206 INFO L273 TraceCheckUtils]: 50: Hoare triple {21301#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:25:05,206 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:25:05,207 INFO L273 TraceCheckUtils]: 52: Hoare triple {21302#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:25:05,208 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:25:05,208 INFO L273 TraceCheckUtils]: 54: Hoare triple {21303#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:25:05,209 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:25:05,209 INFO L273 TraceCheckUtils]: 56: Hoare triple {21304#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:25:05,210 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:25:05,211 INFO L273 TraceCheckUtils]: 58: Hoare triple {21305#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:25:05,211 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:25:05,212 INFO L273 TraceCheckUtils]: 60: Hoare triple {21306#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:25:05,213 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:25:05,213 INFO L273 TraceCheckUtils]: 62: Hoare triple {21307#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:25:05,214 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:25:05,215 INFO L273 TraceCheckUtils]: 64: Hoare triple {21308#(<= main_~i~1 29)} assume !(~i~1 < 1000); {21278#false} is VALID [2018-11-23 12:25:05,215 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:25:05,215 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:25:05,215 INFO L273 TraceCheckUtils]: 67: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,215 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:25:05,216 INFO L273 TraceCheckUtils]: 69: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,216 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:25:05,216 INFO L273 TraceCheckUtils]: 71: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,216 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:25:05,216 INFO L273 TraceCheckUtils]: 73: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,216 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:25:05,217 INFO L273 TraceCheckUtils]: 75: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,217 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:25:05,217 INFO L273 TraceCheckUtils]: 77: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,217 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:25:05,217 INFO L273 TraceCheckUtils]: 79: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,217 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:25:05,218 INFO L273 TraceCheckUtils]: 81: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,218 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:25:05,218 INFO L273 TraceCheckUtils]: 83: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,218 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:25:05,218 INFO L273 TraceCheckUtils]: 85: Hoare triple {21277#true} assume !(~i~0 < 1000); {21277#true} is VALID [2018-11-23 12:25:05,219 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:25:05,219 INFO L273 TraceCheckUtils]: 87: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:25:05,219 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21277#true} {21278#false} #70#return; {21278#false} is VALID [2018-11-23 12:25:05,219 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:05,219 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:25:05,220 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:25:05,220 INFO L273 TraceCheckUtils]: 92: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,220 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:25:05,220 INFO L273 TraceCheckUtils]: 94: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,220 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:25:05,220 INFO L273 TraceCheckUtils]: 96: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,220 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:25:05,220 INFO L273 TraceCheckUtils]: 98: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,220 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:25:05,221 INFO L273 TraceCheckUtils]: 100: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,221 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:25:05,221 INFO L273 TraceCheckUtils]: 102: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,221 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:25:05,221 INFO L273 TraceCheckUtils]: 104: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,221 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:25:05,221 INFO L273 TraceCheckUtils]: 106: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,221 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:25:05,221 INFO L273 TraceCheckUtils]: 108: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,221 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:25:05,222 INFO L273 TraceCheckUtils]: 110: Hoare triple {21277#true} assume !(~i~0 < 1000); {21277#true} is VALID [2018-11-23 12:25:05,222 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:25:05,222 INFO L273 TraceCheckUtils]: 112: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:25:05,222 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21277#true} {21278#false} #72#return; {21278#false} is VALID [2018-11-23 12:25:05,222 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:05,222 INFO L273 TraceCheckUtils]: 115: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,222 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:05,222 INFO L273 TraceCheckUtils]: 117: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,222 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:05,223 INFO L273 TraceCheckUtils]: 119: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,223 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:05,223 INFO L273 TraceCheckUtils]: 121: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,223 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:05,223 INFO L273 TraceCheckUtils]: 123: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,223 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:05,223 INFO L273 TraceCheckUtils]: 125: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,223 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:05,223 INFO L273 TraceCheckUtils]: 127: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,223 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:05,224 INFO L273 TraceCheckUtils]: 129: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,224 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:05,224 INFO L273 TraceCheckUtils]: 131: Hoare triple {21278#false} assume !(~i~2 < 999); {21278#false} is VALID [2018-11-23 12:25:05,224 INFO L273 TraceCheckUtils]: 132: Hoare triple {21278#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:25:05,224 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:25:05,224 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:25:05,224 INFO L273 TraceCheckUtils]: 135: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,224 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:25:05,224 INFO L273 TraceCheckUtils]: 137: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,225 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:25:05,225 INFO L273 TraceCheckUtils]: 139: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,225 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:25:05,225 INFO L273 TraceCheckUtils]: 141: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,225 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:25:05,225 INFO L273 TraceCheckUtils]: 143: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,225 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:25:05,225 INFO L273 TraceCheckUtils]: 145: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,225 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:25:05,225 INFO L273 TraceCheckUtils]: 147: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,226 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:25:05,226 INFO L273 TraceCheckUtils]: 149: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,226 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:25:05,226 INFO L273 TraceCheckUtils]: 151: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:25:05,226 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:25:05,226 INFO L273 TraceCheckUtils]: 153: Hoare triple {21277#true} assume !(~i~0 < 1000); {21277#true} is VALID [2018-11-23 12:25:05,226 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:25:05,226 INFO L273 TraceCheckUtils]: 155: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:25:05,226 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21277#true} {21278#false} #74#return; {21278#false} is VALID [2018-11-23 12:25:05,226 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:05,227 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:05,227 INFO L273 TraceCheckUtils]: 159: Hoare triple {21278#false} assume !false; {21278#false} is VALID [2018-11-23 12:25:05,262 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:25:05,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:05,262 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:25:05,273 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:25:26,970 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-11-23 12:25:26,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:25:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:27,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:27,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {21277#true} call ULTIMATE.init(); {21277#true} is VALID [2018-11-23 12:25:27,336 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:27,336 INFO L273 TraceCheckUtils]: 2: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:25:27,336 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21277#true} {21277#true} #66#return; {21277#true} is VALID [2018-11-23 12:25:27,337 INFO L256 TraceCheckUtils]: 4: Hoare triple {21277#true} call #t~ret13 := main(); {21277#true} is VALID [2018-11-23 12:25:27,337 INFO L273 TraceCheckUtils]: 5: Hoare triple {21277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21277#true} is VALID [2018-11-23 12:25:27,337 INFO L273 TraceCheckUtils]: 6: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,337 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:27,337 INFO L273 TraceCheckUtils]: 8: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,338 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:27,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,338 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:27,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,338 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:27,338 INFO L273 TraceCheckUtils]: 14: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,338 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:27,338 INFO L273 TraceCheckUtils]: 16: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,338 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:27,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,339 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:27,339 INFO L273 TraceCheckUtils]: 20: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,339 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:27,339 INFO L273 TraceCheckUtils]: 22: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,339 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:27,339 INFO L273 TraceCheckUtils]: 24: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,339 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:27,339 INFO L273 TraceCheckUtils]: 26: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,339 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:27,340 INFO L273 TraceCheckUtils]: 28: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,340 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:27,340 INFO L273 TraceCheckUtils]: 30: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,340 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:27,340 INFO L273 TraceCheckUtils]: 32: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,340 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:27,340 INFO L273 TraceCheckUtils]: 34: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,340 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:27,340 INFO L273 TraceCheckUtils]: 36: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,341 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:27,341 INFO L273 TraceCheckUtils]: 38: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,341 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:27,341 INFO L273 TraceCheckUtils]: 40: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,341 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:27,341 INFO L273 TraceCheckUtils]: 42: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,341 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:27,341 INFO L273 TraceCheckUtils]: 44: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,341 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:27,341 INFO L273 TraceCheckUtils]: 46: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,342 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:27,342 INFO L273 TraceCheckUtils]: 48: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,342 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:27,342 INFO L273 TraceCheckUtils]: 50: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,342 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:27,342 INFO L273 TraceCheckUtils]: 52: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,342 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:27,342 INFO L273 TraceCheckUtils]: 54: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,342 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:27,343 INFO L273 TraceCheckUtils]: 56: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,343 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:27,343 INFO L273 TraceCheckUtils]: 58: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,343 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:27,343 INFO L273 TraceCheckUtils]: 60: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,343 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:27,343 INFO L273 TraceCheckUtils]: 62: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:27,343 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:27,343 INFO L273 TraceCheckUtils]: 64: Hoare triple {21277#true} assume !(~i~1 < 1000); {21277#true} is VALID [2018-11-23 12:25:27,343 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:27,344 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:27,344 INFO L273 TraceCheckUtils]: 67: Hoare triple {21510#(<= bAnd_~i~0 1)} assume !!(~i~0 < 1000);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:27,345 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:27,346 INFO L273 TraceCheckUtils]: 69: Hoare triple {21517#(<= bAnd_~i~0 2)} assume !!(~i~0 < 1000);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:27,346 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:27,346 INFO L273 TraceCheckUtils]: 71: Hoare triple {21524#(<= bAnd_~i~0 3)} assume !!(~i~0 < 1000);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:27,347 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:27,347 INFO L273 TraceCheckUtils]: 73: Hoare triple {21531#(<= bAnd_~i~0 4)} assume !!(~i~0 < 1000);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:27,348 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:27,348 INFO L273 TraceCheckUtils]: 75: Hoare triple {21538#(<= bAnd_~i~0 5)} assume !!(~i~0 < 1000);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:27,349 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:27,349 INFO L273 TraceCheckUtils]: 77: Hoare triple {21545#(<= bAnd_~i~0 6)} assume !!(~i~0 < 1000);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:27,350 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:27,350 INFO L273 TraceCheckUtils]: 79: Hoare triple {21552#(<= bAnd_~i~0 7)} assume !!(~i~0 < 1000);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:27,351 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:27,352 INFO L273 TraceCheckUtils]: 81: Hoare triple {21559#(<= bAnd_~i~0 8)} assume !!(~i~0 < 1000);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:27,353 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:27,354 INFO L273 TraceCheckUtils]: 83: Hoare triple {21566#(<= bAnd_~i~0 9)} assume !!(~i~0 < 1000);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:27,355 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:27,355 INFO L273 TraceCheckUtils]: 85: Hoare triple {21573#(<= bAnd_~i~0 10)} assume !(~i~0 < 1000); {21278#false} is VALID [2018-11-23 12:25:27,356 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:27,356 INFO L273 TraceCheckUtils]: 87: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:25:27,356 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21278#false} {21277#true} #70#return; {21278#false} is VALID [2018-11-23 12:25:27,356 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:27,357 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:27,357 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:27,357 INFO L273 TraceCheckUtils]: 92: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,357 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:27,357 INFO L273 TraceCheckUtils]: 94: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,357 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:27,358 INFO L273 TraceCheckUtils]: 96: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,358 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:27,358 INFO L273 TraceCheckUtils]: 98: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,358 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:27,358 INFO L273 TraceCheckUtils]: 100: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,358 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:27,358 INFO L273 TraceCheckUtils]: 102: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,358 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:27,359 INFO L273 TraceCheckUtils]: 104: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,359 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:27,359 INFO L273 TraceCheckUtils]: 106: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,359 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:27,359 INFO L273 TraceCheckUtils]: 108: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,359 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:27,359 INFO L273 TraceCheckUtils]: 110: Hoare triple {21278#false} assume !(~i~0 < 1000); {21278#false} is VALID [2018-11-23 12:25:27,359 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:27,359 INFO L273 TraceCheckUtils]: 112: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:25:27,359 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21278#false} {21278#false} #72#return; {21278#false} is VALID [2018-11-23 12:25:27,360 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:27,360 INFO L273 TraceCheckUtils]: 115: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:27,360 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:27,360 INFO L273 TraceCheckUtils]: 117: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:27,360 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:27,360 INFO L273 TraceCheckUtils]: 119: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:27,360 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:27,360 INFO L273 TraceCheckUtils]: 121: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:27,360 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:27,360 INFO L273 TraceCheckUtils]: 123: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:27,361 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:27,361 INFO L273 TraceCheckUtils]: 125: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:27,361 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:27,361 INFO L273 TraceCheckUtils]: 127: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:27,361 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:27,361 INFO L273 TraceCheckUtils]: 129: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:27,361 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:27,361 INFO L273 TraceCheckUtils]: 131: Hoare triple {21278#false} assume !(~i~2 < 999); {21278#false} is VALID [2018-11-23 12:25:27,361 INFO L273 TraceCheckUtils]: 132: Hoare triple {21278#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:25:27,362 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:27,362 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:27,362 INFO L273 TraceCheckUtils]: 135: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,362 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:27,362 INFO L273 TraceCheckUtils]: 137: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,362 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:27,362 INFO L273 TraceCheckUtils]: 139: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,362 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:27,362 INFO L273 TraceCheckUtils]: 141: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,362 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:27,363 INFO L273 TraceCheckUtils]: 143: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,363 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:27,363 INFO L273 TraceCheckUtils]: 145: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,363 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:27,363 INFO L273 TraceCheckUtils]: 147: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,363 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:27,363 INFO L273 TraceCheckUtils]: 149: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,363 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:27,363 INFO L273 TraceCheckUtils]: 151: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:27,363 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:27,364 INFO L273 TraceCheckUtils]: 153: Hoare triple {21278#false} assume !(~i~0 < 1000); {21278#false} is VALID [2018-11-23 12:25:27,364 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:27,364 INFO L273 TraceCheckUtils]: 155: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:25:27,364 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21278#false} {21278#false} #74#return; {21278#false} is VALID [2018-11-23 12:25:27,364 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:27,364 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:27,364 INFO L273 TraceCheckUtils]: 159: Hoare triple {21278#false} assume !false; {21278#false} is VALID [2018-11-23 12:25:27,374 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:27,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:27,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2018-11-23 12:25:27,398 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:25:27,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:27,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:25:27,513 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:27,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:25:27,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:25:27,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:25:27,515 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2018-11-23 12:25:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:28,437 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2018-11-23 12:25:28,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:25:28,437 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:25:28,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:25:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:25:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:25:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:25:28,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 136 transitions. [2018-11-23 12:25:28,571 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:28,573 INFO L225 Difference]: With dead ends: 171 [2018-11-23 12:25:28,574 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 12:25:28,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:25:28,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 12:25:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-23 12:25:28,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:28,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 119 states. [2018-11-23 12:25:28,622 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 119 states. [2018-11-23 12:25:28,622 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 119 states. [2018-11-23 12:25:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:28,625 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:25:28,625 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:25:28,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:28,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:28,626 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 121 states. [2018-11-23 12:25:28,626 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 121 states. [2018-11-23 12:25:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:28,628 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:25:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:25:28,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:28,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:28,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:28,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:28,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 12:25:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-23 12:25:28,631 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2018-11-23 12:25:28,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:28,631 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-23 12:25:28,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:25:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-23 12:25:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-23 12:25:28,632 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:28,632 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:28,632 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:28,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash -451694749, now seen corresponding path program 30 times [2018-11-23 12:25:28,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:28,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:28,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:28,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:25:28,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:29,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {22471#true} call ULTIMATE.init(); {22471#true} is VALID [2018-11-23 12:25:29,264 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:29,264 INFO L273 TraceCheckUtils]: 2: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:25:29,265 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22471#true} {22471#true} #66#return; {22471#true} is VALID [2018-11-23 12:25:29,265 INFO L256 TraceCheckUtils]: 4: Hoare triple {22471#true} call #t~ret13 := main(); {22471#true} is VALID [2018-11-23 12:25:29,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {22471#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:29,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {22473#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:29,266 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:29,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {22474#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:29,268 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:29,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {22475#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:29,269 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:29,269 INFO L273 TraceCheckUtils]: 12: Hoare triple {22476#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:29,270 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:29,271 INFO L273 TraceCheckUtils]: 14: Hoare triple {22477#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:29,271 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:29,272 INFO L273 TraceCheckUtils]: 16: Hoare triple {22478#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:29,272 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:29,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {22479#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:29,274 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:29,274 INFO L273 TraceCheckUtils]: 20: Hoare triple {22480#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:29,275 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:29,275 INFO L273 TraceCheckUtils]: 22: Hoare triple {22481#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:29,276 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:29,277 INFO L273 TraceCheckUtils]: 24: Hoare triple {22482#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:29,277 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:29,278 INFO L273 TraceCheckUtils]: 26: Hoare triple {22483#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:29,278 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:29,279 INFO L273 TraceCheckUtils]: 28: Hoare triple {22484#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:29,280 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:29,280 INFO L273 TraceCheckUtils]: 30: Hoare triple {22485#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:29,281 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:29,281 INFO L273 TraceCheckUtils]: 32: Hoare triple {22486#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:29,282 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:29,282 INFO L273 TraceCheckUtils]: 34: Hoare triple {22487#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:29,283 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:29,284 INFO L273 TraceCheckUtils]: 36: Hoare triple {22488#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:29,284 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:29,285 INFO L273 TraceCheckUtils]: 38: Hoare triple {22489#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:29,286 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:29,286 INFO L273 TraceCheckUtils]: 40: Hoare triple {22490#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:29,287 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:29,287 INFO L273 TraceCheckUtils]: 42: Hoare triple {22491#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:29,288 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:29,289 INFO L273 TraceCheckUtils]: 44: Hoare triple {22492#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:29,289 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:29,290 INFO L273 TraceCheckUtils]: 46: Hoare triple {22493#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:29,290 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:29,291 INFO L273 TraceCheckUtils]: 48: Hoare triple {22494#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:29,292 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:29,292 INFO L273 TraceCheckUtils]: 50: Hoare triple {22495#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:29,293 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:29,293 INFO L273 TraceCheckUtils]: 52: Hoare triple {22496#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:29,294 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:29,295 INFO L273 TraceCheckUtils]: 54: Hoare triple {22497#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:29,295 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:29,296 INFO L273 TraceCheckUtils]: 56: Hoare triple {22498#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:29,296 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:29,297 INFO L273 TraceCheckUtils]: 58: Hoare triple {22499#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:29,298 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:29,298 INFO L273 TraceCheckUtils]: 60: Hoare triple {22500#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:29,299 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:29,300 INFO L273 TraceCheckUtils]: 62: Hoare triple {22501#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:29,300 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:29,301 INFO L273 TraceCheckUtils]: 64: Hoare triple {22502#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:29,301 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:29,302 INFO L273 TraceCheckUtils]: 66: Hoare triple {22503#(<= main_~i~1 30)} assume !(~i~1 < 1000); {22472#false} is VALID [2018-11-23 12:25:29,302 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:29,303 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:29,303 INFO L273 TraceCheckUtils]: 69: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,303 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:29,303 INFO L273 TraceCheckUtils]: 71: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,303 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:29,303 INFO L273 TraceCheckUtils]: 73: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,304 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:29,304 INFO L273 TraceCheckUtils]: 75: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,304 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:29,304 INFO L273 TraceCheckUtils]: 77: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,304 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:29,304 INFO L273 TraceCheckUtils]: 79: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,305 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:29,305 INFO L273 TraceCheckUtils]: 81: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,305 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:29,305 INFO L273 TraceCheckUtils]: 83: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,305 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:29,305 INFO L273 TraceCheckUtils]: 85: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,306 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:29,306 INFO L273 TraceCheckUtils]: 87: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,306 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:29,306 INFO L273 TraceCheckUtils]: 89: Hoare triple {22471#true} assume !(~i~0 < 1000); {22471#true} is VALID [2018-11-23 12:25:29,306 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:29,306 INFO L273 TraceCheckUtils]: 91: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:25:29,306 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22471#true} {22472#false} #70#return; {22472#false} is VALID [2018-11-23 12:25:29,306 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:29,306 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:29,306 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:29,307 INFO L273 TraceCheckUtils]: 96: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,307 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:29,307 INFO L273 TraceCheckUtils]: 98: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,307 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:29,307 INFO L273 TraceCheckUtils]: 100: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,307 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:29,307 INFO L273 TraceCheckUtils]: 102: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,307 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:29,307 INFO L273 TraceCheckUtils]: 104: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,307 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:29,308 INFO L273 TraceCheckUtils]: 106: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,308 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:29,308 INFO L273 TraceCheckUtils]: 108: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,308 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:29,308 INFO L273 TraceCheckUtils]: 110: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,308 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:29,308 INFO L273 TraceCheckUtils]: 112: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,308 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:29,308 INFO L273 TraceCheckUtils]: 114: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,309 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:29,309 INFO L273 TraceCheckUtils]: 116: Hoare triple {22471#true} assume !(~i~0 < 1000); {22471#true} is VALID [2018-11-23 12:25:29,309 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:29,309 INFO L273 TraceCheckUtils]: 118: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:25:29,309 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22471#true} {22472#false} #72#return; {22472#false} is VALID [2018-11-23 12:25:29,309 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:29,309 INFO L273 TraceCheckUtils]: 121: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29,309 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:29,309 INFO L273 TraceCheckUtils]: 123: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29,309 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:29,310 INFO L273 TraceCheckUtils]: 125: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29,310 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:29,310 INFO L273 TraceCheckUtils]: 127: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29,310 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:29,310 INFO L273 TraceCheckUtils]: 129: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29,310 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:29,310 INFO L273 TraceCheckUtils]: 131: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29,310 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:29,310 INFO L273 TraceCheckUtils]: 133: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29,310 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:29,311 INFO L273 TraceCheckUtils]: 135: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29,311 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:29,311 INFO L273 TraceCheckUtils]: 137: Hoare triple {22472#false} assume !(~i~2 < 999); {22472#false} is VALID [2018-11-23 12:25:29,311 INFO L273 TraceCheckUtils]: 138: Hoare triple {22472#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:25:29,311 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:29,311 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:29,311 INFO L273 TraceCheckUtils]: 141: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,311 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:29,311 INFO L273 TraceCheckUtils]: 143: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,312 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:29,312 INFO L273 TraceCheckUtils]: 145: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,312 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:29,312 INFO L273 TraceCheckUtils]: 147: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,312 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:29,312 INFO L273 TraceCheckUtils]: 149: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,312 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:29,312 INFO L273 TraceCheckUtils]: 151: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,312 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:29,312 INFO L273 TraceCheckUtils]: 153: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,313 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:29,313 INFO L273 TraceCheckUtils]: 155: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,313 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:29,313 INFO L273 TraceCheckUtils]: 157: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,313 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:29,313 INFO L273 TraceCheckUtils]: 159: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:29,313 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:29,313 INFO L273 TraceCheckUtils]: 161: Hoare triple {22471#true} assume !(~i~0 < 1000); {22471#true} is VALID [2018-11-23 12:25:29,313 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:29,313 INFO L273 TraceCheckUtils]: 163: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:25:29,314 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22471#true} {22472#false} #74#return; {22472#false} is VALID [2018-11-23 12:25:29,314 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:29,314 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:29,314 INFO L273 TraceCheckUtils]: 167: Hoare triple {22472#false} assume !false; {22472#false} is VALID [2018-11-23 12:25:29,327 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:29,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:29,327 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:29,337 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:25:30,377 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:25:30,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:25:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:30,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:30,975 INFO L256 TraceCheckUtils]: 0: Hoare triple {22471#true} call ULTIMATE.init(); {22471#true} is VALID [2018-11-23 12:25:30,976 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:30,976 INFO L273 TraceCheckUtils]: 2: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:25:30,976 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22471#true} {22471#true} #66#return; {22471#true} is VALID [2018-11-23 12:25:30,977 INFO L256 TraceCheckUtils]: 4: Hoare triple {22471#true} call #t~ret13 := main(); {22471#true} is VALID [2018-11-23 12:25:30,977 INFO L273 TraceCheckUtils]: 5: Hoare triple {22471#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22471#true} is VALID [2018-11-23 12:25:30,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,977 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:30,978 INFO L273 TraceCheckUtils]: 8: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,978 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:30,978 INFO L273 TraceCheckUtils]: 10: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,978 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:30,978 INFO L273 TraceCheckUtils]: 12: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,978 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:30,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,978 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:30,979 INFO L273 TraceCheckUtils]: 16: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,979 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:30,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,979 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:30,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,979 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:30,979 INFO L273 TraceCheckUtils]: 22: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,979 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:30,979 INFO L273 TraceCheckUtils]: 24: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,979 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:30,980 INFO L273 TraceCheckUtils]: 26: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,980 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:30,980 INFO L273 TraceCheckUtils]: 28: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,980 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:30,980 INFO L273 TraceCheckUtils]: 30: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,980 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:30,980 INFO L273 TraceCheckUtils]: 32: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,980 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:30,980 INFO L273 TraceCheckUtils]: 34: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,980 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:30,981 INFO L273 TraceCheckUtils]: 36: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,981 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:30,981 INFO L273 TraceCheckUtils]: 38: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,981 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:30,981 INFO L273 TraceCheckUtils]: 40: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,981 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:30,981 INFO L273 TraceCheckUtils]: 42: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,981 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:30,981 INFO L273 TraceCheckUtils]: 44: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,982 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:30,982 INFO L273 TraceCheckUtils]: 46: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,982 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:30,982 INFO L273 TraceCheckUtils]: 48: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,982 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:30,982 INFO L273 TraceCheckUtils]: 50: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,982 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:30,982 INFO L273 TraceCheckUtils]: 52: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,982 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:30,982 INFO L273 TraceCheckUtils]: 54: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,983 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:30,983 INFO L273 TraceCheckUtils]: 56: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,983 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:30,983 INFO L273 TraceCheckUtils]: 58: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,983 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:30,983 INFO L273 TraceCheckUtils]: 60: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,983 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:30,983 INFO L273 TraceCheckUtils]: 62: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,983 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:30,983 INFO L273 TraceCheckUtils]: 64: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:30,984 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:30,984 INFO L273 TraceCheckUtils]: 66: Hoare triple {22471#true} assume !(~i~1 < 1000); {22471#true} is VALID [2018-11-23 12:25:30,984 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:30,984 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:30,984 INFO L273 TraceCheckUtils]: 69: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,984 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:30,984 INFO L273 TraceCheckUtils]: 71: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,984 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:30,984 INFO L273 TraceCheckUtils]: 73: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,985 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:30,985 INFO L273 TraceCheckUtils]: 75: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,985 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:30,985 INFO L273 TraceCheckUtils]: 77: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,985 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:30,985 INFO L273 TraceCheckUtils]: 79: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,985 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:30,985 INFO L273 TraceCheckUtils]: 81: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,985 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:30,985 INFO L273 TraceCheckUtils]: 83: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,986 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:30,986 INFO L273 TraceCheckUtils]: 85: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,986 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:30,986 INFO L273 TraceCheckUtils]: 87: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,986 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:30,986 INFO L273 TraceCheckUtils]: 89: Hoare triple {22471#true} assume !(~i~0 < 1000); {22471#true} is VALID [2018-11-23 12:25:30,986 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:30,986 INFO L273 TraceCheckUtils]: 91: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:25:30,986 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22471#true} {22471#true} #70#return; {22471#true} is VALID [2018-11-23 12:25:30,986 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:30,987 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:30,987 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:30,987 INFO L273 TraceCheckUtils]: 96: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,987 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:30,987 INFO L273 TraceCheckUtils]: 98: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,987 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:30,987 INFO L273 TraceCheckUtils]: 100: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,987 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:30,987 INFO L273 TraceCheckUtils]: 102: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,988 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:30,988 INFO L273 TraceCheckUtils]: 104: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,988 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:30,988 INFO L273 TraceCheckUtils]: 106: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,988 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:30,988 INFO L273 TraceCheckUtils]: 108: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,988 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:30,988 INFO L273 TraceCheckUtils]: 110: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,988 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:30,988 INFO L273 TraceCheckUtils]: 112: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,989 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:30,989 INFO L273 TraceCheckUtils]: 114: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:30,989 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:30,989 INFO L273 TraceCheckUtils]: 116: Hoare triple {22471#true} assume !(~i~0 < 1000); {22471#true} is VALID [2018-11-23 12:25:30,989 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:30,989 INFO L273 TraceCheckUtils]: 118: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:25:30,989 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22471#true} {22471#true} #72#return; {22471#true} is VALID [2018-11-23 12:25:30,990 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:30,990 INFO L273 TraceCheckUtils]: 121: Hoare triple {22867#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30,991 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:30,991 INFO L273 TraceCheckUtils]: 123: Hoare triple {22874#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30,991 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:30,992 INFO L273 TraceCheckUtils]: 125: Hoare triple {22881#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30,992 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:30,992 INFO L273 TraceCheckUtils]: 127: Hoare triple {22888#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30,993 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:30,993 INFO L273 TraceCheckUtils]: 129: Hoare triple {22895#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30,994 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:30,995 INFO L273 TraceCheckUtils]: 131: Hoare triple {22902#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30,995 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:30,996 INFO L273 TraceCheckUtils]: 133: Hoare triple {22909#(<= main_~i~2 6)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30,997 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:30,997 INFO L273 TraceCheckUtils]: 135: Hoare triple {22916#(<= main_~i~2 7)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30,998 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:30,999 INFO L273 TraceCheckUtils]: 137: Hoare triple {22923#(<= main_~i~2 8)} assume !(~i~2 < 999); {22472#false} is VALID [2018-11-23 12:25:30,999 INFO L273 TraceCheckUtils]: 138: Hoare triple {22472#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:25:30,999 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:30,999 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:30,999 INFO L273 TraceCheckUtils]: 141: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:30,999 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:31,000 INFO L273 TraceCheckUtils]: 143: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:31,000 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:31,000 INFO L273 TraceCheckUtils]: 145: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:31,000 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:31,000 INFO L273 TraceCheckUtils]: 147: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:31,001 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:31,001 INFO L273 TraceCheckUtils]: 149: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:31,001 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:31,001 INFO L273 TraceCheckUtils]: 151: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:31,001 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:31,001 INFO L273 TraceCheckUtils]: 153: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:31,002 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:31,002 INFO L273 TraceCheckUtils]: 155: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:31,002 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:31,002 INFO L273 TraceCheckUtils]: 157: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:31,002 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:31,003 INFO L273 TraceCheckUtils]: 159: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:31,003 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:31,003 INFO L273 TraceCheckUtils]: 161: Hoare triple {22472#false} assume !(~i~0 < 1000); {22472#false} is VALID [2018-11-23 12:25:31,003 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:31,003 INFO L273 TraceCheckUtils]: 163: Hoare triple {22472#false} assume true; {22472#false} is VALID [2018-11-23 12:25:31,003 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22472#false} {22472#false} #74#return; {22472#false} is VALID [2018-11-23 12:25:31,003 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:31,003 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:31,003 INFO L273 TraceCheckUtils]: 167: Hoare triple {22472#false} assume !false; {22472#false} is VALID [2018-11-23 12:25:31,014 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:31,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:31,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2018-11-23 12:25:31,035 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:25:31,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:31,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:25:31,161 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:31,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:25:31,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:25:31,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:25:31,163 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2018-11-23 12:25:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:32,224 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-11-23 12:25:32,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:25:32,224 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:25:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:25:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:25:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:25:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:25:32,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 133 transitions. [2018-11-23 12:25:32,389 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:32,392 INFO L225 Difference]: With dead ends: 177 [2018-11-23 12:25:32,392 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:25:32,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:25:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:25:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-23 12:25:32,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:32,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 123 states. [2018-11-23 12:25:32,442 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 123 states. [2018-11-23 12:25:32,442 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 123 states. [2018-11-23 12:25:32,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:32,445 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:25:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:25:32,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:32,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:32,446 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 125 states. [2018-11-23 12:25:32,446 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 125 states. [2018-11-23 12:25:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:32,448 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:25:32,448 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:25:32,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:32,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:32,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:32,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 12:25:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-11-23 12:25:32,451 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2018-11-23 12:25:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:32,452 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-11-23 12:25:32,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:25:32,452 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-23 12:25:32,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 12:25:32,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:32,453 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:32,453 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:32,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:32,454 INFO L82 PathProgramCache]: Analyzing trace with hash 853170883, now seen corresponding path program 31 times [2018-11-23 12:25:32,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:32,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:32,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:32,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:25:32,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:33,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {23712#true} call ULTIMATE.init(); {23712#true} is VALID [2018-11-23 12:25:33,161 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:33,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:25:33,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23712#true} {23712#true} #66#return; {23712#true} is VALID [2018-11-23 12:25:33,161 INFO L256 TraceCheckUtils]: 4: Hoare triple {23712#true} call #t~ret13 := main(); {23712#true} is VALID [2018-11-23 12:25:33,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {23712#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:33,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {23714#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:33,163 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:33,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {23715#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:33,164 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:33,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {23716#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:33,164 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:33,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {23717#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:33,165 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:33,166 INFO L273 TraceCheckUtils]: 14: Hoare triple {23718#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:33,167 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:33,167 INFO L273 TraceCheckUtils]: 16: Hoare triple {23719#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:33,168 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:33,168 INFO L273 TraceCheckUtils]: 18: Hoare triple {23720#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:33,169 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:33,170 INFO L273 TraceCheckUtils]: 20: Hoare triple {23721#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:33,170 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:33,171 INFO L273 TraceCheckUtils]: 22: Hoare triple {23722#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:33,172 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:33,172 INFO L273 TraceCheckUtils]: 24: Hoare triple {23723#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:33,173 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:33,173 INFO L273 TraceCheckUtils]: 26: Hoare triple {23724#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:33,174 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:33,175 INFO L273 TraceCheckUtils]: 28: Hoare triple {23725#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:33,175 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:33,176 INFO L273 TraceCheckUtils]: 30: Hoare triple {23726#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:33,177 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:33,177 INFO L273 TraceCheckUtils]: 32: Hoare triple {23727#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:33,178 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:33,178 INFO L273 TraceCheckUtils]: 34: Hoare triple {23728#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:33,179 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:33,180 INFO L273 TraceCheckUtils]: 36: Hoare triple {23729#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:33,180 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:33,181 INFO L273 TraceCheckUtils]: 38: Hoare triple {23730#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:33,182 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:33,182 INFO L273 TraceCheckUtils]: 40: Hoare triple {23731#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:33,183 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:33,183 INFO L273 TraceCheckUtils]: 42: Hoare triple {23732#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:33,184 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:33,185 INFO L273 TraceCheckUtils]: 44: Hoare triple {23733#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:33,185 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:33,186 INFO L273 TraceCheckUtils]: 46: Hoare triple {23734#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:33,187 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:33,189 INFO L273 TraceCheckUtils]: 48: Hoare triple {23735#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:33,196 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:33,197 INFO L273 TraceCheckUtils]: 50: Hoare triple {23736#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:33,197 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:33,197 INFO L273 TraceCheckUtils]: 52: Hoare triple {23737#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:33,198 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:33,198 INFO L273 TraceCheckUtils]: 54: Hoare triple {23738#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:33,199 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:33,199 INFO L273 TraceCheckUtils]: 56: Hoare triple {23739#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:33,199 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:33,200 INFO L273 TraceCheckUtils]: 58: Hoare triple {23740#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:33,200 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:33,200 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:33,201 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:33,201 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:33,202 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:33,203 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:33,203 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:33,204 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:33,205 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:33,205 INFO L273 TraceCheckUtils]: 68: Hoare triple {23745#(<= main_~i~1 31)} assume !(~i~1 < 1000); {23713#false} is VALID [2018-11-23 12:25:33,206 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:33,206 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:33,206 INFO L273 TraceCheckUtils]: 71: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,206 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:33,206 INFO L273 TraceCheckUtils]: 73: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,207 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:33,207 INFO L273 TraceCheckUtils]: 75: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,207 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:33,207 INFO L273 TraceCheckUtils]: 77: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,207 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:33,207 INFO L273 TraceCheckUtils]: 79: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,208 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:33,208 INFO L273 TraceCheckUtils]: 81: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,208 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:33,208 INFO L273 TraceCheckUtils]: 83: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,208 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:33,209 INFO L273 TraceCheckUtils]: 85: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,209 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:33,209 INFO L273 TraceCheckUtils]: 87: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,209 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:33,209 INFO L273 TraceCheckUtils]: 89: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,209 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:33,209 INFO L273 TraceCheckUtils]: 91: Hoare triple {23712#true} assume !(~i~0 < 1000); {23712#true} is VALID [2018-11-23 12:25:33,209 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:33,209 INFO L273 TraceCheckUtils]: 93: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:25:33,209 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23712#true} {23713#false} #70#return; {23713#false} is VALID [2018-11-23 12:25:33,210 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:33,210 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:33,210 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:33,210 INFO L273 TraceCheckUtils]: 98: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,210 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:33,210 INFO L273 TraceCheckUtils]: 100: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,210 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:33,210 INFO L273 TraceCheckUtils]: 102: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,210 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:33,211 INFO L273 TraceCheckUtils]: 104: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,211 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:33,211 INFO L273 TraceCheckUtils]: 106: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,211 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:33,211 INFO L273 TraceCheckUtils]: 108: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,211 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:33,211 INFO L273 TraceCheckUtils]: 110: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,211 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:33,211 INFO L273 TraceCheckUtils]: 112: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,211 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:33,212 INFO L273 TraceCheckUtils]: 114: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,212 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:33,212 INFO L273 TraceCheckUtils]: 116: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,212 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:33,212 INFO L273 TraceCheckUtils]: 118: Hoare triple {23712#true} assume !(~i~0 < 1000); {23712#true} is VALID [2018-11-23 12:25:33,212 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:33,212 INFO L273 TraceCheckUtils]: 120: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:25:33,212 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23712#true} {23713#false} #72#return; {23713#false} is VALID [2018-11-23 12:25:33,212 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:33,213 INFO L273 TraceCheckUtils]: 123: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,213 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:33,213 INFO L273 TraceCheckUtils]: 125: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,213 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:33,213 INFO L273 TraceCheckUtils]: 127: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,213 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:33,213 INFO L273 TraceCheckUtils]: 129: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,213 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:33,213 INFO L273 TraceCheckUtils]: 131: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,214 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:33,214 INFO L273 TraceCheckUtils]: 133: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,214 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:33,214 INFO L273 TraceCheckUtils]: 135: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,214 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:33,214 INFO L273 TraceCheckUtils]: 137: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,214 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:33,214 INFO L273 TraceCheckUtils]: 139: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,214 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:33,214 INFO L273 TraceCheckUtils]: 141: Hoare triple {23713#false} assume !(~i~2 < 999); {23713#false} is VALID [2018-11-23 12:25:33,215 INFO L273 TraceCheckUtils]: 142: Hoare triple {23713#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:25:33,215 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:33,215 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:33,215 INFO L273 TraceCheckUtils]: 145: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,215 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:33,215 INFO L273 TraceCheckUtils]: 147: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,215 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:33,215 INFO L273 TraceCheckUtils]: 149: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,215 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:33,215 INFO L273 TraceCheckUtils]: 151: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,216 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:33,216 INFO L273 TraceCheckUtils]: 153: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,216 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:33,216 INFO L273 TraceCheckUtils]: 155: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,216 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:33,216 INFO L273 TraceCheckUtils]: 157: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,216 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:33,216 INFO L273 TraceCheckUtils]: 159: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,216 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:33,217 INFO L273 TraceCheckUtils]: 161: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,217 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:33,217 INFO L273 TraceCheckUtils]: 163: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:33,217 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:33,217 INFO L273 TraceCheckUtils]: 165: Hoare triple {23712#true} assume !(~i~0 < 1000); {23712#true} is VALID [2018-11-23 12:25:33,217 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:33,217 INFO L273 TraceCheckUtils]: 167: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:25:33,217 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23712#true} {23713#false} #74#return; {23713#false} is VALID [2018-11-23 12:25:33,217 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:33,217 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:33,218 INFO L273 TraceCheckUtils]: 171: Hoare triple {23713#false} assume !false; {23713#false} is VALID [2018-11-23 12:25:33,231 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:33,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:33,232 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:33,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:33,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:33,743 INFO L256 TraceCheckUtils]: 0: Hoare triple {23712#true} call ULTIMATE.init(); {23712#true} is VALID [2018-11-23 12:25:33,743 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:33,743 INFO L273 TraceCheckUtils]: 2: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:25:33,743 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23712#true} {23712#true} #66#return; {23712#true} is VALID [2018-11-23 12:25:33,744 INFO L256 TraceCheckUtils]: 4: Hoare triple {23712#true} call #t~ret13 := main(); {23712#true} is VALID [2018-11-23 12:25:33,745 INFO L273 TraceCheckUtils]: 5: Hoare triple {23712#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:33,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {23764#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:33,746 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:33,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {23715#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:33,746 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:33,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {23716#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:33,747 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:33,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {23717#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:33,749 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:33,749 INFO L273 TraceCheckUtils]: 14: Hoare triple {23718#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:33,750 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:33,751 INFO L273 TraceCheckUtils]: 16: Hoare triple {23719#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:33,751 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:33,752 INFO L273 TraceCheckUtils]: 18: Hoare triple {23720#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:33,753 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:33,754 INFO L273 TraceCheckUtils]: 20: Hoare triple {23721#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:33,754 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:33,755 INFO L273 TraceCheckUtils]: 22: Hoare triple {23722#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:33,756 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:33,756 INFO L273 TraceCheckUtils]: 24: Hoare triple {23723#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:33,757 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:33,758 INFO L273 TraceCheckUtils]: 26: Hoare triple {23724#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:33,759 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:33,759 INFO L273 TraceCheckUtils]: 28: Hoare triple {23725#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:33,760 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:33,786 INFO L273 TraceCheckUtils]: 30: Hoare triple {23726#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:33,789 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:33,790 INFO L273 TraceCheckUtils]: 32: Hoare triple {23727#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:33,791 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:33,791 INFO L273 TraceCheckUtils]: 34: Hoare triple {23728#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:33,792 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:33,792 INFO L273 TraceCheckUtils]: 36: Hoare triple {23729#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:33,792 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:33,793 INFO L273 TraceCheckUtils]: 38: Hoare triple {23730#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:33,793 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:33,793 INFO L273 TraceCheckUtils]: 40: Hoare triple {23731#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:33,794 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:33,794 INFO L273 TraceCheckUtils]: 42: Hoare triple {23732#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:33,795 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:33,796 INFO L273 TraceCheckUtils]: 44: Hoare triple {23733#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:33,796 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:33,797 INFO L273 TraceCheckUtils]: 46: Hoare triple {23734#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:33,798 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:33,798 INFO L273 TraceCheckUtils]: 48: Hoare triple {23735#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:33,799 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:33,799 INFO L273 TraceCheckUtils]: 50: Hoare triple {23736#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:33,800 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:33,801 INFO L273 TraceCheckUtils]: 52: Hoare triple {23737#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:33,801 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:33,802 INFO L273 TraceCheckUtils]: 54: Hoare triple {23738#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:33,802 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:33,803 INFO L273 TraceCheckUtils]: 56: Hoare triple {23739#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:33,804 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:33,804 INFO L273 TraceCheckUtils]: 58: Hoare triple {23740#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:33,805 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:33,806 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:33,806 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:33,807 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:33,807 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:33,808 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:33,809 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:33,809 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:33,810 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:33,811 INFO L273 TraceCheckUtils]: 68: Hoare triple {23745#(<= main_~i~1 31)} assume !(~i~1 < 1000); {23713#false} is VALID [2018-11-23 12:25:33,811 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:33,811 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:33,811 INFO L273 TraceCheckUtils]: 71: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,811 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:33,812 INFO L273 TraceCheckUtils]: 73: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,812 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:33,812 INFO L273 TraceCheckUtils]: 75: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,812 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:33,812 INFO L273 TraceCheckUtils]: 77: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,812 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:33,813 INFO L273 TraceCheckUtils]: 79: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,813 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:33,813 INFO L273 TraceCheckUtils]: 81: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,813 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:33,813 INFO L273 TraceCheckUtils]: 83: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,813 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:33,814 INFO L273 TraceCheckUtils]: 85: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,814 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:33,814 INFO L273 TraceCheckUtils]: 87: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,814 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:33,814 INFO L273 TraceCheckUtils]: 89: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,815 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:33,815 INFO L273 TraceCheckUtils]: 91: Hoare triple {23713#false} assume !(~i~0 < 1000); {23713#false} is VALID [2018-11-23 12:25:33,815 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:33,815 INFO L273 TraceCheckUtils]: 93: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:25:33,815 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23713#false} {23713#false} #70#return; {23713#false} is VALID [2018-11-23 12:25:33,815 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:33,816 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:33,816 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:33,816 INFO L273 TraceCheckUtils]: 98: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,816 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:33,816 INFO L273 TraceCheckUtils]: 100: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,816 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:33,816 INFO L273 TraceCheckUtils]: 102: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,816 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:33,817 INFO L273 TraceCheckUtils]: 104: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,817 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:33,817 INFO L273 TraceCheckUtils]: 106: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,817 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:33,817 INFO L273 TraceCheckUtils]: 108: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,817 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:33,817 INFO L273 TraceCheckUtils]: 110: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,817 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:33,817 INFO L273 TraceCheckUtils]: 112: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,817 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:33,818 INFO L273 TraceCheckUtils]: 114: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,818 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:33,818 INFO L273 TraceCheckUtils]: 116: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,818 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:33,818 INFO L273 TraceCheckUtils]: 118: Hoare triple {23713#false} assume !(~i~0 < 1000); {23713#false} is VALID [2018-11-23 12:25:33,818 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:33,818 INFO L273 TraceCheckUtils]: 120: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:25:33,818 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23713#false} {23713#false} #72#return; {23713#false} is VALID [2018-11-23 12:25:33,818 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:33,818 INFO L273 TraceCheckUtils]: 123: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,819 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:33,819 INFO L273 TraceCheckUtils]: 125: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,819 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:33,819 INFO L273 TraceCheckUtils]: 127: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,819 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:33,819 INFO L273 TraceCheckUtils]: 129: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,819 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:33,819 INFO L273 TraceCheckUtils]: 131: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,819 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:33,820 INFO L273 TraceCheckUtils]: 133: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,820 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:33,820 INFO L273 TraceCheckUtils]: 135: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,820 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:33,820 INFO L273 TraceCheckUtils]: 137: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,820 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:33,821 INFO L273 TraceCheckUtils]: 139: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:33,821 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:33,821 INFO L273 TraceCheckUtils]: 141: Hoare triple {23713#false} assume !(~i~2 < 999); {23713#false} is VALID [2018-11-23 12:25:33,821 INFO L273 TraceCheckUtils]: 142: Hoare triple {23713#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:25:33,821 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:33,821 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:33,822 INFO L273 TraceCheckUtils]: 145: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,822 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:33,822 INFO L273 TraceCheckUtils]: 147: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,822 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:33,822 INFO L273 TraceCheckUtils]: 149: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,822 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:33,822 INFO L273 TraceCheckUtils]: 151: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,823 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:33,823 INFO L273 TraceCheckUtils]: 153: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,823 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:33,823 INFO L273 TraceCheckUtils]: 155: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,823 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:33,823 INFO L273 TraceCheckUtils]: 157: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,824 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:33,824 INFO L273 TraceCheckUtils]: 159: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,824 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:33,824 INFO L273 TraceCheckUtils]: 161: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,824 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:33,824 INFO L273 TraceCheckUtils]: 163: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:33,825 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:33,825 INFO L273 TraceCheckUtils]: 165: Hoare triple {23713#false} assume !(~i~0 < 1000); {23713#false} is VALID [2018-11-23 12:25:33,825 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:33,825 INFO L273 TraceCheckUtils]: 167: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:25:33,825 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23713#false} {23713#false} #74#return; {23713#false} is VALID [2018-11-23 12:25:33,825 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:33,825 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:33,826 INFO L273 TraceCheckUtils]: 171: Hoare triple {23713#false} assume !false; {23713#false} is VALID [2018-11-23 12:25:33,844 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:33,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:33,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:25:33,874 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:25:33,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:33,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:25:34,025 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:34,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:25:34,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:25:34,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:25:34,027 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2018-11-23 12:25:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:34,421 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-23 12:25:34,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:25:34,422 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:25:34,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:25:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:25:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:25:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:25:34,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 116 transitions. [2018-11-23 12:25:34,576 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:34,579 INFO L225 Difference]: With dead ends: 180 [2018-11-23 12:25:34,579 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 12:25:34,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:25:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 12:25:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-23 12:25:34,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:34,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-23 12:25:34,674 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-23 12:25:34,674 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-23 12:25:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:34,676 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:25:34,676 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:25:34,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:34,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:34,677 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-23 12:25:34,677 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-23 12:25:34,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:34,679 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:25:34,679 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:25:34,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:34,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:34,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:34,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:34,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 12:25:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-23 12:25:34,682 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2018-11-23 12:25:34,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:34,682 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-23 12:25:34,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:25:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:25:34,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 12:25:34,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:34,684 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:34,684 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:34,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:34,684 INFO L82 PathProgramCache]: Analyzing trace with hash -320678875, now seen corresponding path program 32 times [2018-11-23 12:25:34,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:34,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:34,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:34,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:34,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:35,706 INFO L256 TraceCheckUtils]: 0: Hoare triple {24968#true} call ULTIMATE.init(); {24968#true} is VALID [2018-11-23 12:25:35,706 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:35,706 INFO L273 TraceCheckUtils]: 2: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:25:35,707 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24968#true} {24968#true} #66#return; {24968#true} is VALID [2018-11-23 12:25:35,707 INFO L256 TraceCheckUtils]: 4: Hoare triple {24968#true} call #t~ret13 := main(); {24968#true} is VALID [2018-11-23 12:25:35,707 INFO L273 TraceCheckUtils]: 5: Hoare triple {24968#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:35,708 INFO L273 TraceCheckUtils]: 6: Hoare triple {24970#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:35,709 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:35,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {24971#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:35,710 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:35,710 INFO L273 TraceCheckUtils]: 10: Hoare triple {24972#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:35,711 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:35,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:35,712 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:35,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:35,714 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:35,714 INFO L273 TraceCheckUtils]: 16: Hoare triple {24975#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:35,715 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:35,715 INFO L273 TraceCheckUtils]: 18: Hoare triple {24976#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:35,716 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:35,717 INFO L273 TraceCheckUtils]: 20: Hoare triple {24977#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:35,717 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:35,718 INFO L273 TraceCheckUtils]: 22: Hoare triple {24978#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:35,718 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:35,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {24979#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:35,720 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:35,720 INFO L273 TraceCheckUtils]: 26: Hoare triple {24980#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:35,721 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:35,721 INFO L273 TraceCheckUtils]: 28: Hoare triple {24981#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:35,722 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:35,723 INFO L273 TraceCheckUtils]: 30: Hoare triple {24982#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:35,723 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:35,724 INFO L273 TraceCheckUtils]: 32: Hoare triple {24983#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:35,725 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:35,725 INFO L273 TraceCheckUtils]: 34: Hoare triple {24984#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:35,726 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:35,726 INFO L273 TraceCheckUtils]: 36: Hoare triple {24985#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:35,727 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:35,728 INFO L273 TraceCheckUtils]: 38: Hoare triple {24986#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:35,728 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:35,729 INFO L273 TraceCheckUtils]: 40: Hoare triple {24987#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:35,730 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:35,730 INFO L273 TraceCheckUtils]: 42: Hoare triple {24988#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:35,731 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:35,731 INFO L273 TraceCheckUtils]: 44: Hoare triple {24989#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:35,732 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:35,733 INFO L273 TraceCheckUtils]: 46: Hoare triple {24990#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:35,733 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:35,734 INFO L273 TraceCheckUtils]: 48: Hoare triple {24991#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:35,735 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:35,735 INFO L273 TraceCheckUtils]: 50: Hoare triple {24992#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:35,736 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:35,736 INFO L273 TraceCheckUtils]: 52: Hoare triple {24993#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:35,737 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:35,738 INFO L273 TraceCheckUtils]: 54: Hoare triple {24994#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:35,738 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:35,739 INFO L273 TraceCheckUtils]: 56: Hoare triple {24995#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:35,740 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:35,740 INFO L273 TraceCheckUtils]: 58: Hoare triple {24996#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:35,741 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:35,741 INFO L273 TraceCheckUtils]: 60: Hoare triple {24997#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:35,742 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:35,743 INFO L273 TraceCheckUtils]: 62: Hoare triple {24998#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:35,743 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:35,744 INFO L273 TraceCheckUtils]: 64: Hoare triple {24999#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:35,745 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:35,745 INFO L273 TraceCheckUtils]: 66: Hoare triple {25000#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:35,746 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:35,746 INFO L273 TraceCheckUtils]: 68: Hoare triple {25001#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -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:35,747 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:35,748 INFO L273 TraceCheckUtils]: 70: Hoare triple {25002#(<= main_~i~1 32)} assume !(~i~1 < 1000); {24969#false} is VALID [2018-11-23 12:25:35,748 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:35,748 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:35,748 INFO L273 TraceCheckUtils]: 73: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,748 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:35,749 INFO L273 TraceCheckUtils]: 75: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,749 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:35,749 INFO L273 TraceCheckUtils]: 77: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,749 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:35,749 INFO L273 TraceCheckUtils]: 79: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,750 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:35,750 INFO L273 TraceCheckUtils]: 81: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,750 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:35,750 INFO L273 TraceCheckUtils]: 83: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,750 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:35,750 INFO L273 TraceCheckUtils]: 85: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,751 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:35,751 INFO L273 TraceCheckUtils]: 87: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,751 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:35,751 INFO L273 TraceCheckUtils]: 89: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,751 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:35,751 INFO L273 TraceCheckUtils]: 91: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,752 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:35,752 INFO L273 TraceCheckUtils]: 93: Hoare triple {24968#true} assume !(~i~0 < 1000); {24968#true} is VALID [2018-11-23 12:25:35,752 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:35,752 INFO L273 TraceCheckUtils]: 95: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:25:35,752 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24968#true} {24969#false} #70#return; {24969#false} is VALID [2018-11-23 12:25:35,752 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:35,753 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:35,753 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:35,753 INFO L273 TraceCheckUtils]: 100: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,753 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:35,753 INFO L273 TraceCheckUtils]: 102: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,753 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:35,753 INFO L273 TraceCheckUtils]: 104: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,753 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:35,753 INFO L273 TraceCheckUtils]: 106: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,753 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:35,754 INFO L273 TraceCheckUtils]: 108: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,754 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:35,754 INFO L273 TraceCheckUtils]: 110: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,754 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:35,754 INFO L273 TraceCheckUtils]: 112: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,754 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:35,754 INFO L273 TraceCheckUtils]: 114: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,754 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:35,754 INFO L273 TraceCheckUtils]: 116: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,755 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:35,755 INFO L273 TraceCheckUtils]: 118: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,755 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:35,755 INFO L273 TraceCheckUtils]: 120: Hoare triple {24968#true} assume !(~i~0 < 1000); {24968#true} is VALID [2018-11-23 12:25:35,755 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:35,755 INFO L273 TraceCheckUtils]: 122: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:25:35,755 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24968#true} {24969#false} #72#return; {24969#false} is VALID [2018-11-23 12:25:35,755 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:35,755 INFO L273 TraceCheckUtils]: 125: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:35,755 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:35,756 INFO L273 TraceCheckUtils]: 127: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:35,756 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:35,756 INFO L273 TraceCheckUtils]: 129: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:35,756 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:35,756 INFO L273 TraceCheckUtils]: 131: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:35,756 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:35,756 INFO L273 TraceCheckUtils]: 133: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:35,756 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:35,756 INFO L273 TraceCheckUtils]: 135: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:35,756 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:35,757 INFO L273 TraceCheckUtils]: 137: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:35,757 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:35,757 INFO L273 TraceCheckUtils]: 139: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:35,757 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:35,757 INFO L273 TraceCheckUtils]: 141: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:35,757 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:35,757 INFO L273 TraceCheckUtils]: 143: Hoare triple {24969#false} assume !(~i~2 < 999); {24969#false} is VALID [2018-11-23 12:25:35,757 INFO L273 TraceCheckUtils]: 144: Hoare triple {24969#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:25:35,757 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:35,757 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:35,758 INFO L273 TraceCheckUtils]: 147: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,758 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:35,758 INFO L273 TraceCheckUtils]: 149: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,758 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:35,758 INFO L273 TraceCheckUtils]: 151: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,758 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:35,758 INFO L273 TraceCheckUtils]: 153: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,758 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:35,758 INFO L273 TraceCheckUtils]: 155: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,758 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:35,759 INFO L273 TraceCheckUtils]: 157: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,759 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:35,759 INFO L273 TraceCheckUtils]: 159: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,759 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:35,759 INFO L273 TraceCheckUtils]: 161: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,759 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:35,759 INFO L273 TraceCheckUtils]: 163: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,759 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:35,759 INFO L273 TraceCheckUtils]: 165: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:35,760 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:35,760 INFO L273 TraceCheckUtils]: 167: Hoare triple {24968#true} assume !(~i~0 < 1000); {24968#true} is VALID [2018-11-23 12:25:35,760 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:35,760 INFO L273 TraceCheckUtils]: 169: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:25:35,760 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24968#true} {24969#false} #74#return; {24969#false} is VALID [2018-11-23 12:25:35,760 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:35,760 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:35,760 INFO L273 TraceCheckUtils]: 173: Hoare triple {24969#false} assume !false; {24969#false} is VALID [2018-11-23 12:25:35,774 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:35,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:35,775 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:35,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:25:35,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:25:35,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:25:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:35,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:36,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {24968#true} call ULTIMATE.init(); {24968#true} is VALID [2018-11-23 12:25:36,216 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:36,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:25:36,217 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24968#true} {24968#true} #66#return; {24968#true} is VALID [2018-11-23 12:25:36,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {24968#true} call #t~ret13 := main(); {24968#true} is VALID [2018-11-23 12:25:36,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {24968#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:36,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {25021#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:36,219 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:36,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {24971#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:36,219 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:36,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {24972#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:36,220 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:36,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:36,221 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:36,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:36,222 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:36,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {24975#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:36,224 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:36,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {24976#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:36,225 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:36,226 INFO L273 TraceCheckUtils]: 20: Hoare triple {24977#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:36,226 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:36,227 INFO L273 TraceCheckUtils]: 22: Hoare triple {24978#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:36,227 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:36,228 INFO L273 TraceCheckUtils]: 24: Hoare triple {24979#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:36,229 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:36,229 INFO L273 TraceCheckUtils]: 26: Hoare triple {24980#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:36,230 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:36,230 INFO L273 TraceCheckUtils]: 28: Hoare triple {24981#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:36,231 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:36,232 INFO L273 TraceCheckUtils]: 30: Hoare triple {24982#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:36,232 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:36,233 INFO L273 TraceCheckUtils]: 32: Hoare triple {24983#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:36,234 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:36,234 INFO L273 TraceCheckUtils]: 34: Hoare triple {24984#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:36,235 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:36,235 INFO L273 TraceCheckUtils]: 36: Hoare triple {24985#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:36,236 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:36,237 INFO L273 TraceCheckUtils]: 38: Hoare triple {24986#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:36,237 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:36,238 INFO L273 TraceCheckUtils]: 40: Hoare triple {24987#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:36,239 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:36,239 INFO L273 TraceCheckUtils]: 42: Hoare triple {24988#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:36,240 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:36,240 INFO L273 TraceCheckUtils]: 44: Hoare triple {24989#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:36,241 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:36,242 INFO L273 TraceCheckUtils]: 46: Hoare triple {24990#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:36,242 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:36,243 INFO L273 TraceCheckUtils]: 48: Hoare triple {24991#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:36,244 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:36,244 INFO L273 TraceCheckUtils]: 50: Hoare triple {24992#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:36,245 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:36,245 INFO L273 TraceCheckUtils]: 52: Hoare triple {24993#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:36,246 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:36,247 INFO L273 TraceCheckUtils]: 54: Hoare triple {24994#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:36,247 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:36,248 INFO L273 TraceCheckUtils]: 56: Hoare triple {24995#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:36,249 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:36,249 INFO L273 TraceCheckUtils]: 58: Hoare triple {24996#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:36,250 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:36,250 INFO L273 TraceCheckUtils]: 60: Hoare triple {24997#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:36,251 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:36,252 INFO L273 TraceCheckUtils]: 62: Hoare triple {24998#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:36,252 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:36,253 INFO L273 TraceCheckUtils]: 64: Hoare triple {24999#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:36,254 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:36,254 INFO L273 TraceCheckUtils]: 66: Hoare triple {25000#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:36,255 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:36,255 INFO L273 TraceCheckUtils]: 68: Hoare triple {25001#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -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:36,256 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:36,257 INFO L273 TraceCheckUtils]: 70: Hoare triple {25002#(<= main_~i~1 32)} assume !(~i~1 < 1000); {24969#false} is VALID [2018-11-23 12:25:36,257 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:36,257 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:36,257 INFO L273 TraceCheckUtils]: 73: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,258 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:36,258 INFO L273 TraceCheckUtils]: 75: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,258 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:36,258 INFO L273 TraceCheckUtils]: 77: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,258 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:36,258 INFO L273 TraceCheckUtils]: 79: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,259 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:36,259 INFO L273 TraceCheckUtils]: 81: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,259 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:36,259 INFO L273 TraceCheckUtils]: 83: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,259 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:36,259 INFO L273 TraceCheckUtils]: 85: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,260 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:36,260 INFO L273 TraceCheckUtils]: 87: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,260 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:36,260 INFO L273 TraceCheckUtils]: 89: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,260 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:36,261 INFO L273 TraceCheckUtils]: 91: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,261 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:36,261 INFO L273 TraceCheckUtils]: 93: Hoare triple {24969#false} assume !(~i~0 < 1000); {24969#false} is VALID [2018-11-23 12:25:36,261 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:36,261 INFO L273 TraceCheckUtils]: 95: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:25:36,261 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24969#false} {24969#false} #70#return; {24969#false} is VALID [2018-11-23 12:25:36,262 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:36,262 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:36,262 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:36,262 INFO L273 TraceCheckUtils]: 100: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,262 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:36,262 INFO L273 TraceCheckUtils]: 102: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,262 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:36,262 INFO L273 TraceCheckUtils]: 104: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,262 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:36,262 INFO L273 TraceCheckUtils]: 106: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,263 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:36,263 INFO L273 TraceCheckUtils]: 108: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,263 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:36,263 INFO L273 TraceCheckUtils]: 110: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,263 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:36,263 INFO L273 TraceCheckUtils]: 112: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,263 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:36,263 INFO L273 TraceCheckUtils]: 114: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,263 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:36,263 INFO L273 TraceCheckUtils]: 116: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,264 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:36,264 INFO L273 TraceCheckUtils]: 118: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,264 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:36,264 INFO L273 TraceCheckUtils]: 120: Hoare triple {24969#false} assume !(~i~0 < 1000); {24969#false} is VALID [2018-11-23 12:25:36,264 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:36,264 INFO L273 TraceCheckUtils]: 122: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:25:36,264 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24969#false} {24969#false} #72#return; {24969#false} is VALID [2018-11-23 12:25:36,264 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:36,264 INFO L273 TraceCheckUtils]: 125: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:36,264 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:36,265 INFO L273 TraceCheckUtils]: 127: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:36,265 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:36,265 INFO L273 TraceCheckUtils]: 129: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:36,265 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:36,265 INFO L273 TraceCheckUtils]: 131: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:36,265 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:36,265 INFO L273 TraceCheckUtils]: 133: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:36,265 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:36,265 INFO L273 TraceCheckUtils]: 135: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:36,265 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:36,266 INFO L273 TraceCheckUtils]: 137: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:36,266 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:36,266 INFO L273 TraceCheckUtils]: 139: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:36,266 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:36,266 INFO L273 TraceCheckUtils]: 141: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:36,266 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:36,266 INFO L273 TraceCheckUtils]: 143: Hoare triple {24969#false} assume !(~i~2 < 999); {24969#false} is VALID [2018-11-23 12:25:36,266 INFO L273 TraceCheckUtils]: 144: Hoare triple {24969#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:25:36,266 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:36,266 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:36,267 INFO L273 TraceCheckUtils]: 147: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,267 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:36,267 INFO L273 TraceCheckUtils]: 149: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,267 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:36,267 INFO L273 TraceCheckUtils]: 151: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,267 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:36,267 INFO L273 TraceCheckUtils]: 153: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,267 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:36,267 INFO L273 TraceCheckUtils]: 155: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,268 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:36,268 INFO L273 TraceCheckUtils]: 157: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,268 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:36,268 INFO L273 TraceCheckUtils]: 159: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,268 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:36,268 INFO L273 TraceCheckUtils]: 161: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,268 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:36,268 INFO L273 TraceCheckUtils]: 163: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,268 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:36,268 INFO L273 TraceCheckUtils]: 165: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:36,269 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:36,269 INFO L273 TraceCheckUtils]: 167: Hoare triple {24969#false} assume !(~i~0 < 1000); {24969#false} is VALID [2018-11-23 12:25:36,269 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:36,269 INFO L273 TraceCheckUtils]: 169: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:25:36,269 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24969#false} {24969#false} #74#return; {24969#false} is VALID [2018-11-23 12:25:36,269 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:36,269 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:36,269 INFO L273 TraceCheckUtils]: 173: Hoare triple {24969#false} assume !false; {24969#false} is VALID [2018-11-23 12:25:36,284 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:36,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:36,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:25:36,304 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:25:36,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:36,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:25:36,415 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:36,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:25:36,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:25:36,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:25:36,417 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2018-11-23 12:25:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:37,359 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2018-11-23 12:25:37,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:25:37,359 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:25:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:25:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:25:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:25:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:25:37,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 118 transitions. [2018-11-23 12:25:37,479 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:37,481 INFO L225 Difference]: With dead ends: 182 [2018-11-23 12:25:37,481 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:25:37,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:25:37,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:25:37,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-11-23 12:25:37,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:37,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 127 states. [2018-11-23 12:25:37,563 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 127 states. [2018-11-23 12:25:37,563 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 127 states. [2018-11-23 12:25:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:37,566 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:25:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:25:37,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:37,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:37,566 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 128 states. [2018-11-23 12:25:37,566 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 128 states. [2018-11-23 12:25:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:37,568 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:25:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:25:37,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:37,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:37,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:37,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 12:25:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-11-23 12:25:37,572 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2018-11-23 12:25:37,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:37,572 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-11-23 12:25:37,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:25:37,572 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:25:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-23 12:25:37,573 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:37,573 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:37,573 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:37,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:37,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1186102535, now seen corresponding path program 33 times [2018-11-23 12:25:37,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:37,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:37,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:37,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:25:37,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:38,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {26241#true} call ULTIMATE.init(); {26241#true} is VALID [2018-11-23 12:25:38,660 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:38,660 INFO L273 TraceCheckUtils]: 2: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:25:38,660 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26241#true} {26241#true} #66#return; {26241#true} is VALID [2018-11-23 12:25:38,660 INFO L256 TraceCheckUtils]: 4: Hoare triple {26241#true} call #t~ret13 := main(); {26241#true} is VALID [2018-11-23 12:25:38,661 INFO L273 TraceCheckUtils]: 5: Hoare triple {26241#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:38,661 INFO L273 TraceCheckUtils]: 6: Hoare triple {26243#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:38,662 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:38,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {26244#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:38,663 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:38,664 INFO L273 TraceCheckUtils]: 10: Hoare triple {26245#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:38,664 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:38,664 INFO L273 TraceCheckUtils]: 12: Hoare triple {26246#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:38,665 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:38,665 INFO L273 TraceCheckUtils]: 14: Hoare triple {26247#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:38,666 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:38,666 INFO L273 TraceCheckUtils]: 16: Hoare triple {26248#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:38,667 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:38,668 INFO L273 TraceCheckUtils]: 18: Hoare triple {26249#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:38,668 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:38,669 INFO L273 TraceCheckUtils]: 20: Hoare triple {26250#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:38,670 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:38,670 INFO L273 TraceCheckUtils]: 22: Hoare triple {26251#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:38,671 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:38,671 INFO L273 TraceCheckUtils]: 24: Hoare triple {26252#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:38,672 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:38,673 INFO L273 TraceCheckUtils]: 26: Hoare triple {26253#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:38,673 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:38,674 INFO L273 TraceCheckUtils]: 28: Hoare triple {26254#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:38,675 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:38,675 INFO L273 TraceCheckUtils]: 30: Hoare triple {26255#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:38,676 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:38,676 INFO L273 TraceCheckUtils]: 32: Hoare triple {26256#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:38,677 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:38,678 INFO L273 TraceCheckUtils]: 34: Hoare triple {26257#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:38,678 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:38,679 INFO L273 TraceCheckUtils]: 36: Hoare triple {26258#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:38,680 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:38,680 INFO L273 TraceCheckUtils]: 38: Hoare triple {26259#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:38,681 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:38,681 INFO L273 TraceCheckUtils]: 40: Hoare triple {26260#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:38,682 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:38,683 INFO L273 TraceCheckUtils]: 42: Hoare triple {26261#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:38,683 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:38,684 INFO L273 TraceCheckUtils]: 44: Hoare triple {26262#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:38,684 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:38,685 INFO L273 TraceCheckUtils]: 46: Hoare triple {26263#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:38,686 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:38,686 INFO L273 TraceCheckUtils]: 48: Hoare triple {26264#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:38,687 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:38,687 INFO L273 TraceCheckUtils]: 50: Hoare triple {26265#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:38,688 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:38,689 INFO L273 TraceCheckUtils]: 52: Hoare triple {26266#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:38,689 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:38,690 INFO L273 TraceCheckUtils]: 54: Hoare triple {26267#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:38,691 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:38,691 INFO L273 TraceCheckUtils]: 56: Hoare triple {26268#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:38,692 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:38,692 INFO L273 TraceCheckUtils]: 58: Hoare triple {26269#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:38,693 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:38,694 INFO L273 TraceCheckUtils]: 60: Hoare triple {26270#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:38,694 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:38,695 INFO L273 TraceCheckUtils]: 62: Hoare triple {26271#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:38,696 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:38,696 INFO L273 TraceCheckUtils]: 64: Hoare triple {26272#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:38,697 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:38,697 INFO L273 TraceCheckUtils]: 66: Hoare triple {26273#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:38,698 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:38,699 INFO L273 TraceCheckUtils]: 68: Hoare triple {26274#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -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:38,699 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:38,700 INFO L273 TraceCheckUtils]: 70: Hoare triple {26275#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -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:38,701 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:38,701 INFO L273 TraceCheckUtils]: 72: Hoare triple {26276#(<= main_~i~1 33)} assume !(~i~1 < 1000); {26242#false} is VALID [2018-11-23 12:25:38,702 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:38,702 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:38,702 INFO L273 TraceCheckUtils]: 75: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,702 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:38,702 INFO L273 TraceCheckUtils]: 77: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,702 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:38,703 INFO L273 TraceCheckUtils]: 79: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,703 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:38,703 INFO L273 TraceCheckUtils]: 81: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,703 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:38,703 INFO L273 TraceCheckUtils]: 83: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,704 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:38,704 INFO L273 TraceCheckUtils]: 85: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,704 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:38,704 INFO L273 TraceCheckUtils]: 87: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,704 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:38,704 INFO L273 TraceCheckUtils]: 89: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,705 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:38,705 INFO L273 TraceCheckUtils]: 91: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,705 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:38,705 INFO L273 TraceCheckUtils]: 93: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,705 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:38,705 INFO L273 TraceCheckUtils]: 95: Hoare triple {26241#true} assume !(~i~0 < 1000); {26241#true} is VALID [2018-11-23 12:25:38,705 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:38,705 INFO L273 TraceCheckUtils]: 97: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:25:38,706 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26241#true} {26242#false} #70#return; {26242#false} is VALID [2018-11-23 12:25:38,706 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:38,706 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:38,706 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:38,706 INFO L273 TraceCheckUtils]: 102: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,706 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:38,706 INFO L273 TraceCheckUtils]: 104: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,706 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:38,706 INFO L273 TraceCheckUtils]: 106: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,707 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:38,707 INFO L273 TraceCheckUtils]: 108: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,707 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:38,707 INFO L273 TraceCheckUtils]: 110: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,707 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:38,707 INFO L273 TraceCheckUtils]: 112: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,707 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:38,707 INFO L273 TraceCheckUtils]: 114: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,707 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:38,707 INFO L273 TraceCheckUtils]: 116: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,708 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:38,708 INFO L273 TraceCheckUtils]: 118: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,708 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:38,708 INFO L273 TraceCheckUtils]: 120: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,708 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:38,708 INFO L273 TraceCheckUtils]: 122: Hoare triple {26241#true} assume !(~i~0 < 1000); {26241#true} is VALID [2018-11-23 12:25:38,708 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:38,708 INFO L273 TraceCheckUtils]: 124: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:25:38,708 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26241#true} {26242#false} #72#return; {26242#false} is VALID [2018-11-23 12:25:38,708 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:38,709 INFO L273 TraceCheckUtils]: 127: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:38,709 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:38,709 INFO L273 TraceCheckUtils]: 129: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:38,709 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:38,709 INFO L273 TraceCheckUtils]: 131: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:38,709 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:38,709 INFO L273 TraceCheckUtils]: 133: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:38,709 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:38,709 INFO L273 TraceCheckUtils]: 135: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:38,709 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:38,710 INFO L273 TraceCheckUtils]: 137: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:38,710 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:38,710 INFO L273 TraceCheckUtils]: 139: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:38,710 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:38,710 INFO L273 TraceCheckUtils]: 141: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:38,710 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:38,710 INFO L273 TraceCheckUtils]: 143: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:38,710 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:38,710 INFO L273 TraceCheckUtils]: 145: Hoare triple {26242#false} assume !(~i~2 < 999); {26242#false} is VALID [2018-11-23 12:25:38,710 INFO L273 TraceCheckUtils]: 146: Hoare triple {26242#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:25:38,711 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:38,711 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:38,711 INFO L273 TraceCheckUtils]: 149: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,711 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:38,711 INFO L273 TraceCheckUtils]: 151: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,711 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:38,711 INFO L273 TraceCheckUtils]: 153: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,711 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:38,711 INFO L273 TraceCheckUtils]: 155: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,712 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:38,712 INFO L273 TraceCheckUtils]: 157: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,712 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:38,712 INFO L273 TraceCheckUtils]: 159: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,712 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:38,712 INFO L273 TraceCheckUtils]: 161: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,712 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:38,712 INFO L273 TraceCheckUtils]: 163: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,712 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:38,712 INFO L273 TraceCheckUtils]: 165: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,713 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:38,713 INFO L273 TraceCheckUtils]: 167: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:38,713 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:38,713 INFO L273 TraceCheckUtils]: 169: Hoare triple {26241#true} assume !(~i~0 < 1000); {26241#true} is VALID [2018-11-23 12:25:38,713 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:38,713 INFO L273 TraceCheckUtils]: 171: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:25:38,713 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26241#true} {26242#false} #74#return; {26242#false} is VALID [2018-11-23 12:25:38,713 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:38,713 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:38,713 INFO L273 TraceCheckUtils]: 175: Hoare triple {26242#false} assume !false; {26242#false} is VALID [2018-11-23 12:25:38,728 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:38,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:38,728 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:38,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:25:38,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 12:25:38,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:25:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:39,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:39,546 INFO L256 TraceCheckUtils]: 0: Hoare triple {26241#true} call ULTIMATE.init(); {26241#true} is VALID [2018-11-23 12:25:39,547 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:39,547 INFO L273 TraceCheckUtils]: 2: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:25:39,547 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26241#true} {26241#true} #66#return; {26241#true} is VALID [2018-11-23 12:25:39,547 INFO L256 TraceCheckUtils]: 4: Hoare triple {26241#true} call #t~ret13 := main(); {26241#true} is VALID [2018-11-23 12:25:39,547 INFO L273 TraceCheckUtils]: 5: Hoare triple {26241#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26241#true} is VALID [2018-11-23 12:25:39,548 INFO L273 TraceCheckUtils]: 6: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,548 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:39,548 INFO L273 TraceCheckUtils]: 8: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,548 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:39,548 INFO L273 TraceCheckUtils]: 10: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,549 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:39,549 INFO L273 TraceCheckUtils]: 12: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,549 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:39,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,549 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:39,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,549 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:39,549 INFO L273 TraceCheckUtils]: 18: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,549 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:39,549 INFO L273 TraceCheckUtils]: 20: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,550 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:39,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,550 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:39,550 INFO L273 TraceCheckUtils]: 24: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,550 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:39,550 INFO L273 TraceCheckUtils]: 26: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,550 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:39,550 INFO L273 TraceCheckUtils]: 28: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,550 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:39,551 INFO L273 TraceCheckUtils]: 30: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,551 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:39,551 INFO L273 TraceCheckUtils]: 32: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,551 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:39,551 INFO L273 TraceCheckUtils]: 34: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,551 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:39,551 INFO L273 TraceCheckUtils]: 36: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,551 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:39,551 INFO L273 TraceCheckUtils]: 38: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,551 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:39,552 INFO L273 TraceCheckUtils]: 40: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,552 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:39,552 INFO L273 TraceCheckUtils]: 42: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,552 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:39,552 INFO L273 TraceCheckUtils]: 44: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,552 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:39,552 INFO L273 TraceCheckUtils]: 46: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,552 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:39,552 INFO L273 TraceCheckUtils]: 48: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,552 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:39,553 INFO L273 TraceCheckUtils]: 50: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,553 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:39,553 INFO L273 TraceCheckUtils]: 52: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,553 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:39,553 INFO L273 TraceCheckUtils]: 54: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,553 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:39,553 INFO L273 TraceCheckUtils]: 56: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,553 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:39,553 INFO L273 TraceCheckUtils]: 58: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,553 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:39,554 INFO L273 TraceCheckUtils]: 60: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,554 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:39,554 INFO L273 TraceCheckUtils]: 62: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,554 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:39,554 INFO L273 TraceCheckUtils]: 64: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,554 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:39,554 INFO L273 TraceCheckUtils]: 66: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,554 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:39,554 INFO L273 TraceCheckUtils]: 68: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,554 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:39,555 INFO L273 TraceCheckUtils]: 70: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:39,555 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:39,555 INFO L273 TraceCheckUtils]: 72: Hoare triple {26241#true} assume !(~i~1 < 1000); {26241#true} is VALID [2018-11-23 12:25:39,555 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:39,555 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:39,555 INFO L273 TraceCheckUtils]: 75: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,555 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:39,555 INFO L273 TraceCheckUtils]: 77: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,555 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:39,556 INFO L273 TraceCheckUtils]: 79: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,556 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:39,556 INFO L273 TraceCheckUtils]: 81: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,556 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:39,556 INFO L273 TraceCheckUtils]: 83: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,556 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:39,556 INFO L273 TraceCheckUtils]: 85: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,556 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:39,556 INFO L273 TraceCheckUtils]: 87: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,556 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:39,557 INFO L273 TraceCheckUtils]: 89: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,557 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:39,557 INFO L273 TraceCheckUtils]: 91: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,557 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:39,557 INFO L273 TraceCheckUtils]: 93: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,557 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:39,557 INFO L273 TraceCheckUtils]: 95: Hoare triple {26241#true} assume !(~i~0 < 1000); {26241#true} is VALID [2018-11-23 12:25:39,557 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:39,557 INFO L273 TraceCheckUtils]: 97: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:25:39,557 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26241#true} {26241#true} #70#return; {26241#true} is VALID [2018-11-23 12:25:39,558 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:39,558 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:39,558 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:39,558 INFO L273 TraceCheckUtils]: 102: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,558 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:39,558 INFO L273 TraceCheckUtils]: 104: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,558 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:39,558 INFO L273 TraceCheckUtils]: 106: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,558 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:39,558 INFO L273 TraceCheckUtils]: 108: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,559 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:39,559 INFO L273 TraceCheckUtils]: 110: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,559 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:39,559 INFO L273 TraceCheckUtils]: 112: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,559 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:39,559 INFO L273 TraceCheckUtils]: 114: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,559 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:39,559 INFO L273 TraceCheckUtils]: 116: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,559 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:39,559 INFO L273 TraceCheckUtils]: 118: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,560 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:39,560 INFO L273 TraceCheckUtils]: 120: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:39,560 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:39,560 INFO L273 TraceCheckUtils]: 122: Hoare triple {26241#true} assume !(~i~0 < 1000); {26241#true} is VALID [2018-11-23 12:25:39,560 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:39,560 INFO L273 TraceCheckUtils]: 124: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:25:39,560 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26241#true} {26241#true} #72#return; {26241#true} is VALID [2018-11-23 12:25:39,561 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:39,561 INFO L273 TraceCheckUtils]: 127: Hoare triple {26658#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:39,562 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:39,562 INFO L273 TraceCheckUtils]: 129: Hoare triple {26665#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:39,562 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:39,563 INFO L273 TraceCheckUtils]: 131: Hoare triple {26672#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:39,563 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:39,563 INFO L273 TraceCheckUtils]: 133: Hoare triple {26679#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:39,564 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:39,564 INFO L273 TraceCheckUtils]: 135: Hoare triple {26686#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:39,565 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:39,566 INFO L273 TraceCheckUtils]: 137: Hoare triple {26693#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:39,566 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:39,567 INFO L273 TraceCheckUtils]: 139: Hoare triple {26700#(<= main_~i~2 6)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:39,568 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:39,568 INFO L273 TraceCheckUtils]: 141: Hoare triple {26707#(<= main_~i~2 7)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:39,569 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:39,569 INFO L273 TraceCheckUtils]: 143: Hoare triple {26714#(<= main_~i~2 8)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:39,570 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:39,571 INFO L273 TraceCheckUtils]: 145: Hoare triple {26721#(<= main_~i~2 9)} assume !(~i~2 < 999); {26242#false} is VALID [2018-11-23 12:25:39,571 INFO L273 TraceCheckUtils]: 146: Hoare triple {26242#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:25:39,571 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:39,571 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:39,571 INFO L273 TraceCheckUtils]: 149: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:39,572 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:39,572 INFO L273 TraceCheckUtils]: 151: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:39,572 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:39,572 INFO L273 TraceCheckUtils]: 153: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:39,572 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:39,573 INFO L273 TraceCheckUtils]: 155: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:39,573 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:39,573 INFO L273 TraceCheckUtils]: 157: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:39,573 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:39,573 INFO L273 TraceCheckUtils]: 159: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:39,573 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:39,574 INFO L273 TraceCheckUtils]: 161: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:39,574 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:39,574 INFO L273 TraceCheckUtils]: 163: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:39,574 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:39,574 INFO L273 TraceCheckUtils]: 165: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:39,574 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:39,574 INFO L273 TraceCheckUtils]: 167: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:39,574 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:39,574 INFO L273 TraceCheckUtils]: 169: Hoare triple {26242#false} assume !(~i~0 < 1000); {26242#false} is VALID [2018-11-23 12:25:39,575 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:39,575 INFO L273 TraceCheckUtils]: 171: Hoare triple {26242#false} assume true; {26242#false} is VALID [2018-11-23 12:25:39,575 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26242#false} {26242#false} #74#return; {26242#false} is VALID [2018-11-23 12:25:39,575 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:39,575 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:39,575 INFO L273 TraceCheckUtils]: 175: Hoare triple {26242#false} assume !false; {26242#false} is VALID [2018-11-23 12:25:39,587 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:39,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:39,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2018-11-23 12:25:39,608 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:25:39,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:39,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:25:39,742 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:39,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:25:39,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:25:39,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:25:39,744 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2018-11-23 12:25:41,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:41,143 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2018-11-23 12:25:41,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:25:41,144 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:25:41,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:41,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:25:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:25:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:25:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:25:41,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 141 transitions. [2018-11-23 12:25:41,287 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:41,290 INFO L225 Difference]: With dead ends: 187 [2018-11-23 12:25:41,290 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 12:25:41,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:25:41,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 12:25:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-23 12:25:41,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:41,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-23 12:25:41,632 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-23 12:25:41,632 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-23 12:25:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:41,634 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:25:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:25:41,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:41,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:41,635 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-23 12:25:41,635 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-23 12:25:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:41,637 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:25:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:25:41,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:41,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:41,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:41,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 12:25:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-11-23 12:25:41,639 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2018-11-23 12:25:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:41,640 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-11-23 12:25:41,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:25:41,640 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-23 12:25:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-23 12:25:41,640 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:41,641 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:41,641 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:41,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:41,641 INFO L82 PathProgramCache]: Analyzing trace with hash 854412647, now seen corresponding path program 34 times [2018-11-23 12:25:41,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:41,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:41,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:41,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:25:41,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:42,383 INFO L256 TraceCheckUtils]: 0: Hoare triple {27553#true} call ULTIMATE.init(); {27553#true} is VALID [2018-11-23 12:25:42,383 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:42,383 INFO L273 TraceCheckUtils]: 2: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:25:42,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27553#true} {27553#true} #66#return; {27553#true} is VALID [2018-11-23 12:25:42,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {27553#true} call #t~ret13 := main(); {27553#true} is VALID [2018-11-23 12:25:42,384 INFO L273 TraceCheckUtils]: 5: Hoare triple {27553#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:42,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {27555#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:42,385 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:42,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {27556#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:42,386 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:42,386 INFO L273 TraceCheckUtils]: 10: Hoare triple {27557#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:42,386 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:42,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {27558#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:42,387 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:42,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {27559#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:42,389 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:42,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {27560#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:42,390 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:42,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {27561#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:42,391 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:42,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {27562#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:42,392 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:42,393 INFO L273 TraceCheckUtils]: 22: Hoare triple {27563#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:42,393 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:42,394 INFO L273 TraceCheckUtils]: 24: Hoare triple {27564#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:42,395 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:42,395 INFO L273 TraceCheckUtils]: 26: Hoare triple {27565#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:42,396 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:42,396 INFO L273 TraceCheckUtils]: 28: Hoare triple {27566#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:42,397 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:42,398 INFO L273 TraceCheckUtils]: 30: Hoare triple {27567#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:42,398 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:42,399 INFO L273 TraceCheckUtils]: 32: Hoare triple {27568#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:42,400 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:42,400 INFO L273 TraceCheckUtils]: 34: Hoare triple {27569#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:42,401 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:42,401 INFO L273 TraceCheckUtils]: 36: Hoare triple {27570#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:42,402 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:42,403 INFO L273 TraceCheckUtils]: 38: Hoare triple {27571#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:42,403 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:42,404 INFO L273 TraceCheckUtils]: 40: Hoare triple {27572#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:42,405 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:42,405 INFO L273 TraceCheckUtils]: 42: Hoare triple {27573#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:42,406 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:42,406 INFO L273 TraceCheckUtils]: 44: Hoare triple {27574#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:42,407 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:42,408 INFO L273 TraceCheckUtils]: 46: Hoare triple {27575#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:42,408 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:42,409 INFO L273 TraceCheckUtils]: 48: Hoare triple {27576#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:42,410 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:42,410 INFO L273 TraceCheckUtils]: 50: Hoare triple {27577#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:42,411 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:42,411 INFO L273 TraceCheckUtils]: 52: Hoare triple {27578#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:42,412 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:42,413 INFO L273 TraceCheckUtils]: 54: Hoare triple {27579#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:42,413 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:42,414 INFO L273 TraceCheckUtils]: 56: Hoare triple {27580#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:42,415 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:42,415 INFO L273 TraceCheckUtils]: 58: Hoare triple {27581#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:42,416 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:42,416 INFO L273 TraceCheckUtils]: 60: Hoare triple {27582#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:42,417 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:42,418 INFO L273 TraceCheckUtils]: 62: Hoare triple {27583#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:42,418 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:42,419 INFO L273 TraceCheckUtils]: 64: Hoare triple {27584#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:42,420 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:42,420 INFO L273 TraceCheckUtils]: 66: Hoare triple {27585#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:42,421 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:42,421 INFO L273 TraceCheckUtils]: 68: Hoare triple {27586#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -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:42,422 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:42,423 INFO L273 TraceCheckUtils]: 70: Hoare triple {27587#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -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:42,423 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:42,424 INFO L273 TraceCheckUtils]: 72: Hoare triple {27588#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -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:42,425 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:42,425 INFO L273 TraceCheckUtils]: 74: Hoare triple {27589#(<= main_~i~1 34)} assume !(~i~1 < 1000); {27554#false} is VALID [2018-11-23 12:25:42,426 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:42,426 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:42,426 INFO L273 TraceCheckUtils]: 77: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,426 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:42,426 INFO L273 TraceCheckUtils]: 79: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,426 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:42,427 INFO L273 TraceCheckUtils]: 81: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,427 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:42,427 INFO L273 TraceCheckUtils]: 83: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,427 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:42,427 INFO L273 TraceCheckUtils]: 85: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,427 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:42,427 INFO L273 TraceCheckUtils]: 87: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,428 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:42,428 INFO L273 TraceCheckUtils]: 89: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,428 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:42,428 INFO L273 TraceCheckUtils]: 91: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,428 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:42,428 INFO L273 TraceCheckUtils]: 93: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,428 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:42,428 INFO L273 TraceCheckUtils]: 95: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,428 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:42,428 INFO L273 TraceCheckUtils]: 97: Hoare triple {27553#true} assume !(~i~0 < 1000); {27553#true} is VALID [2018-11-23 12:25:42,429 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:42,429 INFO L273 TraceCheckUtils]: 99: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:25:42,429 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27553#true} {27554#false} #70#return; {27554#false} is VALID [2018-11-23 12:25:42,429 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:42,429 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:42,429 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:42,429 INFO L273 TraceCheckUtils]: 104: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,429 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:42,429 INFO L273 TraceCheckUtils]: 106: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,429 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:42,430 INFO L273 TraceCheckUtils]: 108: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,430 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:42,430 INFO L273 TraceCheckUtils]: 110: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,430 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:42,430 INFO L273 TraceCheckUtils]: 112: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,430 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:42,430 INFO L273 TraceCheckUtils]: 114: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,430 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:42,430 INFO L273 TraceCheckUtils]: 116: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,431 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:42,431 INFO L273 TraceCheckUtils]: 118: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,431 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:42,431 INFO L273 TraceCheckUtils]: 120: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,431 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:42,431 INFO L273 TraceCheckUtils]: 122: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,431 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:42,431 INFO L273 TraceCheckUtils]: 124: Hoare triple {27553#true} assume !(~i~0 < 1000); {27553#true} is VALID [2018-11-23 12:25:42,431 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:42,431 INFO L273 TraceCheckUtils]: 126: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:25:42,432 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27553#true} {27554#false} #72#return; {27554#false} is VALID [2018-11-23 12:25:42,432 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:42,432 INFO L273 TraceCheckUtils]: 129: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,432 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:42,432 INFO L273 TraceCheckUtils]: 131: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,432 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:42,432 INFO L273 TraceCheckUtils]: 133: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,432 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:42,432 INFO L273 TraceCheckUtils]: 135: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,432 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:42,433 INFO L273 TraceCheckUtils]: 137: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,433 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:42,433 INFO L273 TraceCheckUtils]: 139: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,433 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:42,433 INFO L273 TraceCheckUtils]: 141: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,433 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:42,433 INFO L273 TraceCheckUtils]: 143: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,433 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:42,433 INFO L273 TraceCheckUtils]: 145: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,434 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:42,434 INFO L273 TraceCheckUtils]: 147: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,434 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:42,434 INFO L273 TraceCheckUtils]: 149: Hoare triple {27554#false} assume !(~i~2 < 999); {27554#false} is VALID [2018-11-23 12:25:42,434 INFO L273 TraceCheckUtils]: 150: Hoare triple {27554#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:25:42,434 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:42,434 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:42,434 INFO L273 TraceCheckUtils]: 153: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,434 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:42,434 INFO L273 TraceCheckUtils]: 155: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,435 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:42,435 INFO L273 TraceCheckUtils]: 157: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,435 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:42,435 INFO L273 TraceCheckUtils]: 159: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,435 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:42,435 INFO L273 TraceCheckUtils]: 161: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,435 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:42,435 INFO L273 TraceCheckUtils]: 163: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,435 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:42,435 INFO L273 TraceCheckUtils]: 165: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,436 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:42,436 INFO L273 TraceCheckUtils]: 167: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,436 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:42,436 INFO L273 TraceCheckUtils]: 169: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,436 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:42,436 INFO L273 TraceCheckUtils]: 171: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,436 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:42,436 INFO L273 TraceCheckUtils]: 173: Hoare triple {27553#true} assume !(~i~0 < 1000); {27553#true} is VALID [2018-11-23 12:25:42,436 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:42,436 INFO L273 TraceCheckUtils]: 175: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:25:42,437 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27553#true} {27554#false} #74#return; {27554#false} is VALID [2018-11-23 12:25:42,437 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:42,437 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:42,437 INFO L273 TraceCheckUtils]: 179: Hoare triple {27554#false} assume !false; {27554#false} is VALID [2018-11-23 12:25:42,452 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:42,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:42,452 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:42,462 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:25:42,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:25:42,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:25:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:42,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:42,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {27553#true} call ULTIMATE.init(); {27553#true} is VALID [2018-11-23 12:25:42,973 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:42,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:25:42,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27553#true} {27553#true} #66#return; {27553#true} is VALID [2018-11-23 12:25:42,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {27553#true} call #t~ret13 := main(); {27553#true} is VALID [2018-11-23 12:25:42,974 INFO L273 TraceCheckUtils]: 5: Hoare triple {27553#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27553#true} is VALID [2018-11-23 12:25:42,974 INFO L273 TraceCheckUtils]: 6: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,974 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:42,975 INFO L273 TraceCheckUtils]: 8: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,975 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:42,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,975 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:42,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,975 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:42,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,976 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:42,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,976 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:42,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,976 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:42,976 INFO L273 TraceCheckUtils]: 20: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,976 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:42,976 INFO L273 TraceCheckUtils]: 22: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,976 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:42,976 INFO L273 TraceCheckUtils]: 24: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,977 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:42,977 INFO L273 TraceCheckUtils]: 26: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,977 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:42,977 INFO L273 TraceCheckUtils]: 28: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,977 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:42,977 INFO L273 TraceCheckUtils]: 30: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,977 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:42,977 INFO L273 TraceCheckUtils]: 32: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,977 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:42,978 INFO L273 TraceCheckUtils]: 34: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,978 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:42,978 INFO L273 TraceCheckUtils]: 36: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,978 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:42,978 INFO L273 TraceCheckUtils]: 38: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,978 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:42,978 INFO L273 TraceCheckUtils]: 40: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,978 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:42,978 INFO L273 TraceCheckUtils]: 42: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,978 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:42,979 INFO L273 TraceCheckUtils]: 44: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,979 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:42,979 INFO L273 TraceCheckUtils]: 46: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,979 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:42,979 INFO L273 TraceCheckUtils]: 48: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,979 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:42,979 INFO L273 TraceCheckUtils]: 50: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,979 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:42,979 INFO L273 TraceCheckUtils]: 52: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,979 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:42,980 INFO L273 TraceCheckUtils]: 54: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,980 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:42,980 INFO L273 TraceCheckUtils]: 56: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,980 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:42,980 INFO L273 TraceCheckUtils]: 58: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,980 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:42,980 INFO L273 TraceCheckUtils]: 60: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,980 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:42,980 INFO L273 TraceCheckUtils]: 62: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,980 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:42,981 INFO L273 TraceCheckUtils]: 64: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,981 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:42,981 INFO L273 TraceCheckUtils]: 66: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,981 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:42,981 INFO L273 TraceCheckUtils]: 68: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,981 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:42,981 INFO L273 TraceCheckUtils]: 70: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,981 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:42,981 INFO L273 TraceCheckUtils]: 72: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:42,981 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:42,982 INFO L273 TraceCheckUtils]: 74: Hoare triple {27553#true} assume !(~i~1 < 1000); {27553#true} is VALID [2018-11-23 12:25:42,982 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:42,982 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:42,982 INFO L273 TraceCheckUtils]: 77: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,982 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:42,982 INFO L273 TraceCheckUtils]: 79: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,982 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:42,982 INFO L273 TraceCheckUtils]: 81: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,982 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:42,983 INFO L273 TraceCheckUtils]: 83: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,983 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:42,983 INFO L273 TraceCheckUtils]: 85: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,983 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:42,983 INFO L273 TraceCheckUtils]: 87: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,983 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:42,983 INFO L273 TraceCheckUtils]: 89: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,983 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:42,983 INFO L273 TraceCheckUtils]: 91: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,983 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:42,984 INFO L273 TraceCheckUtils]: 93: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,984 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:42,984 INFO L273 TraceCheckUtils]: 95: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,984 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:42,984 INFO L273 TraceCheckUtils]: 97: Hoare triple {27553#true} assume !(~i~0 < 1000); {27553#true} is VALID [2018-11-23 12:25:42,984 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:42,984 INFO L273 TraceCheckUtils]: 99: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:25:42,984 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27553#true} {27553#true} #70#return; {27553#true} is VALID [2018-11-23 12:25:42,984 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:42,984 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:42,985 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:42,985 INFO L273 TraceCheckUtils]: 104: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,985 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:42,985 INFO L273 TraceCheckUtils]: 106: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,985 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:42,985 INFO L273 TraceCheckUtils]: 108: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,985 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:42,985 INFO L273 TraceCheckUtils]: 110: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,985 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:42,985 INFO L273 TraceCheckUtils]: 112: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,986 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:42,986 INFO L273 TraceCheckUtils]: 114: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,986 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:42,986 INFO L273 TraceCheckUtils]: 116: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,986 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:42,986 INFO L273 TraceCheckUtils]: 118: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,986 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:42,986 INFO L273 TraceCheckUtils]: 120: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,986 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:42,987 INFO L273 TraceCheckUtils]: 122: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:42,987 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:42,987 INFO L273 TraceCheckUtils]: 124: Hoare triple {27553#true} assume !(~i~0 < 1000); {27553#true} is VALID [2018-11-23 12:25:42,987 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:42,987 INFO L273 TraceCheckUtils]: 126: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:25:42,987 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27553#true} {27553#true} #72#return; {27553#true} is VALID [2018-11-23 12:25:42,988 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:42,988 INFO L273 TraceCheckUtils]: 129: Hoare triple {27977#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,988 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:42,989 INFO L273 TraceCheckUtils]: 131: Hoare triple {27984#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,989 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:42,990 INFO L273 TraceCheckUtils]: 133: Hoare triple {27991#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,990 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:42,990 INFO L273 TraceCheckUtils]: 135: Hoare triple {27998#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,991 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:42,991 INFO L273 TraceCheckUtils]: 137: Hoare triple {28005#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,992 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:42,992 INFO L273 TraceCheckUtils]: 139: Hoare triple {28012#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,993 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:42,993 INFO L273 TraceCheckUtils]: 141: Hoare triple {28019#(<= main_~i~2 6)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,994 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:42,995 INFO L273 TraceCheckUtils]: 143: Hoare triple {28026#(<= main_~i~2 7)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,995 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:42,996 INFO L273 TraceCheckUtils]: 145: Hoare triple {28033#(<= main_~i~2 8)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,997 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:42,997 INFO L273 TraceCheckUtils]: 147: Hoare triple {28040#(<= main_~i~2 9)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:42,998 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:42,999 INFO L273 TraceCheckUtils]: 149: Hoare triple {28047#(<= main_~i~2 10)} assume !(~i~2 < 999); {27554#false} is VALID [2018-11-23 12:25:42,999 INFO L273 TraceCheckUtils]: 150: Hoare triple {27554#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:25:42,999 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:42,999 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:42,999 INFO L273 TraceCheckUtils]: 153: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:42,999 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:43,000 INFO L273 TraceCheckUtils]: 155: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:43,000 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:43,000 INFO L273 TraceCheckUtils]: 157: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:43,000 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:43,000 INFO L273 TraceCheckUtils]: 159: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:43,001 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:43,001 INFO L273 TraceCheckUtils]: 161: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:43,001 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:43,001 INFO L273 TraceCheckUtils]: 163: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:43,001 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:43,001 INFO L273 TraceCheckUtils]: 165: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:43,002 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:43,002 INFO L273 TraceCheckUtils]: 167: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:43,002 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:43,002 INFO L273 TraceCheckUtils]: 169: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:43,002 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:43,002 INFO L273 TraceCheckUtils]: 171: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:43,002 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:43,003 INFO L273 TraceCheckUtils]: 173: Hoare triple {27554#false} assume !(~i~0 < 1000); {27554#false} is VALID [2018-11-23 12:25:43,003 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:43,003 INFO L273 TraceCheckUtils]: 175: Hoare triple {27554#false} assume true; {27554#false} is VALID [2018-11-23 12:25:43,003 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27554#false} {27554#false} #74#return; {27554#false} is VALID [2018-11-23 12:25:43,003 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,003 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,003 INFO L273 TraceCheckUtils]: 179: Hoare triple {27554#false} assume !false; {27554#false} is VALID [2018-11-23 12:25:43,015 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:43,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:43,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2018-11-23 12:25:43,036 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:25:43,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:43,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:25:43,176 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:43,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:25:43,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:25:43,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:25:43,178 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2018-11-23 12:25:43,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:43,702 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-11-23 12:25:43,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:25:43,702 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:25:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:25:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:25:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:25:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:25:43,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 145 transitions. [2018-11-23 12:25:44,161 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:44,164 INFO L225 Difference]: With dead ends: 193 [2018-11-23 12:25:44,164 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 12:25:44,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:25:44,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 12:25:44,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-23 12:25:44,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:44,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 135 states. [2018-11-23 12:25:44,219 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 135 states. [2018-11-23 12:25:44,219 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 135 states. [2018-11-23 12:25:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:44,221 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:25:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:25:44,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:44,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:44,222 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 137 states. [2018-11-23 12:25:44,222 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 137 states. [2018-11-23 12:25:44,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:44,224 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:25:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:25:44,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:44,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:44,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:44,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 12:25:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-11-23 12:25:44,226 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2018-11-23 12:25:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:44,226 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-11-23 12:25:44,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:25:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-23 12:25:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 12:25:44,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:44,227 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:44,227 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:44,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:44,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1113930553, now seen corresponding path program 35 times [2018-11-23 12:25:44,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:44,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:44,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:44,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:25:44,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:45,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {28902#true} call ULTIMATE.init(); {28902#true} is VALID [2018-11-23 12:25:45,019 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:45,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:25:45,019 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28902#true} {28902#true} #66#return; {28902#true} is VALID [2018-11-23 12:25:45,019 INFO L256 TraceCheckUtils]: 4: Hoare triple {28902#true} call #t~ret13 := main(); {28902#true} is VALID [2018-11-23 12:25:45,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {28902#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:45,020 INFO L273 TraceCheckUtils]: 6: Hoare triple {28904#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:45,020 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:45,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {28905#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:45,022 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:45,022 INFO L273 TraceCheckUtils]: 10: Hoare triple {28906#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:45,023 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:45,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {28907#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:45,024 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:45,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {28908#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:45,025 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:45,026 INFO L273 TraceCheckUtils]: 16: Hoare triple {28909#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:45,026 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:45,027 INFO L273 TraceCheckUtils]: 18: Hoare triple {28910#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:45,027 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:45,028 INFO L273 TraceCheckUtils]: 20: Hoare triple {28911#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:45,029 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:45,029 INFO L273 TraceCheckUtils]: 22: Hoare triple {28912#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:45,030 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:45,030 INFO L273 TraceCheckUtils]: 24: Hoare triple {28913#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:45,031 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:45,031 INFO L273 TraceCheckUtils]: 26: Hoare triple {28914#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:45,032 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:45,033 INFO L273 TraceCheckUtils]: 28: Hoare triple {28915#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:45,033 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:45,034 INFO L273 TraceCheckUtils]: 30: Hoare triple {28916#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:45,034 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:45,035 INFO L273 TraceCheckUtils]: 32: Hoare triple {28917#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:45,036 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:45,036 INFO L273 TraceCheckUtils]: 34: Hoare triple {28918#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:45,037 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:45,037 INFO L273 TraceCheckUtils]: 36: Hoare triple {28919#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:45,038 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:45,038 INFO L273 TraceCheckUtils]: 38: Hoare triple {28920#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:45,039 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:45,040 INFO L273 TraceCheckUtils]: 40: Hoare triple {28921#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:45,040 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:45,041 INFO L273 TraceCheckUtils]: 42: Hoare triple {28922#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:45,041 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:45,042 INFO L273 TraceCheckUtils]: 44: Hoare triple {28923#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:45,043 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:45,043 INFO L273 TraceCheckUtils]: 46: Hoare triple {28924#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:45,044 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:45,044 INFO L273 TraceCheckUtils]: 48: Hoare triple {28925#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:45,045 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:45,045 INFO L273 TraceCheckUtils]: 50: Hoare triple {28926#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:45,046 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:45,047 INFO L273 TraceCheckUtils]: 52: Hoare triple {28927#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:45,047 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:45,048 INFO L273 TraceCheckUtils]: 54: Hoare triple {28928#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:45,048 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:45,049 INFO L273 TraceCheckUtils]: 56: Hoare triple {28929#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:45,050 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:45,050 INFO L273 TraceCheckUtils]: 58: Hoare triple {28930#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:45,051 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:45,051 INFO L273 TraceCheckUtils]: 60: Hoare triple {28931#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:45,052 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:45,052 INFO L273 TraceCheckUtils]: 62: Hoare triple {28932#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:45,053 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:45,054 INFO L273 TraceCheckUtils]: 64: Hoare triple {28933#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:45,054 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:45,055 INFO L273 TraceCheckUtils]: 66: Hoare triple {28934#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:45,055 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:45,056 INFO L273 TraceCheckUtils]: 68: Hoare triple {28935#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -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:45,057 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:45,057 INFO L273 TraceCheckUtils]: 70: Hoare triple {28936#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -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:45,058 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:45,058 INFO L273 TraceCheckUtils]: 72: Hoare triple {28937#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -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:45,059 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:45,059 INFO L273 TraceCheckUtils]: 74: Hoare triple {28938#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -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:45,060 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:45,061 INFO L273 TraceCheckUtils]: 76: Hoare triple {28939#(<= main_~i~1 35)} assume !(~i~1 < 1000); {28903#false} is VALID [2018-11-23 12:25:45,061 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:45,061 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:45,061 INFO L273 TraceCheckUtils]: 79: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,061 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:45,062 INFO L273 TraceCheckUtils]: 81: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,062 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:45,062 INFO L273 TraceCheckUtils]: 83: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,062 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:45,062 INFO L273 TraceCheckUtils]: 85: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,062 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:45,063 INFO L273 TraceCheckUtils]: 87: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,063 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:45,063 INFO L273 TraceCheckUtils]: 89: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,063 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:45,063 INFO L273 TraceCheckUtils]: 91: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,063 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:45,063 INFO L273 TraceCheckUtils]: 93: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,063 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:45,064 INFO L273 TraceCheckUtils]: 95: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,064 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:45,064 INFO L273 TraceCheckUtils]: 97: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,064 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:45,064 INFO L273 TraceCheckUtils]: 99: Hoare triple {28902#true} assume !(~i~0 < 1000); {28902#true} is VALID [2018-11-23 12:25:45,064 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:45,064 INFO L273 TraceCheckUtils]: 101: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:25:45,064 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28902#true} {28903#false} #70#return; {28903#false} is VALID [2018-11-23 12:25:45,064 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:45,065 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:45,065 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:45,065 INFO L273 TraceCheckUtils]: 106: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,065 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:45,065 INFO L273 TraceCheckUtils]: 108: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,065 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:45,065 INFO L273 TraceCheckUtils]: 110: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,065 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:45,065 INFO L273 TraceCheckUtils]: 112: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,065 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:45,066 INFO L273 TraceCheckUtils]: 114: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,066 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:45,066 INFO L273 TraceCheckUtils]: 116: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,066 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:45,066 INFO L273 TraceCheckUtils]: 118: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,066 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:45,066 INFO L273 TraceCheckUtils]: 120: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,066 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:45,066 INFO L273 TraceCheckUtils]: 122: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,066 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:45,067 INFO L273 TraceCheckUtils]: 124: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,067 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:45,067 INFO L273 TraceCheckUtils]: 126: Hoare triple {28902#true} assume !(~i~0 < 1000); {28902#true} is VALID [2018-11-23 12:25:45,067 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:45,067 INFO L273 TraceCheckUtils]: 128: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:25:45,067 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28902#true} {28903#false} #72#return; {28903#false} is VALID [2018-11-23 12:25:45,067 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:45,067 INFO L273 TraceCheckUtils]: 131: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:45,067 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:45,067 INFO L273 TraceCheckUtils]: 133: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:45,068 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:45,068 INFO L273 TraceCheckUtils]: 135: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:45,068 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:45,068 INFO L273 TraceCheckUtils]: 137: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:45,068 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:45,068 INFO L273 TraceCheckUtils]: 139: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:45,068 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:45,068 INFO L273 TraceCheckUtils]: 141: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:45,068 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:45,068 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:45,069 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:45,069 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:45,069 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:45,069 INFO L273 TraceCheckUtils]: 147: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:45,069 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:45,069 INFO L273 TraceCheckUtils]: 149: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:45,069 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:45,069 INFO L273 TraceCheckUtils]: 151: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:45,069 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:45,069 INFO L273 TraceCheckUtils]: 153: Hoare triple {28903#false} assume !(~i~2 < 999); {28903#false} is VALID [2018-11-23 12:25:45,070 INFO L273 TraceCheckUtils]: 154: Hoare triple {28903#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:25:45,070 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:45,070 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:45,070 INFO L273 TraceCheckUtils]: 157: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,070 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:45,070 INFO L273 TraceCheckUtils]: 159: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,070 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:45,070 INFO L273 TraceCheckUtils]: 161: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,070 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:45,070 INFO L273 TraceCheckUtils]: 163: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,071 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:45,071 INFO L273 TraceCheckUtils]: 165: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,071 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:45,071 INFO L273 TraceCheckUtils]: 167: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,071 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:45,071 INFO L273 TraceCheckUtils]: 169: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,071 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:45,071 INFO L273 TraceCheckUtils]: 171: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,071 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:45,071 INFO L273 TraceCheckUtils]: 173: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,072 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:45,072 INFO L273 TraceCheckUtils]: 175: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:45,072 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:45,072 INFO L273 TraceCheckUtils]: 177: Hoare triple {28902#true} assume !(~i~0 < 1000); {28902#true} is VALID [2018-11-23 12:25:45,072 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:45,072 INFO L273 TraceCheckUtils]: 179: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:25:45,072 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28902#true} {28903#false} #74#return; {28903#false} is VALID [2018-11-23 12:25:45,072 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:45,072 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:45,072 INFO L273 TraceCheckUtils]: 183: Hoare triple {28903#false} assume !false; {28903#false} is VALID [2018-11-23 12:25:45,088 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:45,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:45,088 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:45,097 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:25:51,974 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2018-11-23 12:25:51,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:25:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:52,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:52,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {28902#true} call ULTIMATE.init(); {28902#true} is VALID [2018-11-23 12:25:52,462 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:52,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:25:52,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28902#true} {28902#true} #66#return; {28902#true} is VALID [2018-11-23 12:25:52,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {28902#true} call #t~ret13 := main(); {28902#true} is VALID [2018-11-23 12:25:52,462 INFO L273 TraceCheckUtils]: 5: Hoare triple {28902#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {28902#true} is VALID [2018-11-23 12:25:52,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,463 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:25:52,463 INFO L273 TraceCheckUtils]: 8: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,463 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:25:52,463 INFO L273 TraceCheckUtils]: 10: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,463 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:25:52,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,464 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:25:52,464 INFO L273 TraceCheckUtils]: 14: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,464 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:25:52,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,464 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:25:52,464 INFO L273 TraceCheckUtils]: 18: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,464 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:25:52,464 INFO L273 TraceCheckUtils]: 20: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,464 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:25:52,464 INFO L273 TraceCheckUtils]: 22: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,465 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:25:52,465 INFO L273 TraceCheckUtils]: 24: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,465 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:25:52,465 INFO L273 TraceCheckUtils]: 26: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,465 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:25:52,465 INFO L273 TraceCheckUtils]: 28: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,465 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:25:52,465 INFO L273 TraceCheckUtils]: 30: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,465 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:25:52,466 INFO L273 TraceCheckUtils]: 32: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,466 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:25:52,466 INFO L273 TraceCheckUtils]: 34: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,466 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:25:52,466 INFO L273 TraceCheckUtils]: 36: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,466 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:25:52,466 INFO L273 TraceCheckUtils]: 38: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,466 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:25:52,466 INFO L273 TraceCheckUtils]: 40: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,466 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:25:52,467 INFO L273 TraceCheckUtils]: 42: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,467 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:25:52,467 INFO L273 TraceCheckUtils]: 44: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,467 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:25:52,467 INFO L273 TraceCheckUtils]: 46: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,467 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:25:52,467 INFO L273 TraceCheckUtils]: 48: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,467 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:25:52,467 INFO L273 TraceCheckUtils]: 50: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,467 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:25:52,468 INFO L273 TraceCheckUtils]: 52: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,468 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:25:52,468 INFO L273 TraceCheckUtils]: 54: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,468 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:25:52,468 INFO L273 TraceCheckUtils]: 56: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,468 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:25:52,468 INFO L273 TraceCheckUtils]: 58: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,468 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:25:52,468 INFO L273 TraceCheckUtils]: 60: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,469 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:25:52,469 INFO L273 TraceCheckUtils]: 62: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,469 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:25:52,469 INFO L273 TraceCheckUtils]: 64: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,469 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:25:52,469 INFO L273 TraceCheckUtils]: 66: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,469 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:25:52,469 INFO L273 TraceCheckUtils]: 68: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,469 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:25:52,469 INFO L273 TraceCheckUtils]: 70: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,470 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:25:52,470 INFO L273 TraceCheckUtils]: 72: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,470 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:25:52,470 INFO L273 TraceCheckUtils]: 74: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:25:52,470 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:25:52,470 INFO L273 TraceCheckUtils]: 76: Hoare triple {28902#true} assume !(~i~1 < 1000); {28902#true} is VALID [2018-11-23 12:25:52,470 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:25:52,471 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:25:52,471 INFO L273 TraceCheckUtils]: 79: Hoare triple {29177#(<= bAnd_~i~0 1)} assume !!(~i~0 < 1000);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:25:52,471 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:25:52,472 INFO L273 TraceCheckUtils]: 81: Hoare triple {29184#(<= bAnd_~i~0 2)} assume !!(~i~0 < 1000);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:25:52,472 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:25:52,472 INFO L273 TraceCheckUtils]: 83: Hoare triple {29191#(<= bAnd_~i~0 3)} assume !!(~i~0 < 1000);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:25:52,473 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:25:52,473 INFO L273 TraceCheckUtils]: 85: Hoare triple {29198#(<= bAnd_~i~0 4)} assume !!(~i~0 < 1000);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:25:52,474 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:25:52,474 INFO L273 TraceCheckUtils]: 87: Hoare triple {29205#(<= bAnd_~i~0 5)} assume !!(~i~0 < 1000);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:25:52,475 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:25:52,476 INFO L273 TraceCheckUtils]: 89: Hoare triple {29212#(<= bAnd_~i~0 6)} assume !!(~i~0 < 1000);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:25:52,476 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:25:52,477 INFO L273 TraceCheckUtils]: 91: Hoare triple {29219#(<= bAnd_~i~0 7)} assume !!(~i~0 < 1000);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:25:52,478 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:25:52,478 INFO L273 TraceCheckUtils]: 93: Hoare triple {29226#(<= bAnd_~i~0 8)} assume !!(~i~0 < 1000);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:25:52,479 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:25:52,479 INFO L273 TraceCheckUtils]: 95: Hoare triple {29233#(<= bAnd_~i~0 9)} assume !!(~i~0 < 1000);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:25:52,480 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:25:52,481 INFO L273 TraceCheckUtils]: 97: Hoare triple {29240#(<= bAnd_~i~0 10)} assume !!(~i~0 < 1000);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:25:52,481 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:25:52,482 INFO L273 TraceCheckUtils]: 99: Hoare triple {29247#(<= bAnd_~i~0 11)} assume !(~i~0 < 1000); {28903#false} is VALID [2018-11-23 12:25:52,482 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:25:52,482 INFO L273 TraceCheckUtils]: 101: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:25:52,482 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28903#false} {28902#true} #70#return; {28903#false} is VALID [2018-11-23 12:25:52,483 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:52,483 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:25:52,483 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:25:52,483 INFO L273 TraceCheckUtils]: 106: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,483 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:25:52,483 INFO L273 TraceCheckUtils]: 108: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,484 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:25:52,484 INFO L273 TraceCheckUtils]: 110: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,484 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:25:52,484 INFO L273 TraceCheckUtils]: 112: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,484 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:25:52,484 INFO L273 TraceCheckUtils]: 114: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,484 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:25:52,485 INFO L273 TraceCheckUtils]: 116: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,485 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:25:52,485 INFO L273 TraceCheckUtils]: 118: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,485 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:25:52,485 INFO L273 TraceCheckUtils]: 120: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,485 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:25:52,486 INFO L273 TraceCheckUtils]: 122: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,486 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:25:52,486 INFO L273 TraceCheckUtils]: 124: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,486 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:25:52,486 INFO L273 TraceCheckUtils]: 126: Hoare triple {28903#false} assume !(~i~0 < 1000); {28903#false} is VALID [2018-11-23 12:25:52,486 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:25:52,486 INFO L273 TraceCheckUtils]: 128: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:25:52,487 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28903#false} {28903#false} #72#return; {28903#false} is VALID [2018-11-23 12:25:52,487 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:52,487 INFO L273 TraceCheckUtils]: 131: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:52,487 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:52,487 INFO L273 TraceCheckUtils]: 133: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:52,487 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:52,487 INFO L273 TraceCheckUtils]: 135: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:52,487 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:52,487 INFO L273 TraceCheckUtils]: 137: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:52,487 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:52,488 INFO L273 TraceCheckUtils]: 139: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:52,488 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:52,488 INFO L273 TraceCheckUtils]: 141: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:52,488 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:52,488 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:52,488 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:52,488 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:52,488 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:52,488 INFO L273 TraceCheckUtils]: 147: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:52,489 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:52,489 INFO L273 TraceCheckUtils]: 149: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:52,489 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:52,489 INFO L273 TraceCheckUtils]: 151: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:52,489 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:52,489 INFO L273 TraceCheckUtils]: 153: Hoare triple {28903#false} assume !(~i~2 < 999); {28903#false} is VALID [2018-11-23 12:25:52,489 INFO L273 TraceCheckUtils]: 154: Hoare triple {28903#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:25:52,489 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:25:52,489 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:25:52,490 INFO L273 TraceCheckUtils]: 157: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,490 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:25:52,490 INFO L273 TraceCheckUtils]: 159: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,490 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:25:52,490 INFO L273 TraceCheckUtils]: 161: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,490 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:25:52,490 INFO L273 TraceCheckUtils]: 163: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,490 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:25:52,490 INFO L273 TraceCheckUtils]: 165: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,490 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:25:52,491 INFO L273 TraceCheckUtils]: 167: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,491 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:25:52,491 INFO L273 TraceCheckUtils]: 169: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,491 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:25:52,491 INFO L273 TraceCheckUtils]: 171: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,491 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:25:52,491 INFO L273 TraceCheckUtils]: 173: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,491 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:25:52,491 INFO L273 TraceCheckUtils]: 175: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:25:52,491 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:25:52,492 INFO L273 TraceCheckUtils]: 177: Hoare triple {28903#false} assume !(~i~0 < 1000); {28903#false} is VALID [2018-11-23 12:25:52,492 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:25:52,492 INFO L273 TraceCheckUtils]: 179: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:25:52,492 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28903#false} {28903#false} #74#return; {28903#false} is VALID [2018-11-23 12:25:52,492 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:52,492 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:52,492 INFO L273 TraceCheckUtils]: 183: Hoare triple {28903#false} assume !false; {28903#false} is VALID [2018-11-23 12:25:52,505 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:25:52,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:52,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2018-11-23 12:25:52,529 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:25:52,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:52,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:25:52,669 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:52,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:25:52,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:25:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:25:52,671 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2018-11-23 12:25:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:53,501 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2018-11-23 12:25:53,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:25:53,501 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:25:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:25:53,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:25:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:25:53,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:25:53,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 150 transitions. [2018-11-23 12:25:53,660 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:25:53,663 INFO L225 Difference]: With dead ends: 199 [2018-11-23 12:25:53,663 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 12:25:53,664 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:25:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 12:25:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-23 12:25:53,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:53,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 139 states. [2018-11-23 12:25:53,726 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 139 states. [2018-11-23 12:25:53,726 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 139 states. [2018-11-23 12:25:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:53,729 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:25:53,730 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:25:53,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:53,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:53,730 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 141 states. [2018-11-23 12:25:53,730 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 141 states. [2018-11-23 12:25:53,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:53,733 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:25:53,733 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:25:53,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:53,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:53,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:53,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 12:25:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2018-11-23 12:25:53,736 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2018-11-23 12:25:53,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:53,737 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2018-11-23 12:25:53,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:25:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:25:53,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-23 12:25:53,738 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:53,738 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:25:53,738 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:53,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:53,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2006594855, now seen corresponding path program 36 times [2018-11-23 12:25:53,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:53,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:53,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:53,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:25:53,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:55,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {30287#true} call ULTIMATE.init(); {30287#true} is VALID [2018-11-23 12:25:55,285 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:25:55,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:25:55,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30287#true} {30287#true} #66#return; {30287#true} is VALID [2018-11-23 12:25:55,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {30287#true} call #t~ret13 := main(); {30287#true} is VALID [2018-11-23 12:25:55,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {30287#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:25:55,287 INFO L273 TraceCheckUtils]: 6: Hoare triple {30289#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:25:55,288 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:25:55,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {30290#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:25:55,288 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:25:55,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {30291#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:25:55,289 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:25:55,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {30292#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:25:55,290 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:25:55,290 INFO L273 TraceCheckUtils]: 14: Hoare triple {30293#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:25:55,291 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:25:55,292 INFO L273 TraceCheckUtils]: 16: Hoare triple {30294#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:25:55,292 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:25:55,293 INFO L273 TraceCheckUtils]: 18: Hoare triple {30295#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:25:55,293 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:25:55,294 INFO L273 TraceCheckUtils]: 20: Hoare triple {30296#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:25:55,295 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:25:55,295 INFO L273 TraceCheckUtils]: 22: Hoare triple {30297#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:25:55,296 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:25:55,296 INFO L273 TraceCheckUtils]: 24: Hoare triple {30298#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:25:55,297 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:25:55,297 INFO L273 TraceCheckUtils]: 26: Hoare triple {30299#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:25:55,298 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:25:55,299 INFO L273 TraceCheckUtils]: 28: Hoare triple {30300#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:25:55,299 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:25:55,300 INFO L273 TraceCheckUtils]: 30: Hoare triple {30301#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:25:55,300 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:25:55,301 INFO L273 TraceCheckUtils]: 32: Hoare triple {30302#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:25:55,302 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:25:55,302 INFO L273 TraceCheckUtils]: 34: Hoare triple {30303#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:25:55,303 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:25:55,303 INFO L273 TraceCheckUtils]: 36: Hoare triple {30304#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:25:55,304 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:25:55,304 INFO L273 TraceCheckUtils]: 38: Hoare triple {30305#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:25:55,305 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:25:55,306 INFO L273 TraceCheckUtils]: 40: Hoare triple {30306#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:25:55,306 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:25:55,307 INFO L273 TraceCheckUtils]: 42: Hoare triple {30307#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:25:55,307 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:25:55,308 INFO L273 TraceCheckUtils]: 44: Hoare triple {30308#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:25:55,309 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:25:55,309 INFO L273 TraceCheckUtils]: 46: Hoare triple {30309#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:25:55,310 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:25:55,310 INFO L273 TraceCheckUtils]: 48: Hoare triple {30310#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:25:55,311 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:25:55,312 INFO L273 TraceCheckUtils]: 50: Hoare triple {30311#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:25:55,312 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:25:55,313 INFO L273 TraceCheckUtils]: 52: Hoare triple {30312#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:25:55,313 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:25:55,314 INFO L273 TraceCheckUtils]: 54: Hoare triple {30313#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:25:55,315 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:25:55,315 INFO L273 TraceCheckUtils]: 56: Hoare triple {30314#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:25:55,316 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:25:55,316 INFO L273 TraceCheckUtils]: 58: Hoare triple {30315#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:25:55,317 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:25:55,317 INFO L273 TraceCheckUtils]: 60: Hoare triple {30316#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:25:55,318 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:25:55,319 INFO L273 TraceCheckUtils]: 62: Hoare triple {30317#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:25:55,319 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:25:55,320 INFO L273 TraceCheckUtils]: 64: Hoare triple {30318#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:25:55,321 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:25:55,321 INFO L273 TraceCheckUtils]: 66: Hoare triple {30319#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:25:55,322 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:25:55,322 INFO L273 TraceCheckUtils]: 68: Hoare triple {30320#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -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:25:55,323 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:25:55,324 INFO L273 TraceCheckUtils]: 70: Hoare triple {30321#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -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:25:55,324 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:25:55,325 INFO L273 TraceCheckUtils]: 72: Hoare triple {30322#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -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:25:55,325 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:25:55,326 INFO L273 TraceCheckUtils]: 74: Hoare triple {30323#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -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:25:55,327 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:25:55,327 INFO L273 TraceCheckUtils]: 76: Hoare triple {30324#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -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:25:55,328 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:25:55,328 INFO L273 TraceCheckUtils]: 78: Hoare triple {30325#(<= main_~i~1 36)} assume !(~i~1 < 1000); {30288#false} is VALID [2018-11-23 12:25:55,329 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:25:55,329 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:25:55,329 INFO L273 TraceCheckUtils]: 81: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,329 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:25:55,329 INFO L273 TraceCheckUtils]: 83: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,329 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:25:55,330 INFO L273 TraceCheckUtils]: 85: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,330 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:25:55,330 INFO L273 TraceCheckUtils]: 87: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,330 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:25:55,330 INFO L273 TraceCheckUtils]: 89: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,330 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:25:55,331 INFO L273 TraceCheckUtils]: 91: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,331 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:25:55,331 INFO L273 TraceCheckUtils]: 93: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,331 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:25:55,331 INFO L273 TraceCheckUtils]: 95: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,331 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:25:55,332 INFO L273 TraceCheckUtils]: 97: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,332 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:25:55,332 INFO L273 TraceCheckUtils]: 99: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,332 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:25:55,332 INFO L273 TraceCheckUtils]: 101: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,333 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:25:55,333 INFO L273 TraceCheckUtils]: 103: Hoare triple {30287#true} assume !(~i~0 < 1000); {30287#true} is VALID [2018-11-23 12:25:55,333 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:25:55,333 INFO L273 TraceCheckUtils]: 105: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:25:55,333 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30287#true} {30288#false} #70#return; {30288#false} is VALID [2018-11-23 12:25:55,333 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:25:55,333 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:25:55,333 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:25:55,333 INFO L273 TraceCheckUtils]: 110: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,333 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:25:55,334 INFO L273 TraceCheckUtils]: 112: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,334 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:25:55,334 INFO L273 TraceCheckUtils]: 114: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,334 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:25:55,334 INFO L273 TraceCheckUtils]: 116: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,334 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:25:55,334 INFO L273 TraceCheckUtils]: 118: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,334 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:25:55,334 INFO L273 TraceCheckUtils]: 120: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,334 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:25:55,335 INFO L273 TraceCheckUtils]: 122: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,335 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:25:55,335 INFO L273 TraceCheckUtils]: 124: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,335 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:25:55,335 INFO L273 TraceCheckUtils]: 126: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,335 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:25:55,335 INFO L273 TraceCheckUtils]: 128: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,335 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:25:55,335 INFO L273 TraceCheckUtils]: 130: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,336 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:25:55,336 INFO L273 TraceCheckUtils]: 132: Hoare triple {30287#true} assume !(~i~0 < 1000); {30287#true} is VALID [2018-11-23 12:25:55,336 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:25:55,336 INFO L273 TraceCheckUtils]: 134: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:25:55,336 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30287#true} {30288#false} #72#return; {30288#false} is VALID [2018-11-23 12:25:55,336 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:25:55,336 INFO L273 TraceCheckUtils]: 137: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:55,336 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:25:55,336 INFO L273 TraceCheckUtils]: 139: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:55,336 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:25:55,337 INFO L273 TraceCheckUtils]: 141: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:55,337 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:25:55,337 INFO L273 TraceCheckUtils]: 143: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:55,337 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:25:55,337 INFO L273 TraceCheckUtils]: 145: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:55,337 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:25:55,337 INFO L273 TraceCheckUtils]: 147: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:55,337 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:25:55,337 INFO L273 TraceCheckUtils]: 149: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:55,337 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:25:55,338 INFO L273 TraceCheckUtils]: 151: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:55,338 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:25:55,338 INFO L273 TraceCheckUtils]: 153: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:55,338 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:25:55,338 INFO L273 TraceCheckUtils]: 155: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:55,338 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:25:55,338 INFO L273 TraceCheckUtils]: 157: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:55,338 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:25:55,338 INFO L273 TraceCheckUtils]: 159: Hoare triple {30288#false} assume !(~i~2 < 999); {30288#false} is VALID [2018-11-23 12:25:55,338 INFO L273 TraceCheckUtils]: 160: Hoare triple {30288#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {30288#false} is VALID [2018-11-23 12:25:55,339 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:25:55,339 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:25:55,339 INFO L273 TraceCheckUtils]: 163: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,339 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:25:55,339 INFO L273 TraceCheckUtils]: 165: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,339 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:25:55,339 INFO L273 TraceCheckUtils]: 167: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,339 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:25:55,339 INFO L273 TraceCheckUtils]: 169: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,339 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:25:55,340 INFO L273 TraceCheckUtils]: 171: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,340 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:25:55,340 INFO L273 TraceCheckUtils]: 173: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,340 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:25:55,340 INFO L273 TraceCheckUtils]: 175: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,340 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:25:55,340 INFO L273 TraceCheckUtils]: 177: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,340 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:25:55,340 INFO L273 TraceCheckUtils]: 179: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,341 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:25:55,341 INFO L273 TraceCheckUtils]: 181: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,341 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:25:55,341 INFO L273 TraceCheckUtils]: 183: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:55,341 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:25:55,341 INFO L273 TraceCheckUtils]: 185: Hoare triple {30287#true} assume !(~i~0 < 1000); {30287#true} is VALID [2018-11-23 12:25:55,341 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:25:55,341 INFO L273 TraceCheckUtils]: 187: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:25:55,341 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30287#true} {30288#false} #74#return; {30288#false} is VALID [2018-11-23 12:25:55,341 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:25:55,342 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:25:55,342 INFO L273 TraceCheckUtils]: 191: Hoare triple {30288#false} assume !false; {30288#false} is VALID [2018-11-23 12:25:55,358 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:25:55,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:55,358 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:25:55,367 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:25:57,329 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-11-23 12:25:57,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:25:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:57,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:57,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {30287#true} call ULTIMATE.init(); {30287#true} is VALID [2018-11-23 12:25:57,929 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:25:57,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:25:57,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30287#true} {30287#true} #66#return; {30287#true} is VALID [2018-11-23 12:25:57,930 INFO L256 TraceCheckUtils]: 4: Hoare triple {30287#true} call #t~ret13 := main(); {30287#true} is VALID [2018-11-23 12:25:57,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {30287#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30287#true} is VALID [2018-11-23 12:25:57,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,930 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:25:57,930 INFO L273 TraceCheckUtils]: 8: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,930 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:25:57,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,931 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:25:57,931 INFO L273 TraceCheckUtils]: 12: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,931 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:25:57,931 INFO L273 TraceCheckUtils]: 14: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,931 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:25:57,931 INFO L273 TraceCheckUtils]: 16: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,931 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:25:57,931 INFO L273 TraceCheckUtils]: 18: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,931 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:25:57,932 INFO L273 TraceCheckUtils]: 20: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,932 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:25:57,932 INFO L273 TraceCheckUtils]: 22: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,932 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:25:57,932 INFO L273 TraceCheckUtils]: 24: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,932 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:25:57,932 INFO L273 TraceCheckUtils]: 26: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,932 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:25:57,932 INFO L273 TraceCheckUtils]: 28: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,932 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:25:57,933 INFO L273 TraceCheckUtils]: 30: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,933 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:25:57,933 INFO L273 TraceCheckUtils]: 32: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,933 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:25:57,933 INFO L273 TraceCheckUtils]: 34: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,933 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:25:57,933 INFO L273 TraceCheckUtils]: 36: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,933 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:25:57,933 INFO L273 TraceCheckUtils]: 38: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,933 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:25:57,934 INFO L273 TraceCheckUtils]: 40: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,934 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:25:57,934 INFO L273 TraceCheckUtils]: 42: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,934 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:25:57,934 INFO L273 TraceCheckUtils]: 44: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,934 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:25:57,934 INFO L273 TraceCheckUtils]: 46: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,934 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:25:57,934 INFO L273 TraceCheckUtils]: 48: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,934 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:25:57,935 INFO L273 TraceCheckUtils]: 50: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,935 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:25:57,935 INFO L273 TraceCheckUtils]: 52: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,935 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:25:57,935 INFO L273 TraceCheckUtils]: 54: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,935 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:25:57,935 INFO L273 TraceCheckUtils]: 56: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,935 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:25:57,935 INFO L273 TraceCheckUtils]: 58: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,935 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:25:57,936 INFO L273 TraceCheckUtils]: 60: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,936 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:25:57,936 INFO L273 TraceCheckUtils]: 62: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,936 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:25:57,936 INFO L273 TraceCheckUtils]: 64: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,936 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:25:57,936 INFO L273 TraceCheckUtils]: 66: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,936 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:25:57,936 INFO L273 TraceCheckUtils]: 68: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,936 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:25:57,937 INFO L273 TraceCheckUtils]: 70: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,937 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:25:57,937 INFO L273 TraceCheckUtils]: 72: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,937 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:25:57,937 INFO L273 TraceCheckUtils]: 74: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,937 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:25:57,937 INFO L273 TraceCheckUtils]: 76: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:25:57,937 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:25:57,937 INFO L273 TraceCheckUtils]: 78: Hoare triple {30287#true} assume !(~i~1 < 1000); {30287#true} is VALID [2018-11-23 12:25:57,938 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:25:57,938 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:25:57,938 INFO L273 TraceCheckUtils]: 81: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,938 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:25:57,938 INFO L273 TraceCheckUtils]: 83: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,938 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:25:57,938 INFO L273 TraceCheckUtils]: 85: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,938 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:25:57,938 INFO L273 TraceCheckUtils]: 87: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,938 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:25:57,939 INFO L273 TraceCheckUtils]: 89: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,939 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:25:57,939 INFO L273 TraceCheckUtils]: 91: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,939 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:25:57,939 INFO L273 TraceCheckUtils]: 93: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,939 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:25:57,939 INFO L273 TraceCheckUtils]: 95: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,939 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:25:57,939 INFO L273 TraceCheckUtils]: 97: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,939 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:25:57,940 INFO L273 TraceCheckUtils]: 99: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,940 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:25:57,940 INFO L273 TraceCheckUtils]: 101: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,940 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:25:57,940 INFO L273 TraceCheckUtils]: 103: Hoare triple {30287#true} assume !(~i~0 < 1000); {30287#true} is VALID [2018-11-23 12:25:57,940 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:25:57,940 INFO L273 TraceCheckUtils]: 105: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:25:57,940 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30287#true} {30287#true} #70#return; {30287#true} is VALID [2018-11-23 12:25:57,940 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:25:57,940 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:25:57,941 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:25:57,941 INFO L273 TraceCheckUtils]: 110: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,941 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:25:57,941 INFO L273 TraceCheckUtils]: 112: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,941 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:25:57,941 INFO L273 TraceCheckUtils]: 114: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,941 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:25:57,941 INFO L273 TraceCheckUtils]: 116: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,941 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:25:57,941 INFO L273 TraceCheckUtils]: 118: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,942 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:25:57,942 INFO L273 TraceCheckUtils]: 120: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,942 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:25:57,942 INFO L273 TraceCheckUtils]: 122: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,942 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:25:57,942 INFO L273 TraceCheckUtils]: 124: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,942 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:25:57,942 INFO L273 TraceCheckUtils]: 126: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,942 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:25:57,942 INFO L273 TraceCheckUtils]: 128: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,943 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:25:57,943 INFO L273 TraceCheckUtils]: 130: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:25:57,943 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:25:57,943 INFO L273 TraceCheckUtils]: 132: Hoare triple {30287#true} assume !(~i~0 < 1000); {30287#true} is VALID [2018-11-23 12:25:57,943 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:25:57,943 INFO L273 TraceCheckUtils]: 134: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:25:57,943 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30287#true} {30287#true} #72#return; {30287#true} is VALID [2018-11-23 12:25:57,943 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:25:57,943 INFO L273 TraceCheckUtils]: 137: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:57,943 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:25:57,944 INFO L273 TraceCheckUtils]: 139: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:57,944 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:25:57,944 INFO L273 TraceCheckUtils]: 141: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:57,944 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:25:57,944 INFO L273 TraceCheckUtils]: 143: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:57,944 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:25:57,944 INFO L273 TraceCheckUtils]: 145: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:57,944 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:25:57,944 INFO L273 TraceCheckUtils]: 147: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:57,944 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:25:57,945 INFO L273 TraceCheckUtils]: 149: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:57,945 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:25:57,945 INFO L273 TraceCheckUtils]: 151: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:57,945 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:25:57,945 INFO L273 TraceCheckUtils]: 153: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:57,945 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:25:57,945 INFO L273 TraceCheckUtils]: 155: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:57,945 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:25:57,945 INFO L273 TraceCheckUtils]: 157: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:57,945 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:25:57,946 INFO L273 TraceCheckUtils]: 159: Hoare triple {30287#true} assume !(~i~2 < 999); {30287#true} is VALID [2018-11-23 12:25:57,946 INFO L273 TraceCheckUtils]: 160: Hoare triple {30287#true} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {30287#true} is VALID [2018-11-23 12:25:57,946 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:25:57,946 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:25:57,946 INFO L273 TraceCheckUtils]: 163: Hoare triple {30815#(<= bAnd_~i~0 1)} assume !!(~i~0 < 1000);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:25:57,947 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:25:57,947 INFO L273 TraceCheckUtils]: 165: Hoare triple {30822#(<= bAnd_~i~0 2)} assume !!(~i~0 < 1000);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:25:57,948 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:25:57,948 INFO L273 TraceCheckUtils]: 167: Hoare triple {30829#(<= bAnd_~i~0 3)} assume !!(~i~0 < 1000);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:25:57,948 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:25:57,949 INFO L273 TraceCheckUtils]: 169: Hoare triple {30836#(<= bAnd_~i~0 4)} assume !!(~i~0 < 1000);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:25:57,949 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:25:57,950 INFO L273 TraceCheckUtils]: 171: Hoare triple {30843#(<= bAnd_~i~0 5)} assume !!(~i~0 < 1000);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:25:57,950 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:25:57,951 INFO L273 TraceCheckUtils]: 173: Hoare triple {30850#(<= bAnd_~i~0 6)} assume !!(~i~0 < 1000);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:25:57,951 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:25:57,952 INFO L273 TraceCheckUtils]: 175: Hoare triple {30857#(<= bAnd_~i~0 7)} assume !!(~i~0 < 1000);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:25:57,953 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:25:57,953 INFO L273 TraceCheckUtils]: 177: Hoare triple {30864#(<= bAnd_~i~0 8)} assume !!(~i~0 < 1000);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:25:57,954 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:25:57,954 INFO L273 TraceCheckUtils]: 179: Hoare triple {30871#(<= bAnd_~i~0 9)} assume !!(~i~0 < 1000);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:25:57,955 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:25:57,956 INFO L273 TraceCheckUtils]: 181: Hoare triple {30878#(<= bAnd_~i~0 10)} assume !!(~i~0 < 1000);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:25:57,956 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:25:57,957 INFO L273 TraceCheckUtils]: 183: Hoare triple {30885#(<= bAnd_~i~0 11)} assume !!(~i~0 < 1000);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:25:57,958 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:25:57,958 INFO L273 TraceCheckUtils]: 185: Hoare triple {30892#(<= bAnd_~i~0 12)} assume !(~i~0 < 1000); {30288#false} is VALID [2018-11-23 12:25:57,958 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:25:57,959 INFO L273 TraceCheckUtils]: 187: Hoare triple {30288#false} assume true; {30288#false} is VALID [2018-11-23 12:25:57,959 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30288#false} {30287#true} #74#return; {30288#false} is VALID [2018-11-23 12:25:57,959 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:25:57,959 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:25:57,959 INFO L273 TraceCheckUtils]: 191: Hoare triple {30288#false} assume !false; {30288#false} is VALID [2018-11-23 12:25:57,974 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:25:57,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:57,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2018-11-23 12:25:57,995 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:25:57,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:57,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 12:25:58,137 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:25:58,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 12:25:58,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 12:25:58,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:25:58,139 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2018-11-23 12:25:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:59,622 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2018-11-23 12:25:59,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 12:25:59,622 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:25:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:25:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:25:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:25:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:25:59,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 154 transitions. [2018-11-23 12:25:59,782 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:25:59,786 INFO L225 Difference]: With dead ends: 205 [2018-11-23 12:25:59,786 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 12:25:59,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:25:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 12:25:59,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-23 12:25:59,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:59,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-23 12:25:59,843 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-23 12:25:59,844 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-23 12:25:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:59,846 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:25:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:25:59,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:59,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:59,847 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-23 12:25:59,847 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-23 12:25:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:59,849 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:25:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:25:59,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:59,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:59,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:59,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 12:25:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-11-23 12:25:59,851 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2018-11-23 12:25:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:59,851 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-11-23 12:25:59,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 12:25:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:25:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-23 12:25:59,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:59,852 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:25:59,852 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:59,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:59,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2105744263, now seen corresponding path program 37 times [2018-11-23 12:25:59,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:59,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:59,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:59,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:25:59,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:00,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {31721#true} call ULTIMATE.init(); {31721#true} is VALID [2018-11-23 12:26:00,648 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:00,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:26:00,649 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31721#true} {31721#true} #66#return; {31721#true} is VALID [2018-11-23 12:26:00,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {31721#true} call #t~ret13 := main(); {31721#true} is VALID [2018-11-23 12:26:00,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {31721#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:00,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {31723#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:00,650 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:00,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {31724#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:00,650 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:00,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {31725#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:00,652 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:00,652 INFO L273 TraceCheckUtils]: 12: Hoare triple {31726#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:00,653 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:00,653 INFO L273 TraceCheckUtils]: 14: Hoare triple {31727#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:00,654 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:00,654 INFO L273 TraceCheckUtils]: 16: Hoare triple {31728#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:00,655 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:00,656 INFO L273 TraceCheckUtils]: 18: Hoare triple {31729#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:00,656 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:00,657 INFO L273 TraceCheckUtils]: 20: Hoare triple {31730#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:00,657 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:00,658 INFO L273 TraceCheckUtils]: 22: Hoare triple {31731#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:00,659 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:00,659 INFO L273 TraceCheckUtils]: 24: Hoare triple {31732#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:00,660 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:00,660 INFO L273 TraceCheckUtils]: 26: Hoare triple {31733#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:00,661 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:00,661 INFO L273 TraceCheckUtils]: 28: Hoare triple {31734#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:00,662 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:00,663 INFO L273 TraceCheckUtils]: 30: Hoare triple {31735#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:00,663 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:00,664 INFO L273 TraceCheckUtils]: 32: Hoare triple {31736#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:00,664 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:00,665 INFO L273 TraceCheckUtils]: 34: Hoare triple {31737#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:00,666 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:00,666 INFO L273 TraceCheckUtils]: 36: Hoare triple {31738#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:00,667 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:00,667 INFO L273 TraceCheckUtils]: 38: Hoare triple {31739#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:00,668 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:00,668 INFO L273 TraceCheckUtils]: 40: Hoare triple {31740#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:00,669 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:00,670 INFO L273 TraceCheckUtils]: 42: Hoare triple {31741#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:00,670 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:00,671 INFO L273 TraceCheckUtils]: 44: Hoare triple {31742#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:00,671 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:00,672 INFO L273 TraceCheckUtils]: 46: Hoare triple {31743#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:00,673 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:00,673 INFO L273 TraceCheckUtils]: 48: Hoare triple {31744#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:00,676 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:00,676 INFO L273 TraceCheckUtils]: 50: Hoare triple {31745#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:00,677 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:00,680 INFO L273 TraceCheckUtils]: 52: Hoare triple {31746#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:00,681 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:00,682 INFO L273 TraceCheckUtils]: 54: Hoare triple {31747#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:00,684 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:00,684 INFO L273 TraceCheckUtils]: 56: Hoare triple {31748#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:00,686 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:00,686 INFO L273 TraceCheckUtils]: 58: Hoare triple {31749#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:00,688 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:00,690 INFO L273 TraceCheckUtils]: 60: Hoare triple {31750#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:00,692 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:00,692 INFO L273 TraceCheckUtils]: 62: Hoare triple {31751#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:00,694 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:00,694 INFO L273 TraceCheckUtils]: 64: Hoare triple {31752#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:00,696 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:00,696 INFO L273 TraceCheckUtils]: 66: Hoare triple {31753#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:00,698 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:00,698 INFO L273 TraceCheckUtils]: 68: Hoare triple {31754#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -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:00,700 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:00,700 INFO L273 TraceCheckUtils]: 70: Hoare triple {31755#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -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:00,702 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:00,702 INFO L273 TraceCheckUtils]: 72: Hoare triple {31756#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -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:00,704 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:00,704 INFO L273 TraceCheckUtils]: 74: Hoare triple {31757#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -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:00,706 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:00,706 INFO L273 TraceCheckUtils]: 76: Hoare triple {31758#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -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:00,708 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:00,710 INFO L273 TraceCheckUtils]: 78: Hoare triple {31759#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -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:00,711 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:00,712 INFO L273 TraceCheckUtils]: 80: Hoare triple {31760#(<= main_~i~1 37)} assume !(~i~1 < 1000); {31722#false} is VALID [2018-11-23 12:26:00,712 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:00,712 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:00,712 INFO L273 TraceCheckUtils]: 83: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,712 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:00,712 INFO L273 TraceCheckUtils]: 85: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,712 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:00,712 INFO L273 TraceCheckUtils]: 87: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,712 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:00,713 INFO L273 TraceCheckUtils]: 89: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,713 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:00,713 INFO L273 TraceCheckUtils]: 91: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,713 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:00,713 INFO L273 TraceCheckUtils]: 93: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,713 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:00,713 INFO L273 TraceCheckUtils]: 95: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,713 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:00,713 INFO L273 TraceCheckUtils]: 97: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,714 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:00,714 INFO L273 TraceCheckUtils]: 99: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,714 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:00,714 INFO L273 TraceCheckUtils]: 101: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,714 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:00,714 INFO L273 TraceCheckUtils]: 103: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,715 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:00,715 INFO L273 TraceCheckUtils]: 105: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,715 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:00,715 INFO L273 TraceCheckUtils]: 107: Hoare triple {31721#true} assume !(~i~0 < 1000); {31721#true} is VALID [2018-11-23 12:26:00,715 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:00,715 INFO L273 TraceCheckUtils]: 109: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:26:00,716 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31721#true} {31722#false} #70#return; {31722#false} is VALID [2018-11-23 12:26:00,716 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:00,716 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:00,716 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:00,716 INFO L273 TraceCheckUtils]: 114: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,716 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:00,716 INFO L273 TraceCheckUtils]: 116: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,716 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:00,716 INFO L273 TraceCheckUtils]: 118: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,717 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:00,717 INFO L273 TraceCheckUtils]: 120: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,717 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:00,717 INFO L273 TraceCheckUtils]: 122: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,717 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:00,717 INFO L273 TraceCheckUtils]: 124: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,717 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:00,717 INFO L273 TraceCheckUtils]: 126: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,717 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:00,717 INFO L273 TraceCheckUtils]: 128: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,718 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:00,718 INFO L273 TraceCheckUtils]: 130: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,718 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:00,718 INFO L273 TraceCheckUtils]: 132: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,718 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:00,718 INFO L273 TraceCheckUtils]: 134: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,718 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:00,718 INFO L273 TraceCheckUtils]: 136: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,718 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:00,718 INFO L273 TraceCheckUtils]: 138: Hoare triple {31721#true} assume !(~i~0 < 1000); {31721#true} is VALID [2018-11-23 12:26:00,719 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:00,719 INFO L273 TraceCheckUtils]: 140: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:26:00,719 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31721#true} {31722#false} #72#return; {31722#false} is VALID [2018-11-23 12:26:00,719 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:00,719 INFO L273 TraceCheckUtils]: 143: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:00,719 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:00,719 INFO L273 TraceCheckUtils]: 145: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:00,719 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:00,719 INFO L273 TraceCheckUtils]: 147: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:00,720 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:00,720 INFO L273 TraceCheckUtils]: 149: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:00,720 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:00,720 INFO L273 TraceCheckUtils]: 151: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:00,720 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:00,720 INFO L273 TraceCheckUtils]: 153: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:00,720 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:00,720 INFO L273 TraceCheckUtils]: 155: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:00,720 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:00,720 INFO L273 TraceCheckUtils]: 157: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:00,721 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:00,721 INFO L273 TraceCheckUtils]: 159: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:00,721 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:00,721 INFO L273 TraceCheckUtils]: 161: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:00,721 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:00,721 INFO L273 TraceCheckUtils]: 163: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:00,721 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:00,721 INFO L273 TraceCheckUtils]: 165: Hoare triple {31722#false} assume !(~i~2 < 999); {31722#false} is VALID [2018-11-23 12:26:00,721 INFO L273 TraceCheckUtils]: 166: Hoare triple {31722#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:26:00,721 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:00,722 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:00,722 INFO L273 TraceCheckUtils]: 169: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,722 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:00,722 INFO L273 TraceCheckUtils]: 171: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,722 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:00,722 INFO L273 TraceCheckUtils]: 173: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,722 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:00,722 INFO L273 TraceCheckUtils]: 175: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,722 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:00,722 INFO L273 TraceCheckUtils]: 177: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,723 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:00,723 INFO L273 TraceCheckUtils]: 179: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,723 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:00,723 INFO L273 TraceCheckUtils]: 181: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,723 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:00,723 INFO L273 TraceCheckUtils]: 183: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,723 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:00,723 INFO L273 TraceCheckUtils]: 185: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,723 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:00,723 INFO L273 TraceCheckUtils]: 187: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,724 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:00,724 INFO L273 TraceCheckUtils]: 189: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,724 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:00,724 INFO L273 TraceCheckUtils]: 191: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:00,724 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:00,724 INFO L273 TraceCheckUtils]: 193: Hoare triple {31721#true} assume !(~i~0 < 1000); {31721#true} is VALID [2018-11-23 12:26:00,724 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:00,724 INFO L273 TraceCheckUtils]: 195: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:26:00,724 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31721#true} {31722#false} #74#return; {31722#false} is VALID [2018-11-23 12:26:00,724 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:00,725 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:00,725 INFO L273 TraceCheckUtils]: 199: Hoare triple {31722#false} assume !false; {31722#false} is VALID [2018-11-23 12:26:00,742 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:00,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:00,743 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:00,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:00,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:01,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {31721#true} call ULTIMATE.init(); {31721#true} is VALID [2018-11-23 12:26:01,236 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:01,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:26:01,237 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31721#true} {31721#true} #66#return; {31721#true} is VALID [2018-11-23 12:26:01,237 INFO L256 TraceCheckUtils]: 4: Hoare triple {31721#true} call #t~ret13 := main(); {31721#true} is VALID [2018-11-23 12:26:01,238 INFO L273 TraceCheckUtils]: 5: Hoare triple {31721#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:01,238 INFO L273 TraceCheckUtils]: 6: Hoare triple {31779#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:01,238 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:01,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {31724#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:01,239 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:01,239 INFO L273 TraceCheckUtils]: 10: Hoare triple {31725#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:01,240 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:01,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {31726#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:01,241 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:01,242 INFO L273 TraceCheckUtils]: 14: Hoare triple {31727#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:01,242 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:01,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {31728#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:01,244 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:01,244 INFO L273 TraceCheckUtils]: 18: Hoare triple {31729#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:01,245 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:01,245 INFO L273 TraceCheckUtils]: 20: Hoare triple {31730#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:01,246 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:01,246 INFO L273 TraceCheckUtils]: 22: Hoare triple {31731#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:01,247 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:01,248 INFO L273 TraceCheckUtils]: 24: Hoare triple {31732#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:01,248 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:01,249 INFO L273 TraceCheckUtils]: 26: Hoare triple {31733#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:01,249 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:01,250 INFO L273 TraceCheckUtils]: 28: Hoare triple {31734#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:01,251 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:01,251 INFO L273 TraceCheckUtils]: 30: Hoare triple {31735#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:01,252 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:01,252 INFO L273 TraceCheckUtils]: 32: Hoare triple {31736#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:01,253 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:01,253 INFO L273 TraceCheckUtils]: 34: Hoare triple {31737#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:01,254 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:01,255 INFO L273 TraceCheckUtils]: 36: Hoare triple {31738#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:01,255 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:01,256 INFO L273 TraceCheckUtils]: 38: Hoare triple {31739#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:01,256 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:01,257 INFO L273 TraceCheckUtils]: 40: Hoare triple {31740#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:01,258 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:01,258 INFO L273 TraceCheckUtils]: 42: Hoare triple {31741#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:01,259 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:01,259 INFO L273 TraceCheckUtils]: 44: Hoare triple {31742#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:01,260 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:01,260 INFO L273 TraceCheckUtils]: 46: Hoare triple {31743#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:01,261 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:01,262 INFO L273 TraceCheckUtils]: 48: Hoare triple {31744#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:01,262 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:01,263 INFO L273 TraceCheckUtils]: 50: Hoare triple {31745#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:01,263 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:01,264 INFO L273 TraceCheckUtils]: 52: Hoare triple {31746#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:01,265 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:01,265 INFO L273 TraceCheckUtils]: 54: Hoare triple {31747#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:01,266 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:01,266 INFO L273 TraceCheckUtils]: 56: Hoare triple {31748#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:01,267 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:01,267 INFO L273 TraceCheckUtils]: 58: Hoare triple {31749#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:01,268 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:01,269 INFO L273 TraceCheckUtils]: 60: Hoare triple {31750#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:01,269 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:01,270 INFO L273 TraceCheckUtils]: 62: Hoare triple {31751#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:01,270 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:01,271 INFO L273 TraceCheckUtils]: 64: Hoare triple {31752#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:01,272 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:01,272 INFO L273 TraceCheckUtils]: 66: Hoare triple {31753#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:01,273 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:01,273 INFO L273 TraceCheckUtils]: 68: Hoare triple {31754#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -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:01,274 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:01,274 INFO L273 TraceCheckUtils]: 70: Hoare triple {31755#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -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:01,275 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:01,276 INFO L273 TraceCheckUtils]: 72: Hoare triple {31756#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -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:01,276 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:01,277 INFO L273 TraceCheckUtils]: 74: Hoare triple {31757#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -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:01,278 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:01,278 INFO L273 TraceCheckUtils]: 76: Hoare triple {31758#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -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:01,279 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:01,279 INFO L273 TraceCheckUtils]: 78: Hoare triple {31759#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -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:01,280 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:01,281 INFO L273 TraceCheckUtils]: 80: Hoare triple {31760#(<= main_~i~1 37)} assume !(~i~1 < 1000); {31722#false} is VALID [2018-11-23 12:26:01,281 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:01,281 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:01,281 INFO L273 TraceCheckUtils]: 83: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,281 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:01,281 INFO L273 TraceCheckUtils]: 85: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,282 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:01,282 INFO L273 TraceCheckUtils]: 87: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,282 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:01,282 INFO L273 TraceCheckUtils]: 89: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,282 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:01,282 INFO L273 TraceCheckUtils]: 91: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,283 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:01,283 INFO L273 TraceCheckUtils]: 93: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,283 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:01,283 INFO L273 TraceCheckUtils]: 95: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,283 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:01,283 INFO L273 TraceCheckUtils]: 97: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,284 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:01,284 INFO L273 TraceCheckUtils]: 99: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,284 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:01,284 INFO L273 TraceCheckUtils]: 101: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,284 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:01,284 INFO L273 TraceCheckUtils]: 103: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,285 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:01,285 INFO L273 TraceCheckUtils]: 105: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,285 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:01,285 INFO L273 TraceCheckUtils]: 107: Hoare triple {31722#false} assume !(~i~0 < 1000); {31722#false} is VALID [2018-11-23 12:26:01,285 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:01,285 INFO L273 TraceCheckUtils]: 109: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:26:01,286 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31722#false} {31722#false} #70#return; {31722#false} is VALID [2018-11-23 12:26:01,286 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:01,286 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:01,286 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:01,286 INFO L273 TraceCheckUtils]: 114: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,286 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:01,286 INFO L273 TraceCheckUtils]: 116: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,286 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:01,287 INFO L273 TraceCheckUtils]: 118: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,287 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:01,287 INFO L273 TraceCheckUtils]: 120: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,287 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:01,287 INFO L273 TraceCheckUtils]: 122: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,287 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:01,287 INFO L273 TraceCheckUtils]: 124: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,287 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:01,287 INFO L273 TraceCheckUtils]: 126: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,287 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:01,288 INFO L273 TraceCheckUtils]: 128: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,288 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:01,288 INFO L273 TraceCheckUtils]: 130: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,288 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:01,288 INFO L273 TraceCheckUtils]: 132: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,288 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:01,288 INFO L273 TraceCheckUtils]: 134: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,288 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:01,288 INFO L273 TraceCheckUtils]: 136: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,288 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:01,289 INFO L273 TraceCheckUtils]: 138: Hoare triple {31722#false} assume !(~i~0 < 1000); {31722#false} is VALID [2018-11-23 12:26:01,289 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:01,289 INFO L273 TraceCheckUtils]: 140: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:26:01,289 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31722#false} {31722#false} #72#return; {31722#false} is VALID [2018-11-23 12:26:01,289 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:01,289 INFO L273 TraceCheckUtils]: 143: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:01,289 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:01,289 INFO L273 TraceCheckUtils]: 145: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:01,289 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:01,289 INFO L273 TraceCheckUtils]: 147: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:01,290 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:01,314 INFO L273 TraceCheckUtils]: 149: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:01,315 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:01,315 INFO L273 TraceCheckUtils]: 151: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:01,315 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:01,315 INFO L273 TraceCheckUtils]: 153: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:01,315 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:01,315 INFO L273 TraceCheckUtils]: 155: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:01,315 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:01,315 INFO L273 TraceCheckUtils]: 157: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:01,315 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:01,316 INFO L273 TraceCheckUtils]: 159: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:01,316 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:01,316 INFO L273 TraceCheckUtils]: 161: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:01,316 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:01,316 INFO L273 TraceCheckUtils]: 163: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:01,316 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:01,317 INFO L273 TraceCheckUtils]: 165: Hoare triple {31722#false} assume !(~i~2 < 999); {31722#false} is VALID [2018-11-23 12:26:01,317 INFO L273 TraceCheckUtils]: 166: Hoare triple {31722#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:26:01,317 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:01,317 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:01,317 INFO L273 TraceCheckUtils]: 169: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,317 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:01,317 INFO L273 TraceCheckUtils]: 171: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,317 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:01,318 INFO L273 TraceCheckUtils]: 173: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,318 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:01,318 INFO L273 TraceCheckUtils]: 175: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,318 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:01,318 INFO L273 TraceCheckUtils]: 177: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,318 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:01,318 INFO L273 TraceCheckUtils]: 179: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,319 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:01,319 INFO L273 TraceCheckUtils]: 181: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,319 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:01,319 INFO L273 TraceCheckUtils]: 183: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,319 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:01,319 INFO L273 TraceCheckUtils]: 185: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,319 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:01,319 INFO L273 TraceCheckUtils]: 187: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,320 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:01,320 INFO L273 TraceCheckUtils]: 189: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,320 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:01,320 INFO L273 TraceCheckUtils]: 191: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:01,320 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:01,320 INFO L273 TraceCheckUtils]: 193: Hoare triple {31722#false} assume !(~i~0 < 1000); {31722#false} is VALID [2018-11-23 12:26:01,320 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:01,320 INFO L273 TraceCheckUtils]: 195: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:26:01,320 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31722#false} {31722#false} #74#return; {31722#false} is VALID [2018-11-23 12:26:01,320 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:01,321 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:01,321 INFO L273 TraceCheckUtils]: 199: Hoare triple {31722#false} assume !false; {31722#false} is VALID [2018-11-23 12:26:01,339 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:01,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:01,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:26:01,358 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:26:01,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:01,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:26:01,478 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:01,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:26:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:26:01,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:26:01,480 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2018-11-23 12:26:02,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:02,092 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2018-11-23 12:26:02,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:26:02,092 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:26:02,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:26:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:26:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:26:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:26:02,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 128 transitions. [2018-11-23 12:26:02,230 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:02,233 INFO L225 Difference]: With dead ends: 208 [2018-11-23 12:26:02,233 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:26:02,234 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:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:26:02,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-11-23 12:26:02,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:02,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 145 states. [2018-11-23 12:26:02,322 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 145 states. [2018-11-23 12:26:02,322 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 145 states. [2018-11-23 12:26:02,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:02,324 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:26:02,324 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:26:02,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:02,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:02,325 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 146 states. [2018-11-23 12:26:02,325 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 146 states. [2018-11-23 12:26:02,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:02,327 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:26:02,327 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:26:02,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:02,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:02,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:02,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 12:26:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2018-11-23 12:26:02,329 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 200 [2018-11-23 12:26:02,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:02,329 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-11-23 12:26:02,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:26:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:26:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-23 12:26:02,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:02,330 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:02,331 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:02,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:02,331 INFO L82 PathProgramCache]: Analyzing trace with hash -283013655, now seen corresponding path program 38 times [2018-11-23 12:26:02,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:02,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:02,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:02,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:02,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:03,644 INFO L256 TraceCheckUtils]: 0: Hoare triple {33179#true} call ULTIMATE.init(); {33179#true} is VALID [2018-11-23 12:26:03,644 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:03,644 INFO L273 TraceCheckUtils]: 2: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:26:03,644 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33179#true} {33179#true} #66#return; {33179#true} is VALID [2018-11-23 12:26:03,644 INFO L256 TraceCheckUtils]: 4: Hoare triple {33179#true} call #t~ret13 := main(); {33179#true} is VALID [2018-11-23 12:26:03,645 INFO L273 TraceCheckUtils]: 5: Hoare triple {33179#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:03,645 INFO L273 TraceCheckUtils]: 6: Hoare triple {33181#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:03,646 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:03,647 INFO L273 TraceCheckUtils]: 8: Hoare triple {33182#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:03,647 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:03,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {33183#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:03,648 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:03,648 INFO L273 TraceCheckUtils]: 12: Hoare triple {33184#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:03,649 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:03,649 INFO L273 TraceCheckUtils]: 14: Hoare triple {33185#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:03,650 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:03,650 INFO L273 TraceCheckUtils]: 16: Hoare triple {33186#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:03,651 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:03,651 INFO L273 TraceCheckUtils]: 18: Hoare triple {33187#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:03,652 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:03,653 INFO L273 TraceCheckUtils]: 20: Hoare triple {33188#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:03,653 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:03,654 INFO L273 TraceCheckUtils]: 22: Hoare triple {33189#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:03,654 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:03,655 INFO L273 TraceCheckUtils]: 24: Hoare triple {33190#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:03,656 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:03,656 INFO L273 TraceCheckUtils]: 26: Hoare triple {33191#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:03,657 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:03,657 INFO L273 TraceCheckUtils]: 28: Hoare triple {33192#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:03,658 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:03,658 INFO L273 TraceCheckUtils]: 30: Hoare triple {33193#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:03,659 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:03,660 INFO L273 TraceCheckUtils]: 32: Hoare triple {33194#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:03,660 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:03,661 INFO L273 TraceCheckUtils]: 34: Hoare triple {33195#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:03,661 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:03,662 INFO L273 TraceCheckUtils]: 36: Hoare triple {33196#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:03,663 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:03,663 INFO L273 TraceCheckUtils]: 38: Hoare triple {33197#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:03,664 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:03,664 INFO L273 TraceCheckUtils]: 40: Hoare triple {33198#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:03,665 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:03,666 INFO L273 TraceCheckUtils]: 42: Hoare triple {33199#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:03,666 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:03,667 INFO L273 TraceCheckUtils]: 44: Hoare triple {33200#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:03,667 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:03,668 INFO L273 TraceCheckUtils]: 46: Hoare triple {33201#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:03,669 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:03,669 INFO L273 TraceCheckUtils]: 48: Hoare triple {33202#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:03,670 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:03,671 INFO L273 TraceCheckUtils]: 50: Hoare triple {33203#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:03,671 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:03,672 INFO L273 TraceCheckUtils]: 52: Hoare triple {33204#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:03,672 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:03,673 INFO L273 TraceCheckUtils]: 54: Hoare triple {33205#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:03,674 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:03,674 INFO L273 TraceCheckUtils]: 56: Hoare triple {33206#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:03,675 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:03,675 INFO L273 TraceCheckUtils]: 58: Hoare triple {33207#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:03,676 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:03,676 INFO L273 TraceCheckUtils]: 60: Hoare triple {33208#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:03,677 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:03,678 INFO L273 TraceCheckUtils]: 62: Hoare triple {33209#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:03,678 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:03,679 INFO L273 TraceCheckUtils]: 64: Hoare triple {33210#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:03,679 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:03,680 INFO L273 TraceCheckUtils]: 66: Hoare triple {33211#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:03,681 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:03,681 INFO L273 TraceCheckUtils]: 68: Hoare triple {33212#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -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:03,682 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:03,682 INFO L273 TraceCheckUtils]: 70: Hoare triple {33213#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -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:03,683 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:03,683 INFO L273 TraceCheckUtils]: 72: Hoare triple {33214#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -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:03,684 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:03,685 INFO L273 TraceCheckUtils]: 74: Hoare triple {33215#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -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:03,685 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:03,686 INFO L273 TraceCheckUtils]: 76: Hoare triple {33216#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -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:03,686 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:03,687 INFO L273 TraceCheckUtils]: 78: Hoare triple {33217#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -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:03,688 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:03,688 INFO L273 TraceCheckUtils]: 80: Hoare triple {33218#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -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:03,689 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:03,689 INFO L273 TraceCheckUtils]: 82: Hoare triple {33219#(<= main_~i~1 38)} assume !(~i~1 < 1000); {33180#false} is VALID [2018-11-23 12:26:03,690 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:03,690 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:03,690 INFO L273 TraceCheckUtils]: 85: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,690 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:03,690 INFO L273 TraceCheckUtils]: 87: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,690 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:03,691 INFO L273 TraceCheckUtils]: 89: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,691 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:03,691 INFO L273 TraceCheckUtils]: 91: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,691 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:03,691 INFO L273 TraceCheckUtils]: 93: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,691 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:03,692 INFO L273 TraceCheckUtils]: 95: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,692 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:03,692 INFO L273 TraceCheckUtils]: 97: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,692 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:03,692 INFO L273 TraceCheckUtils]: 99: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,692 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:03,693 INFO L273 TraceCheckUtils]: 101: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,693 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:03,693 INFO L273 TraceCheckUtils]: 103: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,693 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:03,693 INFO L273 TraceCheckUtils]: 105: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,693 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:03,694 INFO L273 TraceCheckUtils]: 107: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,694 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:03,694 INFO L273 TraceCheckUtils]: 109: Hoare triple {33179#true} assume !(~i~0 < 1000); {33179#true} is VALID [2018-11-23 12:26:03,694 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:03,694 INFO L273 TraceCheckUtils]: 111: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:26:03,694 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {33179#true} {33180#false} #70#return; {33180#false} is VALID [2018-11-23 12:26:03,695 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:03,695 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:03,695 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:03,695 INFO L273 TraceCheckUtils]: 116: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,695 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:03,695 INFO L273 TraceCheckUtils]: 118: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,695 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:03,695 INFO L273 TraceCheckUtils]: 120: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,695 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:03,695 INFO L273 TraceCheckUtils]: 122: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,696 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:03,696 INFO L273 TraceCheckUtils]: 124: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,696 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:03,696 INFO L273 TraceCheckUtils]: 126: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,696 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:03,696 INFO L273 TraceCheckUtils]: 128: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,696 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:03,696 INFO L273 TraceCheckUtils]: 130: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,696 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:03,696 INFO L273 TraceCheckUtils]: 132: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,697 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:03,697 INFO L273 TraceCheckUtils]: 134: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,697 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:03,697 INFO L273 TraceCheckUtils]: 136: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,697 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:03,697 INFO L273 TraceCheckUtils]: 138: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,697 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:03,697 INFO L273 TraceCheckUtils]: 140: Hoare triple {33179#true} assume !(~i~0 < 1000); {33179#true} is VALID [2018-11-23 12:26:03,697 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:03,697 INFO L273 TraceCheckUtils]: 142: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:26:03,698 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {33179#true} {33180#false} #72#return; {33180#false} is VALID [2018-11-23 12:26:03,698 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:03,698 INFO L273 TraceCheckUtils]: 145: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:03,698 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:03,698 INFO L273 TraceCheckUtils]: 147: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:03,698 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:03,698 INFO L273 TraceCheckUtils]: 149: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:03,698 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:03,698 INFO L273 TraceCheckUtils]: 151: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:03,698 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:03,699 INFO L273 TraceCheckUtils]: 153: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:03,699 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:03,699 INFO L273 TraceCheckUtils]: 155: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:03,699 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:03,699 INFO L273 TraceCheckUtils]: 157: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:03,699 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:03,699 INFO L273 TraceCheckUtils]: 159: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:03,699 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:03,699 INFO L273 TraceCheckUtils]: 161: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:03,700 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:03,700 INFO L273 TraceCheckUtils]: 163: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:03,700 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:03,700 INFO L273 TraceCheckUtils]: 165: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:03,700 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:03,700 INFO L273 TraceCheckUtils]: 167: Hoare triple {33180#false} assume !(~i~2 < 999); {33180#false} is VALID [2018-11-23 12:26:03,700 INFO L273 TraceCheckUtils]: 168: Hoare triple {33180#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:26:03,700 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:03,700 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:03,700 INFO L273 TraceCheckUtils]: 171: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,700 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:03,701 INFO L273 TraceCheckUtils]: 173: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,701 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:03,701 INFO L273 TraceCheckUtils]: 175: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,701 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:03,701 INFO L273 TraceCheckUtils]: 177: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,701 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:03,701 INFO L273 TraceCheckUtils]: 179: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,701 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:03,701 INFO L273 TraceCheckUtils]: 181: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,701 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:03,701 INFO L273 TraceCheckUtils]: 183: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,702 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:03,702 INFO L273 TraceCheckUtils]: 185: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,702 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:03,702 INFO L273 TraceCheckUtils]: 187: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,702 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:03,702 INFO L273 TraceCheckUtils]: 189: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,702 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:03,702 INFO L273 TraceCheckUtils]: 191: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,702 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:03,702 INFO L273 TraceCheckUtils]: 193: Hoare triple {33179#true} assume !!(~i~0 < 1000);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:03,703 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:03,703 INFO L273 TraceCheckUtils]: 195: Hoare triple {33179#true} assume !(~i~0 < 1000); {33179#true} is VALID [2018-11-23 12:26:03,703 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:03,703 INFO L273 TraceCheckUtils]: 197: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:26:03,703 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {33179#true} {33180#false} #74#return; {33180#false} is VALID [2018-11-23 12:26:03,703 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:03,703 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:03,703 INFO L273 TraceCheckUtils]: 201: Hoare triple {33180#false} assume !false; {33180#false} is VALID [2018-11-23 12:26:03,719 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:03,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:03,719 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:03,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:26:03,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:26:03,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:03,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:04,980 INFO L256 TraceCheckUtils]: 0: Hoare triple {33179#true} call ULTIMATE.init(); {33179#true} is VALID [2018-11-23 12:26:04,980 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:04,981 INFO L273 TraceCheckUtils]: 2: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:26:04,981 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33179#true} {33179#true} #66#return; {33179#true} is VALID [2018-11-23 12:26:04,981 INFO L256 TraceCheckUtils]: 4: Hoare triple {33179#true} call #t~ret13 := main(); {33179#true} is VALID [2018-11-23 12:26:04,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {33179#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:04,982 INFO L273 TraceCheckUtils]: 6: Hoare triple {33238#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:04,982 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:04,983 INFO L273 TraceCheckUtils]: 8: Hoare triple {33182#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:04,983 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:04,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {33183#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:04,984 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:04,984 INFO L273 TraceCheckUtils]: 12: Hoare triple {33184#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:04,985 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:04,985 INFO L273 TraceCheckUtils]: 14: Hoare triple {33185#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:04,986 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:04,986 INFO L273 TraceCheckUtils]: 16: Hoare triple {33186#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:04,987 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:04,988 INFO L273 TraceCheckUtils]: 18: Hoare triple {33187#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:04,988 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:04,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {33188#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:04,990 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:04,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {33189#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:04,991 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:04,991 INFO L273 TraceCheckUtils]: 24: Hoare triple {33190#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:04,992 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:04,992 INFO L273 TraceCheckUtils]: 26: Hoare triple {33191#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:04,993 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:04,994 INFO L273 TraceCheckUtils]: 28: Hoare triple {33192#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:04,994 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:04,995 INFO L273 TraceCheckUtils]: 30: Hoare triple {33193#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:04,995 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:04,996 INFO L273 TraceCheckUtils]: 32: Hoare triple {33194#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:04,997 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:04,997 INFO L273 TraceCheckUtils]: 34: Hoare triple {33195#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:04,998 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:04,998 INFO L273 TraceCheckUtils]: 36: Hoare triple {33196#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:04,999 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:05,000 INFO L273 TraceCheckUtils]: 38: Hoare triple {33197#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:05,000 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:05,001 INFO L273 TraceCheckUtils]: 40: Hoare triple {33198#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:05,002 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:05,002 INFO L273 TraceCheckUtils]: 42: Hoare triple {33199#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:05,003 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:05,003 INFO L273 TraceCheckUtils]: 44: Hoare triple {33200#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:05,004 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:05,005 INFO L273 TraceCheckUtils]: 46: Hoare triple {33201#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:05,005 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:05,006 INFO L273 TraceCheckUtils]: 48: Hoare triple {33202#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:05,006 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:05,007 INFO L273 TraceCheckUtils]: 50: Hoare triple {33203#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:05,008 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:05,008 INFO L273 TraceCheckUtils]: 52: Hoare triple {33204#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:05,009 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:05,009 INFO L273 TraceCheckUtils]: 54: Hoare triple {33205#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:05,010 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:05,010 INFO L273 TraceCheckUtils]: 56: Hoare triple {33206#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:05,011 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:05,012 INFO L273 TraceCheckUtils]: 58: Hoare triple {33207#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:05,012 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:05,013 INFO L273 TraceCheckUtils]: 60: Hoare triple {33208#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:05,014 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:05,014 INFO L273 TraceCheckUtils]: 62: Hoare triple {33209#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:05,015 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:05,015 INFO L273 TraceCheckUtils]: 64: Hoare triple {33210#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:05,016 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:05,016 INFO L273 TraceCheckUtils]: 66: Hoare triple {33211#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:05,017 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:05,018 INFO L273 TraceCheckUtils]: 68: Hoare triple {33212#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -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:05,018 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:05,019 INFO L273 TraceCheckUtils]: 70: Hoare triple {33213#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -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:05,020 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:05,020 INFO L273 TraceCheckUtils]: 72: Hoare triple {33214#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -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:05,021 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:05,021 INFO L273 TraceCheckUtils]: 74: Hoare triple {33215#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -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:05,022 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:05,023 INFO L273 TraceCheckUtils]: 76: Hoare triple {33216#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -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:05,023 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:05,024 INFO L273 TraceCheckUtils]: 78: Hoare triple {33217#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -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:05,024 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:05,025 INFO L273 TraceCheckUtils]: 80: Hoare triple {33218#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -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:05,026 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:05,026 INFO L273 TraceCheckUtils]: 82: Hoare triple {33219#(<= main_~i~1 38)} assume !(~i~1 < 1000); {33180#false} is VALID [2018-11-23 12:26:05,026 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:05,027 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:05,027 INFO L273 TraceCheckUtils]: 85: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,027 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:05,027 INFO L273 TraceCheckUtils]: 87: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,027 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:05,027 INFO L273 TraceCheckUtils]: 89: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,027 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:05,028 INFO L273 TraceCheckUtils]: 91: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,028 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:05,028 INFO L273 TraceCheckUtils]: 93: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,028 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:05,028 INFO L273 TraceCheckUtils]: 95: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,028 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:05,029 INFO L273 TraceCheckUtils]: 97: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,029 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:05,029 INFO L273 TraceCheckUtils]: 99: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,029 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:05,029 INFO L273 TraceCheckUtils]: 101: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,030 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:05,030 INFO L273 TraceCheckUtils]: 103: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,030 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:05,030 INFO L273 TraceCheckUtils]: 105: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,030 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:05,030 INFO L273 TraceCheckUtils]: 107: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,031 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:05,031 INFO L273 TraceCheckUtils]: 109: Hoare triple {33180#false} assume !(~i~0 < 1000); {33180#false} is VALID [2018-11-23 12:26:05,031 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:05,031 INFO L273 TraceCheckUtils]: 111: Hoare triple {33180#false} assume true; {33180#false} is VALID [2018-11-23 12:26:05,031 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {33180#false} {33180#false} #70#return; {33180#false} is VALID [2018-11-23 12:26:05,031 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:05,031 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:05,031 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:05,031 INFO L273 TraceCheckUtils]: 116: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,032 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:05,032 INFO L273 TraceCheckUtils]: 118: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,032 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:05,032 INFO L273 TraceCheckUtils]: 120: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,032 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:05,032 INFO L273 TraceCheckUtils]: 122: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,032 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:05,032 INFO L273 TraceCheckUtils]: 124: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,032 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:05,033 INFO L273 TraceCheckUtils]: 126: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,033 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:05,033 INFO L273 TraceCheckUtils]: 128: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,033 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:05,033 INFO L273 TraceCheckUtils]: 130: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,033 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:05,033 INFO L273 TraceCheckUtils]: 132: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,033 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:05,033 INFO L273 TraceCheckUtils]: 134: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,033 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:05,034 INFO L273 TraceCheckUtils]: 136: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,034 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:05,034 INFO L273 TraceCheckUtils]: 138: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,034 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:05,034 INFO L273 TraceCheckUtils]: 140: Hoare triple {33180#false} assume !(~i~0 < 1000); {33180#false} is VALID [2018-11-23 12:26:05,034 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:05,034 INFO L273 TraceCheckUtils]: 142: Hoare triple {33180#false} assume true; {33180#false} is VALID [2018-11-23 12:26:05,034 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {33180#false} {33180#false} #72#return; {33180#false} is VALID [2018-11-23 12:26:05,034 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:05,034 INFO L273 TraceCheckUtils]: 145: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,035 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:05,035 INFO L273 TraceCheckUtils]: 147: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,035 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:05,035 INFO L273 TraceCheckUtils]: 149: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,035 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:05,035 INFO L273 TraceCheckUtils]: 151: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,035 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:05,035 INFO L273 TraceCheckUtils]: 153: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,035 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:05,035 INFO L273 TraceCheckUtils]: 155: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,036 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:05,036 INFO L273 TraceCheckUtils]: 157: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,036 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:05,036 INFO L273 TraceCheckUtils]: 159: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,036 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:05,036 INFO L273 TraceCheckUtils]: 161: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,036 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:05,036 INFO L273 TraceCheckUtils]: 163: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,036 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:05,036 INFO L273 TraceCheckUtils]: 165: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:05,037 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:05,037 INFO L273 TraceCheckUtils]: 167: Hoare triple {33180#false} assume !(~i~2 < 999); {33180#false} is VALID [2018-11-23 12:26:05,037 INFO L273 TraceCheckUtils]: 168: Hoare triple {33180#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:26:05,037 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:05,037 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:05,037 INFO L273 TraceCheckUtils]: 171: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,037 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:05,037 INFO L273 TraceCheckUtils]: 173: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,037 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:05,037 INFO L273 TraceCheckUtils]: 175: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,038 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:05,038 INFO L273 TraceCheckUtils]: 177: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,038 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:05,038 INFO L273 TraceCheckUtils]: 179: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,038 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:05,038 INFO L273 TraceCheckUtils]: 181: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,038 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:05,038 INFO L273 TraceCheckUtils]: 183: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,038 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:05,038 INFO L273 TraceCheckUtils]: 185: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,039 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:05,039 INFO L273 TraceCheckUtils]: 187: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,039 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:05,039 INFO L273 TraceCheckUtils]: 189: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,039 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:05,039 INFO L273 TraceCheckUtils]: 191: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,039 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:05,039 INFO L273 TraceCheckUtils]: 193: Hoare triple {33180#false} assume !!(~i~0 < 1000);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:05,039 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:05,039 INFO L273 TraceCheckUtils]: 195: Hoare triple {33180#false} assume !(~i~0 < 1000); {33180#false} is VALID [2018-11-23 12:26:05,040 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:05,040 INFO L273 TraceCheckUtils]: 197: Hoare triple {33180#false} assume true; {33180#false} is VALID [2018-11-23 12:26:05,040 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {33180#false} {33180#false} #74#return; {33180#false} is VALID [2018-11-23 12:26:05,040 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:05,040 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:05,040 INFO L273 TraceCheckUtils]: 201: Hoare triple {33180#false} assume !false; {33180#false} is VALID [2018-11-23 12:26:05,059 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:05,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:05,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:26:05,079 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-11-23 12:26:05,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:05,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:26:05,194 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:05,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:26:05,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:26:05,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:26:05,196 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2018-11-23 12:26:05,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:05,574 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2018-11-23 12:26:05,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:26:05,575 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-11-23 12:26:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:05,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:26:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:26:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:26:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:26:05,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 130 transitions. [2018-11-23 12:26:05,703 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:05,706 INFO L225 Difference]: With dead ends: 210 [2018-11-23 12:26:05,706 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 12:26:05,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:26:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 12:26:05,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-11-23 12:26:05,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:05,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 147 states. [2018-11-23 12:26:05,765 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 147 states. [2018-11-23 12:26:05,765 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 147 states. [2018-11-23 12:26:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:05,767 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:26:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:26:05,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:05,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:05,768 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 148 states. [2018-11-23 12:26:05,768 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 148 states. [2018-11-23 12:26:05,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:05,771 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:26:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:26:05,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:05,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:05,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:05,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 12:26:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2018-11-23 12:26:05,774 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 202 [2018-11-23 12:26:05,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:05,775 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2018-11-23 12:26:05,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:26:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-11-23 12:26:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-23 12:26:05,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:05,776 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:05,776 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:05,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:05,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1928130507, now seen corresponding path program 39 times [2018-11-23 12:26:05,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:05,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:05,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:05,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:05,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:06,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {34654#true} call ULTIMATE.init(); {34654#true} is VALID [2018-11-23 12:26:06,767 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:06,767 INFO L273 TraceCheckUtils]: 2: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:26:06,767 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34654#true} {34654#true} #66#return; {34654#true} is VALID [2018-11-23 12:26:06,768 INFO L256 TraceCheckUtils]: 4: Hoare triple {34654#true} call #t~ret13 := main(); {34654#true} is VALID [2018-11-23 12:26:06,768 INFO L273 TraceCheckUtils]: 5: Hoare triple {34654#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:06,769 INFO L273 TraceCheckUtils]: 6: Hoare triple {34656#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:06,769 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:06,770 INFO L273 TraceCheckUtils]: 8: Hoare triple {34657#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:06,770 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:06,770 INFO L273 TraceCheckUtils]: 10: Hoare triple {34658#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:06,771 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:06,771 INFO L273 TraceCheckUtils]: 12: Hoare triple {34659#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:06,772 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:06,772 INFO L273 TraceCheckUtils]: 14: Hoare triple {34660#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:06,773 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:06,774 INFO L273 TraceCheckUtils]: 16: Hoare triple {34661#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:06,774 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:06,775 INFO L273 TraceCheckUtils]: 18: Hoare triple {34662#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:06,776 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:06,776 INFO L273 TraceCheckUtils]: 20: Hoare triple {34663#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:06,777 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:06,777 INFO L273 TraceCheckUtils]: 22: Hoare triple {34664#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:06,778 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:06,779 INFO L273 TraceCheckUtils]: 24: Hoare triple {34665#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:06,779 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:06,780 INFO L273 TraceCheckUtils]: 26: Hoare triple {34666#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:06,781 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:06,781 INFO L273 TraceCheckUtils]: 28: Hoare triple {34667#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:06,782 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:06,782 INFO L273 TraceCheckUtils]: 30: Hoare triple {34668#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:06,783 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:06,784 INFO L273 TraceCheckUtils]: 32: Hoare triple {34669#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:06,784 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:06,785 INFO L273 TraceCheckUtils]: 34: Hoare triple {34670#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:06,786 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:06,786 INFO L273 TraceCheckUtils]: 36: Hoare triple {34671#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:06,787 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:06,787 INFO L273 TraceCheckUtils]: 38: Hoare triple {34672#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:06,788 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:06,789 INFO L273 TraceCheckUtils]: 40: Hoare triple {34673#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:06,789 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:06,790 INFO L273 TraceCheckUtils]: 42: Hoare triple {34674#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:06,791 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:06,791 INFO L273 TraceCheckUtils]: 44: Hoare triple {34675#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:06,792 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:06,792 INFO L273 TraceCheckUtils]: 46: Hoare triple {34676#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:06,793 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:06,794 INFO L273 TraceCheckUtils]: 48: Hoare triple {34677#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:06,794 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:06,795 INFO L273 TraceCheckUtils]: 50: Hoare triple {34678#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:06,796 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:06,796 INFO L273 TraceCheckUtils]: 52: Hoare triple {34679#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:06,797 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:06,797 INFO L273 TraceCheckUtils]: 54: Hoare triple {34680#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:06,798 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:06,799 INFO L273 TraceCheckUtils]: 56: Hoare triple {34681#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:06,799 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:06,800 INFO L273 TraceCheckUtils]: 58: Hoare triple {34682#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:06,801 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:06,801 INFO L273 TraceCheckUtils]: 60: Hoare triple {34683#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:06,802 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:06,802 INFO L273 TraceCheckUtils]: 62: Hoare triple {34684#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:06,803 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:06,804 INFO L273 TraceCheckUtils]: 64: Hoare triple {34685#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:06,804 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:06,805 INFO L273 TraceCheckUtils]: 66: Hoare triple {34686#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:06,806 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:06,806 INFO L273 TraceCheckUtils]: 68: Hoare triple {34687#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -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:06,807 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:06,807 INFO L273 TraceCheckUtils]: 70: Hoare triple {34688#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -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:06,808 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:06,809 INFO L273 TraceCheckUtils]: 72: Hoare triple {34689#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -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:06,809 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:06,810 INFO L273 TraceCheckUtils]: 74: Hoare triple {34690#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -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:06,811 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:06,811 INFO L273 TraceCheckUtils]: 76: Hoare triple {34691#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -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:06,812 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:06,812 INFO L273 TraceCheckUtils]: 78: Hoare triple {34692#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -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:06,813 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:06,814 INFO L273 TraceCheckUtils]: 80: Hoare triple {34693#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -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:06,814 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:06,815 INFO L273 TraceCheckUtils]: 82: Hoare triple {34694#(<= main_~i~1 38)} assume !!(~i~1 < 1000);assume -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:06,816 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:06,816 INFO L273 TraceCheckUtils]: 84: Hoare triple {34695#(<= main_~i~1 39)} assume !(~i~1 < 1000); {34655#false} is VALID [2018-11-23 12:26:06,816 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:06,817 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:06,817 INFO L273 TraceCheckUtils]: 87: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,817 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:06,817 INFO L273 TraceCheckUtils]: 89: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,817 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:06,818 INFO L273 TraceCheckUtils]: 91: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,818 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:06,818 INFO L273 TraceCheckUtils]: 93: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,818 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:06,818 INFO L273 TraceCheckUtils]: 95: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,818 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:06,819 INFO L273 TraceCheckUtils]: 97: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,819 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:06,819 INFO L273 TraceCheckUtils]: 99: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,819 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:06,819 INFO L273 TraceCheckUtils]: 101: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,819 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:06,820 INFO L273 TraceCheckUtils]: 103: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,820 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:06,820 INFO L273 TraceCheckUtils]: 105: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,820 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:06,820 INFO L273 TraceCheckUtils]: 107: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,821 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:06,821 INFO L273 TraceCheckUtils]: 109: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,821 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:06,821 INFO L273 TraceCheckUtils]: 111: Hoare triple {34654#true} assume !(~i~0 < 1000); {34654#true} is VALID [2018-11-23 12:26:06,821 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:06,821 INFO L273 TraceCheckUtils]: 113: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:26:06,821 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {34654#true} {34655#false} #70#return; {34655#false} is VALID [2018-11-23 12:26:06,822 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:06,822 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:06,822 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:06,822 INFO L273 TraceCheckUtils]: 118: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,822 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:06,822 INFO L273 TraceCheckUtils]: 120: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,822 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:06,822 INFO L273 TraceCheckUtils]: 122: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,822 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:06,822 INFO L273 TraceCheckUtils]: 124: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,823 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:06,823 INFO L273 TraceCheckUtils]: 126: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,823 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:06,823 INFO L273 TraceCheckUtils]: 128: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,823 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:06,823 INFO L273 TraceCheckUtils]: 130: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,823 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:06,823 INFO L273 TraceCheckUtils]: 132: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,823 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:06,824 INFO L273 TraceCheckUtils]: 134: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,824 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:06,824 INFO L273 TraceCheckUtils]: 136: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,824 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:06,824 INFO L273 TraceCheckUtils]: 138: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,824 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:06,824 INFO L273 TraceCheckUtils]: 140: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,824 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:06,824 INFO L273 TraceCheckUtils]: 142: Hoare triple {34654#true} assume !(~i~0 < 1000); {34654#true} is VALID [2018-11-23 12:26:06,824 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:06,825 INFO L273 TraceCheckUtils]: 144: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:26:06,825 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {34654#true} {34655#false} #72#return; {34655#false} is VALID [2018-11-23 12:26:06,825 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:06,825 INFO L273 TraceCheckUtils]: 147: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:06,825 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:06,825 INFO L273 TraceCheckUtils]: 149: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:06,825 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:06,825 INFO L273 TraceCheckUtils]: 151: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:06,825 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:06,825 INFO L273 TraceCheckUtils]: 153: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:06,826 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:06,826 INFO L273 TraceCheckUtils]: 155: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:06,826 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:06,826 INFO L273 TraceCheckUtils]: 157: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:06,826 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:06,826 INFO L273 TraceCheckUtils]: 159: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:06,826 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:06,826 INFO L273 TraceCheckUtils]: 161: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:06,826 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:06,826 INFO L273 TraceCheckUtils]: 163: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:06,827 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:06,827 INFO L273 TraceCheckUtils]: 165: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:06,827 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:06,827 INFO L273 TraceCheckUtils]: 167: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:06,827 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:06,827 INFO L273 TraceCheckUtils]: 169: Hoare triple {34655#false} assume !(~i~2 < 999); {34655#false} is VALID [2018-11-23 12:26:06,827 INFO L273 TraceCheckUtils]: 170: Hoare triple {34655#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {34655#false} is VALID [2018-11-23 12:26:06,827 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:06,827 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:06,827 INFO L273 TraceCheckUtils]: 173: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,828 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:06,828 INFO L273 TraceCheckUtils]: 175: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,828 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:06,828 INFO L273 TraceCheckUtils]: 177: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,828 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:06,828 INFO L273 TraceCheckUtils]: 179: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,828 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:06,828 INFO L273 TraceCheckUtils]: 181: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,828 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:06,829 INFO L273 TraceCheckUtils]: 183: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,829 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:06,829 INFO L273 TraceCheckUtils]: 185: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,829 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:06,829 INFO L273 TraceCheckUtils]: 187: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,829 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:06,829 INFO L273 TraceCheckUtils]: 189: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,829 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:06,829 INFO L273 TraceCheckUtils]: 191: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,829 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:06,830 INFO L273 TraceCheckUtils]: 193: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,830 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:06,830 INFO L273 TraceCheckUtils]: 195: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:06,830 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:06,830 INFO L273 TraceCheckUtils]: 197: Hoare triple {34654#true} assume !(~i~0 < 1000); {34654#true} is VALID [2018-11-23 12:26:06,830 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:06,830 INFO L273 TraceCheckUtils]: 199: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:26:06,830 INFO L268 TraceCheckUtils]: 200: Hoare quadruple {34654#true} {34655#false} #74#return; {34655#false} is VALID [2018-11-23 12:26:06,830 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:06,830 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:06,831 INFO L273 TraceCheckUtils]: 203: Hoare triple {34655#false} assume !false; {34655#false} is VALID [2018-11-23 12:26:06,849 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:06,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:06,849 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:06,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:26:07,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-23 12:26:07,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:07,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:08,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {34654#true} call ULTIMATE.init(); {34654#true} is VALID [2018-11-23 12:26:08,229 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:08,229 INFO L273 TraceCheckUtils]: 2: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:26:08,229 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34654#true} {34654#true} #66#return; {34654#true} is VALID [2018-11-23 12:26:08,230 INFO L256 TraceCheckUtils]: 4: Hoare triple {34654#true} call #t~ret13 := main(); {34654#true} is VALID [2018-11-23 12:26:08,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {34654#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34654#true} is VALID [2018-11-23 12:26:08,230 INFO L273 TraceCheckUtils]: 6: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,230 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:08,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,230 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:08,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,231 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:08,231 INFO L273 TraceCheckUtils]: 12: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,231 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:08,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,231 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:08,232 INFO L273 TraceCheckUtils]: 16: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,232 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:08,232 INFO L273 TraceCheckUtils]: 18: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,232 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:08,232 INFO L273 TraceCheckUtils]: 20: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,232 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:08,232 INFO L273 TraceCheckUtils]: 22: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,232 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:08,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,233 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:08,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,233 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:08,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,233 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:08,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,233 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:08,233 INFO L273 TraceCheckUtils]: 32: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,233 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:08,234 INFO L273 TraceCheckUtils]: 34: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,234 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:08,234 INFO L273 TraceCheckUtils]: 36: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,234 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:08,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,234 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:08,234 INFO L273 TraceCheckUtils]: 40: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,234 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:08,234 INFO L273 TraceCheckUtils]: 42: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,235 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:08,235 INFO L273 TraceCheckUtils]: 44: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,235 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:08,235 INFO L273 TraceCheckUtils]: 46: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,235 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:08,235 INFO L273 TraceCheckUtils]: 48: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,235 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:08,235 INFO L273 TraceCheckUtils]: 50: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,235 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:08,235 INFO L273 TraceCheckUtils]: 52: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,236 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:08,236 INFO L273 TraceCheckUtils]: 54: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,236 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:08,236 INFO L273 TraceCheckUtils]: 56: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,236 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:08,236 INFO L273 TraceCheckUtils]: 58: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,236 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:08,236 INFO L273 TraceCheckUtils]: 60: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,236 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:08,236 INFO L273 TraceCheckUtils]: 62: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,237 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:08,237 INFO L273 TraceCheckUtils]: 64: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,237 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:08,237 INFO L273 TraceCheckUtils]: 66: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,237 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:08,237 INFO L273 TraceCheckUtils]: 68: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,237 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:08,237 INFO L273 TraceCheckUtils]: 70: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,237 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:08,237 INFO L273 TraceCheckUtils]: 72: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,238 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:08,238 INFO L273 TraceCheckUtils]: 74: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,238 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:08,238 INFO L273 TraceCheckUtils]: 76: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,238 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:08,238 INFO L273 TraceCheckUtils]: 78: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,238 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:08,238 INFO L273 TraceCheckUtils]: 80: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,238 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:08,238 INFO L273 TraceCheckUtils]: 82: Hoare triple {34654#true} assume !!(~i~1 < 1000);assume -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:08,239 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:08,239 INFO L273 TraceCheckUtils]: 84: Hoare triple {34654#true} assume !(~i~1 < 1000); {34654#true} is VALID [2018-11-23 12:26:08,239 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:08,239 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:08,239 INFO L273 TraceCheckUtils]: 87: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,239 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:08,239 INFO L273 TraceCheckUtils]: 89: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,239 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:08,239 INFO L273 TraceCheckUtils]: 91: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,240 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:08,240 INFO L273 TraceCheckUtils]: 93: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,240 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:08,240 INFO L273 TraceCheckUtils]: 95: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,240 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:08,240 INFO L273 TraceCheckUtils]: 97: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,240 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:08,240 INFO L273 TraceCheckUtils]: 99: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,240 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:08,240 INFO L273 TraceCheckUtils]: 101: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,241 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:08,241 INFO L273 TraceCheckUtils]: 103: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,241 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:08,241 INFO L273 TraceCheckUtils]: 105: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,241 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:08,241 INFO L273 TraceCheckUtils]: 107: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,241 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:08,241 INFO L273 TraceCheckUtils]: 109: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,241 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:08,241 INFO L273 TraceCheckUtils]: 111: Hoare triple {34654#true} assume !(~i~0 < 1000); {34654#true} is VALID [2018-11-23 12:26:08,242 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:08,242 INFO L273 TraceCheckUtils]: 113: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:26:08,242 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {34654#true} {34654#true} #70#return; {34654#true} is VALID [2018-11-23 12:26:08,242 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:08,242 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:08,242 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:08,242 INFO L273 TraceCheckUtils]: 118: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,242 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:08,242 INFO L273 TraceCheckUtils]: 120: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,242 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:08,243 INFO L273 TraceCheckUtils]: 122: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,243 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:08,243 INFO L273 TraceCheckUtils]: 124: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,243 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:08,243 INFO L273 TraceCheckUtils]: 126: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,243 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:08,243 INFO L273 TraceCheckUtils]: 128: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,243 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:08,243 INFO L273 TraceCheckUtils]: 130: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,244 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:08,244 INFO L273 TraceCheckUtils]: 132: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,244 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:08,244 INFO L273 TraceCheckUtils]: 134: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,244 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:08,244 INFO L273 TraceCheckUtils]: 136: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,244 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:08,244 INFO L273 TraceCheckUtils]: 138: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,244 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:08,244 INFO L273 TraceCheckUtils]: 140: Hoare triple {34654#true} assume !!(~i~0 < 1000);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:08,245 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:08,245 INFO L273 TraceCheckUtils]: 142: Hoare triple {34654#true} assume !(~i~0 < 1000); {34654#true} is VALID [2018-11-23 12:26:08,245 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:08,245 INFO L273 TraceCheckUtils]: 144: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:26:08,245 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {34654#true} {34654#true} #72#return; {34654#true} is VALID [2018-11-23 12:26:08,245 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:08,245 INFO L273 TraceCheckUtils]: 147: Hoare triple {34654#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:08,245 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:08,245 INFO L273 TraceCheckUtils]: 149: Hoare triple {34654#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:08,245 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:08,246 INFO L273 TraceCheckUtils]: 151: Hoare triple {34654#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:08,246 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:08,246 INFO L273 TraceCheckUtils]: 153: Hoare triple {34654#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:08,246 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:08,246 INFO L273 TraceCheckUtils]: 155: Hoare triple {34654#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:08,246 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:08,246 INFO L273 TraceCheckUtils]: 157: Hoare triple {34654#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:08,246 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:08,246 INFO L273 TraceCheckUtils]: 159: Hoare triple {34654#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:08,246 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:08,247 INFO L273 TraceCheckUtils]: 161: Hoare triple {34654#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:08,247 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:08,247 INFO L273 TraceCheckUtils]: 163: Hoare triple {34654#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:08,247 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:08,247 INFO L273 TraceCheckUtils]: 165: Hoare triple {34654#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:08,247 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:08,247 INFO L273 TraceCheckUtils]: 167: Hoare triple {34654#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:08,247 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:08,247 INFO L273 TraceCheckUtils]: 169: Hoare triple {34654#true} assume !(~i~2 < 999); {34654#true} is VALID [2018-11-23 12:26:08,247 INFO L273 TraceCheckUtils]: 170: Hoare triple {34654#true} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {34654#true} is VALID [2018-11-23 12:26:08,248 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:08,248 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:08,248 INFO L273 TraceCheckUtils]: 173: Hoare triple {35215#(<= bAnd_~i~0 1)} assume !!(~i~0 < 1000);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:08,249 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:08,249 INFO L273 TraceCheckUtils]: 175: Hoare triple {35222#(<= bAnd_~i~0 2)} assume !!(~i~0 < 1000);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:08,250 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:08,250 INFO L273 TraceCheckUtils]: 177: Hoare triple {35229#(<= bAnd_~i~0 3)} assume !!(~i~0 < 1000);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:08,250 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:08,251 INFO L273 TraceCheckUtils]: 179: Hoare triple {35236#(<= bAnd_~i~0 4)} assume !!(~i~0 < 1000);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:08,251 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:08,252 INFO L273 TraceCheckUtils]: 181: Hoare triple {35243#(<= bAnd_~i~0 5)} assume !!(~i~0 < 1000);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:08,253 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:08,253 INFO L273 TraceCheckUtils]: 183: Hoare triple {35250#(<= bAnd_~i~0 6)} assume !!(~i~0 < 1000);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:08,254 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:08,254 INFO L273 TraceCheckUtils]: 185: Hoare triple {35257#(<= bAnd_~i~0 7)} assume !!(~i~0 < 1000);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:08,255 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:08,256 INFO L273 TraceCheckUtils]: 187: Hoare triple {35264#(<= bAnd_~i~0 8)} assume !!(~i~0 < 1000);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:08,256 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:08,257 INFO L273 TraceCheckUtils]: 189: Hoare triple {35271#(<= bAnd_~i~0 9)} assume !!(~i~0 < 1000);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:08,258 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:08,258 INFO L273 TraceCheckUtils]: 191: Hoare triple {35278#(<= bAnd_~i~0 10)} assume !!(~i~0 < 1000);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:08,259 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:08,259 INFO L273 TraceCheckUtils]: 193: Hoare triple {35285#(<= bAnd_~i~0 11)} assume !!(~i~0 < 1000);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:08,260 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:08,261 INFO L273 TraceCheckUtils]: 195: Hoare triple {35292#(<= bAnd_~i~0 12)} assume !!(~i~0 < 1000);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:08,261 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:08,262 INFO L273 TraceCheckUtils]: 197: Hoare triple {35299#(<= bAnd_~i~0 13)} assume !(~i~0 < 1000); {34655#false} is VALID [2018-11-23 12:26:08,262 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:08,262 INFO L273 TraceCheckUtils]: 199: Hoare triple {34655#false} assume true; {34655#false} is VALID [2018-11-23 12:26:08,263 INFO L268 TraceCheckUtils]: 200: Hoare quadruple {34655#false} {34654#true} #74#return; {34655#false} is VALID [2018-11-23 12:26:08,263 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:08,263 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:08,263 INFO L273 TraceCheckUtils]: 203: Hoare triple {34655#false} assume !false; {34655#false} is VALID [2018-11-23 12:26:08,280 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:08,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:08,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 55 [2018-11-23 12:26:08,301 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-11-23 12:26:08,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:08,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 12:26:08,482 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:08,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 12:26:08,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 12:26:08,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:26:08,485 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 55 states. [2018-11-23 12:26:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:09,330 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2018-11-23 12:26:09,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 12:26:09,330 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-11-23 12:26:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:26:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 162 transitions. [2018-11-23 12:26:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:26:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 162 transitions. [2018-11-23 12:26:09,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 162 transitions. [2018-11-23 12:26:09,495 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:09,498 INFO L225 Difference]: With dead ends: 215 [2018-11-23 12:26:09,498 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 12:26:09,499 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:09,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 12:26:09,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-11-23 12:26:09,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:09,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 151 states. [2018-11-23 12:26:09,553 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 151 states. [2018-11-23 12:26:09,553 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 151 states. [2018-11-23 12:26:09,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:09,557 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-23 12:26:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:26:09,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:09,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:09,558 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 153 states. [2018-11-23 12:26:09,558 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 153 states. [2018-11-23 12:26:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:09,561 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-23 12:26:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:26:09,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:09,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:09,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:09,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-23 12:26:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2018-11-23 12:26:09,563 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 204 [2018-11-23 12:26:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:09,564 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2018-11-23 12:26:09,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-23 12:26:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2018-11-23 12:26:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-23 12:26:09,565 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:09,565 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:09,565 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:09,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash -15611861, now seen corresponding path program 40 times [2018-11-23 12:26:09,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:09,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:09,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:09,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:10,663 INFO L256 TraceCheckUtils]: 0: Hoare triple {36171#true} call ULTIMATE.init(); {36171#true} is VALID [2018-11-23 12:26:10,663 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:10,663 INFO L273 TraceCheckUtils]: 2: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:26:10,664 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36171#true} {36171#true} #66#return; {36171#true} is VALID [2018-11-23 12:26:10,664 INFO L256 TraceCheckUtils]: 4: Hoare triple {36171#true} call #t~ret13 := main(); {36171#true} is VALID [2018-11-23 12:26:10,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {36171#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:10,665 INFO L273 TraceCheckUtils]: 6: Hoare triple {36173#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:10,666 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:10,666 INFO L273 TraceCheckUtils]: 8: Hoare triple {36174#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:10,666 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:10,667 INFO L273 TraceCheckUtils]: 10: Hoare triple {36175#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:10,667 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:10,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {36176#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:10,668 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:10,669 INFO L273 TraceCheckUtils]: 14: Hoare triple {36177#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:10,670 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:10,670 INFO L273 TraceCheckUtils]: 16: Hoare triple {36178#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:10,671 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:10,671 INFO L273 TraceCheckUtils]: 18: Hoare triple {36179#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:10,672 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:10,673 INFO L273 TraceCheckUtils]: 20: Hoare triple {36180#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:10,673 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:10,674 INFO L273 TraceCheckUtils]: 22: Hoare triple {36181#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:10,675 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:10,675 INFO L273 TraceCheckUtils]: 24: Hoare triple {36182#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:10,676 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:10,676 INFO L273 TraceCheckUtils]: 26: Hoare triple {36183#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:10,677 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:10,678 INFO L273 TraceCheckUtils]: 28: Hoare triple {36184#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:10,678 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:10,679 INFO L273 TraceCheckUtils]: 30: Hoare triple {36185#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:10,679 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:10,680 INFO L273 TraceCheckUtils]: 32: Hoare triple {36186#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:10,681 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:10,681 INFO L273 TraceCheckUtils]: 34: Hoare triple {36187#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:10,682 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:10,683 INFO L273 TraceCheckUtils]: 36: Hoare triple {36188#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:10,683 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:10,684 INFO L273 TraceCheckUtils]: 38: Hoare triple {36189#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:10,684 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:10,685 INFO L273 TraceCheckUtils]: 40: Hoare triple {36190#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:10,686 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:10,686 INFO L273 TraceCheckUtils]: 42: Hoare triple {36191#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:10,687 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:10,688 INFO L273 TraceCheckUtils]: 44: Hoare triple {36192#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:10,688 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:10,689 INFO L273 TraceCheckUtils]: 46: Hoare triple {36193#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:10,690 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:10,690 INFO L273 TraceCheckUtils]: 48: Hoare triple {36194#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:10,691 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:10,691 INFO L273 TraceCheckUtils]: 50: Hoare triple {36195#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:10,692 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:10,693 INFO L273 TraceCheckUtils]: 52: Hoare triple {36196#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:10,693 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:10,694 INFO L273 TraceCheckUtils]: 54: Hoare triple {36197#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:10,695 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:10,695 INFO L273 TraceCheckUtils]: 56: Hoare triple {36198#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:10,696 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:10,696 INFO L273 TraceCheckUtils]: 58: Hoare triple {36199#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:10,697 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:10,698 INFO L273 TraceCheckUtils]: 60: Hoare triple {36200#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:10,698 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:10,699 INFO L273 TraceCheckUtils]: 62: Hoare triple {36201#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:10,700 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:10,700 INFO L273 TraceCheckUtils]: 64: Hoare triple {36202#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:10,701 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:10,701 INFO L273 TraceCheckUtils]: 66: Hoare triple {36203#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:10,702 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:10,703 INFO L273 TraceCheckUtils]: 68: Hoare triple {36204#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -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:10,703 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:10,704 INFO L273 TraceCheckUtils]: 70: Hoare triple {36205#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -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:10,704 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:10,705 INFO L273 TraceCheckUtils]: 72: Hoare triple {36206#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -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:10,706 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:10,706 INFO L273 TraceCheckUtils]: 74: Hoare triple {36207#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -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:10,707 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:10,708 INFO L273 TraceCheckUtils]: 76: Hoare triple {36208#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -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:10,708 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:10,709 INFO L273 TraceCheckUtils]: 78: Hoare triple {36209#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -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:10,709 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:10,710 INFO L273 TraceCheckUtils]: 80: Hoare triple {36210#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -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:10,711 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:10,711 INFO L273 TraceCheckUtils]: 82: Hoare triple {36211#(<= main_~i~1 38)} assume !!(~i~1 < 1000);assume -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:10,712 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:10,713 INFO L273 TraceCheckUtils]: 84: Hoare triple {36212#(<= main_~i~1 39)} assume !!(~i~1 < 1000);assume -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:10,713 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:10,714 INFO L273 TraceCheckUtils]: 86: Hoare triple {36213#(<= main_~i~1 40)} assume !(~i~1 < 1000); {36172#false} is VALID [2018-11-23 12:26:10,714 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:10,714 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:10,714 INFO L273 TraceCheckUtils]: 89: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,715 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:10,715 INFO L273 TraceCheckUtils]: 91: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,715 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:10,715 INFO L273 TraceCheckUtils]: 93: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,715 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:10,716 INFO L273 TraceCheckUtils]: 95: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,716 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:10,716 INFO L273 TraceCheckUtils]: 97: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,716 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:10,716 INFO L273 TraceCheckUtils]: 99: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,716 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:10,717 INFO L273 TraceCheckUtils]: 101: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,717 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:10,717 INFO L273 TraceCheckUtils]: 103: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,717 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:10,717 INFO L273 TraceCheckUtils]: 105: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,717 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:10,717 INFO L273 TraceCheckUtils]: 107: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,717 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:10,717 INFO L273 TraceCheckUtils]: 109: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,718 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:10,718 INFO L273 TraceCheckUtils]: 111: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,718 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:10,718 INFO L273 TraceCheckUtils]: 113: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,718 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:10,718 INFO L273 TraceCheckUtils]: 115: Hoare triple {36171#true} assume !(~i~0 < 1000); {36171#true} is VALID [2018-11-23 12:26:10,718 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:10,718 INFO L273 TraceCheckUtils]: 117: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:26:10,718 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {36171#true} {36172#false} #70#return; {36172#false} is VALID [2018-11-23 12:26:10,718 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:10,719 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:10,719 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:10,719 INFO L273 TraceCheckUtils]: 122: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,719 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:10,719 INFO L273 TraceCheckUtils]: 124: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,719 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:10,719 INFO L273 TraceCheckUtils]: 126: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,719 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:10,719 INFO L273 TraceCheckUtils]: 128: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,719 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:10,720 INFO L273 TraceCheckUtils]: 130: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,720 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:10,720 INFO L273 TraceCheckUtils]: 132: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,720 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:10,720 INFO L273 TraceCheckUtils]: 134: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,720 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:10,720 INFO L273 TraceCheckUtils]: 136: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,720 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:10,720 INFO L273 TraceCheckUtils]: 138: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,720 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:10,721 INFO L273 TraceCheckUtils]: 140: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,721 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:10,721 INFO L273 TraceCheckUtils]: 142: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,721 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:10,721 INFO L273 TraceCheckUtils]: 144: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,721 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:10,721 INFO L273 TraceCheckUtils]: 146: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,721 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:10,721 INFO L273 TraceCheckUtils]: 148: Hoare triple {36171#true} assume !(~i~0 < 1000); {36171#true} is VALID [2018-11-23 12:26:10,722 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:10,722 INFO L273 TraceCheckUtils]: 150: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:26:10,722 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {36171#true} {36172#false} #72#return; {36172#false} is VALID [2018-11-23 12:26:10,722 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:10,722 INFO L273 TraceCheckUtils]: 153: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:10,722 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:10,722 INFO L273 TraceCheckUtils]: 155: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:10,722 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:10,722 INFO L273 TraceCheckUtils]: 157: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:10,722 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:10,723 INFO L273 TraceCheckUtils]: 159: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:10,723 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:10,723 INFO L273 TraceCheckUtils]: 161: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:10,723 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:10,723 INFO L273 TraceCheckUtils]: 163: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:10,723 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:10,723 INFO L273 TraceCheckUtils]: 165: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:10,723 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:10,723 INFO L273 TraceCheckUtils]: 167: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:10,723 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:10,724 INFO L273 TraceCheckUtils]: 169: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:10,724 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:10,724 INFO L273 TraceCheckUtils]: 171: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:10,724 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:10,724 INFO L273 TraceCheckUtils]: 173: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:10,724 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:10,724 INFO L273 TraceCheckUtils]: 175: Hoare triple {36172#false} assume !(~i~2 < 999); {36172#false} is VALID [2018-11-23 12:26:10,724 INFO L273 TraceCheckUtils]: 176: Hoare triple {36172#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {36172#false} is VALID [2018-11-23 12:26:10,724 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:10,725 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:10,725 INFO L273 TraceCheckUtils]: 179: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,725 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:10,725 INFO L273 TraceCheckUtils]: 181: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,725 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:10,725 INFO L273 TraceCheckUtils]: 183: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,725 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:10,725 INFO L273 TraceCheckUtils]: 185: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,725 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:10,725 INFO L273 TraceCheckUtils]: 187: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,726 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:10,726 INFO L273 TraceCheckUtils]: 189: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,726 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:10,726 INFO L273 TraceCheckUtils]: 191: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,726 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:10,726 INFO L273 TraceCheckUtils]: 193: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,726 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:10,726 INFO L273 TraceCheckUtils]: 195: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,726 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:10,726 INFO L273 TraceCheckUtils]: 197: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,727 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:10,727 INFO L273 TraceCheckUtils]: 199: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,727 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:10,727 INFO L273 TraceCheckUtils]: 201: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,727 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:10,727 INFO L273 TraceCheckUtils]: 203: Hoare triple {36171#true} assume !!(~i~0 < 1000);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:10,727 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:10,727 INFO L273 TraceCheckUtils]: 205: Hoare triple {36171#true} assume !(~i~0 < 1000); {36171#true} is VALID [2018-11-23 12:26:10,727 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:10,727 INFO L273 TraceCheckUtils]: 207: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:26:10,728 INFO L268 TraceCheckUtils]: 208: Hoare quadruple {36171#true} {36172#false} #74#return; {36172#false} is VALID [2018-11-23 12:26:10,728 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:10,728 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:10,728 INFO L273 TraceCheckUtils]: 211: Hoare triple {36172#false} assume !false; {36172#false} is VALID [2018-11-23 12:26:10,748 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:10,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:10,748 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:10,757 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:26:10,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:26:10,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:10,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:11,500 INFO L256 TraceCheckUtils]: 0: Hoare triple {36171#true} call ULTIMATE.init(); {36171#true} is VALID [2018-11-23 12:26:11,501 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:11,501 INFO L273 TraceCheckUtils]: 2: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:26:11,501 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36171#true} {36171#true} #66#return; {36171#true} is VALID [2018-11-23 12:26:11,501 INFO L256 TraceCheckUtils]: 4: Hoare triple {36171#true} call #t~ret13 := main(); {36171#true} is VALID [2018-11-23 12:26:11,502 INFO L273 TraceCheckUtils]: 5: Hoare triple {36171#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:11,502 INFO L273 TraceCheckUtils]: 6: Hoare triple {36232#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:11,503 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:11,503 INFO L273 TraceCheckUtils]: 8: Hoare triple {36174#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:11,503 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:11,504 INFO L273 TraceCheckUtils]: 10: Hoare triple {36175#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:11,504 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:11,505 INFO L273 TraceCheckUtils]: 12: Hoare triple {36176#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:11,506 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:11,506 INFO L273 TraceCheckUtils]: 14: Hoare triple {36177#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:11,507 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:11,507 INFO L273 TraceCheckUtils]: 16: Hoare triple {36178#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:11,508 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:11,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {36179#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:11,509 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:11,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {36180#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:11,511 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:11,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {36181#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:11,512 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:11,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {36182#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:11,513 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:11,514 INFO L273 TraceCheckUtils]: 26: Hoare triple {36183#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:11,514 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:11,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {36184#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:11,516 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:11,516 INFO L273 TraceCheckUtils]: 30: Hoare triple {36185#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:11,517 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:11,517 INFO L273 TraceCheckUtils]: 32: Hoare triple {36186#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:11,518 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:11,519 INFO L273 TraceCheckUtils]: 34: Hoare triple {36187#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:11,519 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:11,520 INFO L273 TraceCheckUtils]: 36: Hoare triple {36188#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:11,521 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:11,521 INFO L273 TraceCheckUtils]: 38: Hoare triple {36189#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:11,522 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:11,522 INFO L273 TraceCheckUtils]: 40: Hoare triple {36190#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:11,523 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:11,524 INFO L273 TraceCheckUtils]: 42: Hoare triple {36191#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:11,524 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:11,525 INFO L273 TraceCheckUtils]: 44: Hoare triple {36192#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:11,525 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:11,526 INFO L273 TraceCheckUtils]: 46: Hoare triple {36193#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:11,527 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:11,527 INFO L273 TraceCheckUtils]: 48: Hoare triple {36194#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:11,528 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:11,529 INFO L273 TraceCheckUtils]: 50: Hoare triple {36195#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:11,529 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:11,530 INFO L273 TraceCheckUtils]: 52: Hoare triple {36196#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:11,530 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:11,531 INFO L273 TraceCheckUtils]: 54: Hoare triple {36197#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:11,532 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:11,532 INFO L273 TraceCheckUtils]: 56: Hoare triple {36198#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:11,533 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:11,534 INFO L273 TraceCheckUtils]: 58: Hoare triple {36199#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:11,534 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:11,535 INFO L273 TraceCheckUtils]: 60: Hoare triple {36200#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:11,535 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:11,536 INFO L273 TraceCheckUtils]: 62: Hoare triple {36201#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:11,537 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:11,537 INFO L273 TraceCheckUtils]: 64: Hoare triple {36202#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:11,538 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:11,538 INFO L273 TraceCheckUtils]: 66: Hoare triple {36203#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:11,539 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:11,540 INFO L273 TraceCheckUtils]: 68: Hoare triple {36204#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -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:11,540 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:11,541 INFO L273 TraceCheckUtils]: 70: Hoare triple {36205#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -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:11,542 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:11,542 INFO L273 TraceCheckUtils]: 72: Hoare triple {36206#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -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:11,543 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:11,543 INFO L273 TraceCheckUtils]: 74: Hoare triple {36207#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -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:11,544 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:11,545 INFO L273 TraceCheckUtils]: 76: Hoare triple {36208#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -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:11,545 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:11,546 INFO L273 TraceCheckUtils]: 78: Hoare triple {36209#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -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:11,547 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:11,547 INFO L273 TraceCheckUtils]: 80: Hoare triple {36210#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -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:11,548 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:11,548 INFO L273 TraceCheckUtils]: 82: Hoare triple {36211#(<= main_~i~1 38)} assume !!(~i~1 < 1000);assume -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:11,549 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:11,550 INFO L273 TraceCheckUtils]: 84: Hoare triple {36212#(<= main_~i~1 39)} assume !!(~i~1 < 1000);assume -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:11,550 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:11,551 INFO L273 TraceCheckUtils]: 86: Hoare triple {36213#(<= main_~i~1 40)} assume !(~i~1 < 1000); {36172#false} is VALID [2018-11-23 12:26:11,551 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:11,551 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:11,552 INFO L273 TraceCheckUtils]: 89: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,552 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:11,552 INFO L273 TraceCheckUtils]: 91: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,552 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:11,552 INFO L273 TraceCheckUtils]: 93: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,553 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:11,553 INFO L273 TraceCheckUtils]: 95: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,553 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:11,553 INFO L273 TraceCheckUtils]: 97: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,553 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:11,553 INFO L273 TraceCheckUtils]: 99: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,554 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:11,554 INFO L273 TraceCheckUtils]: 101: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,554 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:11,554 INFO L273 TraceCheckUtils]: 103: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,554 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:11,554 INFO L273 TraceCheckUtils]: 105: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,555 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:11,555 INFO L273 TraceCheckUtils]: 107: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,555 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:11,555 INFO L273 TraceCheckUtils]: 109: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,555 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:11,555 INFO L273 TraceCheckUtils]: 111: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,556 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:11,556 INFO L273 TraceCheckUtils]: 113: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,556 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:11,556 INFO L273 TraceCheckUtils]: 115: Hoare triple {36172#false} assume !(~i~0 < 1000); {36172#false} is VALID [2018-11-23 12:26:11,556 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:11,556 INFO L273 TraceCheckUtils]: 117: Hoare triple {36172#false} assume true; {36172#false} is VALID [2018-11-23 12:26:11,556 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {36172#false} {36172#false} #70#return; {36172#false} is VALID [2018-11-23 12:26:11,556 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:11,556 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:11,556 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:11,557 INFO L273 TraceCheckUtils]: 122: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,557 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:11,557 INFO L273 TraceCheckUtils]: 124: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,557 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:11,557 INFO L273 TraceCheckUtils]: 126: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,557 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:11,557 INFO L273 TraceCheckUtils]: 128: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,557 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:11,557 INFO L273 TraceCheckUtils]: 130: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,557 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:11,558 INFO L273 TraceCheckUtils]: 132: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,558 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:11,558 INFO L273 TraceCheckUtils]: 134: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,558 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:11,558 INFO L273 TraceCheckUtils]: 136: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,558 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:11,558 INFO L273 TraceCheckUtils]: 138: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,558 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:11,558 INFO L273 TraceCheckUtils]: 140: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,558 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:11,559 INFO L273 TraceCheckUtils]: 142: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,559 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:11,559 INFO L273 TraceCheckUtils]: 144: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,559 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:11,559 INFO L273 TraceCheckUtils]: 146: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,559 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:11,559 INFO L273 TraceCheckUtils]: 148: Hoare triple {36172#false} assume !(~i~0 < 1000); {36172#false} is VALID [2018-11-23 12:26:11,559 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:11,559 INFO L273 TraceCheckUtils]: 150: Hoare triple {36172#false} assume true; {36172#false} is VALID [2018-11-23 12:26:11,559 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {36172#false} {36172#false} #72#return; {36172#false} is VALID [2018-11-23 12:26:11,560 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:11,560 INFO L273 TraceCheckUtils]: 153: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:11,560 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:11,560 INFO L273 TraceCheckUtils]: 155: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:11,560 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:11,560 INFO L273 TraceCheckUtils]: 157: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:11,560 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:11,560 INFO L273 TraceCheckUtils]: 159: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:11,560 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:11,560 INFO L273 TraceCheckUtils]: 161: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:11,561 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:11,561 INFO L273 TraceCheckUtils]: 163: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:11,561 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:11,561 INFO L273 TraceCheckUtils]: 165: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:11,561 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:11,561 INFO L273 TraceCheckUtils]: 167: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:11,561 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:11,561 INFO L273 TraceCheckUtils]: 169: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:11,561 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:11,562 INFO L273 TraceCheckUtils]: 171: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:11,562 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:11,562 INFO L273 TraceCheckUtils]: 173: Hoare triple {36172#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:11,562 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:11,562 INFO L273 TraceCheckUtils]: 175: Hoare triple {36172#false} assume !(~i~2 < 999); {36172#false} is VALID [2018-11-23 12:26:11,562 INFO L273 TraceCheckUtils]: 176: Hoare triple {36172#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {36172#false} is VALID [2018-11-23 12:26:11,562 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:11,562 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:11,562 INFO L273 TraceCheckUtils]: 179: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,562 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:11,563 INFO L273 TraceCheckUtils]: 181: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,563 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:11,563 INFO L273 TraceCheckUtils]: 183: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,563 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:11,563 INFO L273 TraceCheckUtils]: 185: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,563 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:11,563 INFO L273 TraceCheckUtils]: 187: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,563 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:11,563 INFO L273 TraceCheckUtils]: 189: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,563 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:11,564 INFO L273 TraceCheckUtils]: 191: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,564 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:11,564 INFO L273 TraceCheckUtils]: 193: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,564 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:11,564 INFO L273 TraceCheckUtils]: 195: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,564 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:11,564 INFO L273 TraceCheckUtils]: 197: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,564 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:11,564 INFO L273 TraceCheckUtils]: 199: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,564 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:11,565 INFO L273 TraceCheckUtils]: 201: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,565 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:11,565 INFO L273 TraceCheckUtils]: 203: Hoare triple {36172#false} assume !!(~i~0 < 1000);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:11,565 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:11,565 INFO L273 TraceCheckUtils]: 205: Hoare triple {36172#false} assume !(~i~0 < 1000); {36172#false} is VALID [2018-11-23 12:26:11,565 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:11,565 INFO L273 TraceCheckUtils]: 207: Hoare triple {36172#false} assume true; {36172#false} is VALID [2018-11-23 12:26:11,565 INFO L268 TraceCheckUtils]: 208: Hoare quadruple {36172#false} {36172#false} #74#return; {36172#false} is VALID [2018-11-23 12:26:11,565 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:11,565 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:11,566 INFO L273 TraceCheckUtils]: 211: Hoare triple {36172#false} assume !false; {36172#false} is VALID [2018-11-23 12:26:11,587 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:11,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:11,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 12:26:11,618 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2018-11-23 12:26:11,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:11,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 12:26:11,827 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:11,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 12:26:11,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 12:26:11,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:26:11,828 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 44 states. [2018-11-23 12:26:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:13,026 INFO L93 Difference]: Finished difference Result 218 states and 226 transitions. [2018-11-23 12:26:13,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:26:13,026 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2018-11-23 12:26:13,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:26:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 134 transitions. [2018-11-23 12:26:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:26:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 134 transitions. [2018-11-23 12:26:13,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 134 transitions. [2018-11-23 12:26:13,162 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:13,166 INFO L225 Difference]: With dead ends: 218 [2018-11-23 12:26:13,166 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 12:26:13,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:26:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 12:26:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-11-23 12:26:13,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:13,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 153 states. [2018-11-23 12:26:13,265 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 153 states. [2018-11-23 12:26:13,266 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 153 states. [2018-11-23 12:26:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:13,268 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2018-11-23 12:26:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-11-23 12:26:13,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:13,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:13,269 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 154 states. [2018-11-23 12:26:13,269 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 154 states. [2018-11-23 12:26:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:13,272 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2018-11-23 12:26:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-11-23 12:26:13,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:13,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:13,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:13,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 12:26:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2018-11-23 12:26:13,276 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 212 [2018-11-23 12:26:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:13,276 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2018-11-23 12:26:13,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 12:26:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:26:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-23 12:26:13,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:13,277 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:13,278 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:13,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:13,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1698842739, now seen corresponding path program 41 times [2018-11-23 12:26:13,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:13,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:13,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:13,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:13,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:14,525 INFO L256 TraceCheckUtils]: 0: Hoare triple {37711#true} call ULTIMATE.init(); {37711#true} is VALID [2018-11-23 12:26:14,526 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:14,526 INFO L273 TraceCheckUtils]: 2: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:26:14,526 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37711#true} {37711#true} #66#return; {37711#true} is VALID [2018-11-23 12:26:14,526 INFO L256 TraceCheckUtils]: 4: Hoare triple {37711#true} call #t~ret13 := main(); {37711#true} is VALID [2018-11-23 12:26:14,527 INFO L273 TraceCheckUtils]: 5: Hoare triple {37711#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);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:14,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {37713#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -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:14,528 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:14,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {37714#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -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:14,529 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:14,530 INFO L273 TraceCheckUtils]: 10: Hoare triple {37715#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -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:14,530 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:14,530 INFO L273 TraceCheckUtils]: 12: Hoare triple {37716#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -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:14,531 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:14,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {37717#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -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:14,531 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:14,532 INFO L273 TraceCheckUtils]: 16: Hoare triple {37718#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -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:14,532 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:14,533 INFO L273 TraceCheckUtils]: 18: Hoare triple {37719#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -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:14,534 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:14,534 INFO L273 TraceCheckUtils]: 20: Hoare triple {37720#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -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:14,535 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:14,535 INFO L273 TraceCheckUtils]: 22: Hoare triple {37721#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -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:14,536 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:14,537 INFO L273 TraceCheckUtils]: 24: Hoare triple {37722#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -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:14,537 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:14,538 INFO L273 TraceCheckUtils]: 26: Hoare triple {37723#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -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:14,539 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:14,539 INFO L273 TraceCheckUtils]: 28: Hoare triple {37724#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -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:14,540 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:14,540 INFO L273 TraceCheckUtils]: 30: Hoare triple {37725#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -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:14,541 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:14,542 INFO L273 TraceCheckUtils]: 32: Hoare triple {37726#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -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:14,542 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:14,543 INFO L273 TraceCheckUtils]: 34: Hoare triple {37727#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -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:14,544 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:14,544 INFO L273 TraceCheckUtils]: 36: Hoare triple {37728#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -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:14,545 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:14,545 INFO L273 TraceCheckUtils]: 38: Hoare triple {37729#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -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:14,546 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:14,547 INFO L273 TraceCheckUtils]: 40: Hoare triple {37730#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -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:14,547 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:14,548 INFO L273 TraceCheckUtils]: 42: Hoare triple {37731#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -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:14,549 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:14,549 INFO L273 TraceCheckUtils]: 44: Hoare triple {37732#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -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:14,550 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:14,550 INFO L273 TraceCheckUtils]: 46: Hoare triple {37733#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -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:14,551 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:14,552 INFO L273 TraceCheckUtils]: 48: Hoare triple {37734#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -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:14,552 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:14,553 INFO L273 TraceCheckUtils]: 50: Hoare triple {37735#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -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:14,554 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:14,554 INFO L273 TraceCheckUtils]: 52: Hoare triple {37736#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -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:14,555 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:14,555 INFO L273 TraceCheckUtils]: 54: Hoare triple {37737#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -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:14,556 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:14,557 INFO L273 TraceCheckUtils]: 56: Hoare triple {37738#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -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:14,557 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:14,558 INFO L273 TraceCheckUtils]: 58: Hoare triple {37739#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -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:14,559 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:14,559 INFO L273 TraceCheckUtils]: 60: Hoare triple {37740#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -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:14,560 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:14,560 INFO L273 TraceCheckUtils]: 62: Hoare triple {37741#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -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:14,561 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:14,562 INFO L273 TraceCheckUtils]: 64: Hoare triple {37742#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -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:14,562 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:14,563 INFO L273 TraceCheckUtils]: 66: Hoare triple {37743#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -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:14,564 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:14,564 INFO L273 TraceCheckUtils]: 68: Hoare triple {37744#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -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:14,565 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:14,565 INFO L273 TraceCheckUtils]: 70: Hoare triple {37745#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -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:14,566 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:14,567 INFO L273 TraceCheckUtils]: 72: Hoare triple {37746#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -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:14,567 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:14,568 INFO L273 TraceCheckUtils]: 74: Hoare triple {37747#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -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:14,569 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:14,569 INFO L273 TraceCheckUtils]: 76: Hoare triple {37748#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -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:14,570 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:14,570 INFO L273 TraceCheckUtils]: 78: Hoare triple {37749#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -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:14,571 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:14,572 INFO L273 TraceCheckUtils]: 80: Hoare triple {37750#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -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:14,572 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:14,573 INFO L273 TraceCheckUtils]: 82: Hoare triple {37751#(<= main_~i~1 38)} assume !!(~i~1 < 1000);assume -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:14,574 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:14,574 INFO L273 TraceCheckUtils]: 84: Hoare triple {37752#(<= main_~i~1 39)} assume !!(~i~1 < 1000);assume -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:14,575 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:14,575 INFO L273 TraceCheckUtils]: 86: Hoare triple {37753#(<= main_~i~1 40)} assume !!(~i~1 < 1000);assume -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:14,576 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:14,577 INFO L273 TraceCheckUtils]: 88: Hoare triple {37754#(<= main_~i~1 41)} assume !(~i~1 < 1000); {37712#false} is VALID [2018-11-23 12:26:14,577 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:14,577 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:14,577 INFO L273 TraceCheckUtils]: 91: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,577 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:14,578 INFO L273 TraceCheckUtils]: 93: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,578 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:14,578 INFO L273 TraceCheckUtils]: 95: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,578 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:14,578 INFO L273 TraceCheckUtils]: 97: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,579 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:14,579 INFO L273 TraceCheckUtils]: 99: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,579 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:14,579 INFO L273 TraceCheckUtils]: 101: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,579 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:14,579 INFO L273 TraceCheckUtils]: 103: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,580 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:14,580 INFO L273 TraceCheckUtils]: 105: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,580 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:14,580 INFO L273 TraceCheckUtils]: 107: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,580 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:14,580 INFO L273 TraceCheckUtils]: 109: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,581 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:14,581 INFO L273 TraceCheckUtils]: 111: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,581 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:14,581 INFO L273 TraceCheckUtils]: 113: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,581 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:14,582 INFO L273 TraceCheckUtils]: 115: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,582 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:14,582 INFO L273 TraceCheckUtils]: 117: Hoare triple {37711#true} assume !(~i~0 < 1000); {37711#true} is VALID [2018-11-23 12:26:14,582 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:14,582 INFO L273 TraceCheckUtils]: 119: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:26:14,582 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {37711#true} {37712#false} #70#return; {37712#false} is VALID [2018-11-23 12:26:14,582 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:14,582 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:14,583 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:14,583 INFO L273 TraceCheckUtils]: 124: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,583 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:14,583 INFO L273 TraceCheckUtils]: 126: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,583 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:14,583 INFO L273 TraceCheckUtils]: 128: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,583 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:14,583 INFO L273 TraceCheckUtils]: 130: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,583 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:14,583 INFO L273 TraceCheckUtils]: 132: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,584 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:14,584 INFO L273 TraceCheckUtils]: 134: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,584 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:14,584 INFO L273 TraceCheckUtils]: 136: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,584 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:14,584 INFO L273 TraceCheckUtils]: 138: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,584 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:14,584 INFO L273 TraceCheckUtils]: 140: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,584 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:14,584 INFO L273 TraceCheckUtils]: 142: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,585 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:14,585 INFO L273 TraceCheckUtils]: 144: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,585 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:14,585 INFO L273 TraceCheckUtils]: 146: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,585 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:14,585 INFO L273 TraceCheckUtils]: 148: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,585 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:14,585 INFO L273 TraceCheckUtils]: 150: Hoare triple {37711#true} assume !(~i~0 < 1000); {37711#true} is VALID [2018-11-23 12:26:14,585 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:14,585 INFO L273 TraceCheckUtils]: 152: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:26:14,586 INFO L268 TraceCheckUtils]: 153: Hoare quadruple {37711#true} {37712#false} #72#return; {37712#false} is VALID [2018-11-23 12:26:14,586 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:14,586 INFO L273 TraceCheckUtils]: 155: Hoare triple {37712#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:14,586 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:14,586 INFO L273 TraceCheckUtils]: 157: Hoare triple {37712#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:14,586 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:14,586 INFO L273 TraceCheckUtils]: 159: Hoare triple {37712#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:14,586 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:14,586 INFO L273 TraceCheckUtils]: 161: Hoare triple {37712#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:14,586 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:14,587 INFO L273 TraceCheckUtils]: 163: Hoare triple {37712#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:14,587 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:14,587 INFO L273 TraceCheckUtils]: 165: Hoare triple {37712#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:14,587 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:14,587 INFO L273 TraceCheckUtils]: 167: Hoare triple {37712#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:14,587 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:14,587 INFO L273 TraceCheckUtils]: 169: Hoare triple {37712#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:14,587 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:14,587 INFO L273 TraceCheckUtils]: 171: Hoare triple {37712#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:14,587 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:14,588 INFO L273 TraceCheckUtils]: 173: Hoare triple {37712#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:14,588 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:14,588 INFO L273 TraceCheckUtils]: 175: Hoare triple {37712#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:14,588 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:14,588 INFO L273 TraceCheckUtils]: 177: Hoare triple {37712#false} assume !(~i~2 < 999); {37712#false} is VALID [2018-11-23 12:26:14,588 INFO L273 TraceCheckUtils]: 178: Hoare triple {37712#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {37712#false} is VALID [2018-11-23 12:26:14,588 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:14,588 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:14,588 INFO L273 TraceCheckUtils]: 181: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,589 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:14,589 INFO L273 TraceCheckUtils]: 183: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,589 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:14,589 INFO L273 TraceCheckUtils]: 185: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,589 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:14,589 INFO L273 TraceCheckUtils]: 187: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,589 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:14,589 INFO L273 TraceCheckUtils]: 189: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,589 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:14,589 INFO L273 TraceCheckUtils]: 191: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,590 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:14,590 INFO L273 TraceCheckUtils]: 193: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,590 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:14,590 INFO L273 TraceCheckUtils]: 195: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,590 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:14,590 INFO L273 TraceCheckUtils]: 197: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,590 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:14,590 INFO L273 TraceCheckUtils]: 199: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,590 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:14,590 INFO L273 TraceCheckUtils]: 201: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,591 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:14,591 INFO L273 TraceCheckUtils]: 203: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,591 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:14,591 INFO L273 TraceCheckUtils]: 205: Hoare triple {37711#true} assume !!(~i~0 < 1000);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:14,591 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:14,591 INFO L273 TraceCheckUtils]: 207: Hoare triple {37711#true} assume !(~i~0 < 1000); {37711#true} is VALID [2018-11-23 12:26:14,591 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:14,591 INFO L273 TraceCheckUtils]: 209: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:26:14,591 INFO L268 TraceCheckUtils]: 210: Hoare quadruple {37711#true} {37712#false} #74#return; {37712#false} is VALID [2018-11-23 12:26:14,591 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:14,592 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:14,592 INFO L273 TraceCheckUtils]: 213: Hoare triple {37712#false} assume !false; {37712#false} is VALID [2018-11-23 12:26:14,612 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:14,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:14,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14,622 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1