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/mapavg2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:26:45,756 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:26:45,759 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:26:45,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:26:45,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:26:45,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:26:45,778 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:26:45,780 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:26:45,782 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:26:45,783 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:26:45,784 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:26:45,784 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:26:45,785 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:26:45,786 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:26:45,787 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:26:45,788 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:26:45,789 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:26:45,790 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:26:45,792 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:26:45,794 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:26:45,795 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:26:45,796 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:26:45,798 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:26:45,798 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:26:45,800 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:26:45,801 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:26:45,802 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:26:45,802 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:26:45,807 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:26:45,809 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:26:45,809 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:26:45,810 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:26:45,810 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:26:45,812 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:26:45,813 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:26:45,815 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:26:45,815 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:26:45,842 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:26:45,842 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:26:45,843 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:26:45,843 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:26:45,847 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:26:45,847 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:26:45,847 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:26:45,848 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:26:45,849 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:26:45,849 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:26:45,849 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:26:45,849 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:26:45,849 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:26:45,850 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:26:45,850 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:26:45,850 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:26:45,850 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:26:45,850 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:26:45,851 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:26:45,852 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:26:45,852 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:26:45,852 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:26:45,852 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:26:45,852 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:26:45,853 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:26:45,853 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:26:45,853 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:26:45,853 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:26:45,854 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:26:45,854 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:26:45,854 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:26:45,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:26:45,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:26:45,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:26:45,923 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:26:45,924 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:26:45,924 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapavg2_true-unreach-call.i [2018-11-23 12:26:45,988 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d0793b27/265526de47d84c079647de0cda17d125/FLAG5991cf6a4 [2018-11-23 12:26:46,446 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:26:46,446 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapavg2_true-unreach-call.i [2018-11-23 12:26:46,453 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d0793b27/265526de47d84c079647de0cda17d125/FLAG5991cf6a4 [2018-11-23 12:26:46,798 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d0793b27/265526de47d84c079647de0cda17d125 [2018-11-23 12:26:46,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:26:46,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:26:46,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:26:46,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:26:46,814 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:26:46,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:26:46" (1/1) ... [2018-11-23 12:26:46,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d13d574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:46, skipping insertion in model container [2018-11-23 12:26:46,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:26:46" (1/1) ... [2018-11-23 12:26:46,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:26:46,852 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:26:47,058 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:26:47,071 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:26:47,100 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:26:47,126 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:26:47,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:47 WrapperNode [2018-11-23 12:26:47,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:26:47,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:26:47,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:26:47,128 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:26:47,139 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:26:47" (1/1) ... [2018-11-23 12:26:47,151 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:26:47" (1/1) ... [2018-11-23 12:26:47,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:26:47,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:26:47,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:26:47,162 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:26:47,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:47" (1/1) ... [2018-11-23 12:26:47,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:47" (1/1) ... [2018-11-23 12:26:47,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:47" (1/1) ... [2018-11-23 12:26:47,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:47" (1/1) ... [2018-11-23 12:26:47,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:47" (1/1) ... [2018-11-23 12:26:47,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:47" (1/1) ... [2018-11-23 12:26:47,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:47" (1/1) ... [2018-11-23 12:26:47,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:26:47,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:26:47,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:26:47,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:26:47,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:47" (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:26:47,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:26:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:26:47,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:26:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:26:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:26:47,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:26:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:26:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:26:47,431 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:26:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure mapavg [2018-11-23 12:26:47,432 INFO L138 BoogieDeclarations]: Found implementation of procedure mapavg [2018-11-23 12:26:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:26:48,118 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:26:48,119 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:26:48,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:26:48 BoogieIcfgContainer [2018-11-23 12:26:48,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:26:48,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:26:48,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:26:48,125 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:26:48,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:26:46" (1/3) ... [2018-11-23 12:26:48,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eca4135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:26:48, skipping insertion in model container [2018-11-23 12:26:48,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:47" (2/3) ... [2018-11-23 12:26:48,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eca4135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:26:48, skipping insertion in model container [2018-11-23 12:26:48,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:26:48" (3/3) ... [2018-11-23 12:26:48,129 INFO L112 eAbstractionObserver]: Analyzing ICFG mapavg2_true-unreach-call.i [2018-11-23 12:26:48,141 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:26:48,151 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:26:48,169 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:26:48,204 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:26:48,205 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:26:48,205 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:26:48,205 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:26:48,205 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:26:48,205 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:26:48,205 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:26:48,206 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:26:48,206 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:26:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:26:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:26:48,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:48,233 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:26:48,236 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:48,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:48,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1234592251, now seen corresponding path program 1 times [2018-11-23 12:26:48,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:48,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:48,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:48,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:48,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:48,458 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:26:48,462 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:26:48,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:26:48,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 12:26:48,464 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret12 := main(); {34#true} is VALID [2018-11-23 12:26:48,464 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34#true} is VALID [2018-11-23 12:26:48,465 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:26:48,465 INFO L256 TraceCheckUtils]: 7: Hoare triple {35#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:26:48,466 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34#true} is VALID [2018-11-23 12:26:48,466 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !(~i~0 < 1000); {34#true} is VALID [2018-11-23 12:26:48,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:26:48,467 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:26:48,468 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {34#true} {35#false} #70#return; {35#false} is VALID [2018-11-23 12:26:48,468 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:26:48,469 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:26:48,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34#true} is VALID [2018-11-23 12:26:48,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !(~i~0 < 1000); {34#true} is VALID [2018-11-23 12:26:48,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {34#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:26:48,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:26:48,470 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #72#return; {35#false} is VALID [2018-11-23 12:26:48,470 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {35#false} is VALID [2018-11-23 12:26:48,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:26:48,471 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:26:48,471 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:26:48,471 INFO L273 TraceCheckUtils]: 24: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34#true} is VALID [2018-11-23 12:26:48,472 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !(~i~0 < 1000); {34#true} is VALID [2018-11-23 12:26:48,472 INFO L273 TraceCheckUtils]: 26: Hoare triple {34#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:26:48,472 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:26:48,472 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #74#return; {35#false} is VALID [2018-11-23 12:26:48,473 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {35#false} is VALID [2018-11-23 12:26:48,473 INFO L273 TraceCheckUtils]: 30: Hoare triple {35#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {35#false} is VALID [2018-11-23 12:26:48,474 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:26:48,480 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:26:48,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:26:48,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:26:48,489 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:26:48,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:48,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:26:48,734 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:26:48,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:26:48,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:26:48,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:26:48,748 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:26:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:48,886 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 12:26:48,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:26:48,887 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:26:48,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:26:48,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:26:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:26:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:26:48,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 12:26:49,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:49,172 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:26:49,172 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:26:49,176 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:26:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:26:49,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:26:49,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:49,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:26:49,223 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:26:49,223 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:26:49,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:49,230 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:26:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:26:49,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:49,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:49,232 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:26:49,232 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:26:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:49,237 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:26:49,237 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:26:49,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:49,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:49,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:49,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:26:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:26:49,247 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 12:26:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:49,247 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:26:49,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:26:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:26:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:26:49,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:49,251 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:26:49,251 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:49,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:49,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1054720325, now seen corresponding path program 1 times [2018-11-23 12:26:49,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:49,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:49,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:49,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:49,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2018-11-23 12:26:49,369 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:26:49,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:26:49,370 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #66#return; {198#true} is VALID [2018-11-23 12:26:49,370 INFO L256 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret12 := main(); {198#true} is VALID [2018-11-23 12:26:49,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {198#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {200#(= main_~i~1 0)} is VALID [2018-11-23 12:26:49,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= main_~i~1 0)} assume !(~i~1 < 1000); {199#false} is VALID [2018-11-23 12:26:49,390 INFO L256 TraceCheckUtils]: 7: Hoare triple {199#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:26:49,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {198#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {198#true} is VALID [2018-11-23 12:26:49,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#true} assume !(~i~0 < 1000); {198#true} is VALID [2018-11-23 12:26:49,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:26:49,391 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:26:49,391 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {198#true} {199#false} #70#return; {199#false} is VALID [2018-11-23 12:26:49,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {199#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:26:49,392 INFO L256 TraceCheckUtils]: 14: Hoare triple {199#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:26:49,392 INFO L273 TraceCheckUtils]: 15: Hoare triple {198#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {198#true} is VALID [2018-11-23 12:26:49,392 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#true} assume !(~i~0 < 1000); {198#true} is VALID [2018-11-23 12:26:49,392 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:26:49,393 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:26:49,393 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {198#true} {199#false} #72#return; {199#false} is VALID [2018-11-23 12:26:49,393 INFO L273 TraceCheckUtils]: 20: Hoare triple {199#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {199#false} is VALID [2018-11-23 12:26:49,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {199#false} assume !(~i~2 < 999); {199#false} is VALID [2018-11-23 12:26:49,394 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:26:49,395 INFO L256 TraceCheckUtils]: 23: Hoare triple {199#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:26:49,395 INFO L273 TraceCheckUtils]: 24: Hoare triple {198#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {198#true} is VALID [2018-11-23 12:26:49,395 INFO L273 TraceCheckUtils]: 25: Hoare triple {198#true} assume !(~i~0 < 1000); {198#true} is VALID [2018-11-23 12:26:49,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {198#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:26:49,396 INFO L273 TraceCheckUtils]: 27: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:26:49,396 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {198#true} {199#false} #74#return; {199#false} is VALID [2018-11-23 12:26:49,397 INFO L273 TraceCheckUtils]: 29: Hoare triple {199#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {199#false} is VALID [2018-11-23 12:26:49,397 INFO L273 TraceCheckUtils]: 30: Hoare triple {199#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {199#false} is VALID [2018-11-23 12:26:49,397 INFO L273 TraceCheckUtils]: 31: Hoare triple {199#false} assume !false; {199#false} is VALID [2018-11-23 12:26:49,400 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:26:49,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:26:49,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:26:49,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:26:49,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:49,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:26:49,480 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:26:49,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:26:49,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:26:49,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:26:49,481 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 12:26:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:50,009 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:26:50,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:26:50,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:26:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:26:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:26:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:26:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:26:50,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:26:50,228 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:26:50,231 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:26:50,231 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:26:50,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:26:50,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:26:50,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:26:50,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:50,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:26:50,251 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:26:50,251 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:26:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:50,257 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:26:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:26:50,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:50,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:50,260 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:26:50,260 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:26:50,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:50,266 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:26:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:26:50,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:50,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:50,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:50,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:26:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:26:50,271 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:26:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:50,271 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:26:50,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:26:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:26:50,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:26:50,273 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:50,273 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:26:50,274 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:50,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:50,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1286970653, now seen corresponding path program 1 times [2018-11-23 12:26:50,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:50,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:50,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:50,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:50,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:50,411 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:26:50,411 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:26:50,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:26:50,412 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:26:50,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret12 := main(); {362#true} is VALID [2018-11-23 12:26:50,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:26:50,413 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {362#true} is VALID [2018-11-23 12:26:50,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {362#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {362#true} is VALID [2018-11-23 12:26:50,414 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 1000); {362#true} is VALID [2018-11-23 12:26:50,414 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:26:50,415 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {364#(= mapavg_~i~0 0)} is VALID [2018-11-23 12:26:50,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= mapavg_~i~0 0)} assume !(~i~0 < 1000); {363#false} is VALID [2018-11-23 12:26:50,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:26:50,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:26:50,419 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:26:50,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {363#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:26:50,419 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:26:50,420 INFO L273 TraceCheckUtils]: 17: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {362#true} is VALID [2018-11-23 12:26:50,420 INFO L273 TraceCheckUtils]: 18: Hoare triple {362#true} assume !(~i~0 < 1000); {362#true} is VALID [2018-11-23 12:26:50,420 INFO L273 TraceCheckUtils]: 19: Hoare triple {362#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:26:50,421 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:26:50,421 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {362#true} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:26:50,421 INFO L273 TraceCheckUtils]: 22: Hoare triple {363#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {363#false} is VALID [2018-11-23 12:26:50,422 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 999); {363#false} is VALID [2018-11-23 12:26:50,422 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:26:50,422 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:26:50,422 INFO L273 TraceCheckUtils]: 26: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {362#true} is VALID [2018-11-23 12:26:50,423 INFO L273 TraceCheckUtils]: 27: Hoare triple {362#true} assume !(~i~0 < 1000); {362#true} is VALID [2018-11-23 12:26:50,423 INFO L273 TraceCheckUtils]: 28: Hoare triple {362#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:26:50,423 INFO L273 TraceCheckUtils]: 29: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:26:50,424 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {362#true} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:26:50,424 INFO L273 TraceCheckUtils]: 31: Hoare triple {363#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {363#false} is VALID [2018-11-23 12:26:50,424 INFO L273 TraceCheckUtils]: 32: Hoare triple {363#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {363#false} is VALID [2018-11-23 12:26:50,425 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:26:50,427 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:26:50,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:50,428 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:26:50,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:50,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:50,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:26:50,631 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:26:50,631 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:26:50,632 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:26:50,632 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret12 := main(); {362#true} is VALID [2018-11-23 12:26:50,632 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:26:50,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {362#true} is VALID [2018-11-23 12:26:50,633 INFO L273 TraceCheckUtils]: 7: Hoare triple {362#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {362#true} is VALID [2018-11-23 12:26:50,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 1000); {362#true} is VALID [2018-11-23 12:26:50,633 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:26:50,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {398#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:26:50,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(<= mapavg_~i~0 0)} assume !(~i~0 < 1000); {363#false} is VALID [2018-11-23 12:26:50,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:26:50,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:26:50,641 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:26:50,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {363#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:26:50,641 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:26:50,641 INFO L273 TraceCheckUtils]: 17: Hoare triple {363#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {363#false} is VALID [2018-11-23 12:26:50,642 INFO L273 TraceCheckUtils]: 18: Hoare triple {363#false} assume !(~i~0 < 1000); {363#false} is VALID [2018-11-23 12:26:50,642 INFO L273 TraceCheckUtils]: 19: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:26:50,643 INFO L273 TraceCheckUtils]: 20: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:26:50,643 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {363#false} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:26:50,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {363#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {363#false} is VALID [2018-11-23 12:26:50,644 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 999); {363#false} is VALID [2018-11-23 12:26:50,644 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:26:50,644 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:26:50,645 INFO L273 TraceCheckUtils]: 26: Hoare triple {363#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {363#false} is VALID [2018-11-23 12:26:50,645 INFO L273 TraceCheckUtils]: 27: Hoare triple {363#false} assume !(~i~0 < 1000); {363#false} is VALID [2018-11-23 12:26:50,645 INFO L273 TraceCheckUtils]: 28: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:26:50,646 INFO L273 TraceCheckUtils]: 29: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:26:50,646 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {363#false} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:26:50,646 INFO L273 TraceCheckUtils]: 31: Hoare triple {363#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {363#false} is VALID [2018-11-23 12:26:50,647 INFO L273 TraceCheckUtils]: 32: Hoare triple {363#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {363#false} is VALID [2018-11-23 12:26:50,647 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:26:50,649 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:26:50,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:26:50,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:26:50,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:26:50,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:50,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:26:50,796 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:26:50,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:26:50,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:26:50,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:26:50,797 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2018-11-23 12:26:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:51,050 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:26:51,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:26:51,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:26:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:26:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:26:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:26:51,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:26:51,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:26:51,194 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:26:51,197 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:26:51,197 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:26:51,198 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:26:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:26:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:26:51,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:51,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:26:51,218 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:26:51,218 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:26:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:51,221 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:26:51,222 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:26:51,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:51,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:51,223 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:26:51,223 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:26:51,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:51,226 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:26:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:26:51,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:51,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:51,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:51,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:26:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:26:51,229 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2018-11-23 12:26:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:51,230 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:26:51,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:26:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:26:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:26:51,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:51,232 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:26:51,232 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:51,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:51,232 INFO L82 PathProgramCache]: Analyzing trace with hash -631694085, now seen corresponding path program 1 times [2018-11-23 12:26:51,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:51,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:51,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:51,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:51,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:51,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-23 12:26:51,355 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:26:51,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:26:51,356 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #66#return; {630#true} is VALID [2018-11-23 12:26:51,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret12 := main(); {630#true} is VALID [2018-11-23 12:26:51,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {630#true} is VALID [2018-11-23 12:26:51,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {630#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {630#true} is VALID [2018-11-23 12:26:51,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {630#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {630#true} is VALID [2018-11-23 12:26:51,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {630#true} assume !(~i~1 < 1000); {630#true} is VALID [2018-11-23 12:26:51,357 INFO L256 TraceCheckUtils]: 9: Hoare triple {630#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:26:51,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {630#true} is VALID [2018-11-23 12:26:51,358 INFO L273 TraceCheckUtils]: 11: Hoare triple {630#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {630#true} is VALID [2018-11-23 12:26:51,358 INFO L273 TraceCheckUtils]: 12: Hoare triple {630#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {630#true} is VALID [2018-11-23 12:26:51,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {630#true} assume !(~i~0 < 1000); {630#true} is VALID [2018-11-23 12:26:51,359 INFO L273 TraceCheckUtils]: 14: Hoare triple {630#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:26:51,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:26:51,360 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {630#true} {630#true} #70#return; {630#true} is VALID [2018-11-23 12:26:51,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {630#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {630#true} is VALID [2018-11-23 12:26:51,360 INFO L256 TraceCheckUtils]: 18: Hoare triple {630#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:26:51,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {630#true} is VALID [2018-11-23 12:26:51,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {630#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {630#true} is VALID [2018-11-23 12:26:51,361 INFO L273 TraceCheckUtils]: 21: Hoare triple {630#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {630#true} is VALID [2018-11-23 12:26:51,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {630#true} assume !(~i~0 < 1000); {630#true} is VALID [2018-11-23 12:26:51,362 INFO L273 TraceCheckUtils]: 23: Hoare triple {630#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:26:51,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:26:51,362 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {630#true} {630#true} #72#return; {630#true} is VALID [2018-11-23 12:26:51,374 INFO L273 TraceCheckUtils]: 26: Hoare triple {630#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {632#(= main_~i~2 0)} is VALID [2018-11-23 12:26:51,375 INFO L273 TraceCheckUtils]: 27: Hoare triple {632#(= main_~i~2 0)} assume !(~i~2 < 999); {631#false} is VALID [2018-11-23 12:26:51,375 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:26:51,376 INFO L256 TraceCheckUtils]: 29: Hoare triple {631#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:26:51,376 INFO L273 TraceCheckUtils]: 30: Hoare triple {630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {630#true} is VALID [2018-11-23 12:26:51,376 INFO L273 TraceCheckUtils]: 31: Hoare triple {630#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {630#true} is VALID [2018-11-23 12:26:51,376 INFO L273 TraceCheckUtils]: 32: Hoare triple {630#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {630#true} is VALID [2018-11-23 12:26:51,377 INFO L273 TraceCheckUtils]: 33: Hoare triple {630#true} assume !(~i~0 < 1000); {630#true} is VALID [2018-11-23 12:26:51,377 INFO L273 TraceCheckUtils]: 34: Hoare triple {630#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:26:51,377 INFO L273 TraceCheckUtils]: 35: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:26:51,377 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {630#true} {631#false} #74#return; {631#false} is VALID [2018-11-23 12:26:51,377 INFO L273 TraceCheckUtils]: 37: Hoare triple {631#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {631#false} is VALID [2018-11-23 12:26:51,378 INFO L273 TraceCheckUtils]: 38: Hoare triple {631#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {631#false} is VALID [2018-11-23 12:26:51,378 INFO L273 TraceCheckUtils]: 39: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-23 12:26:51,381 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:26:51,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:26:51,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:26:51,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:26:51,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:51,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:26:51,466 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:26:51,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:26:51,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:26:51,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:26:51,467 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 12:26:51,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:51,552 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:26:51,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:26:51,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:26:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:26:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:26:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:26:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:26:51,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 12:26:51,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:51,651 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:26:51,651 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:26:51,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:26:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:26:51,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:26:51,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:51,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:26:51,671 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:26:51,671 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:26:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:51,673 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:26:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:26:51,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:51,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:51,675 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:26:51,675 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:26:51,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:51,677 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:26:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:26:51,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:51,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:51,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:51,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:26:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:26:51,681 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2018-11-23 12:26:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:51,681 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:26:51,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:26:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:26:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:26:51,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:51,683 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:51,684 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:51,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:51,684 INFO L82 PathProgramCache]: Analyzing trace with hash -490156423, now seen corresponding path program 1 times [2018-11-23 12:26:51,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:51,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:51,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:51,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:51,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:51,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:26:51,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {799#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {799#true} is VALID [2018-11-23 12:26:51,873 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:26:51,874 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:26:51,874 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret12 := main(); {799#true} is VALID [2018-11-23 12:26:51,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:26:51,877 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:26:51,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {801#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {802#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:51,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 1000); {800#false} is VALID [2018-11-23 12:26:51,878 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:26:51,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {799#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {799#true} is VALID [2018-11-23 12:26:51,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {799#true} is VALID [2018-11-23 12:26:51,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {799#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {799#true} is VALID [2018-11-23 12:26:51,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {799#true} assume !(~i~0 < 1000); {799#true} is VALID [2018-11-23 12:26:51,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {799#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:26:51,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:26:51,880 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {799#true} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:26:51,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {800#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:26:51,881 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:26:51,881 INFO L273 TraceCheckUtils]: 19: Hoare triple {799#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {799#true} is VALID [2018-11-23 12:26:51,881 INFO L273 TraceCheckUtils]: 20: Hoare triple {799#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {799#true} is VALID [2018-11-23 12:26:51,882 INFO L273 TraceCheckUtils]: 21: Hoare triple {799#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {799#true} is VALID [2018-11-23 12:26:51,882 INFO L273 TraceCheckUtils]: 22: Hoare triple {799#true} assume !(~i~0 < 1000); {799#true} is VALID [2018-11-23 12:26:51,882 INFO L273 TraceCheckUtils]: 23: Hoare triple {799#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:26:51,883 INFO L273 TraceCheckUtils]: 24: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:26:51,883 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {799#true} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:26:51,883 INFO L273 TraceCheckUtils]: 26: Hoare triple {800#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {800#false} is VALID [2018-11-23 12:26:51,883 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {800#false} is VALID [2018-11-23 12:26:51,884 INFO L273 TraceCheckUtils]: 28: Hoare triple {800#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {800#false} is VALID [2018-11-23 12:26:51,884 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 999); {800#false} is VALID [2018-11-23 12:26:51,884 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:26:51,885 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:26:51,885 INFO L273 TraceCheckUtils]: 32: Hoare triple {799#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {799#true} is VALID [2018-11-23 12:26:51,885 INFO L273 TraceCheckUtils]: 33: Hoare triple {799#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {799#true} is VALID [2018-11-23 12:26:51,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {799#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {799#true} is VALID [2018-11-23 12:26:51,886 INFO L273 TraceCheckUtils]: 35: Hoare triple {799#true} assume !(~i~0 < 1000); {799#true} is VALID [2018-11-23 12:26:51,886 INFO L273 TraceCheckUtils]: 36: Hoare triple {799#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:26:51,886 INFO L273 TraceCheckUtils]: 37: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:26:51,887 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {799#true} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:26:51,887 INFO L273 TraceCheckUtils]: 39: Hoare triple {800#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {800#false} is VALID [2018-11-23 12:26:51,887 INFO L273 TraceCheckUtils]: 40: Hoare triple {800#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {800#false} is VALID [2018-11-23 12:26:51,888 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:26:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:26:51,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:51,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:51,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:52,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:52,445 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:26:52,445 INFO L273 TraceCheckUtils]: 1: Hoare triple {799#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {799#true} is VALID [2018-11-23 12:26:52,446 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:26:52,446 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:26:52,446 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret12 := main(); {799#true} is VALID [2018-11-23 12:26:52,447 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:52,448 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:52,448 INFO L273 TraceCheckUtils]: 7: Hoare triple {821#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {802#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:52,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 1000); {800#false} is VALID [2018-11-23 12:26:52,449 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:26:52,450 INFO L273 TraceCheckUtils]: 10: Hoare triple {800#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {800#false} is VALID [2018-11-23 12:26:52,450 INFO L273 TraceCheckUtils]: 11: Hoare triple {800#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {800#false} is VALID [2018-11-23 12:26:52,450 INFO L273 TraceCheckUtils]: 12: Hoare triple {800#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {800#false} is VALID [2018-11-23 12:26:52,451 INFO L273 TraceCheckUtils]: 13: Hoare triple {800#false} assume !(~i~0 < 1000); {800#false} is VALID [2018-11-23 12:26:52,451 INFO L273 TraceCheckUtils]: 14: Hoare triple {800#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:26:52,452 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:26:52,452 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#false} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:26:52,452 INFO L273 TraceCheckUtils]: 17: Hoare triple {800#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:26:52,452 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:26:52,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {800#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {800#false} is VALID [2018-11-23 12:26:52,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {800#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {800#false} is VALID [2018-11-23 12:26:52,453 INFO L273 TraceCheckUtils]: 21: Hoare triple {800#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {800#false} is VALID [2018-11-23 12:26:52,453 INFO L273 TraceCheckUtils]: 22: Hoare triple {800#false} assume !(~i~0 < 1000); {800#false} is VALID [2018-11-23 12:26:52,454 INFO L273 TraceCheckUtils]: 23: Hoare triple {800#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:26:52,454 INFO L273 TraceCheckUtils]: 24: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:26:52,454 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {800#false} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:26:52,454 INFO L273 TraceCheckUtils]: 26: Hoare triple {800#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {800#false} is VALID [2018-11-23 12:26:52,455 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {800#false} is VALID [2018-11-23 12:26:52,455 INFO L273 TraceCheckUtils]: 28: Hoare triple {800#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {800#false} is VALID [2018-11-23 12:26:52,455 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 999); {800#false} is VALID [2018-11-23 12:26:52,456 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:26:52,456 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:26:52,456 INFO L273 TraceCheckUtils]: 32: Hoare triple {800#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {800#false} is VALID [2018-11-23 12:26:52,456 INFO L273 TraceCheckUtils]: 33: Hoare triple {800#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {800#false} is VALID [2018-11-23 12:26:52,457 INFO L273 TraceCheckUtils]: 34: Hoare triple {800#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {800#false} is VALID [2018-11-23 12:26:52,457 INFO L273 TraceCheckUtils]: 35: Hoare triple {800#false} assume !(~i~0 < 1000); {800#false} is VALID [2018-11-23 12:26:52,457 INFO L273 TraceCheckUtils]: 36: Hoare triple {800#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:26:52,457 INFO L273 TraceCheckUtils]: 37: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:26:52,458 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {800#false} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:26:52,458 INFO L273 TraceCheckUtils]: 39: Hoare triple {800#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {800#false} is VALID [2018-11-23 12:26:52,458 INFO L273 TraceCheckUtils]: 40: Hoare triple {800#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {800#false} is VALID [2018-11-23 12:26:52,459 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:26:52,461 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:26:52,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:52,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:26:52,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:26:52,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:52,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:26:52,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:52,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:26:52,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:26:52,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:26:52,547 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2018-11-23 12:26:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:52,689 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:26:52,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:26:52,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:26:52,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:26:52,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:26:52,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:26:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:26:52,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-23 12:26:52,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:52,802 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:26:52,803 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:26:52,803 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:26:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:26:52,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:26:52,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:52,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:26:52,861 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:26:52,861 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:26:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:52,864 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:26:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:26:52,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:52,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:52,866 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:26:52,866 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:26:52,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:52,868 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:26:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:26:52,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:52,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:52,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:52,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:26:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:26:52,872 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2018-11-23 12:26:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:52,872 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:26:52,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:26:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:26:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:26:52,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:52,874 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:52,875 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:52,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1271601755, now seen corresponding path program 2 times [2018-11-23 12:26:52,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:52,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:52,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:52,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:52,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:53,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:26:53,029 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1114#true} is VALID [2018-11-23 12:26:53,029 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:26:53,029 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:26:53,029 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret12 := main(); {1114#true} is VALID [2018-11-23 12:26:53,030 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:26:53,033 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:26:53,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {1116#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:53,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:53,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {1117#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1118#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:53,036 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 1000); {1115#false} is VALID [2018-11-23 12:26:53,036 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:26:53,037 INFO L273 TraceCheckUtils]: 12: Hoare triple {1114#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1114#true} is VALID [2018-11-23 12:26:53,037 INFO L273 TraceCheckUtils]: 13: Hoare triple {1114#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1114#true} is VALID [2018-11-23 12:26:53,038 INFO L273 TraceCheckUtils]: 14: Hoare triple {1114#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1114#true} is VALID [2018-11-23 12:26:53,038 INFO L273 TraceCheckUtils]: 15: Hoare triple {1114#true} assume !(~i~0 < 1000); {1114#true} is VALID [2018-11-23 12:26:53,038 INFO L273 TraceCheckUtils]: 16: Hoare triple {1114#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:26:53,039 INFO L273 TraceCheckUtils]: 17: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:26:53,039 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1114#true} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:26:53,039 INFO L273 TraceCheckUtils]: 19: Hoare triple {1115#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:26:53,040 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:26:53,040 INFO L273 TraceCheckUtils]: 21: Hoare triple {1114#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1114#true} is VALID [2018-11-23 12:26:53,040 INFO L273 TraceCheckUtils]: 22: Hoare triple {1114#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1114#true} is VALID [2018-11-23 12:26:53,040 INFO L273 TraceCheckUtils]: 23: Hoare triple {1114#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1114#true} is VALID [2018-11-23 12:26:53,041 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#true} assume !(~i~0 < 1000); {1114#true} is VALID [2018-11-23 12:26:53,041 INFO L273 TraceCheckUtils]: 25: Hoare triple {1114#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:26:53,041 INFO L273 TraceCheckUtils]: 26: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:26:53,042 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1114#true} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:26:53,042 INFO L273 TraceCheckUtils]: 28: Hoare triple {1115#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1115#false} is VALID [2018-11-23 12:26:53,042 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1115#false} is VALID [2018-11-23 12:26:53,042 INFO L273 TraceCheckUtils]: 30: Hoare triple {1115#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1115#false} is VALID [2018-11-23 12:26:53,043 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 999); {1115#false} is VALID [2018-11-23 12:26:53,043 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:26:53,043 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:26:53,043 INFO L273 TraceCheckUtils]: 34: Hoare triple {1114#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1114#true} is VALID [2018-11-23 12:26:53,044 INFO L273 TraceCheckUtils]: 35: Hoare triple {1114#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1114#true} is VALID [2018-11-23 12:26:53,044 INFO L273 TraceCheckUtils]: 36: Hoare triple {1114#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1114#true} is VALID [2018-11-23 12:26:53,044 INFO L273 TraceCheckUtils]: 37: Hoare triple {1114#true} assume !(~i~0 < 1000); {1114#true} is VALID [2018-11-23 12:26:53,045 INFO L273 TraceCheckUtils]: 38: Hoare triple {1114#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:26:53,045 INFO L273 TraceCheckUtils]: 39: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:26:53,045 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1114#true} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:26:53,045 INFO L273 TraceCheckUtils]: 41: Hoare triple {1115#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1115#false} is VALID [2018-11-23 12:26:53,046 INFO L273 TraceCheckUtils]: 42: Hoare triple {1115#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1115#false} is VALID [2018-11-23 12:26:53,046 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:26:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:26:53,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:53,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:53,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:26:53,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:26:53,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:53,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:53,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:26:53,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1114#true} is VALID [2018-11-23 12:26:53,253 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:26:53,254 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:26:53,254 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret12 := main(); {1114#true} is VALID [2018-11-23 12:26:53,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:53,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {1137#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:53,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {1137#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:53,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:53,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {1117#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1118#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:53,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 1000); {1115#false} is VALID [2018-11-23 12:26:53,262 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:26:53,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {1115#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1115#false} is VALID [2018-11-23 12:26:53,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {1115#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1115#false} is VALID [2018-11-23 12:26:53,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {1115#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1115#false} is VALID [2018-11-23 12:26:53,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {1115#false} assume !(~i~0 < 1000); {1115#false} is VALID [2018-11-23 12:26:53,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {1115#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:26:53,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:26:53,263 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1115#false} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:26:53,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {1115#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:26:53,264 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:26:53,264 INFO L273 TraceCheckUtils]: 21: Hoare triple {1115#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1115#false} is VALID [2018-11-23 12:26:53,265 INFO L273 TraceCheckUtils]: 22: Hoare triple {1115#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1115#false} is VALID [2018-11-23 12:26:53,265 INFO L273 TraceCheckUtils]: 23: Hoare triple {1115#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1115#false} is VALID [2018-11-23 12:26:53,265 INFO L273 TraceCheckUtils]: 24: Hoare triple {1115#false} assume !(~i~0 < 1000); {1115#false} is VALID [2018-11-23 12:26:53,266 INFO L273 TraceCheckUtils]: 25: Hoare triple {1115#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:26:53,266 INFO L273 TraceCheckUtils]: 26: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:26:53,266 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1115#false} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:26:53,266 INFO L273 TraceCheckUtils]: 28: Hoare triple {1115#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1115#false} is VALID [2018-11-23 12:26:53,266 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1115#false} is VALID [2018-11-23 12:26:53,267 INFO L273 TraceCheckUtils]: 30: Hoare triple {1115#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1115#false} is VALID [2018-11-23 12:26:53,267 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 999); {1115#false} is VALID [2018-11-23 12:26:53,267 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:26:53,267 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:26:53,267 INFO L273 TraceCheckUtils]: 34: Hoare triple {1115#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1115#false} is VALID [2018-11-23 12:26:53,268 INFO L273 TraceCheckUtils]: 35: Hoare triple {1115#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1115#false} is VALID [2018-11-23 12:26:53,268 INFO L273 TraceCheckUtils]: 36: Hoare triple {1115#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1115#false} is VALID [2018-11-23 12:26:53,268 INFO L273 TraceCheckUtils]: 37: Hoare triple {1115#false} assume !(~i~0 < 1000); {1115#false} is VALID [2018-11-23 12:26:53,268 INFO L273 TraceCheckUtils]: 38: Hoare triple {1115#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:26:53,268 INFO L273 TraceCheckUtils]: 39: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:26:53,269 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1115#false} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:26:53,269 INFO L273 TraceCheckUtils]: 41: Hoare triple {1115#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1115#false} is VALID [2018-11-23 12:26:53,269 INFO L273 TraceCheckUtils]: 42: Hoare triple {1115#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1115#false} is VALID [2018-11-23 12:26:53,269 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:26:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:26:53,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:53,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:26:53,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:26:53,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:53,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:26:53,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:53,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:26:53,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:26:53,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:26:53,348 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-23 12:26:53,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:53,530 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 12:26:53,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:26:53,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:26:53,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:53,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:26:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:26:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:26:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:26:53,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:26:53,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:53,727 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:26:53,728 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:26:53,729 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:26:53,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:26:53,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:26:53,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:53,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:26:53,742 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:26:53,742 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:26:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:53,745 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:26:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:26:53,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:53,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:53,746 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:26:53,746 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:26:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:53,748 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:26:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:26:53,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:53,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:53,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:53,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:26:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:26:53,751 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2018-11-23 12:26:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:53,751 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:26:53,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:26:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:26:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:26:53,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:53,752 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:53,753 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:53,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:53,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2104096189, now seen corresponding path program 3 times [2018-11-23 12:26:53,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:53,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:53,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:53,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:53,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:53,885 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:26:53,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {1446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1446#true} is VALID [2018-11-23 12:26:53,886 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:53,886 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:26:53,886 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret12 := main(); {1446#true} is VALID [2018-11-23 12:26:53,887 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:26:53,888 INFO L273 TraceCheckUtils]: 6: Hoare triple {1448#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:26:53,888 INFO L273 TraceCheckUtils]: 7: Hoare triple {1448#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1449#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:53,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {1449#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1449#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:53,892 INFO L273 TraceCheckUtils]: 9: Hoare triple {1449#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1450#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:53,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {1450#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1450#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:53,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {1450#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1451#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:53,895 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#(<= main_~i~1 3)} assume !(~i~1 < 1000); {1447#false} is VALID [2018-11-23 12:26:53,895 INFO L256 TraceCheckUtils]: 13: Hoare triple {1447#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:53,895 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1446#true} is VALID [2018-11-23 12:26:53,895 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:26:53,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1446#true} is VALID [2018-11-23 12:26:53,896 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 1000); {1446#true} is VALID [2018-11-23 12:26:53,897 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:26:53,897 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:53,898 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1447#false} #70#return; {1447#false} is VALID [2018-11-23 12:26:53,898 INFO L273 TraceCheckUtils]: 21: Hoare triple {1447#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:26:53,898 INFO L256 TraceCheckUtils]: 22: Hoare triple {1447#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:53,898 INFO L273 TraceCheckUtils]: 23: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1446#true} is VALID [2018-11-23 12:26:53,899 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:26:53,899 INFO L273 TraceCheckUtils]: 25: Hoare triple {1446#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1446#true} is VALID [2018-11-23 12:26:53,899 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 1000); {1446#true} is VALID [2018-11-23 12:26:53,899 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:26:53,900 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:53,900 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1447#false} #72#return; {1447#false} is VALID [2018-11-23 12:26:53,900 INFO L273 TraceCheckUtils]: 30: Hoare triple {1447#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1447#false} is VALID [2018-11-23 12:26:53,900 INFO L273 TraceCheckUtils]: 31: Hoare triple {1447#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1447#false} is VALID [2018-11-23 12:26:53,901 INFO L273 TraceCheckUtils]: 32: Hoare triple {1447#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1447#false} is VALID [2018-11-23 12:26:53,901 INFO L273 TraceCheckUtils]: 33: Hoare triple {1447#false} assume !(~i~2 < 999); {1447#false} is VALID [2018-11-23 12:26:53,901 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:26:53,901 INFO L256 TraceCheckUtils]: 35: Hoare triple {1447#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:53,902 INFO L273 TraceCheckUtils]: 36: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1446#true} is VALID [2018-11-23 12:26:53,902 INFO L273 TraceCheckUtils]: 37: Hoare triple {1446#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:26:53,902 INFO L273 TraceCheckUtils]: 38: Hoare triple {1446#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1446#true} is VALID [2018-11-23 12:26:53,903 INFO L273 TraceCheckUtils]: 39: Hoare triple {1446#true} assume !(~i~0 < 1000); {1446#true} is VALID [2018-11-23 12:26:53,903 INFO L273 TraceCheckUtils]: 40: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:26:53,903 INFO L273 TraceCheckUtils]: 41: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:53,903 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1446#true} {1447#false} #74#return; {1447#false} is VALID [2018-11-23 12:26:53,904 INFO L273 TraceCheckUtils]: 43: Hoare triple {1447#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1447#false} is VALID [2018-11-23 12:26:53,904 INFO L273 TraceCheckUtils]: 44: Hoare triple {1447#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1447#false} is VALID [2018-11-23 12:26:53,904 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:26:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:26:53,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:53,907 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:53,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:26:53,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:26:53,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:54,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:54,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:26:54,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {1446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1446#true} is VALID [2018-11-23 12:26:54,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:54,604 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:26:54,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret12 := main(); {1446#true} is VALID [2018-11-23 12:26:54,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1446#true} is VALID [2018-11-23 12:26:54,605 INFO L273 TraceCheckUtils]: 6: Hoare triple {1446#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1446#true} is VALID [2018-11-23 12:26:54,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {1446#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1446#true} is VALID [2018-11-23 12:26:54,606 INFO L273 TraceCheckUtils]: 8: Hoare triple {1446#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1446#true} is VALID [2018-11-23 12:26:54,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {1446#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1446#true} is VALID [2018-11-23 12:26:54,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {1446#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1446#true} is VALID [2018-11-23 12:26:54,606 INFO L273 TraceCheckUtils]: 11: Hoare triple {1446#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1446#true} is VALID [2018-11-23 12:26:54,606 INFO L273 TraceCheckUtils]: 12: Hoare triple {1446#true} assume !(~i~1 < 1000); {1446#true} is VALID [2018-11-23 12:26:54,607 INFO L256 TraceCheckUtils]: 13: Hoare triple {1446#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:54,607 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1446#true} is VALID [2018-11-23 12:26:54,607 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:26:54,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1446#true} is VALID [2018-11-23 12:26:54,608 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 1000); {1446#true} is VALID [2018-11-23 12:26:54,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:26:54,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:54,608 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1446#true} #70#return; {1446#true} is VALID [2018-11-23 12:26:54,609 INFO L273 TraceCheckUtils]: 21: Hoare triple {1446#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:26:54,609 INFO L256 TraceCheckUtils]: 22: Hoare triple {1446#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:54,609 INFO L273 TraceCheckUtils]: 23: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1446#true} is VALID [2018-11-23 12:26:54,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:26:54,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {1446#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1446#true} is VALID [2018-11-23 12:26:54,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 1000); {1446#true} is VALID [2018-11-23 12:26:54,610 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:26:54,610 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:54,611 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1446#true} #72#return; {1446#true} is VALID [2018-11-23 12:26:54,611 INFO L273 TraceCheckUtils]: 30: Hoare triple {1446#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1446#true} is VALID [2018-11-23 12:26:54,611 INFO L273 TraceCheckUtils]: 31: Hoare triple {1446#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1446#true} is VALID [2018-11-23 12:26:54,611 INFO L273 TraceCheckUtils]: 32: Hoare triple {1446#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1446#true} is VALID [2018-11-23 12:26:54,612 INFO L273 TraceCheckUtils]: 33: Hoare triple {1446#true} assume !(~i~2 < 999); {1446#true} is VALID [2018-11-23 12:26:54,612 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:26:54,612 INFO L256 TraceCheckUtils]: 35: Hoare triple {1446#true} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:54,613 INFO L273 TraceCheckUtils]: 36: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1563#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:26:54,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {1563#(<= mapavg_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1563#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:26:54,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {1563#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1570#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:26:54,618 INFO L273 TraceCheckUtils]: 39: Hoare triple {1570#(<= mapavg_~i~0 1)} assume !(~i~0 < 1000); {1447#false} is VALID [2018-11-23 12:26:54,618 INFO L273 TraceCheckUtils]: 40: Hoare triple {1447#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1447#false} is VALID [2018-11-23 12:26:54,618 INFO L273 TraceCheckUtils]: 41: Hoare triple {1447#false} assume true; {1447#false} is VALID [2018-11-23 12:26:54,618 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1447#false} {1446#true} #74#return; {1447#false} is VALID [2018-11-23 12:26:54,619 INFO L273 TraceCheckUtils]: 43: Hoare triple {1447#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1447#false} is VALID [2018-11-23 12:26:54,619 INFO L273 TraceCheckUtils]: 44: Hoare triple {1447#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1447#false} is VALID [2018-11-23 12:26:54,619 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:26:54,622 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 12:26:54,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:54,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:26:54,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:26:54,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:54,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:26:54,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:54,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:26:54,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:26:54,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:26:54,764 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-23 12:26:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:55,098 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 12:26:55,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:26:55,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:26:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:55,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:26:55,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:26:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:26:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:26:55,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2018-11-23 12:26:55,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:55,299 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:26:55,299 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:26:55,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:26:55,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:26:55,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:26:55,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:55,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:26:55,319 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:26:55,319 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:26:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:55,322 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:26:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:26:55,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:55,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:55,323 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:26:55,323 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:26:55,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:55,325 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:26:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:26:55,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:55,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:55,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:55,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:26:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:26:55,329 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2018-11-23 12:26:55,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:55,329 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:26:55,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:26:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:26:55,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:26:55,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:55,330 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:55,330 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:55,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:55,331 INFO L82 PathProgramCache]: Analyzing trace with hash 780809725, now seen corresponding path program 4 times [2018-11-23 12:26:55,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:55,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:55,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:55,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:55,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:55,730 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:26:55,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {1809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1809#true} is VALID [2018-11-23 12:26:55,731 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:26:55,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:26:55,732 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 12:26:55,733 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:26:55,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {1811#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:26:55,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {1811#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:55,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:55,735 INFO L273 TraceCheckUtils]: 9: Hoare triple {1812#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:55,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:55,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {1813#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:55,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:55,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {1814#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1815#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:55,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 1000); {1810#false} is VALID [2018-11-23 12:26:55,738 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:26:55,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1809#true} is VALID [2018-11-23 12:26:55,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:26:55,739 INFO L273 TraceCheckUtils]: 18: Hoare triple {1809#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1809#true} is VALID [2018-11-23 12:26:55,739 INFO L273 TraceCheckUtils]: 19: Hoare triple {1809#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:26:55,740 INFO L273 TraceCheckUtils]: 20: Hoare triple {1809#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1809#true} is VALID [2018-11-23 12:26:55,740 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} assume !(~i~0 < 1000); {1809#true} is VALID [2018-11-23 12:26:55,740 INFO L273 TraceCheckUtils]: 22: Hoare triple {1809#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:26:55,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:26:55,741 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1809#true} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:26:55,741 INFO L273 TraceCheckUtils]: 25: Hoare triple {1810#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:26:55,742 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:26:55,742 INFO L273 TraceCheckUtils]: 27: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1809#true} is VALID [2018-11-23 12:26:55,742 INFO L273 TraceCheckUtils]: 28: Hoare triple {1809#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:26:55,742 INFO L273 TraceCheckUtils]: 29: Hoare triple {1809#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1809#true} is VALID [2018-11-23 12:26:55,743 INFO L273 TraceCheckUtils]: 30: Hoare triple {1809#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:26:55,743 INFO L273 TraceCheckUtils]: 31: Hoare triple {1809#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1809#true} is VALID [2018-11-23 12:26:55,743 INFO L273 TraceCheckUtils]: 32: Hoare triple {1809#true} assume !(~i~0 < 1000); {1809#true} is VALID [2018-11-23 12:26:55,743 INFO L273 TraceCheckUtils]: 33: Hoare triple {1809#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:26:55,743 INFO L273 TraceCheckUtils]: 34: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:26:55,744 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1809#true} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:26:55,744 INFO L273 TraceCheckUtils]: 36: Hoare triple {1810#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1810#false} is VALID [2018-11-23 12:26:55,744 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1810#false} is VALID [2018-11-23 12:26:55,744 INFO L273 TraceCheckUtils]: 38: Hoare triple {1810#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1810#false} is VALID [2018-11-23 12:26:55,745 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 999); {1810#false} is VALID [2018-11-23 12:26:55,745 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:26:55,745 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:26:55,745 INFO L273 TraceCheckUtils]: 42: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1809#true} is VALID [2018-11-23 12:26:55,746 INFO L273 TraceCheckUtils]: 43: Hoare triple {1809#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:26:55,746 INFO L273 TraceCheckUtils]: 44: Hoare triple {1809#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1809#true} is VALID [2018-11-23 12:26:55,746 INFO L273 TraceCheckUtils]: 45: Hoare triple {1809#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:26:55,746 INFO L273 TraceCheckUtils]: 46: Hoare triple {1809#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1809#true} is VALID [2018-11-23 12:26:55,746 INFO L273 TraceCheckUtils]: 47: Hoare triple {1809#true} assume !(~i~0 < 1000); {1809#true} is VALID [2018-11-23 12:26:55,747 INFO L273 TraceCheckUtils]: 48: Hoare triple {1809#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:26:55,747 INFO L273 TraceCheckUtils]: 49: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:26:55,747 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1809#true} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:26:55,747 INFO L273 TraceCheckUtils]: 51: Hoare triple {1810#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1810#false} is VALID [2018-11-23 12:26:55,748 INFO L273 TraceCheckUtils]: 52: Hoare triple {1810#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1810#false} is VALID [2018-11-23 12:26:55,748 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:26:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:26:55,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:55,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:55,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:26:55,800 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:26:55,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:55,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:56,088 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:26:56,089 INFO L273 TraceCheckUtils]: 1: Hoare triple {1809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1809#true} is VALID [2018-11-23 12:26:56,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:26:56,089 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:26:56,089 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 12:26:56,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1834#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:56,091 INFO L273 TraceCheckUtils]: 6: Hoare triple {1834#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1834#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:56,092 INFO L273 TraceCheckUtils]: 7: Hoare triple {1834#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:56,092 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:56,093 INFO L273 TraceCheckUtils]: 9: Hoare triple {1812#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:56,094 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:56,095 INFO L273 TraceCheckUtils]: 11: Hoare triple {1813#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:56,095 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:56,096 INFO L273 TraceCheckUtils]: 13: Hoare triple {1814#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1815#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:56,097 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 1000); {1810#false} is VALID [2018-11-23 12:26:56,098 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:26:56,098 INFO L273 TraceCheckUtils]: 16: Hoare triple {1810#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1810#false} is VALID [2018-11-23 12:26:56,098 INFO L273 TraceCheckUtils]: 17: Hoare triple {1810#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:26:56,098 INFO L273 TraceCheckUtils]: 18: Hoare triple {1810#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1810#false} is VALID [2018-11-23 12:26:56,099 INFO L273 TraceCheckUtils]: 19: Hoare triple {1810#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:26:56,099 INFO L273 TraceCheckUtils]: 20: Hoare triple {1810#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1810#false} is VALID [2018-11-23 12:26:56,099 INFO L273 TraceCheckUtils]: 21: Hoare triple {1810#false} assume !(~i~0 < 1000); {1810#false} is VALID [2018-11-23 12:26:56,100 INFO L273 TraceCheckUtils]: 22: Hoare triple {1810#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:26:56,100 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:26:56,101 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1810#false} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:26:56,101 INFO L273 TraceCheckUtils]: 25: Hoare triple {1810#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:26:56,102 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:26:56,102 INFO L273 TraceCheckUtils]: 27: Hoare triple {1810#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1810#false} is VALID [2018-11-23 12:26:56,102 INFO L273 TraceCheckUtils]: 28: Hoare triple {1810#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:26:56,103 INFO L273 TraceCheckUtils]: 29: Hoare triple {1810#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1810#false} is VALID [2018-11-23 12:26:56,103 INFO L273 TraceCheckUtils]: 30: Hoare triple {1810#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:26:56,103 INFO L273 TraceCheckUtils]: 31: Hoare triple {1810#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1810#false} is VALID [2018-11-23 12:26:56,103 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} assume !(~i~0 < 1000); {1810#false} is VALID [2018-11-23 12:26:56,103 INFO L273 TraceCheckUtils]: 33: Hoare triple {1810#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:26:56,104 INFO L273 TraceCheckUtils]: 34: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:26:56,104 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1810#false} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:26:56,104 INFO L273 TraceCheckUtils]: 36: Hoare triple {1810#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1810#false} is VALID [2018-11-23 12:26:56,104 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1810#false} is VALID [2018-11-23 12:26:56,105 INFO L273 TraceCheckUtils]: 38: Hoare triple {1810#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1810#false} is VALID [2018-11-23 12:26:56,105 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 999); {1810#false} is VALID [2018-11-23 12:26:56,105 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:26:56,105 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:26:56,106 INFO L273 TraceCheckUtils]: 42: Hoare triple {1810#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1810#false} is VALID [2018-11-23 12:26:56,106 INFO L273 TraceCheckUtils]: 43: Hoare triple {1810#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:26:56,106 INFO L273 TraceCheckUtils]: 44: Hoare triple {1810#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1810#false} is VALID [2018-11-23 12:26:56,106 INFO L273 TraceCheckUtils]: 45: Hoare triple {1810#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:26:56,107 INFO L273 TraceCheckUtils]: 46: Hoare triple {1810#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1810#false} is VALID [2018-11-23 12:26:56,107 INFO L273 TraceCheckUtils]: 47: Hoare triple {1810#false} assume !(~i~0 < 1000); {1810#false} is VALID [2018-11-23 12:26:56,107 INFO L273 TraceCheckUtils]: 48: Hoare triple {1810#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:26:56,107 INFO L273 TraceCheckUtils]: 49: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:26:56,107 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1810#false} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:26:56,108 INFO L273 TraceCheckUtils]: 51: Hoare triple {1810#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1810#false} is VALID [2018-11-23 12:26:56,108 INFO L273 TraceCheckUtils]: 52: Hoare triple {1810#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1810#false} is VALID [2018-11-23 12:26:56,108 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:26:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:26:56,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:56,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:26:56,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:26:56,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:56,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:26:56,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:56,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:26:56,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:26:56,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:26:56,244 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 12:26:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:56,556 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:26:56,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:26:56,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:26:56,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:26:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:26:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:26:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:26:56,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2018-11-23 12:26:56,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:56,691 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:26:56,691 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:26:56,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:26:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:26:56,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:26:56,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:56,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:26:56,712 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:26:56,712 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:26:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:56,714 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:26:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:26:56,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:56,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:56,715 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:26:56,715 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:26:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:56,717 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:26:56,718 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:26:56,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:56,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:56,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:56,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:26:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:26:56,721 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2018-11-23 12:26:56,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:56,721 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:26:56,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:26:56,721 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:26:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:26:56,722 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:56,722 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:56,723 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:56,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:56,723 INFO L82 PathProgramCache]: Analyzing trace with hash 387956447, now seen corresponding path program 5 times [2018-11-23 12:26:56,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:56,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:56,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:56,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:56,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:57,032 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:26:57,032 INFO L273 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2206#true} is VALID [2018-11-23 12:26:57,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:26:57,033 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:26:57,033 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret12 := main(); {2206#true} is VALID [2018-11-23 12:26:57,038 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2208#(= main_~i~1 0)} is VALID [2018-11-23 12:26:57,038 INFO L273 TraceCheckUtils]: 6: Hoare triple {2208#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2208#(= main_~i~1 0)} is VALID [2018-11-23 12:26:57,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {2208#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2209#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:57,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {2209#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2209#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:57,043 INFO L273 TraceCheckUtils]: 9: Hoare triple {2209#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2210#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:57,043 INFO L273 TraceCheckUtils]: 10: Hoare triple {2210#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2210#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:57,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {2210#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2211#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:57,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {2211#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2211#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:57,048 INFO L273 TraceCheckUtils]: 13: Hoare triple {2211#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2212#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:57,048 INFO L273 TraceCheckUtils]: 14: Hoare triple {2212#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2212#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:57,050 INFO L273 TraceCheckUtils]: 15: Hoare triple {2212#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2213#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:57,050 INFO L273 TraceCheckUtils]: 16: Hoare triple {2213#(<= main_~i~1 5)} assume !(~i~1 < 1000); {2207#false} is VALID [2018-11-23 12:26:57,050 INFO L256 TraceCheckUtils]: 17: Hoare triple {2207#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:26:57,050 INFO L273 TraceCheckUtils]: 18: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2206#true} is VALID [2018-11-23 12:26:57,051 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:26:57,051 INFO L273 TraceCheckUtils]: 20: Hoare triple {2206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 12:26:57,051 INFO L273 TraceCheckUtils]: 21: Hoare triple {2206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:26:57,051 INFO L273 TraceCheckUtils]: 22: Hoare triple {2206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 12:26:57,051 INFO L273 TraceCheckUtils]: 23: Hoare triple {2206#true} assume !(~i~0 < 1000); {2206#true} is VALID [2018-11-23 12:26:57,051 INFO L273 TraceCheckUtils]: 24: Hoare triple {2206#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:26:57,051 INFO L273 TraceCheckUtils]: 25: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:26:57,051 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2206#true} {2207#false} #70#return; {2207#false} is VALID [2018-11-23 12:26:57,052 INFO L273 TraceCheckUtils]: 27: Hoare triple {2207#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:26:57,052 INFO L256 TraceCheckUtils]: 28: Hoare triple {2207#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:26:57,052 INFO L273 TraceCheckUtils]: 29: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2206#true} is VALID [2018-11-23 12:26:57,052 INFO L273 TraceCheckUtils]: 30: Hoare triple {2206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:26:57,052 INFO L273 TraceCheckUtils]: 31: Hoare triple {2206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 12:26:57,052 INFO L273 TraceCheckUtils]: 32: Hoare triple {2206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:26:57,052 INFO L273 TraceCheckUtils]: 33: Hoare triple {2206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 12:26:57,052 INFO L273 TraceCheckUtils]: 34: Hoare triple {2206#true} assume !(~i~0 < 1000); {2206#true} is VALID [2018-11-23 12:26:57,053 INFO L273 TraceCheckUtils]: 35: Hoare triple {2206#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:26:57,053 INFO L273 TraceCheckUtils]: 36: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:26:57,053 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2206#true} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:26:57,053 INFO L273 TraceCheckUtils]: 38: Hoare triple {2207#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2207#false} is VALID [2018-11-23 12:26:57,053 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2207#false} is VALID [2018-11-23 12:26:57,053 INFO L273 TraceCheckUtils]: 40: Hoare triple {2207#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2207#false} is VALID [2018-11-23 12:26:57,053 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 999); {2207#false} is VALID [2018-11-23 12:26:57,054 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:26:57,054 INFO L256 TraceCheckUtils]: 43: Hoare triple {2207#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:26:57,054 INFO L273 TraceCheckUtils]: 44: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2206#true} is VALID [2018-11-23 12:26:57,054 INFO L273 TraceCheckUtils]: 45: Hoare triple {2206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:26:57,054 INFO L273 TraceCheckUtils]: 46: Hoare triple {2206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 12:26:57,054 INFO L273 TraceCheckUtils]: 47: Hoare triple {2206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:26:57,054 INFO L273 TraceCheckUtils]: 48: Hoare triple {2206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 12:26:57,054 INFO L273 TraceCheckUtils]: 49: Hoare triple {2206#true} assume !(~i~0 < 1000); {2206#true} is VALID [2018-11-23 12:26:57,055 INFO L273 TraceCheckUtils]: 50: Hoare triple {2206#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:26:57,055 INFO L273 TraceCheckUtils]: 51: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:26:57,055 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2206#true} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:26:57,055 INFO L273 TraceCheckUtils]: 53: Hoare triple {2207#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2207#false} is VALID [2018-11-23 12:26:57,055 INFO L273 TraceCheckUtils]: 54: Hoare triple {2207#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2207#false} is VALID [2018-11-23 12:26:57,055 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:26:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:26:57,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:57,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:57,066 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:26:57,138 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:26:57,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:57,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:57,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:26:57,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2206#true} is VALID [2018-11-23 12:26:57,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:26:57,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:26:57,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret12 := main(); {2206#true} is VALID [2018-11-23 12:26:57,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2206#true} is VALID [2018-11-23 12:26:57,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {2206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2206#true} is VALID [2018-11-23 12:26:57,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {2206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2206#true} is VALID [2018-11-23 12:26:57,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {2206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2206#true} is VALID [2018-11-23 12:26:57,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {2206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2206#true} is VALID [2018-11-23 12:26:57,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2206#true} is VALID [2018-11-23 12:26:57,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {2206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2206#true} is VALID [2018-11-23 12:26:57,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {2206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2206#true} is VALID [2018-11-23 12:26:57,393 INFO L273 TraceCheckUtils]: 13: Hoare triple {2206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2206#true} is VALID [2018-11-23 12:26:57,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {2206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2206#true} is VALID [2018-11-23 12:26:57,393 INFO L273 TraceCheckUtils]: 15: Hoare triple {2206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2206#true} is VALID [2018-11-23 12:26:57,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {2206#true} assume !(~i~1 < 1000); {2206#true} is VALID [2018-11-23 12:26:57,394 INFO L256 TraceCheckUtils]: 17: Hoare triple {2206#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:26:57,394 INFO L273 TraceCheckUtils]: 18: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2271#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:26:57,394 INFO L273 TraceCheckUtils]: 19: Hoare triple {2271#(<= mapavg_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2271#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:26:57,395 INFO L273 TraceCheckUtils]: 20: Hoare triple {2271#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2278#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:26:57,395 INFO L273 TraceCheckUtils]: 21: Hoare triple {2278#(<= mapavg_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2278#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:26:57,396 INFO L273 TraceCheckUtils]: 22: Hoare triple {2278#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2285#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:26:57,397 INFO L273 TraceCheckUtils]: 23: Hoare triple {2285#(<= mapavg_~i~0 2)} assume !(~i~0 < 1000); {2207#false} is VALID [2018-11-23 12:26:57,397 INFO L273 TraceCheckUtils]: 24: Hoare triple {2207#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:26:57,397 INFO L273 TraceCheckUtils]: 25: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:26:57,397 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2207#false} {2206#true} #70#return; {2207#false} is VALID [2018-11-23 12:26:57,397 INFO L273 TraceCheckUtils]: 27: Hoare triple {2207#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:26:57,397 INFO L256 TraceCheckUtils]: 28: Hoare triple {2207#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {2207#false} is VALID [2018-11-23 12:26:57,397 INFO L273 TraceCheckUtils]: 29: Hoare triple {2207#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2207#false} is VALID [2018-11-23 12:26:57,398 INFO L273 TraceCheckUtils]: 30: Hoare triple {2207#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2207#false} is VALID [2018-11-23 12:26:57,398 INFO L273 TraceCheckUtils]: 31: Hoare triple {2207#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2207#false} is VALID [2018-11-23 12:26:57,398 INFO L273 TraceCheckUtils]: 32: Hoare triple {2207#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2207#false} is VALID [2018-11-23 12:26:57,398 INFO L273 TraceCheckUtils]: 33: Hoare triple {2207#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2207#false} is VALID [2018-11-23 12:26:57,398 INFO L273 TraceCheckUtils]: 34: Hoare triple {2207#false} assume !(~i~0 < 1000); {2207#false} is VALID [2018-11-23 12:26:57,398 INFO L273 TraceCheckUtils]: 35: Hoare triple {2207#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:26:57,398 INFO L273 TraceCheckUtils]: 36: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:26:57,399 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2207#false} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:26:57,399 INFO L273 TraceCheckUtils]: 38: Hoare triple {2207#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2207#false} is VALID [2018-11-23 12:26:57,399 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2207#false} is VALID [2018-11-23 12:26:57,399 INFO L273 TraceCheckUtils]: 40: Hoare triple {2207#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2207#false} is VALID [2018-11-23 12:26:57,399 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 999); {2207#false} is VALID [2018-11-23 12:26:57,399 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:26:57,400 INFO L256 TraceCheckUtils]: 43: Hoare triple {2207#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {2207#false} is VALID [2018-11-23 12:26:57,400 INFO L273 TraceCheckUtils]: 44: Hoare triple {2207#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2207#false} is VALID [2018-11-23 12:26:57,400 INFO L273 TraceCheckUtils]: 45: Hoare triple {2207#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2207#false} is VALID [2018-11-23 12:26:57,401 INFO L273 TraceCheckUtils]: 46: Hoare triple {2207#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2207#false} is VALID [2018-11-23 12:26:57,401 INFO L273 TraceCheckUtils]: 47: Hoare triple {2207#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2207#false} is VALID [2018-11-23 12:26:57,401 INFO L273 TraceCheckUtils]: 48: Hoare triple {2207#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2207#false} is VALID [2018-11-23 12:26:57,401 INFO L273 TraceCheckUtils]: 49: Hoare triple {2207#false} assume !(~i~0 < 1000); {2207#false} is VALID [2018-11-23 12:26:57,401 INFO L273 TraceCheckUtils]: 50: Hoare triple {2207#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:26:57,402 INFO L273 TraceCheckUtils]: 51: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:26:57,402 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2207#false} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:26:57,402 INFO L273 TraceCheckUtils]: 53: Hoare triple {2207#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2207#false} is VALID [2018-11-23 12:26:57,402 INFO L273 TraceCheckUtils]: 54: Hoare triple {2207#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2207#false} is VALID [2018-11-23 12:26:57,402 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:26:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 12:26:57,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:57,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 12:26:57,430 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:26:57,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:57,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:26:57,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:57,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:26:57,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:26:57,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:26:57,557 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-11-23 12:26:58,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:58,112 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-23 12:26:58,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:26:58,112 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:26:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:26:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:26:58,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 12:26:58,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:58,200 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:26:58,200 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:26:58,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:26:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:26:58,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 12:26:58,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:58,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 12:26:58,235 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 12:26:58,235 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 12:26:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:58,240 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:26:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:26:58,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:58,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:58,241 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 12:26:58,241 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 12:26:58,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:58,242 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:26:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:26:58,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:58,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:58,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:58,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:26:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 12:26:58,246 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2018-11-23 12:26:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:58,246 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 12:26:58,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:26:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:26:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:26:58,247 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:58,247 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:58,247 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:58,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:58,248 INFO L82 PathProgramCache]: Analyzing trace with hash -482079969, now seen corresponding path program 6 times [2018-11-23 12:26:58,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:58,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:58,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:58,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:58,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:58,505 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:26:58,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {2635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2635#true} is VALID [2018-11-23 12:26:58,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:58,506 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:26:58,507 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret12 := main(); {2635#true} is VALID [2018-11-23 12:26:58,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2637#(= main_~i~1 0)} is VALID [2018-11-23 12:26:58,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {2637#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2637#(= main_~i~1 0)} is VALID [2018-11-23 12:26:58,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {2637#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2638#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:58,508 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2638#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:58,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {2638#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2639#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:58,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2639#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:58,510 INFO L273 TraceCheckUtils]: 11: Hoare triple {2639#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2640#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:58,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2640#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:58,510 INFO L273 TraceCheckUtils]: 13: Hoare triple {2640#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2641#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:58,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {2641#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2641#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:58,511 INFO L273 TraceCheckUtils]: 15: Hoare triple {2641#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2642#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:58,512 INFO L273 TraceCheckUtils]: 16: Hoare triple {2642#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2642#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:58,513 INFO L273 TraceCheckUtils]: 17: Hoare triple {2642#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2643#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:58,513 INFO L273 TraceCheckUtils]: 18: Hoare triple {2643#(<= main_~i~1 6)} assume !(~i~1 < 1000); {2636#false} is VALID [2018-11-23 12:26:58,514 INFO L256 TraceCheckUtils]: 19: Hoare triple {2636#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:26:58,514 INFO L273 TraceCheckUtils]: 20: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2635#true} is VALID [2018-11-23 12:26:58,514 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:26:58,514 INFO L273 TraceCheckUtils]: 22: Hoare triple {2635#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#true} is VALID [2018-11-23 12:26:58,514 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:26:58,515 INFO L273 TraceCheckUtils]: 24: Hoare triple {2635#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#true} is VALID [2018-11-23 12:26:58,515 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:26:58,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {2635#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#true} is VALID [2018-11-23 12:26:58,515 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 1000); {2635#true} is VALID [2018-11-23 12:26:58,516 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:26:58,516 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:58,516 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2636#false} #70#return; {2636#false} is VALID [2018-11-23 12:26:58,516 INFO L273 TraceCheckUtils]: 31: Hoare triple {2636#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:26:58,516 INFO L256 TraceCheckUtils]: 32: Hoare triple {2636#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:26:58,517 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2635#true} is VALID [2018-11-23 12:26:58,517 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:26:58,517 INFO L273 TraceCheckUtils]: 35: Hoare triple {2635#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#true} is VALID [2018-11-23 12:26:58,517 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:26:58,517 INFO L273 TraceCheckUtils]: 37: Hoare triple {2635#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#true} is VALID [2018-11-23 12:26:58,518 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:26:58,518 INFO L273 TraceCheckUtils]: 39: Hoare triple {2635#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#true} is VALID [2018-11-23 12:26:58,518 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 1000); {2635#true} is VALID [2018-11-23 12:26:58,518 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:26:58,518 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:58,518 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2636#false} #72#return; {2636#false} is VALID [2018-11-23 12:26:58,518 INFO L273 TraceCheckUtils]: 44: Hoare triple {2636#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2636#false} is VALID [2018-11-23 12:26:58,518 INFO L273 TraceCheckUtils]: 45: Hoare triple {2636#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2636#false} is VALID [2018-11-23 12:26:58,519 INFO L273 TraceCheckUtils]: 46: Hoare triple {2636#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2636#false} is VALID [2018-11-23 12:26:58,519 INFO L273 TraceCheckUtils]: 47: Hoare triple {2636#false} assume !(~i~2 < 999); {2636#false} is VALID [2018-11-23 12:26:58,519 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:26:58,519 INFO L256 TraceCheckUtils]: 49: Hoare triple {2636#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:26:58,519 INFO L273 TraceCheckUtils]: 50: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2635#true} is VALID [2018-11-23 12:26:58,519 INFO L273 TraceCheckUtils]: 51: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:26:58,519 INFO L273 TraceCheckUtils]: 52: Hoare triple {2635#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#true} is VALID [2018-11-23 12:26:58,520 INFO L273 TraceCheckUtils]: 53: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:26:58,520 INFO L273 TraceCheckUtils]: 54: Hoare triple {2635#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#true} is VALID [2018-11-23 12:26:58,520 INFO L273 TraceCheckUtils]: 55: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:26:58,520 INFO L273 TraceCheckUtils]: 56: Hoare triple {2635#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#true} is VALID [2018-11-23 12:26:58,520 INFO L273 TraceCheckUtils]: 57: Hoare triple {2635#true} assume !(~i~0 < 1000); {2635#true} is VALID [2018-11-23 12:26:58,520 INFO L273 TraceCheckUtils]: 58: Hoare triple {2635#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:26:58,520 INFO L273 TraceCheckUtils]: 59: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:58,520 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2635#true} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:26:58,521 INFO L273 TraceCheckUtils]: 61: Hoare triple {2636#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2636#false} is VALID [2018-11-23 12:26:58,521 INFO L273 TraceCheckUtils]: 62: Hoare triple {2636#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2636#false} is VALID [2018-11-23 12:26:58,521 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:26:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-23 12:26:58,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:58,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:58,533 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:26:58,619 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:26:58,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:58,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:59,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:26:59,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {2635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2635#true} is VALID [2018-11-23 12:26:59,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:59,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:26:59,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret12 := main(); {2635#true} is VALID [2018-11-23 12:26:59,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2635#true} is VALID [2018-11-23 12:26:59,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:26:59,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {2635#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2635#true} is VALID [2018-11-23 12:26:59,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:26:59,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {2635#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2635#true} is VALID [2018-11-23 12:26:59,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:26:59,070 INFO L273 TraceCheckUtils]: 11: Hoare triple {2635#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2635#true} is VALID [2018-11-23 12:26:59,070 INFO L273 TraceCheckUtils]: 12: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:26:59,070 INFO L273 TraceCheckUtils]: 13: Hoare triple {2635#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2635#true} is VALID [2018-11-23 12:26:59,070 INFO L273 TraceCheckUtils]: 14: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:26:59,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {2635#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2635#true} is VALID [2018-11-23 12:26:59,070 INFO L273 TraceCheckUtils]: 16: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:26:59,071 INFO L273 TraceCheckUtils]: 17: Hoare triple {2635#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2635#true} is VALID [2018-11-23 12:26:59,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {2635#true} assume !(~i~1 < 1000); {2635#true} is VALID [2018-11-23 12:26:59,071 INFO L256 TraceCheckUtils]: 19: Hoare triple {2635#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:26:59,071 INFO L273 TraceCheckUtils]: 20: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2635#true} is VALID [2018-11-23 12:26:59,071 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:26:59,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {2635#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#true} is VALID [2018-11-23 12:26:59,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:26:59,071 INFO L273 TraceCheckUtils]: 24: Hoare triple {2635#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#true} is VALID [2018-11-23 12:26:59,072 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:26:59,072 INFO L273 TraceCheckUtils]: 26: Hoare triple {2635#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#true} is VALID [2018-11-23 12:26:59,072 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 1000); {2635#true} is VALID [2018-11-23 12:26:59,072 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:26:59,072 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:59,072 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2635#true} #70#return; {2635#true} is VALID [2018-11-23 12:26:59,072 INFO L273 TraceCheckUtils]: 31: Hoare triple {2635#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2635#true} is VALID [2018-11-23 12:26:59,073 INFO L256 TraceCheckUtils]: 32: Hoare triple {2635#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:26:59,073 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2635#true} is VALID [2018-11-23 12:26:59,073 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:26:59,073 INFO L273 TraceCheckUtils]: 35: Hoare triple {2635#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#true} is VALID [2018-11-23 12:26:59,073 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:26:59,073 INFO L273 TraceCheckUtils]: 37: Hoare triple {2635#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#true} is VALID [2018-11-23 12:26:59,073 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:26:59,073 INFO L273 TraceCheckUtils]: 39: Hoare triple {2635#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#true} is VALID [2018-11-23 12:26:59,074 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 1000); {2635#true} is VALID [2018-11-23 12:26:59,074 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:26:59,074 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:59,074 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2635#true} #72#return; {2635#true} is VALID [2018-11-23 12:26:59,091 INFO L273 TraceCheckUtils]: 44: Hoare triple {2635#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2779#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:59,100 INFO L273 TraceCheckUtils]: 45: Hoare triple {2779#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2779#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:59,112 INFO L273 TraceCheckUtils]: 46: Hoare triple {2779#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2786#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:59,113 INFO L273 TraceCheckUtils]: 47: Hoare triple {2786#(<= main_~i~2 1)} assume !(~i~2 < 999); {2636#false} is VALID [2018-11-23 12:26:59,113 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:26:59,113 INFO L256 TraceCheckUtils]: 49: Hoare triple {2636#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {2636#false} is VALID [2018-11-23 12:26:59,113 INFO L273 TraceCheckUtils]: 50: Hoare triple {2636#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2636#false} is VALID [2018-11-23 12:26:59,113 INFO L273 TraceCheckUtils]: 51: Hoare triple {2636#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2636#false} is VALID [2018-11-23 12:26:59,113 INFO L273 TraceCheckUtils]: 52: Hoare triple {2636#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2636#false} is VALID [2018-11-23 12:26:59,114 INFO L273 TraceCheckUtils]: 53: Hoare triple {2636#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2636#false} is VALID [2018-11-23 12:26:59,114 INFO L273 TraceCheckUtils]: 54: Hoare triple {2636#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2636#false} is VALID [2018-11-23 12:26:59,114 INFO L273 TraceCheckUtils]: 55: Hoare triple {2636#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2636#false} is VALID [2018-11-23 12:26:59,114 INFO L273 TraceCheckUtils]: 56: Hoare triple {2636#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2636#false} is VALID [2018-11-23 12:26:59,114 INFO L273 TraceCheckUtils]: 57: Hoare triple {2636#false} assume !(~i~0 < 1000); {2636#false} is VALID [2018-11-23 12:26:59,114 INFO L273 TraceCheckUtils]: 58: Hoare triple {2636#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {2636#false} is VALID [2018-11-23 12:26:59,115 INFO L273 TraceCheckUtils]: 59: Hoare triple {2636#false} assume true; {2636#false} is VALID [2018-11-23 12:26:59,115 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2636#false} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:26:59,115 INFO L273 TraceCheckUtils]: 61: Hoare triple {2636#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2636#false} is VALID [2018-11-23 12:26:59,115 INFO L273 TraceCheckUtils]: 62: Hoare triple {2636#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2636#false} is VALID [2018-11-23 12:26:59,115 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:26:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-23 12:26:59,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:59,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:26:59,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:26:59,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:59,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:26:59,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:59,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:26:59,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:26:59,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:26:59,280 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-11-23 12:26:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:59,590 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:26:59,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:26:59,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:26:59,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:26:59,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:59,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:26:59,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:26:59,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:59,687 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:26:59,687 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:26:59,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:26:59,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:26:59,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:26:59,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:59,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:26:59,714 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:26:59,715 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:26:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:59,717 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:26:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:26:59,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:59,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:59,718 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:26:59,718 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:26:59,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:59,720 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:26:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:26:59,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:59,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:59,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:59,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:26:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 12:26:59,722 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2018-11-23 12:26:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:59,723 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 12:26:59,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:26:59,723 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:26:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:26:59,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:59,724 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:59,724 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:59,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:59,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1276959103, now seen corresponding path program 7 times [2018-11-23 12:26:59,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:59,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:59,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:59,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:59,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:26:59,954 INFO L273 TraceCheckUtils]: 1: Hoare triple {3111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3111#true} is VALID [2018-11-23 12:26:59,954 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:26:59,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:26:59,955 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret12 := main(); {3111#true} is VALID [2018-11-23 12:26:59,960 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3113#(= main_~i~1 0)} is VALID [2018-11-23 12:26:59,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {3113#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3113#(= main_~i~1 0)} is VALID [2018-11-23 12:26:59,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {3113#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:59,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:59,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {3114#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:59,963 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:59,963 INFO L273 TraceCheckUtils]: 11: Hoare triple {3115#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:59,963 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:59,964 INFO L273 TraceCheckUtils]: 13: Hoare triple {3116#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:59,964 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:59,965 INFO L273 TraceCheckUtils]: 15: Hoare triple {3117#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:59,965 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:59,966 INFO L273 TraceCheckUtils]: 17: Hoare triple {3118#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:59,966 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:59,967 INFO L273 TraceCheckUtils]: 19: Hoare triple {3119#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3120#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:59,968 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 1000); {3112#false} is VALID [2018-11-23 12:26:59,968 INFO L256 TraceCheckUtils]: 21: Hoare triple {3112#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:26:59,968 INFO L273 TraceCheckUtils]: 22: Hoare triple {3111#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3111#true} is VALID [2018-11-23 12:26:59,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:26:59,968 INFO L273 TraceCheckUtils]: 24: Hoare triple {3111#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3111#true} is VALID [2018-11-23 12:26:59,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:26:59,969 INFO L273 TraceCheckUtils]: 26: Hoare triple {3111#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3111#true} is VALID [2018-11-23 12:26:59,969 INFO L273 TraceCheckUtils]: 27: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:26:59,969 INFO L273 TraceCheckUtils]: 28: Hoare triple {3111#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3111#true} is VALID [2018-11-23 12:26:59,970 INFO L273 TraceCheckUtils]: 29: Hoare triple {3111#true} assume !(~i~0 < 1000); {3111#true} is VALID [2018-11-23 12:26:59,970 INFO L273 TraceCheckUtils]: 30: Hoare triple {3111#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:26:59,970 INFO L273 TraceCheckUtils]: 31: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:26:59,971 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3111#true} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:26:59,971 INFO L273 TraceCheckUtils]: 33: Hoare triple {3112#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:26:59,971 INFO L256 TraceCheckUtils]: 34: Hoare triple {3112#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:26:59,971 INFO L273 TraceCheckUtils]: 35: Hoare triple {3111#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3111#true} is VALID [2018-11-23 12:26:59,971 INFO L273 TraceCheckUtils]: 36: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:26:59,972 INFO L273 TraceCheckUtils]: 37: Hoare triple {3111#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3111#true} is VALID [2018-11-23 12:26:59,972 INFO L273 TraceCheckUtils]: 38: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:26:59,972 INFO L273 TraceCheckUtils]: 39: Hoare triple {3111#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3111#true} is VALID [2018-11-23 12:26:59,972 INFO L273 TraceCheckUtils]: 40: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:26:59,972 INFO L273 TraceCheckUtils]: 41: Hoare triple {3111#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3111#true} is VALID [2018-11-23 12:26:59,972 INFO L273 TraceCheckUtils]: 42: Hoare triple {3111#true} assume !(~i~0 < 1000); {3111#true} is VALID [2018-11-23 12:26:59,973 INFO L273 TraceCheckUtils]: 43: Hoare triple {3111#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:26:59,973 INFO L273 TraceCheckUtils]: 44: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:26:59,973 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3111#true} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:26:59,973 INFO L273 TraceCheckUtils]: 46: Hoare triple {3112#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {3112#false} is VALID [2018-11-23 12:26:59,973 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3112#false} is VALID [2018-11-23 12:26:59,974 INFO L273 TraceCheckUtils]: 48: Hoare triple {3112#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3112#false} is VALID [2018-11-23 12:26:59,974 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3112#false} is VALID [2018-11-23 12:26:59,974 INFO L273 TraceCheckUtils]: 50: Hoare triple {3112#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3112#false} is VALID [2018-11-23 12:26:59,974 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 999); {3112#false} is VALID [2018-11-23 12:26:59,974 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:26:59,974 INFO L256 TraceCheckUtils]: 53: Hoare triple {3112#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:26:59,975 INFO L273 TraceCheckUtils]: 54: Hoare triple {3111#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3111#true} is VALID [2018-11-23 12:26:59,975 INFO L273 TraceCheckUtils]: 55: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:26:59,975 INFO L273 TraceCheckUtils]: 56: Hoare triple {3111#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3111#true} is VALID [2018-11-23 12:26:59,975 INFO L273 TraceCheckUtils]: 57: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:26:59,975 INFO L273 TraceCheckUtils]: 58: Hoare triple {3111#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3111#true} is VALID [2018-11-23 12:26:59,975 INFO L273 TraceCheckUtils]: 59: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:26:59,976 INFO L273 TraceCheckUtils]: 60: Hoare triple {3111#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3111#true} is VALID [2018-11-23 12:26:59,976 INFO L273 TraceCheckUtils]: 61: Hoare triple {3111#true} assume !(~i~0 < 1000); {3111#true} is VALID [2018-11-23 12:26:59,976 INFO L273 TraceCheckUtils]: 62: Hoare triple {3111#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:26:59,976 INFO L273 TraceCheckUtils]: 63: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:26:59,976 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3111#true} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:26:59,976 INFO L273 TraceCheckUtils]: 65: Hoare triple {3112#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3112#false} is VALID [2018-11-23 12:26:59,977 INFO L273 TraceCheckUtils]: 66: Hoare triple {3112#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3112#false} is VALID [2018-11-23 12:26:59,977 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:26:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:26:59,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:59,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:59,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:00,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:00,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:27:00,169 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:27:00,169 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:00,170 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:27:00,170 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret12 := main(); {3111#true} is VALID [2018-11-23 12:27:00,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3139#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:00,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {3139#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3139#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:00,172 INFO L273 TraceCheckUtils]: 7: Hoare triple {3139#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:00,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:00,173 INFO L273 TraceCheckUtils]: 9: Hoare triple {3114#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:00,173 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:00,173 INFO L273 TraceCheckUtils]: 11: Hoare triple {3115#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:00,174 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:00,175 INFO L273 TraceCheckUtils]: 13: Hoare triple {3116#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:00,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:00,176 INFO L273 TraceCheckUtils]: 15: Hoare triple {3117#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:00,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:00,177 INFO L273 TraceCheckUtils]: 17: Hoare triple {3118#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:00,178 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:00,179 INFO L273 TraceCheckUtils]: 19: Hoare triple {3119#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3120#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:00,179 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 1000); {3112#false} is VALID [2018-11-23 12:27:00,179 INFO L256 TraceCheckUtils]: 21: Hoare triple {3112#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:27:00,180 INFO L273 TraceCheckUtils]: 22: Hoare triple {3112#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3112#false} is VALID [2018-11-23 12:27:00,180 INFO L273 TraceCheckUtils]: 23: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:00,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {3112#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3112#false} is VALID [2018-11-23 12:27:00,180 INFO L273 TraceCheckUtils]: 25: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:00,180 INFO L273 TraceCheckUtils]: 26: Hoare triple {3112#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3112#false} is VALID [2018-11-23 12:27:00,181 INFO L273 TraceCheckUtils]: 27: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:00,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {3112#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3112#false} is VALID [2018-11-23 12:27:00,181 INFO L273 TraceCheckUtils]: 29: Hoare triple {3112#false} assume !(~i~0 < 1000); {3112#false} is VALID [2018-11-23 12:27:00,181 INFO L273 TraceCheckUtils]: 30: Hoare triple {3112#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:27:00,182 INFO L273 TraceCheckUtils]: 31: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:00,182 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3112#false} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:27:00,182 INFO L273 TraceCheckUtils]: 33: Hoare triple {3112#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:27:00,182 INFO L256 TraceCheckUtils]: 34: Hoare triple {3112#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:27:00,182 INFO L273 TraceCheckUtils]: 35: Hoare triple {3112#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3112#false} is VALID [2018-11-23 12:27:00,183 INFO L273 TraceCheckUtils]: 36: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:00,183 INFO L273 TraceCheckUtils]: 37: Hoare triple {3112#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3112#false} is VALID [2018-11-23 12:27:00,183 INFO L273 TraceCheckUtils]: 38: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:00,183 INFO L273 TraceCheckUtils]: 39: Hoare triple {3112#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3112#false} is VALID [2018-11-23 12:27:00,183 INFO L273 TraceCheckUtils]: 40: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:00,184 INFO L273 TraceCheckUtils]: 41: Hoare triple {3112#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3112#false} is VALID [2018-11-23 12:27:00,184 INFO L273 TraceCheckUtils]: 42: Hoare triple {3112#false} assume !(~i~0 < 1000); {3112#false} is VALID [2018-11-23 12:27:00,184 INFO L273 TraceCheckUtils]: 43: Hoare triple {3112#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:27:00,185 INFO L273 TraceCheckUtils]: 44: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:00,185 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3112#false} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:27:00,185 INFO L273 TraceCheckUtils]: 46: Hoare triple {3112#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {3112#false} is VALID [2018-11-23 12:27:00,185 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3112#false} is VALID [2018-11-23 12:27:00,185 INFO L273 TraceCheckUtils]: 48: Hoare triple {3112#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3112#false} is VALID [2018-11-23 12:27:00,185 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3112#false} is VALID [2018-11-23 12:27:00,186 INFO L273 TraceCheckUtils]: 50: Hoare triple {3112#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3112#false} is VALID [2018-11-23 12:27:00,186 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 999); {3112#false} is VALID [2018-11-23 12:27:00,186 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:27:00,186 INFO L256 TraceCheckUtils]: 53: Hoare triple {3112#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:27:00,186 INFO L273 TraceCheckUtils]: 54: Hoare triple {3112#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3112#false} is VALID [2018-11-23 12:27:00,186 INFO L273 TraceCheckUtils]: 55: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:00,187 INFO L273 TraceCheckUtils]: 56: Hoare triple {3112#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3112#false} is VALID [2018-11-23 12:27:00,187 INFO L273 TraceCheckUtils]: 57: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:00,187 INFO L273 TraceCheckUtils]: 58: Hoare triple {3112#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3112#false} is VALID [2018-11-23 12:27:00,187 INFO L273 TraceCheckUtils]: 59: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:00,187 INFO L273 TraceCheckUtils]: 60: Hoare triple {3112#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3112#false} is VALID [2018-11-23 12:27:00,187 INFO L273 TraceCheckUtils]: 61: Hoare triple {3112#false} assume !(~i~0 < 1000); {3112#false} is VALID [2018-11-23 12:27:00,188 INFO L273 TraceCheckUtils]: 62: Hoare triple {3112#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:27:00,188 INFO L273 TraceCheckUtils]: 63: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:00,188 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3112#false} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:27:00,188 INFO L273 TraceCheckUtils]: 65: Hoare triple {3112#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3112#false} is VALID [2018-11-23 12:27:00,188 INFO L273 TraceCheckUtils]: 66: Hoare triple {3112#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3112#false} is VALID [2018-11-23 12:27:00,188 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:27:00,191 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:27:00,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:00,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:27:00,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:27:00,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:00,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:00,271 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:27:00,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:00,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:00,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:00,272 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2018-11-23 12:27:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:00,541 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 12:27:00,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:27:00,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:27:00,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:27:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:27:00,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-23 12:27:00,613 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:27:00,615 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:27:00,615 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:27:00,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:27:00,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 12:27:00,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:00,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:00,645 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:00,645 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:00,646 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:27:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:27:00,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:00,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:00,647 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 12:27:00,647 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 12:27:00,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:00,648 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:27:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:27:00,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:00,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:00,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:00,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:27:00,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 12:27:00,651 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2018-11-23 12:27:00,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:00,651 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 12:27:00,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:27:00,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:00,652 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:27:00,653 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:00,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:00,653 INFO L82 PathProgramCache]: Analyzing trace with hash -266850591, now seen corresponding path program 8 times [2018-11-23 12:27:00,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:00,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:00,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:00,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:00,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:00,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:27:00,991 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:27:00,991 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:00,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:27:00,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret12 := main(); {3609#true} is VALID [2018-11-23 12:27:00,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3611#(= main_~i~1 0)} is VALID [2018-11-23 12:27:00,993 INFO L273 TraceCheckUtils]: 6: Hoare triple {3611#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3611#(= main_~i~1 0)} is VALID [2018-11-23 12:27:00,993 INFO L273 TraceCheckUtils]: 7: Hoare triple {3611#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:00,994 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:00,994 INFO L273 TraceCheckUtils]: 9: Hoare triple {3612#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:00,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:00,995 INFO L273 TraceCheckUtils]: 11: Hoare triple {3613#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:00,995 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:00,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {3614#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:00,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:00,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {3615#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:00,998 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:00,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {3616#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:00,999 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:01,000 INFO L273 TraceCheckUtils]: 19: Hoare triple {3617#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:01,001 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:01,001 INFO L273 TraceCheckUtils]: 21: Hoare triple {3618#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3619#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:01,002 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 1000); {3610#false} is VALID [2018-11-23 12:27:01,002 INFO L256 TraceCheckUtils]: 23: Hoare triple {3610#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:27:01,003 INFO L273 TraceCheckUtils]: 24: Hoare triple {3609#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3609#true} is VALID [2018-11-23 12:27:01,003 INFO L273 TraceCheckUtils]: 25: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:01,003 INFO L273 TraceCheckUtils]: 26: Hoare triple {3609#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3609#true} is VALID [2018-11-23 12:27:01,003 INFO L273 TraceCheckUtils]: 27: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:01,003 INFO L273 TraceCheckUtils]: 28: Hoare triple {3609#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3609#true} is VALID [2018-11-23 12:27:01,004 INFO L273 TraceCheckUtils]: 29: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:01,004 INFO L273 TraceCheckUtils]: 30: Hoare triple {3609#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3609#true} is VALID [2018-11-23 12:27:01,004 INFO L273 TraceCheckUtils]: 31: Hoare triple {3609#true} assume !(~i~0 < 1000); {3609#true} is VALID [2018-11-23 12:27:01,004 INFO L273 TraceCheckUtils]: 32: Hoare triple {3609#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:27:01,004 INFO L273 TraceCheckUtils]: 33: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:01,005 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3609#true} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:27:01,005 INFO L273 TraceCheckUtils]: 35: Hoare triple {3610#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:27:01,005 INFO L256 TraceCheckUtils]: 36: Hoare triple {3610#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:27:01,005 INFO L273 TraceCheckUtils]: 37: Hoare triple {3609#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3609#true} is VALID [2018-11-23 12:27:01,006 INFO L273 TraceCheckUtils]: 38: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:01,006 INFO L273 TraceCheckUtils]: 39: Hoare triple {3609#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3609#true} is VALID [2018-11-23 12:27:01,006 INFO L273 TraceCheckUtils]: 40: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:01,006 INFO L273 TraceCheckUtils]: 41: Hoare triple {3609#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3609#true} is VALID [2018-11-23 12:27:01,006 INFO L273 TraceCheckUtils]: 42: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:01,006 INFO L273 TraceCheckUtils]: 43: Hoare triple {3609#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3609#true} is VALID [2018-11-23 12:27:01,006 INFO L273 TraceCheckUtils]: 44: Hoare triple {3609#true} assume !(~i~0 < 1000); {3609#true} is VALID [2018-11-23 12:27:01,007 INFO L273 TraceCheckUtils]: 45: Hoare triple {3609#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:27:01,007 INFO L273 TraceCheckUtils]: 46: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:01,007 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3609#true} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:27:01,007 INFO L273 TraceCheckUtils]: 48: Hoare triple {3610#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {3610#false} is VALID [2018-11-23 12:27:01,007 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3610#false} is VALID [2018-11-23 12:27:01,007 INFO L273 TraceCheckUtils]: 50: Hoare triple {3610#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3610#false} is VALID [2018-11-23 12:27:01,008 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3610#false} is VALID [2018-11-23 12:27:01,008 INFO L273 TraceCheckUtils]: 52: Hoare triple {3610#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3610#false} is VALID [2018-11-23 12:27:01,008 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 999); {3610#false} is VALID [2018-11-23 12:27:01,008 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:27:01,008 INFO L256 TraceCheckUtils]: 55: Hoare triple {3610#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:27:01,008 INFO L273 TraceCheckUtils]: 56: Hoare triple {3609#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3609#true} is VALID [2018-11-23 12:27:01,009 INFO L273 TraceCheckUtils]: 57: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:01,009 INFO L273 TraceCheckUtils]: 58: Hoare triple {3609#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3609#true} is VALID [2018-11-23 12:27:01,009 INFO L273 TraceCheckUtils]: 59: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:01,009 INFO L273 TraceCheckUtils]: 60: Hoare triple {3609#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3609#true} is VALID [2018-11-23 12:27:01,009 INFO L273 TraceCheckUtils]: 61: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:01,009 INFO L273 TraceCheckUtils]: 62: Hoare triple {3609#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3609#true} is VALID [2018-11-23 12:27:01,009 INFO L273 TraceCheckUtils]: 63: Hoare triple {3609#true} assume !(~i~0 < 1000); {3609#true} is VALID [2018-11-23 12:27:01,009 INFO L273 TraceCheckUtils]: 64: Hoare triple {3609#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:27:01,010 INFO L273 TraceCheckUtils]: 65: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:01,010 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3609#true} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:27:01,010 INFO L273 TraceCheckUtils]: 67: Hoare triple {3610#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3610#false} is VALID [2018-11-23 12:27:01,010 INFO L273 TraceCheckUtils]: 68: Hoare triple {3610#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3610#false} is VALID [2018-11-23 12:27:01,010 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:27:01,013 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:27:01,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:01,013 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:27:01,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:01,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:01,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:01,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:01,271 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:27:01,272 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:27:01,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:01,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:27:01,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret12 := main(); {3609#true} is VALID [2018-11-23 12:27:01,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3638#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:01,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {3638#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3638#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:01,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {3638#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:01,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:01,275 INFO L273 TraceCheckUtils]: 9: Hoare triple {3612#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:01,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:01,276 INFO L273 TraceCheckUtils]: 11: Hoare triple {3613#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:01,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:01,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {3614#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:01,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:01,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {3615#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:01,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:01,280 INFO L273 TraceCheckUtils]: 17: Hoare triple {3616#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:01,280 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:01,281 INFO L273 TraceCheckUtils]: 19: Hoare triple {3617#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:01,282 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:01,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {3618#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3619#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:01,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 1000); {3610#false} is VALID [2018-11-23 12:27:01,283 INFO L256 TraceCheckUtils]: 23: Hoare triple {3610#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:27:01,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {3610#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3610#false} is VALID [2018-11-23 12:27:01,284 INFO L273 TraceCheckUtils]: 25: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:01,284 INFO L273 TraceCheckUtils]: 26: Hoare triple {3610#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3610#false} is VALID [2018-11-23 12:27:01,284 INFO L273 TraceCheckUtils]: 27: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:01,284 INFO L273 TraceCheckUtils]: 28: Hoare triple {3610#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3610#false} is VALID [2018-11-23 12:27:01,285 INFO L273 TraceCheckUtils]: 29: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:01,285 INFO L273 TraceCheckUtils]: 30: Hoare triple {3610#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3610#false} is VALID [2018-11-23 12:27:01,285 INFO L273 TraceCheckUtils]: 31: Hoare triple {3610#false} assume !(~i~0 < 1000); {3610#false} is VALID [2018-11-23 12:27:01,285 INFO L273 TraceCheckUtils]: 32: Hoare triple {3610#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:27:01,286 INFO L273 TraceCheckUtils]: 33: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:01,286 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3610#false} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:27:01,286 INFO L273 TraceCheckUtils]: 35: Hoare triple {3610#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:27:01,286 INFO L256 TraceCheckUtils]: 36: Hoare triple {3610#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:27:01,286 INFO L273 TraceCheckUtils]: 37: Hoare triple {3610#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3610#false} is VALID [2018-11-23 12:27:01,287 INFO L273 TraceCheckUtils]: 38: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:01,287 INFO L273 TraceCheckUtils]: 39: Hoare triple {3610#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3610#false} is VALID [2018-11-23 12:27:01,287 INFO L273 TraceCheckUtils]: 40: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:01,287 INFO L273 TraceCheckUtils]: 41: Hoare triple {3610#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3610#false} is VALID [2018-11-23 12:27:01,287 INFO L273 TraceCheckUtils]: 42: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:01,288 INFO L273 TraceCheckUtils]: 43: Hoare triple {3610#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3610#false} is VALID [2018-11-23 12:27:01,288 INFO L273 TraceCheckUtils]: 44: Hoare triple {3610#false} assume !(~i~0 < 1000); {3610#false} is VALID [2018-11-23 12:27:01,288 INFO L273 TraceCheckUtils]: 45: Hoare triple {3610#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:27:01,288 INFO L273 TraceCheckUtils]: 46: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:01,288 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3610#false} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:27:01,289 INFO L273 TraceCheckUtils]: 48: Hoare triple {3610#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {3610#false} is VALID [2018-11-23 12:27:01,289 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3610#false} is VALID [2018-11-23 12:27:01,289 INFO L273 TraceCheckUtils]: 50: Hoare triple {3610#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3610#false} is VALID [2018-11-23 12:27:01,289 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3610#false} is VALID [2018-11-23 12:27:01,289 INFO L273 TraceCheckUtils]: 52: Hoare triple {3610#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3610#false} is VALID [2018-11-23 12:27:01,289 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 999); {3610#false} is VALID [2018-11-23 12:27:01,289 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:27:01,289 INFO L256 TraceCheckUtils]: 55: Hoare triple {3610#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:27:01,290 INFO L273 TraceCheckUtils]: 56: Hoare triple {3610#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3610#false} is VALID [2018-11-23 12:27:01,290 INFO L273 TraceCheckUtils]: 57: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:01,290 INFO L273 TraceCheckUtils]: 58: Hoare triple {3610#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3610#false} is VALID [2018-11-23 12:27:01,290 INFO L273 TraceCheckUtils]: 59: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:01,290 INFO L273 TraceCheckUtils]: 60: Hoare triple {3610#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3610#false} is VALID [2018-11-23 12:27:01,290 INFO L273 TraceCheckUtils]: 61: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:01,290 INFO L273 TraceCheckUtils]: 62: Hoare triple {3610#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3610#false} is VALID [2018-11-23 12:27:01,290 INFO L273 TraceCheckUtils]: 63: Hoare triple {3610#false} assume !(~i~0 < 1000); {3610#false} is VALID [2018-11-23 12:27:01,291 INFO L273 TraceCheckUtils]: 64: Hoare triple {3610#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:27:01,291 INFO L273 TraceCheckUtils]: 65: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:01,291 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3610#false} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:27:01,291 INFO L273 TraceCheckUtils]: 67: Hoare triple {3610#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3610#false} is VALID [2018-11-23 12:27:01,291 INFO L273 TraceCheckUtils]: 68: Hoare triple {3610#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3610#false} is VALID [2018-11-23 12:27:01,291 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:27:01,294 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:27:01,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:01,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:27:01,313 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:27:01,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:01,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:27:01,370 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:27:01,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:27:01,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:27:01,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:27:01,372 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2018-11-23 12:27:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:01,561 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-23 12:27:01,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:01,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:27:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:27:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:27:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:27:01,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:27:01,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:27:01,651 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:27:01,652 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:27:01,652 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:27:01,653 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:27:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:27:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:27:01,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:01,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:01,678 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:01,679 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:01,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:01,680 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:27:01,681 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:27:01,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:01,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:01,682 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:27:01,682 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:27:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:01,684 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:27:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:27:01,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:01,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:01,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:01,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:27:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 12:27:01,687 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2018-11-23 12:27:01,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:01,687 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 12:27:01,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:27:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:27:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:27:01,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:01,688 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:27:01,689 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:01,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:01,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2104249405, now seen corresponding path program 9 times [2018-11-23 12:27:01,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:01,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:01,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:01,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:01,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:02,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:27:02,652 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:27:02,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:02,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:27:02,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret12 := main(); {4124#true} is VALID [2018-11-23 12:27:02,653 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4126#(= main_~i~1 0)} is VALID [2018-11-23 12:27:02,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {4126#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4126#(= main_~i~1 0)} is VALID [2018-11-23 12:27:02,654 INFO L273 TraceCheckUtils]: 7: Hoare triple {4126#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4127#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:02,655 INFO L273 TraceCheckUtils]: 8: Hoare triple {4127#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4127#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:02,655 INFO L273 TraceCheckUtils]: 9: Hoare triple {4127#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4128#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:02,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {4128#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4128#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:02,657 INFO L273 TraceCheckUtils]: 11: Hoare triple {4128#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4129#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:02,657 INFO L273 TraceCheckUtils]: 12: Hoare triple {4129#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4129#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:02,658 INFO L273 TraceCheckUtils]: 13: Hoare triple {4129#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4130#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:02,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {4130#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4130#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:02,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {4130#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4131#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:02,660 INFO L273 TraceCheckUtils]: 16: Hoare triple {4131#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4131#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:02,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {4131#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4132#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:02,661 INFO L273 TraceCheckUtils]: 18: Hoare triple {4132#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4132#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:02,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {4132#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4133#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:02,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {4133#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4133#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:02,663 INFO L273 TraceCheckUtils]: 21: Hoare triple {4133#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4134#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:02,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {4134#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4134#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:02,665 INFO L273 TraceCheckUtils]: 23: Hoare triple {4134#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4135#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:02,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {4135#(<= main_~i~1 9)} assume !(~i~1 < 1000); {4125#false} is VALID [2018-11-23 12:27:02,666 INFO L256 TraceCheckUtils]: 25: Hoare triple {4125#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:27:02,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4124#true} is VALID [2018-11-23 12:27:02,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:02,666 INFO L273 TraceCheckUtils]: 28: Hoare triple {4124#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#true} is VALID [2018-11-23 12:27:02,666 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:02,667 INFO L273 TraceCheckUtils]: 30: Hoare triple {4124#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#true} is VALID [2018-11-23 12:27:02,667 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:02,667 INFO L273 TraceCheckUtils]: 32: Hoare triple {4124#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#true} is VALID [2018-11-23 12:27:02,667 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 1000); {4124#true} is VALID [2018-11-23 12:27:02,668 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:02,668 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:02,668 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4125#false} #70#return; {4125#false} is VALID [2018-11-23 12:27:02,668 INFO L273 TraceCheckUtils]: 37: Hoare triple {4125#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:27:02,668 INFO L256 TraceCheckUtils]: 38: Hoare triple {4125#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:27:02,669 INFO L273 TraceCheckUtils]: 39: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4124#true} is VALID [2018-11-23 12:27:02,669 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:02,669 INFO L273 TraceCheckUtils]: 41: Hoare triple {4124#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#true} is VALID [2018-11-23 12:27:02,669 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:02,669 INFO L273 TraceCheckUtils]: 43: Hoare triple {4124#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#true} is VALID [2018-11-23 12:27:02,670 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:02,670 INFO L273 TraceCheckUtils]: 45: Hoare triple {4124#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#true} is VALID [2018-11-23 12:27:02,670 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 1000); {4124#true} is VALID [2018-11-23 12:27:02,670 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:02,670 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:02,671 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4125#false} #72#return; {4125#false} is VALID [2018-11-23 12:27:02,671 INFO L273 TraceCheckUtils]: 50: Hoare triple {4125#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {4125#false} is VALID [2018-11-23 12:27:02,671 INFO L273 TraceCheckUtils]: 51: Hoare triple {4125#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4125#false} is VALID [2018-11-23 12:27:02,671 INFO L273 TraceCheckUtils]: 52: Hoare triple {4125#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4125#false} is VALID [2018-11-23 12:27:02,671 INFO L273 TraceCheckUtils]: 53: Hoare triple {4125#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4125#false} is VALID [2018-11-23 12:27:02,671 INFO L273 TraceCheckUtils]: 54: Hoare triple {4125#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4125#false} is VALID [2018-11-23 12:27:02,672 INFO L273 TraceCheckUtils]: 55: Hoare triple {4125#false} assume !(~i~2 < 999); {4125#false} is VALID [2018-11-23 12:27:02,672 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:27:02,672 INFO L256 TraceCheckUtils]: 57: Hoare triple {4125#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:27:02,672 INFO L273 TraceCheckUtils]: 58: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4124#true} is VALID [2018-11-23 12:27:02,672 INFO L273 TraceCheckUtils]: 59: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:02,672 INFO L273 TraceCheckUtils]: 60: Hoare triple {4124#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#true} is VALID [2018-11-23 12:27:02,672 INFO L273 TraceCheckUtils]: 61: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:02,672 INFO L273 TraceCheckUtils]: 62: Hoare triple {4124#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#true} is VALID [2018-11-23 12:27:02,673 INFO L273 TraceCheckUtils]: 63: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:02,673 INFO L273 TraceCheckUtils]: 64: Hoare triple {4124#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#true} is VALID [2018-11-23 12:27:02,673 INFO L273 TraceCheckUtils]: 65: Hoare triple {4124#true} assume !(~i~0 < 1000); {4124#true} is VALID [2018-11-23 12:27:02,673 INFO L273 TraceCheckUtils]: 66: Hoare triple {4124#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:02,673 INFO L273 TraceCheckUtils]: 67: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:02,673 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4124#true} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:27:02,673 INFO L273 TraceCheckUtils]: 69: Hoare triple {4125#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4125#false} is VALID [2018-11-23 12:27:02,673 INFO L273 TraceCheckUtils]: 70: Hoare triple {4125#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4125#false} is VALID [2018-11-23 12:27:02,674 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:27:02,678 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:27:02,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:02,679 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:27:02,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:02,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:27:02,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:02,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:02,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:27:02,900 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:27:02,901 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:02,901 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:27:02,901 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret12 := main(); {4124#true} is VALID [2018-11-23 12:27:02,901 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4124#true} is VALID [2018-11-23 12:27:02,902 INFO L273 TraceCheckUtils]: 6: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:02,902 INFO L273 TraceCheckUtils]: 7: Hoare triple {4124#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4124#true} is VALID [2018-11-23 12:27:02,902 INFO L273 TraceCheckUtils]: 8: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:02,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {4124#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4124#true} is VALID [2018-11-23 12:27:02,902 INFO L273 TraceCheckUtils]: 10: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:02,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {4124#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4124#true} is VALID [2018-11-23 12:27:02,903 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:02,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {4124#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4124#true} is VALID [2018-11-23 12:27:02,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:02,903 INFO L273 TraceCheckUtils]: 15: Hoare triple {4124#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4124#true} is VALID [2018-11-23 12:27:02,903 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:02,903 INFO L273 TraceCheckUtils]: 17: Hoare triple {4124#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4124#true} is VALID [2018-11-23 12:27:02,904 INFO L273 TraceCheckUtils]: 18: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:02,904 INFO L273 TraceCheckUtils]: 19: Hoare triple {4124#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4124#true} is VALID [2018-11-23 12:27:02,904 INFO L273 TraceCheckUtils]: 20: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:02,904 INFO L273 TraceCheckUtils]: 21: Hoare triple {4124#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4124#true} is VALID [2018-11-23 12:27:02,904 INFO L273 TraceCheckUtils]: 22: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:02,904 INFO L273 TraceCheckUtils]: 23: Hoare triple {4124#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4124#true} is VALID [2018-11-23 12:27:02,904 INFO L273 TraceCheckUtils]: 24: Hoare triple {4124#true} assume !(~i~1 < 1000); {4124#true} is VALID [2018-11-23 12:27:02,905 INFO L256 TraceCheckUtils]: 25: Hoare triple {4124#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:27:02,905 INFO L273 TraceCheckUtils]: 26: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4124#true} is VALID [2018-11-23 12:27:02,905 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:02,905 INFO L273 TraceCheckUtils]: 28: Hoare triple {4124#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#true} is VALID [2018-11-23 12:27:02,905 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:02,905 INFO L273 TraceCheckUtils]: 30: Hoare triple {4124#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#true} is VALID [2018-11-23 12:27:02,906 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:02,906 INFO L273 TraceCheckUtils]: 32: Hoare triple {4124#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#true} is VALID [2018-11-23 12:27:02,906 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 1000); {4124#true} is VALID [2018-11-23 12:27:02,906 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:02,906 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:02,906 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4124#true} #70#return; {4124#true} is VALID [2018-11-23 12:27:02,907 INFO L273 TraceCheckUtils]: 37: Hoare triple {4124#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4124#true} is VALID [2018-11-23 12:27:02,907 INFO L256 TraceCheckUtils]: 38: Hoare triple {4124#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:27:02,907 INFO L273 TraceCheckUtils]: 39: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4124#true} is VALID [2018-11-23 12:27:02,907 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:02,907 INFO L273 TraceCheckUtils]: 41: Hoare triple {4124#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#true} is VALID [2018-11-23 12:27:02,907 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:02,907 INFO L273 TraceCheckUtils]: 43: Hoare triple {4124#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#true} is VALID [2018-11-23 12:27:02,908 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:02,908 INFO L273 TraceCheckUtils]: 45: Hoare triple {4124#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#true} is VALID [2018-11-23 12:27:02,908 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 1000); {4124#true} is VALID [2018-11-23 12:27:02,908 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:02,908 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:02,908 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4124#true} #72#return; {4124#true} is VALID [2018-11-23 12:27:02,909 INFO L273 TraceCheckUtils]: 50: Hoare triple {4124#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {4289#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:02,910 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4289#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:02,910 INFO L273 TraceCheckUtils]: 52: Hoare triple {4289#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4296#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:02,910 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4296#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:02,911 INFO L273 TraceCheckUtils]: 54: Hoare triple {4296#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4303#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:02,911 INFO L273 TraceCheckUtils]: 55: Hoare triple {4303#(<= main_~i~2 2)} assume !(~i~2 < 999); {4125#false} is VALID [2018-11-23 12:27:02,912 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:27:02,912 INFO L256 TraceCheckUtils]: 57: Hoare triple {4125#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {4125#false} is VALID [2018-11-23 12:27:02,912 INFO L273 TraceCheckUtils]: 58: Hoare triple {4125#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4125#false} is VALID [2018-11-23 12:27:02,912 INFO L273 TraceCheckUtils]: 59: Hoare triple {4125#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4125#false} is VALID [2018-11-23 12:27:02,912 INFO L273 TraceCheckUtils]: 60: Hoare triple {4125#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4125#false} is VALID [2018-11-23 12:27:02,912 INFO L273 TraceCheckUtils]: 61: Hoare triple {4125#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4125#false} is VALID [2018-11-23 12:27:02,913 INFO L273 TraceCheckUtils]: 62: Hoare triple {4125#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4125#false} is VALID [2018-11-23 12:27:02,913 INFO L273 TraceCheckUtils]: 63: Hoare triple {4125#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4125#false} is VALID [2018-11-23 12:27:02,913 INFO L273 TraceCheckUtils]: 64: Hoare triple {4125#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4125#false} is VALID [2018-11-23 12:27:02,913 INFO L273 TraceCheckUtils]: 65: Hoare triple {4125#false} assume !(~i~0 < 1000); {4125#false} is VALID [2018-11-23 12:27:02,914 INFO L273 TraceCheckUtils]: 66: Hoare triple {4125#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {4125#false} is VALID [2018-11-23 12:27:02,914 INFO L273 TraceCheckUtils]: 67: Hoare triple {4125#false} assume true; {4125#false} is VALID [2018-11-23 12:27:02,914 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4125#false} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:27:02,914 INFO L273 TraceCheckUtils]: 69: Hoare triple {4125#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4125#false} is VALID [2018-11-23 12:27:02,915 INFO L273 TraceCheckUtils]: 70: Hoare triple {4125#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4125#false} is VALID [2018-11-23 12:27:02,915 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:27:02,919 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:27:02,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:02,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:27:02,940 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:27:02,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:02,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:27:03,066 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:27:03,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:27:03,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:27:03,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:27:03,068 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2018-11-23 12:27:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:03,539 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-23 12:27:03,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:27:03,539 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:27:03,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:27:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:27:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:27:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:27:03,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2018-11-23 12:27:03,626 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:27:03,628 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:27:03,628 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:27:03,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:27:03,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:27:03,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 12:27:03,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:03,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:03,653 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:03,653 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:03,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:03,655 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:27:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:27:03,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:03,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:03,656 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2018-11-23 12:27:03,656 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2018-11-23 12:27:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:03,658 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:27:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:27:03,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:03,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:03,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:03,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:27:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-23 12:27:03,660 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2018-11-23 12:27:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:03,661 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-23 12:27:03,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:27:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 12:27:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:27:03,662 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:03,662 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:27:03,662 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:03,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:03,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1485183197, now seen corresponding path program 10 times [2018-11-23 12:27:03,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:03,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:03,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:03,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:03,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:03,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:27:03,853 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:27:03,853 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:03,853 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:27:03,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret12 := main(); {4671#true} is VALID [2018-11-23 12:27:03,854 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4673#(= main_~i~1 0)} is VALID [2018-11-23 12:27:03,855 INFO L273 TraceCheckUtils]: 6: Hoare triple {4673#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4673#(= main_~i~1 0)} is VALID [2018-11-23 12:27:03,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {4673#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4674#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:03,856 INFO L273 TraceCheckUtils]: 8: Hoare triple {4674#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4674#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:03,857 INFO L273 TraceCheckUtils]: 9: Hoare triple {4674#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4675#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:03,857 INFO L273 TraceCheckUtils]: 10: Hoare triple {4675#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4675#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:03,858 INFO L273 TraceCheckUtils]: 11: Hoare triple {4675#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4676#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:03,859 INFO L273 TraceCheckUtils]: 12: Hoare triple {4676#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4676#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:03,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {4676#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4677#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:03,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {4677#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4677#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:03,861 INFO L273 TraceCheckUtils]: 15: Hoare triple {4677#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4678#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:03,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {4678#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4678#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:03,862 INFO L273 TraceCheckUtils]: 17: Hoare triple {4678#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4679#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:03,863 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4679#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:03,863 INFO L273 TraceCheckUtils]: 19: Hoare triple {4679#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4680#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:03,864 INFO L273 TraceCheckUtils]: 20: Hoare triple {4680#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4680#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:03,865 INFO L273 TraceCheckUtils]: 21: Hoare triple {4680#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4681#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:03,865 INFO L273 TraceCheckUtils]: 22: Hoare triple {4681#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4681#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:03,866 INFO L273 TraceCheckUtils]: 23: Hoare triple {4681#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4682#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:03,866 INFO L273 TraceCheckUtils]: 24: Hoare triple {4682#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4682#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:03,867 INFO L273 TraceCheckUtils]: 25: Hoare triple {4682#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4683#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:03,868 INFO L273 TraceCheckUtils]: 26: Hoare triple {4683#(<= main_~i~1 10)} assume !(~i~1 < 1000); {4672#false} is VALID [2018-11-23 12:27:03,868 INFO L256 TraceCheckUtils]: 27: Hoare triple {4672#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:03,868 INFO L273 TraceCheckUtils]: 28: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4671#true} is VALID [2018-11-23 12:27:03,869 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:03,869 INFO L273 TraceCheckUtils]: 30: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:03,869 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:03,869 INFO L273 TraceCheckUtils]: 32: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:03,869 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:03,870 INFO L273 TraceCheckUtils]: 34: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:03,870 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 1000); {4671#true} is VALID [2018-11-23 12:27:03,870 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:03,870 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:03,870 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4672#false} #70#return; {4672#false} is VALID [2018-11-23 12:27:03,871 INFO L273 TraceCheckUtils]: 39: Hoare triple {4672#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:27:03,871 INFO L256 TraceCheckUtils]: 40: Hoare triple {4672#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:03,871 INFO L273 TraceCheckUtils]: 41: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4671#true} is VALID [2018-11-23 12:27:03,871 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:03,871 INFO L273 TraceCheckUtils]: 43: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:03,871 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:03,871 INFO L273 TraceCheckUtils]: 45: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:03,871 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:03,872 INFO L273 TraceCheckUtils]: 47: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:03,872 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 1000); {4671#true} is VALID [2018-11-23 12:27:03,872 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:03,872 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:03,872 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4672#false} #72#return; {4672#false} is VALID [2018-11-23 12:27:03,872 INFO L273 TraceCheckUtils]: 52: Hoare triple {4672#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {4672#false} is VALID [2018-11-23 12:27:03,872 INFO L273 TraceCheckUtils]: 53: Hoare triple {4672#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4672#false} is VALID [2018-11-23 12:27:03,872 INFO L273 TraceCheckUtils]: 54: Hoare triple {4672#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4672#false} is VALID [2018-11-23 12:27:03,873 INFO L273 TraceCheckUtils]: 55: Hoare triple {4672#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4672#false} is VALID [2018-11-23 12:27:03,873 INFO L273 TraceCheckUtils]: 56: Hoare triple {4672#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4672#false} is VALID [2018-11-23 12:27:03,873 INFO L273 TraceCheckUtils]: 57: Hoare triple {4672#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4672#false} is VALID [2018-11-23 12:27:03,873 INFO L273 TraceCheckUtils]: 58: Hoare triple {4672#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4672#false} is VALID [2018-11-23 12:27:03,873 INFO L273 TraceCheckUtils]: 59: Hoare triple {4672#false} assume !(~i~2 < 999); {4672#false} is VALID [2018-11-23 12:27:03,873 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:27:03,873 INFO L256 TraceCheckUtils]: 61: Hoare triple {4672#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:03,873 INFO L273 TraceCheckUtils]: 62: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4671#true} is VALID [2018-11-23 12:27:03,873 INFO L273 TraceCheckUtils]: 63: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:03,874 INFO L273 TraceCheckUtils]: 64: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:03,874 INFO L273 TraceCheckUtils]: 65: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:03,874 INFO L273 TraceCheckUtils]: 66: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:03,874 INFO L273 TraceCheckUtils]: 67: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:03,874 INFO L273 TraceCheckUtils]: 68: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:03,874 INFO L273 TraceCheckUtils]: 69: Hoare triple {4671#true} assume !(~i~0 < 1000); {4671#true} is VALID [2018-11-23 12:27:03,874 INFO L273 TraceCheckUtils]: 70: Hoare triple {4671#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:03,874 INFO L273 TraceCheckUtils]: 71: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:03,875 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4671#true} {4672#false} #74#return; {4672#false} is VALID [2018-11-23 12:27:03,875 INFO L273 TraceCheckUtils]: 73: Hoare triple {4672#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4672#false} is VALID [2018-11-23 12:27:03,875 INFO L273 TraceCheckUtils]: 74: Hoare triple {4672#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4672#false} is VALID [2018-11-23 12:27:03,875 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:27:03,878 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:27:03,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:03,878 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:27:03,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:03,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:03,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:03,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:04,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:27:04,193 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:27:04,194 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:04,194 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:27:04,194 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret12 := main(); {4671#true} is VALID [2018-11-23 12:27:04,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4671#true} is VALID [2018-11-23 12:27:04,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:04,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {4671#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4671#true} is VALID [2018-11-23 12:27:04,195 INFO L273 TraceCheckUtils]: 8: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:04,195 INFO L273 TraceCheckUtils]: 9: Hoare triple {4671#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4671#true} is VALID [2018-11-23 12:27:04,196 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:04,196 INFO L273 TraceCheckUtils]: 11: Hoare triple {4671#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4671#true} is VALID [2018-11-23 12:27:04,196 INFO L273 TraceCheckUtils]: 12: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:04,196 INFO L273 TraceCheckUtils]: 13: Hoare triple {4671#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4671#true} is VALID [2018-11-23 12:27:04,197 INFO L273 TraceCheckUtils]: 14: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:04,197 INFO L273 TraceCheckUtils]: 15: Hoare triple {4671#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4671#true} is VALID [2018-11-23 12:27:04,197 INFO L273 TraceCheckUtils]: 16: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:04,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {4671#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4671#true} is VALID [2018-11-23 12:27:04,197 INFO L273 TraceCheckUtils]: 18: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:04,197 INFO L273 TraceCheckUtils]: 19: Hoare triple {4671#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4671#true} is VALID [2018-11-23 12:27:04,197 INFO L273 TraceCheckUtils]: 20: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:04,197 INFO L273 TraceCheckUtils]: 21: Hoare triple {4671#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4671#true} is VALID [2018-11-23 12:27:04,197 INFO L273 TraceCheckUtils]: 22: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:04,198 INFO L273 TraceCheckUtils]: 23: Hoare triple {4671#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4671#true} is VALID [2018-11-23 12:27:04,198 INFO L273 TraceCheckUtils]: 24: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:04,198 INFO L273 TraceCheckUtils]: 25: Hoare triple {4671#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4671#true} is VALID [2018-11-23 12:27:04,198 INFO L273 TraceCheckUtils]: 26: Hoare triple {4671#true} assume !(~i~1 < 1000); {4671#true} is VALID [2018-11-23 12:27:04,198 INFO L256 TraceCheckUtils]: 27: Hoare triple {4671#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:04,198 INFO L273 TraceCheckUtils]: 28: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4671#true} is VALID [2018-11-23 12:27:04,198 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:04,198 INFO L273 TraceCheckUtils]: 30: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:04,199 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:04,199 INFO L273 TraceCheckUtils]: 32: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:04,199 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:04,199 INFO L273 TraceCheckUtils]: 34: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:04,199 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 1000); {4671#true} is VALID [2018-11-23 12:27:04,199 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:04,199 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:04,199 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4671#true} #70#return; {4671#true} is VALID [2018-11-23 12:27:04,200 INFO L273 TraceCheckUtils]: 39: Hoare triple {4671#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:27:04,200 INFO L256 TraceCheckUtils]: 40: Hoare triple {4671#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:04,200 INFO L273 TraceCheckUtils]: 41: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4671#true} is VALID [2018-11-23 12:27:04,200 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:04,200 INFO L273 TraceCheckUtils]: 43: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:04,200 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:04,200 INFO L273 TraceCheckUtils]: 45: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:04,200 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:04,201 INFO L273 TraceCheckUtils]: 47: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:04,201 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 1000); {4671#true} is VALID [2018-11-23 12:27:04,201 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:04,201 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:04,201 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4671#true} #72#return; {4671#true} is VALID [2018-11-23 12:27:04,201 INFO L273 TraceCheckUtils]: 52: Hoare triple {4671#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {4671#true} is VALID [2018-11-23 12:27:04,201 INFO L273 TraceCheckUtils]: 53: Hoare triple {4671#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4671#true} is VALID [2018-11-23 12:27:04,201 INFO L273 TraceCheckUtils]: 54: Hoare triple {4671#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4671#true} is VALID [2018-11-23 12:27:04,201 INFO L273 TraceCheckUtils]: 55: Hoare triple {4671#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4671#true} is VALID [2018-11-23 12:27:04,202 INFO L273 TraceCheckUtils]: 56: Hoare triple {4671#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4671#true} is VALID [2018-11-23 12:27:04,202 INFO L273 TraceCheckUtils]: 57: Hoare triple {4671#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4671#true} is VALID [2018-11-23 12:27:04,202 INFO L273 TraceCheckUtils]: 58: Hoare triple {4671#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4671#true} is VALID [2018-11-23 12:27:04,202 INFO L273 TraceCheckUtils]: 59: Hoare triple {4671#true} assume !(~i~2 < 999); {4671#true} is VALID [2018-11-23 12:27:04,202 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:27:04,202 INFO L256 TraceCheckUtils]: 61: Hoare triple {4671#true} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:04,203 INFO L273 TraceCheckUtils]: 62: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4873#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:27:04,203 INFO L273 TraceCheckUtils]: 63: Hoare triple {4873#(<= mapavg_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4873#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:27:04,204 INFO L273 TraceCheckUtils]: 64: Hoare triple {4873#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4880#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:27:04,204 INFO L273 TraceCheckUtils]: 65: Hoare triple {4880#(<= mapavg_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4880#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:27:04,204 INFO L273 TraceCheckUtils]: 66: Hoare triple {4880#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4887#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:27:04,205 INFO L273 TraceCheckUtils]: 67: Hoare triple {4887#(<= mapavg_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4887#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:27:04,205 INFO L273 TraceCheckUtils]: 68: Hoare triple {4887#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4894#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:27:04,206 INFO L273 TraceCheckUtils]: 69: Hoare triple {4894#(<= mapavg_~i~0 3)} assume !(~i~0 < 1000); {4672#false} is VALID [2018-11-23 12:27:04,206 INFO L273 TraceCheckUtils]: 70: Hoare triple {4672#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {4672#false} is VALID [2018-11-23 12:27:04,206 INFO L273 TraceCheckUtils]: 71: Hoare triple {4672#false} assume true; {4672#false} is VALID [2018-11-23 12:27:04,207 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4672#false} {4671#true} #74#return; {4672#false} is VALID [2018-11-23 12:27:04,207 INFO L273 TraceCheckUtils]: 73: Hoare triple {4672#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4672#false} is VALID [2018-11-23 12:27:04,207 INFO L273 TraceCheckUtils]: 74: Hoare triple {4672#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4672#false} is VALID [2018-11-23 12:27:04,207 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:27:04,211 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:27:04,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:04,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2018-11-23 12:27:04,230 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:27:04,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:04,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:27:04,301 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:27:04,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:27:04,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:27:04,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:04,303 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2018-11-23 12:27:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:04,797 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-11-23 12:27:04,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:27:04,798 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:27:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:27:04,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:27:04,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 12:27:04,908 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:27:04,910 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:27:04,910 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:27:04,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:04,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:27:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 12:27:04,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:04,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:04,941 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:04,941 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:04,943 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:27:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:27:04,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:04,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:04,945 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 12:27:04,945 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 12:27:04,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:04,947 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:27:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:27:04,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:04,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:04,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:04,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:27:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 12:27:04,949 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2018-11-23 12:27:04,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:04,950 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 12:27:04,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:27:04,950 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 12:27:04,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 12:27:04,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:04,951 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:27:04,951 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:04,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:04,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1828841827, now seen corresponding path program 11 times [2018-11-23 12:27:04,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:04,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:04,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:04,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:04,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:05,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:27:05,877 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:27:05,877 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:05,877 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:27:05,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret12 := main(); {5255#true} is VALID [2018-11-23 12:27:05,877 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5257#(= main_~i~1 0)} is VALID [2018-11-23 12:27:05,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {5257#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5257#(= main_~i~1 0)} is VALID [2018-11-23 12:27:05,878 INFO L273 TraceCheckUtils]: 7: Hoare triple {5257#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5258#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:05,879 INFO L273 TraceCheckUtils]: 8: Hoare triple {5258#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5258#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:05,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {5258#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5259#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:05,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {5259#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5259#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:05,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {5259#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5260#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:05,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {5260#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5260#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:05,881 INFO L273 TraceCheckUtils]: 13: Hoare triple {5260#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5261#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:05,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {5261#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5261#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:05,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {5261#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5262#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:05,882 INFO L273 TraceCheckUtils]: 16: Hoare triple {5262#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5262#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:05,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {5262#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5263#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:05,901 INFO L273 TraceCheckUtils]: 18: Hoare triple {5263#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5263#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:05,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {5263#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5264#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:05,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {5264#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5264#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:05,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {5264#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5265#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:05,911 INFO L273 TraceCheckUtils]: 22: Hoare triple {5265#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5265#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:05,912 INFO L273 TraceCheckUtils]: 23: Hoare triple {5265#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5266#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:05,912 INFO L273 TraceCheckUtils]: 24: Hoare triple {5266#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5266#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:05,913 INFO L273 TraceCheckUtils]: 25: Hoare triple {5266#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5267#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:05,913 INFO L273 TraceCheckUtils]: 26: Hoare triple {5267#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5267#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:05,913 INFO L273 TraceCheckUtils]: 27: Hoare triple {5267#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5268#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:05,914 INFO L273 TraceCheckUtils]: 28: Hoare triple {5268#(<= main_~i~1 11)} assume !(~i~1 < 1000); {5256#false} is VALID [2018-11-23 12:27:05,914 INFO L256 TraceCheckUtils]: 29: Hoare triple {5256#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:27:05,914 INFO L273 TraceCheckUtils]: 30: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5255#true} is VALID [2018-11-23 12:27:05,914 INFO L273 TraceCheckUtils]: 31: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:05,914 INFO L273 TraceCheckUtils]: 32: Hoare triple {5255#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5255#true} is VALID [2018-11-23 12:27:05,915 INFO L273 TraceCheckUtils]: 33: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:05,915 INFO L273 TraceCheckUtils]: 34: Hoare triple {5255#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5255#true} is VALID [2018-11-23 12:27:05,915 INFO L273 TraceCheckUtils]: 35: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:05,915 INFO L273 TraceCheckUtils]: 36: Hoare triple {5255#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5255#true} is VALID [2018-11-23 12:27:05,915 INFO L273 TraceCheckUtils]: 37: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:05,916 INFO L273 TraceCheckUtils]: 38: Hoare triple {5255#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5255#true} is VALID [2018-11-23 12:27:05,916 INFO L273 TraceCheckUtils]: 39: Hoare triple {5255#true} assume !(~i~0 < 1000); {5255#true} is VALID [2018-11-23 12:27:05,916 INFO L273 TraceCheckUtils]: 40: Hoare triple {5255#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:27:05,916 INFO L273 TraceCheckUtils]: 41: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:05,916 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5255#true} {5256#false} #70#return; {5256#false} is VALID [2018-11-23 12:27:05,917 INFO L273 TraceCheckUtils]: 43: Hoare triple {5256#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:27:05,917 INFO L256 TraceCheckUtils]: 44: Hoare triple {5256#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:27:05,917 INFO L273 TraceCheckUtils]: 45: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5255#true} is VALID [2018-11-23 12:27:05,917 INFO L273 TraceCheckUtils]: 46: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:05,917 INFO L273 TraceCheckUtils]: 47: Hoare triple {5255#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5255#true} is VALID [2018-11-23 12:27:05,917 INFO L273 TraceCheckUtils]: 48: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:05,917 INFO L273 TraceCheckUtils]: 49: Hoare triple {5255#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5255#true} is VALID [2018-11-23 12:27:05,917 INFO L273 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:05,917 INFO L273 TraceCheckUtils]: 51: Hoare triple {5255#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5255#true} is VALID [2018-11-23 12:27:05,918 INFO L273 TraceCheckUtils]: 52: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:05,918 INFO L273 TraceCheckUtils]: 53: Hoare triple {5255#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5255#true} is VALID [2018-11-23 12:27:05,918 INFO L273 TraceCheckUtils]: 54: Hoare triple {5255#true} assume !(~i~0 < 1000); {5255#true} is VALID [2018-11-23 12:27:05,918 INFO L273 TraceCheckUtils]: 55: Hoare triple {5255#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:27:05,918 INFO L273 TraceCheckUtils]: 56: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:05,918 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5255#true} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:27:05,918 INFO L273 TraceCheckUtils]: 58: Hoare triple {5256#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {5256#false} is VALID [2018-11-23 12:27:05,918 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:05,919 INFO L273 TraceCheckUtils]: 60: Hoare triple {5256#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5256#false} is VALID [2018-11-23 12:27:05,919 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:05,919 INFO L273 TraceCheckUtils]: 62: Hoare triple {5256#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5256#false} is VALID [2018-11-23 12:27:05,919 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:05,919 INFO L273 TraceCheckUtils]: 64: Hoare triple {5256#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5256#false} is VALID [2018-11-23 12:27:05,919 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 999); {5256#false} is VALID [2018-11-23 12:27:05,919 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:27:05,919 INFO L256 TraceCheckUtils]: 67: Hoare triple {5256#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:27:05,920 INFO L273 TraceCheckUtils]: 68: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5255#true} is VALID [2018-11-23 12:27:05,920 INFO L273 TraceCheckUtils]: 69: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:05,920 INFO L273 TraceCheckUtils]: 70: Hoare triple {5255#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5255#true} is VALID [2018-11-23 12:27:05,920 INFO L273 TraceCheckUtils]: 71: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:05,920 INFO L273 TraceCheckUtils]: 72: Hoare triple {5255#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5255#true} is VALID [2018-11-23 12:27:05,920 INFO L273 TraceCheckUtils]: 73: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:05,920 INFO L273 TraceCheckUtils]: 74: Hoare triple {5255#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5255#true} is VALID [2018-11-23 12:27:05,920 INFO L273 TraceCheckUtils]: 75: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:05,921 INFO L273 TraceCheckUtils]: 76: Hoare triple {5255#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5255#true} is VALID [2018-11-23 12:27:05,921 INFO L273 TraceCheckUtils]: 77: Hoare triple {5255#true} assume !(~i~0 < 1000); {5255#true} is VALID [2018-11-23 12:27:05,921 INFO L273 TraceCheckUtils]: 78: Hoare triple {5255#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:27:05,921 INFO L273 TraceCheckUtils]: 79: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:05,921 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5255#true} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:27:05,921 INFO L273 TraceCheckUtils]: 81: Hoare triple {5256#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {5256#false} is VALID [2018-11-23 12:27:05,921 INFO L273 TraceCheckUtils]: 82: Hoare triple {5256#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5256#false} is VALID [2018-11-23 12:27:05,921 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:27:05,925 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:27:05,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:05,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:27:05,936 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:06,187 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 12:27:06,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:06,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:06,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:27:06,339 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:27:06,339 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:06,339 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:27:06,340 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret12 := main(); {5255#true} is VALID [2018-11-23 12:27:06,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5255#true} is VALID [2018-11-23 12:27:06,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:06,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {5255#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5255#true} is VALID [2018-11-23 12:27:06,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:06,341 INFO L273 TraceCheckUtils]: 9: Hoare triple {5255#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5255#true} is VALID [2018-11-23 12:27:06,341 INFO L273 TraceCheckUtils]: 10: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:06,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {5255#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5255#true} is VALID [2018-11-23 12:27:06,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:06,341 INFO L273 TraceCheckUtils]: 13: Hoare triple {5255#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5255#true} is VALID [2018-11-23 12:27:06,342 INFO L273 TraceCheckUtils]: 14: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:06,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {5255#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5255#true} is VALID [2018-11-23 12:27:06,342 INFO L273 TraceCheckUtils]: 16: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:06,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {5255#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5255#true} is VALID [2018-11-23 12:27:06,342 INFO L273 TraceCheckUtils]: 18: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:06,342 INFO L273 TraceCheckUtils]: 19: Hoare triple {5255#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5255#true} is VALID [2018-11-23 12:27:06,343 INFO L273 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:06,343 INFO L273 TraceCheckUtils]: 21: Hoare triple {5255#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5255#true} is VALID [2018-11-23 12:27:06,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:06,343 INFO L273 TraceCheckUtils]: 23: Hoare triple {5255#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5255#true} is VALID [2018-11-23 12:27:06,343 INFO L273 TraceCheckUtils]: 24: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:06,343 INFO L273 TraceCheckUtils]: 25: Hoare triple {5255#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5255#true} is VALID [2018-11-23 12:27:06,343 INFO L273 TraceCheckUtils]: 26: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:06,343 INFO L273 TraceCheckUtils]: 27: Hoare triple {5255#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5255#true} is VALID [2018-11-23 12:27:06,343 INFO L273 TraceCheckUtils]: 28: Hoare triple {5255#true} assume !(~i~1 < 1000); {5255#true} is VALID [2018-11-23 12:27:06,344 INFO L256 TraceCheckUtils]: 29: Hoare triple {5255#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:27:06,344 INFO L273 TraceCheckUtils]: 30: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5362#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:27:06,344 INFO L273 TraceCheckUtils]: 31: Hoare triple {5362#(<= mapavg_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5362#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:27:06,345 INFO L273 TraceCheckUtils]: 32: Hoare triple {5362#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5369#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:27:06,345 INFO L273 TraceCheckUtils]: 33: Hoare triple {5369#(<= mapavg_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5369#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:27:06,346 INFO L273 TraceCheckUtils]: 34: Hoare triple {5369#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5376#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:27:06,346 INFO L273 TraceCheckUtils]: 35: Hoare triple {5376#(<= mapavg_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5376#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:27:06,346 INFO L273 TraceCheckUtils]: 36: Hoare triple {5376#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5383#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:27:06,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {5383#(<= mapavg_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5383#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:27:06,347 INFO L273 TraceCheckUtils]: 38: Hoare triple {5383#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5390#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:27:06,348 INFO L273 TraceCheckUtils]: 39: Hoare triple {5390#(<= mapavg_~i~0 4)} assume !(~i~0 < 1000); {5256#false} is VALID [2018-11-23 12:27:06,348 INFO L273 TraceCheckUtils]: 40: Hoare triple {5256#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:27:06,349 INFO L273 TraceCheckUtils]: 41: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:06,349 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5256#false} {5255#true} #70#return; {5256#false} is VALID [2018-11-23 12:27:06,349 INFO L273 TraceCheckUtils]: 43: Hoare triple {5256#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:27:06,349 INFO L256 TraceCheckUtils]: 44: Hoare triple {5256#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {5256#false} is VALID [2018-11-23 12:27:06,349 INFO L273 TraceCheckUtils]: 45: Hoare triple {5256#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5256#false} is VALID [2018-11-23 12:27:06,350 INFO L273 TraceCheckUtils]: 46: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:06,350 INFO L273 TraceCheckUtils]: 47: Hoare triple {5256#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5256#false} is VALID [2018-11-23 12:27:06,350 INFO L273 TraceCheckUtils]: 48: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:06,350 INFO L273 TraceCheckUtils]: 49: Hoare triple {5256#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5256#false} is VALID [2018-11-23 12:27:06,350 INFO L273 TraceCheckUtils]: 50: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:06,351 INFO L273 TraceCheckUtils]: 51: Hoare triple {5256#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5256#false} is VALID [2018-11-23 12:27:06,351 INFO L273 TraceCheckUtils]: 52: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:06,351 INFO L273 TraceCheckUtils]: 53: Hoare triple {5256#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5256#false} is VALID [2018-11-23 12:27:06,351 INFO L273 TraceCheckUtils]: 54: Hoare triple {5256#false} assume !(~i~0 < 1000); {5256#false} is VALID [2018-11-23 12:27:06,351 INFO L273 TraceCheckUtils]: 55: Hoare triple {5256#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:27:06,351 INFO L273 TraceCheckUtils]: 56: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:06,352 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5256#false} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:27:06,352 INFO L273 TraceCheckUtils]: 58: Hoare triple {5256#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {5256#false} is VALID [2018-11-23 12:27:06,352 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:06,352 INFO L273 TraceCheckUtils]: 60: Hoare triple {5256#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5256#false} is VALID [2018-11-23 12:27:06,352 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:06,352 INFO L273 TraceCheckUtils]: 62: Hoare triple {5256#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5256#false} is VALID [2018-11-23 12:27:06,352 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:06,352 INFO L273 TraceCheckUtils]: 64: Hoare triple {5256#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5256#false} is VALID [2018-11-23 12:27:06,352 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 999); {5256#false} is VALID [2018-11-23 12:27:06,353 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:27:06,353 INFO L256 TraceCheckUtils]: 67: Hoare triple {5256#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {5256#false} is VALID [2018-11-23 12:27:06,353 INFO L273 TraceCheckUtils]: 68: Hoare triple {5256#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5256#false} is VALID [2018-11-23 12:27:06,353 INFO L273 TraceCheckUtils]: 69: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:06,353 INFO L273 TraceCheckUtils]: 70: Hoare triple {5256#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5256#false} is VALID [2018-11-23 12:27:06,353 INFO L273 TraceCheckUtils]: 71: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:06,353 INFO L273 TraceCheckUtils]: 72: Hoare triple {5256#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5256#false} is VALID [2018-11-23 12:27:06,353 INFO L273 TraceCheckUtils]: 73: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:06,354 INFO L273 TraceCheckUtils]: 74: Hoare triple {5256#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5256#false} is VALID [2018-11-23 12:27:06,354 INFO L273 TraceCheckUtils]: 75: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:06,354 INFO L273 TraceCheckUtils]: 76: Hoare triple {5256#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5256#false} is VALID [2018-11-23 12:27:06,354 INFO L273 TraceCheckUtils]: 77: Hoare triple {5256#false} assume !(~i~0 < 1000); {5256#false} is VALID [2018-11-23 12:27:06,354 INFO L273 TraceCheckUtils]: 78: Hoare triple {5256#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:27:06,354 INFO L273 TraceCheckUtils]: 79: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:06,355 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5256#false} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:27:06,355 INFO L273 TraceCheckUtils]: 81: Hoare triple {5256#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {5256#false} is VALID [2018-11-23 12:27:06,355 INFO L273 TraceCheckUtils]: 82: Hoare triple {5256#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5256#false} is VALID [2018-11-23 12:27:06,355 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:27:06,359 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:27:06,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:06,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-23 12:27:06,389 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:27:06,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:06,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:27:06,492 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:27:06,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:27:06,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:27:06,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:06,493 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2018-11-23 12:27:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:06,995 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-23 12:27:06,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:06,995 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:27:06,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:27:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:27:06,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2018-11-23 12:27:07,534 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:27:07,536 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:27:07,536 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:27:07,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:27:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 12:27:07,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:07,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:07,573 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:07,573 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:07,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:07,575 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:27:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:27:07,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:07,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:07,576 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 12:27:07,576 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 12:27:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:07,578 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:27:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:27:07,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:07,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:07,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:07,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:27:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 12:27:07,581 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2018-11-23 12:27:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:07,581 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 12:27:07,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:27:07,581 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 12:27:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:27:07,582 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:07,583 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:27:07,583 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:07,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:07,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1538721373, now seen corresponding path program 12 times [2018-11-23 12:27:07,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:07,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:07,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:07,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:07,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:09,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:27:09,060 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:27:09,060 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:09,060 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:27:09,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret12 := main(); {5888#true} is VALID [2018-11-23 12:27:09,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5890#(= main_~i~1 0)} is VALID [2018-11-23 12:27:09,061 INFO L273 TraceCheckUtils]: 6: Hoare triple {5890#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5890#(= main_~i~1 0)} is VALID [2018-11-23 12:27:09,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {5890#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5891#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:09,062 INFO L273 TraceCheckUtils]: 8: Hoare triple {5891#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5891#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:09,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {5891#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5892#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:09,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {5892#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5892#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:09,063 INFO L273 TraceCheckUtils]: 11: Hoare triple {5892#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5893#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:09,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {5893#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5893#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:09,066 INFO L273 TraceCheckUtils]: 13: Hoare triple {5893#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5894#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:09,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {5894#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5894#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:09,067 INFO L273 TraceCheckUtils]: 15: Hoare triple {5894#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5895#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:09,068 INFO L273 TraceCheckUtils]: 16: Hoare triple {5895#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5895#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:09,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {5895#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5896#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:09,069 INFO L273 TraceCheckUtils]: 18: Hoare triple {5896#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5896#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:09,070 INFO L273 TraceCheckUtils]: 19: Hoare triple {5896#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5897#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:09,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {5897#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5897#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:09,071 INFO L273 TraceCheckUtils]: 21: Hoare triple {5897#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5898#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:09,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {5898#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5898#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:09,072 INFO L273 TraceCheckUtils]: 23: Hoare triple {5898#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5899#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:09,073 INFO L273 TraceCheckUtils]: 24: Hoare triple {5899#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5899#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:09,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {5899#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5900#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:09,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {5900#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5900#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:09,075 INFO L273 TraceCheckUtils]: 27: Hoare triple {5900#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5901#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:09,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {5901#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5901#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:09,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {5901#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5902#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:09,077 INFO L273 TraceCheckUtils]: 30: Hoare triple {5902#(<= main_~i~1 12)} assume !(~i~1 < 1000); {5889#false} is VALID [2018-11-23 12:27:09,077 INFO L256 TraceCheckUtils]: 31: Hoare triple {5889#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:27:09,077 INFO L273 TraceCheckUtils]: 32: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5888#true} is VALID [2018-11-23 12:27:09,077 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,078 INFO L273 TraceCheckUtils]: 34: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,078 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,078 INFO L273 TraceCheckUtils]: 36: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,078 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,078 INFO L273 TraceCheckUtils]: 38: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,079 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,079 INFO L273 TraceCheckUtils]: 40: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,079 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,079 INFO L273 TraceCheckUtils]: 42: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,079 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 1000); {5888#true} is VALID [2018-11-23 12:27:09,080 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:09,080 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:09,080 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5889#false} #70#return; {5889#false} is VALID [2018-11-23 12:27:09,080 INFO L273 TraceCheckUtils]: 47: Hoare triple {5889#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:27:09,080 INFO L256 TraceCheckUtils]: 48: Hoare triple {5889#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:27:09,080 INFO L273 TraceCheckUtils]: 49: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5888#true} is VALID [2018-11-23 12:27:09,080 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,080 INFO L273 TraceCheckUtils]: 51: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,080 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,081 INFO L273 TraceCheckUtils]: 53: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,081 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,081 INFO L273 TraceCheckUtils]: 55: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,081 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,081 INFO L273 TraceCheckUtils]: 57: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,081 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,081 INFO L273 TraceCheckUtils]: 59: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,081 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 1000); {5888#true} is VALID [2018-11-23 12:27:09,082 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:09,082 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:09,082 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5889#false} #72#return; {5889#false} is VALID [2018-11-23 12:27:09,082 INFO L273 TraceCheckUtils]: 64: Hoare triple {5889#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {5889#false} is VALID [2018-11-23 12:27:09,082 INFO L273 TraceCheckUtils]: 65: Hoare triple {5889#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5889#false} is VALID [2018-11-23 12:27:09,082 INFO L273 TraceCheckUtils]: 66: Hoare triple {5889#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5889#false} is VALID [2018-11-23 12:27:09,082 INFO L273 TraceCheckUtils]: 67: Hoare triple {5889#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5889#false} is VALID [2018-11-23 12:27:09,082 INFO L273 TraceCheckUtils]: 68: Hoare triple {5889#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5889#false} is VALID [2018-11-23 12:27:09,082 INFO L273 TraceCheckUtils]: 69: Hoare triple {5889#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5889#false} is VALID [2018-11-23 12:27:09,083 INFO L273 TraceCheckUtils]: 70: Hoare triple {5889#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5889#false} is VALID [2018-11-23 12:27:09,083 INFO L273 TraceCheckUtils]: 71: Hoare triple {5889#false} assume !(~i~2 < 999); {5889#false} is VALID [2018-11-23 12:27:09,083 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:27:09,083 INFO L256 TraceCheckUtils]: 73: Hoare triple {5889#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:27:09,083 INFO L273 TraceCheckUtils]: 74: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5888#true} is VALID [2018-11-23 12:27:09,083 INFO L273 TraceCheckUtils]: 75: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,083 INFO L273 TraceCheckUtils]: 76: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,083 INFO L273 TraceCheckUtils]: 77: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,084 INFO L273 TraceCheckUtils]: 78: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,084 INFO L273 TraceCheckUtils]: 79: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,084 INFO L273 TraceCheckUtils]: 80: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,084 INFO L273 TraceCheckUtils]: 81: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,084 INFO L273 TraceCheckUtils]: 82: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,084 INFO L273 TraceCheckUtils]: 83: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,084 INFO L273 TraceCheckUtils]: 84: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,084 INFO L273 TraceCheckUtils]: 85: Hoare triple {5888#true} assume !(~i~0 < 1000); {5888#true} is VALID [2018-11-23 12:27:09,084 INFO L273 TraceCheckUtils]: 86: Hoare triple {5888#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:09,085 INFO L273 TraceCheckUtils]: 87: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:09,085 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5888#true} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:27:09,085 INFO L273 TraceCheckUtils]: 89: Hoare triple {5889#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {5889#false} is VALID [2018-11-23 12:27:09,085 INFO L273 TraceCheckUtils]: 90: Hoare triple {5889#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5889#false} is VALID [2018-11-23 12:27:09,085 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:27:09,089 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:27:09,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:09,089 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:27:09,099 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:09,280 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:27:09,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:09,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:09,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:27:09,507 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:27:09,507 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:09,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:27:09,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret12 := main(); {5888#true} is VALID [2018-11-23 12:27:09,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5888#true} is VALID [2018-11-23 12:27:09,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:09,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {5888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5888#true} is VALID [2018-11-23 12:27:09,508 INFO L273 TraceCheckUtils]: 8: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:09,508 INFO L273 TraceCheckUtils]: 9: Hoare triple {5888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5888#true} is VALID [2018-11-23 12:27:09,508 INFO L273 TraceCheckUtils]: 10: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:09,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {5888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5888#true} is VALID [2018-11-23 12:27:09,508 INFO L273 TraceCheckUtils]: 12: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:09,509 INFO L273 TraceCheckUtils]: 13: Hoare triple {5888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5888#true} is VALID [2018-11-23 12:27:09,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:09,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {5888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5888#true} is VALID [2018-11-23 12:27:09,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:09,509 INFO L273 TraceCheckUtils]: 17: Hoare triple {5888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5888#true} is VALID [2018-11-23 12:27:09,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:09,509 INFO L273 TraceCheckUtils]: 19: Hoare triple {5888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5888#true} is VALID [2018-11-23 12:27:09,509 INFO L273 TraceCheckUtils]: 20: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:09,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {5888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5888#true} is VALID [2018-11-23 12:27:09,510 INFO L273 TraceCheckUtils]: 22: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:09,510 INFO L273 TraceCheckUtils]: 23: Hoare triple {5888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5888#true} is VALID [2018-11-23 12:27:09,510 INFO L273 TraceCheckUtils]: 24: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:09,510 INFO L273 TraceCheckUtils]: 25: Hoare triple {5888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5888#true} is VALID [2018-11-23 12:27:09,510 INFO L273 TraceCheckUtils]: 26: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:09,510 INFO L273 TraceCheckUtils]: 27: Hoare triple {5888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5888#true} is VALID [2018-11-23 12:27:09,510 INFO L273 TraceCheckUtils]: 28: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:09,510 INFO L273 TraceCheckUtils]: 29: Hoare triple {5888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5888#true} is VALID [2018-11-23 12:27:09,511 INFO L273 TraceCheckUtils]: 30: Hoare triple {5888#true} assume !(~i~1 < 1000); {5888#true} is VALID [2018-11-23 12:27:09,511 INFO L256 TraceCheckUtils]: 31: Hoare triple {5888#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:27:09,511 INFO L273 TraceCheckUtils]: 32: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5888#true} is VALID [2018-11-23 12:27:09,511 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,511 INFO L273 TraceCheckUtils]: 34: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,511 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,511 INFO L273 TraceCheckUtils]: 36: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,511 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,512 INFO L273 TraceCheckUtils]: 38: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,512 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,512 INFO L273 TraceCheckUtils]: 40: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,512 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,512 INFO L273 TraceCheckUtils]: 42: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,512 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 1000); {5888#true} is VALID [2018-11-23 12:27:09,512 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:09,512 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:09,512 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5888#true} #70#return; {5888#true} is VALID [2018-11-23 12:27:09,513 INFO L273 TraceCheckUtils]: 47: Hoare triple {5888#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5888#true} is VALID [2018-11-23 12:27:09,513 INFO L256 TraceCheckUtils]: 48: Hoare triple {5888#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:27:09,513 INFO L273 TraceCheckUtils]: 49: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5888#true} is VALID [2018-11-23 12:27:09,513 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,513 INFO L273 TraceCheckUtils]: 51: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,513 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,513 INFO L273 TraceCheckUtils]: 53: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,513 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,514 INFO L273 TraceCheckUtils]: 55: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,514 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,514 INFO L273 TraceCheckUtils]: 57: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,514 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:09,514 INFO L273 TraceCheckUtils]: 59: Hoare triple {5888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5888#true} is VALID [2018-11-23 12:27:09,514 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 1000); {5888#true} is VALID [2018-11-23 12:27:09,514 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:09,514 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:09,515 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5888#true} #72#return; {5888#true} is VALID [2018-11-23 12:27:09,515 INFO L273 TraceCheckUtils]: 64: Hoare triple {5888#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {6098#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:09,515 INFO L273 TraceCheckUtils]: 65: Hoare triple {6098#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6098#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:09,516 INFO L273 TraceCheckUtils]: 66: Hoare triple {6098#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6105#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:09,516 INFO L273 TraceCheckUtils]: 67: Hoare triple {6105#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6105#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:09,517 INFO L273 TraceCheckUtils]: 68: Hoare triple {6105#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6112#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:09,517 INFO L273 TraceCheckUtils]: 69: Hoare triple {6112#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6112#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:09,518 INFO L273 TraceCheckUtils]: 70: Hoare triple {6112#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6119#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:09,518 INFO L273 TraceCheckUtils]: 71: Hoare triple {6119#(<= main_~i~2 3)} assume !(~i~2 < 999); {5889#false} is VALID [2018-11-23 12:27:09,518 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:27:09,518 INFO L256 TraceCheckUtils]: 73: Hoare triple {5889#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {5889#false} is VALID [2018-11-23 12:27:09,518 INFO L273 TraceCheckUtils]: 74: Hoare triple {5889#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5889#false} is VALID [2018-11-23 12:27:09,519 INFO L273 TraceCheckUtils]: 75: Hoare triple {5889#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5889#false} is VALID [2018-11-23 12:27:09,519 INFO L273 TraceCheckUtils]: 76: Hoare triple {5889#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5889#false} is VALID [2018-11-23 12:27:09,519 INFO L273 TraceCheckUtils]: 77: Hoare triple {5889#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5889#false} is VALID [2018-11-23 12:27:09,519 INFO L273 TraceCheckUtils]: 78: Hoare triple {5889#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5889#false} is VALID [2018-11-23 12:27:09,519 INFO L273 TraceCheckUtils]: 79: Hoare triple {5889#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5889#false} is VALID [2018-11-23 12:27:09,520 INFO L273 TraceCheckUtils]: 80: Hoare triple {5889#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5889#false} is VALID [2018-11-23 12:27:09,520 INFO L273 TraceCheckUtils]: 81: Hoare triple {5889#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5889#false} is VALID [2018-11-23 12:27:09,520 INFO L273 TraceCheckUtils]: 82: Hoare triple {5889#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5889#false} is VALID [2018-11-23 12:27:09,521 INFO L273 TraceCheckUtils]: 83: Hoare triple {5889#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5889#false} is VALID [2018-11-23 12:27:09,521 INFO L273 TraceCheckUtils]: 84: Hoare triple {5889#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5889#false} is VALID [2018-11-23 12:27:09,521 INFO L273 TraceCheckUtils]: 85: Hoare triple {5889#false} assume !(~i~0 < 1000); {5889#false} is VALID [2018-11-23 12:27:09,521 INFO L273 TraceCheckUtils]: 86: Hoare triple {5889#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {5889#false} is VALID [2018-11-23 12:27:09,522 INFO L273 TraceCheckUtils]: 87: Hoare triple {5889#false} assume true; {5889#false} is VALID [2018-11-23 12:27:09,522 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5889#false} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:27:09,522 INFO L273 TraceCheckUtils]: 89: Hoare triple {5889#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {5889#false} is VALID [2018-11-23 12:27:09,522 INFO L273 TraceCheckUtils]: 90: Hoare triple {5889#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5889#false} is VALID [2018-11-23 12:27:09,522 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:27:09,526 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:27:09,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:09,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-11-23 12:27:09,548 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:27:09,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:09,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:27:09,624 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:27:09,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:27:09,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:27:09,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:09,625 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2018-11-23 12:27:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:10,220 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-23 12:27:10,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:10,220 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:27:10,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:27:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:27:10,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 87 transitions. [2018-11-23 12:27:10,661 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:27:10,664 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:27:10,664 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:27:10,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:10,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:27:11,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:27:11,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:11,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:27:11,123 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:27:11,124 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:27:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:11,126 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:27:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:27:11,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:11,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:11,127 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:27:11,127 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:27:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:11,129 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:27:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:27:11,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:11,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:11,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:11,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:27:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 12:27:11,132 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2018-11-23 12:27:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:11,132 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 12:27:11,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:27:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:27:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:27:11,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:11,133 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:27:11,134 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:11,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:11,134 INFO L82 PathProgramCache]: Analyzing trace with hash 713900035, now seen corresponding path program 13 times [2018-11-23 12:27:11,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:11,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:11,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:11,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:11,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:11,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:27:11,453 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:27:11,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:11,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:27:11,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret12 := main(); {6568#true} is VALID [2018-11-23 12:27:11,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6570#(= main_~i~1 0)} is VALID [2018-11-23 12:27:11,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {6570#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6570#(= main_~i~1 0)} is VALID [2018-11-23 12:27:11,456 INFO L273 TraceCheckUtils]: 7: Hoare triple {6570#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:11,457 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:11,458 INFO L273 TraceCheckUtils]: 9: Hoare triple {6571#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:11,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:11,459 INFO L273 TraceCheckUtils]: 11: Hoare triple {6572#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:11,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:11,461 INFO L273 TraceCheckUtils]: 13: Hoare triple {6573#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:11,462 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:11,462 INFO L273 TraceCheckUtils]: 15: Hoare triple {6574#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:11,463 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:11,464 INFO L273 TraceCheckUtils]: 17: Hoare triple {6575#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:11,465 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:11,465 INFO L273 TraceCheckUtils]: 19: Hoare triple {6576#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:11,466 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:11,467 INFO L273 TraceCheckUtils]: 21: Hoare triple {6577#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:11,468 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:11,469 INFO L273 TraceCheckUtils]: 23: Hoare triple {6578#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:11,469 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:11,470 INFO L273 TraceCheckUtils]: 25: Hoare triple {6579#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:11,471 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:11,472 INFO L273 TraceCheckUtils]: 27: Hoare triple {6580#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:11,472 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:11,473 INFO L273 TraceCheckUtils]: 29: Hoare triple {6581#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:11,474 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:11,475 INFO L273 TraceCheckUtils]: 31: Hoare triple {6582#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6583#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:11,475 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 1000); {6569#false} is VALID [2018-11-23 12:27:11,476 INFO L256 TraceCheckUtils]: 33: Hoare triple {6569#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:27:11,476 INFO L273 TraceCheckUtils]: 34: Hoare triple {6568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6568#true} is VALID [2018-11-23 12:27:11,476 INFO L273 TraceCheckUtils]: 35: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:11,477 INFO L273 TraceCheckUtils]: 36: Hoare triple {6568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6568#true} is VALID [2018-11-23 12:27:11,477 INFO L273 TraceCheckUtils]: 37: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:11,477 INFO L273 TraceCheckUtils]: 38: Hoare triple {6568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6568#true} is VALID [2018-11-23 12:27:11,477 INFO L273 TraceCheckUtils]: 39: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:11,478 INFO L273 TraceCheckUtils]: 40: Hoare triple {6568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6568#true} is VALID [2018-11-23 12:27:11,478 INFO L273 TraceCheckUtils]: 41: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:11,478 INFO L273 TraceCheckUtils]: 42: Hoare triple {6568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6568#true} is VALID [2018-11-23 12:27:11,478 INFO L273 TraceCheckUtils]: 43: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:11,479 INFO L273 TraceCheckUtils]: 44: Hoare triple {6568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6568#true} is VALID [2018-11-23 12:27:11,479 INFO L273 TraceCheckUtils]: 45: Hoare triple {6568#true} assume !(~i~0 < 1000); {6568#true} is VALID [2018-11-23 12:27:11,479 INFO L273 TraceCheckUtils]: 46: Hoare triple {6568#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:27:11,479 INFO L273 TraceCheckUtils]: 47: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:11,479 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6568#true} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:27:11,479 INFO L273 TraceCheckUtils]: 49: Hoare triple {6569#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:27:11,480 INFO L256 TraceCheckUtils]: 50: Hoare triple {6569#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:27:11,480 INFO L273 TraceCheckUtils]: 51: Hoare triple {6568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6568#true} is VALID [2018-11-23 12:27:11,480 INFO L273 TraceCheckUtils]: 52: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:11,480 INFO L273 TraceCheckUtils]: 53: Hoare triple {6568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6568#true} is VALID [2018-11-23 12:27:11,480 INFO L273 TraceCheckUtils]: 54: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:11,480 INFO L273 TraceCheckUtils]: 55: Hoare triple {6568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6568#true} is VALID [2018-11-23 12:27:11,481 INFO L273 TraceCheckUtils]: 56: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:11,481 INFO L273 TraceCheckUtils]: 57: Hoare triple {6568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6568#true} is VALID [2018-11-23 12:27:11,481 INFO L273 TraceCheckUtils]: 58: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:11,481 INFO L273 TraceCheckUtils]: 59: Hoare triple {6568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6568#true} is VALID [2018-11-23 12:27:11,481 INFO L273 TraceCheckUtils]: 60: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:11,481 INFO L273 TraceCheckUtils]: 61: Hoare triple {6568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6568#true} is VALID [2018-11-23 12:27:11,481 INFO L273 TraceCheckUtils]: 62: Hoare triple {6568#true} assume !(~i~0 < 1000); {6568#true} is VALID [2018-11-23 12:27:11,482 INFO L273 TraceCheckUtils]: 63: Hoare triple {6568#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:27:11,482 INFO L273 TraceCheckUtils]: 64: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:11,482 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6568#true} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:27:11,482 INFO L273 TraceCheckUtils]: 66: Hoare triple {6569#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {6569#false} is VALID [2018-11-23 12:27:11,482 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:11,482 INFO L273 TraceCheckUtils]: 68: Hoare triple {6569#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6569#false} is VALID [2018-11-23 12:27:11,483 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:11,483 INFO L273 TraceCheckUtils]: 70: Hoare triple {6569#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6569#false} is VALID [2018-11-23 12:27:11,483 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:11,483 INFO L273 TraceCheckUtils]: 72: Hoare triple {6569#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6569#false} is VALID [2018-11-23 12:27:11,483 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:11,483 INFO L273 TraceCheckUtils]: 74: Hoare triple {6569#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6569#false} is VALID [2018-11-23 12:27:11,483 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 999); {6569#false} is VALID [2018-11-23 12:27:11,484 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:27:11,484 INFO L256 TraceCheckUtils]: 77: Hoare triple {6569#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:27:11,484 INFO L273 TraceCheckUtils]: 78: Hoare triple {6568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6568#true} is VALID [2018-11-23 12:27:11,484 INFO L273 TraceCheckUtils]: 79: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:11,484 INFO L273 TraceCheckUtils]: 80: Hoare triple {6568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6568#true} is VALID [2018-11-23 12:27:11,484 INFO L273 TraceCheckUtils]: 81: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:11,485 INFO L273 TraceCheckUtils]: 82: Hoare triple {6568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6568#true} is VALID [2018-11-23 12:27:11,485 INFO L273 TraceCheckUtils]: 83: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:11,485 INFO L273 TraceCheckUtils]: 84: Hoare triple {6568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6568#true} is VALID [2018-11-23 12:27:11,485 INFO L273 TraceCheckUtils]: 85: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:11,485 INFO L273 TraceCheckUtils]: 86: Hoare triple {6568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6568#true} is VALID [2018-11-23 12:27:11,485 INFO L273 TraceCheckUtils]: 87: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:11,485 INFO L273 TraceCheckUtils]: 88: Hoare triple {6568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6568#true} is VALID [2018-11-23 12:27:11,486 INFO L273 TraceCheckUtils]: 89: Hoare triple {6568#true} assume !(~i~0 < 1000); {6568#true} is VALID [2018-11-23 12:27:11,486 INFO L273 TraceCheckUtils]: 90: Hoare triple {6568#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:27:11,486 INFO L273 TraceCheckUtils]: 91: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:11,486 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6568#true} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:27:11,486 INFO L273 TraceCheckUtils]: 93: Hoare triple {6569#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {6569#false} is VALID [2018-11-23 12:27:11,486 INFO L273 TraceCheckUtils]: 94: Hoare triple {6569#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6569#false} is VALID [2018-11-23 12:27:11,487 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:27:11,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:27:11,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:11,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:27:11,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:11,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:11,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:27:11,990 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:27:11,990 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:11,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:27:11,991 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret12 := main(); {6568#true} is VALID [2018-11-23 12:27:11,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6602#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:11,992 INFO L273 TraceCheckUtils]: 6: Hoare triple {6602#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6602#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:11,993 INFO L273 TraceCheckUtils]: 7: Hoare triple {6602#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:11,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:11,994 INFO L273 TraceCheckUtils]: 9: Hoare triple {6571#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:11,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:11,995 INFO L273 TraceCheckUtils]: 11: Hoare triple {6572#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:11,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:11,997 INFO L273 TraceCheckUtils]: 13: Hoare triple {6573#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:11,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:11,998 INFO L273 TraceCheckUtils]: 15: Hoare triple {6574#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:11,999 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:12,000 INFO L273 TraceCheckUtils]: 17: Hoare triple {6575#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:12,001 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:12,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {6576#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:12,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:12,003 INFO L273 TraceCheckUtils]: 21: Hoare triple {6577#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:12,004 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:12,004 INFO L273 TraceCheckUtils]: 23: Hoare triple {6578#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:12,005 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:12,006 INFO L273 TraceCheckUtils]: 25: Hoare triple {6579#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:12,007 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:12,007 INFO L273 TraceCheckUtils]: 27: Hoare triple {6580#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:12,008 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:12,009 INFO L273 TraceCheckUtils]: 29: Hoare triple {6581#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:12,010 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:12,010 INFO L273 TraceCheckUtils]: 31: Hoare triple {6582#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6583#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:12,011 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 1000); {6569#false} is VALID [2018-11-23 12:27:12,012 INFO L256 TraceCheckUtils]: 33: Hoare triple {6569#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:27:12,012 INFO L273 TraceCheckUtils]: 34: Hoare triple {6569#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6569#false} is VALID [2018-11-23 12:27:12,012 INFO L273 TraceCheckUtils]: 35: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:12,012 INFO L273 TraceCheckUtils]: 36: Hoare triple {6569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6569#false} is VALID [2018-11-23 12:27:12,013 INFO L273 TraceCheckUtils]: 37: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:12,013 INFO L273 TraceCheckUtils]: 38: Hoare triple {6569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6569#false} is VALID [2018-11-23 12:27:12,013 INFO L273 TraceCheckUtils]: 39: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:12,013 INFO L273 TraceCheckUtils]: 40: Hoare triple {6569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6569#false} is VALID [2018-11-23 12:27:12,014 INFO L273 TraceCheckUtils]: 41: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:12,014 INFO L273 TraceCheckUtils]: 42: Hoare triple {6569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6569#false} is VALID [2018-11-23 12:27:12,014 INFO L273 TraceCheckUtils]: 43: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:12,014 INFO L273 TraceCheckUtils]: 44: Hoare triple {6569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6569#false} is VALID [2018-11-23 12:27:12,015 INFO L273 TraceCheckUtils]: 45: Hoare triple {6569#false} assume !(~i~0 < 1000); {6569#false} is VALID [2018-11-23 12:27:12,015 INFO L273 TraceCheckUtils]: 46: Hoare triple {6569#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:27:12,015 INFO L273 TraceCheckUtils]: 47: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:27:12,015 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6569#false} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:27:12,016 INFO L273 TraceCheckUtils]: 49: Hoare triple {6569#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:27:12,016 INFO L256 TraceCheckUtils]: 50: Hoare triple {6569#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:27:12,016 INFO L273 TraceCheckUtils]: 51: Hoare triple {6569#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6569#false} is VALID [2018-11-23 12:27:12,017 INFO L273 TraceCheckUtils]: 52: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:12,017 INFO L273 TraceCheckUtils]: 53: Hoare triple {6569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6569#false} is VALID [2018-11-23 12:27:12,017 INFO L273 TraceCheckUtils]: 54: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:12,017 INFO L273 TraceCheckUtils]: 55: Hoare triple {6569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6569#false} is VALID [2018-11-23 12:27:12,017 INFO L273 TraceCheckUtils]: 56: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:12,017 INFO L273 TraceCheckUtils]: 57: Hoare triple {6569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6569#false} is VALID [2018-11-23 12:27:12,018 INFO L273 TraceCheckUtils]: 58: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:12,018 INFO L273 TraceCheckUtils]: 59: Hoare triple {6569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6569#false} is VALID [2018-11-23 12:27:12,018 INFO L273 TraceCheckUtils]: 60: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:12,018 INFO L273 TraceCheckUtils]: 61: Hoare triple {6569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6569#false} is VALID [2018-11-23 12:27:12,018 INFO L273 TraceCheckUtils]: 62: Hoare triple {6569#false} assume !(~i~0 < 1000); {6569#false} is VALID [2018-11-23 12:27:12,018 INFO L273 TraceCheckUtils]: 63: Hoare triple {6569#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:27:12,018 INFO L273 TraceCheckUtils]: 64: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:27:12,019 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6569#false} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:27:12,019 INFO L273 TraceCheckUtils]: 66: Hoare triple {6569#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {6569#false} is VALID [2018-11-23 12:27:12,019 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:12,019 INFO L273 TraceCheckUtils]: 68: Hoare triple {6569#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6569#false} is VALID [2018-11-23 12:27:12,019 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:12,019 INFO L273 TraceCheckUtils]: 70: Hoare triple {6569#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6569#false} is VALID [2018-11-23 12:27:12,020 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:12,020 INFO L273 TraceCheckUtils]: 72: Hoare triple {6569#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6569#false} is VALID [2018-11-23 12:27:12,020 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:12,020 INFO L273 TraceCheckUtils]: 74: Hoare triple {6569#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6569#false} is VALID [2018-11-23 12:27:12,020 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 999); {6569#false} is VALID [2018-11-23 12:27:12,020 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:27:12,020 INFO L256 TraceCheckUtils]: 77: Hoare triple {6569#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:27:12,021 INFO L273 TraceCheckUtils]: 78: Hoare triple {6569#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6569#false} is VALID [2018-11-23 12:27:12,021 INFO L273 TraceCheckUtils]: 79: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:12,021 INFO L273 TraceCheckUtils]: 80: Hoare triple {6569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6569#false} is VALID [2018-11-23 12:27:12,021 INFO L273 TraceCheckUtils]: 81: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:12,021 INFO L273 TraceCheckUtils]: 82: Hoare triple {6569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6569#false} is VALID [2018-11-23 12:27:12,021 INFO L273 TraceCheckUtils]: 83: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:12,022 INFO L273 TraceCheckUtils]: 84: Hoare triple {6569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6569#false} is VALID [2018-11-23 12:27:12,022 INFO L273 TraceCheckUtils]: 85: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:12,022 INFO L273 TraceCheckUtils]: 86: Hoare triple {6569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6569#false} is VALID [2018-11-23 12:27:12,022 INFO L273 TraceCheckUtils]: 87: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:12,022 INFO L273 TraceCheckUtils]: 88: Hoare triple {6569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6569#false} is VALID [2018-11-23 12:27:12,022 INFO L273 TraceCheckUtils]: 89: Hoare triple {6569#false} assume !(~i~0 < 1000); {6569#false} is VALID [2018-11-23 12:27:12,023 INFO L273 TraceCheckUtils]: 90: Hoare triple {6569#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:27:12,023 INFO L273 TraceCheckUtils]: 91: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:27:12,023 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6569#false} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:27:12,023 INFO L273 TraceCheckUtils]: 93: Hoare triple {6569#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {6569#false} is VALID [2018-11-23 12:27:12,023 INFO L273 TraceCheckUtils]: 94: Hoare triple {6569#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6569#false} is VALID [2018-11-23 12:27:12,023 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:27:12,032 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:27:12,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:12,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:27:12,052 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:27:12,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:12,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:27:12,165 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:27:12,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:27:12,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:27:12,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:12,166 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2018-11-23 12:27:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:12,821 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 12:27:12,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:27:12,822 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:27:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:27:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:27:12,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2018-11-23 12:27:13,309 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:27:13,312 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:27:13,312 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:27:13,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:27:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:27:13,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:13,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:27:13,344 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:27:13,344 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:27:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:13,347 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:27:13,347 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:27:13,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:13,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:13,349 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:27:13,349 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:27:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:13,351 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:27:13,351 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:27:13,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:13,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:13,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:13,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:27:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 12:27:13,353 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2018-11-23 12:27:13,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:13,353 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 12:27:13,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:27:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:27:13,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 12:27:13,355 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:13,355 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:27:13,355 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:13,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:13,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1350791579, now seen corresponding path program 14 times [2018-11-23 12:27:13,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:13,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:13,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:13,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:13,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:13,785 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:27:13,786 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:27:13,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:13,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:27:13,786 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret12 := main(); {7268#true} is VALID [2018-11-23 12:27:13,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7270#(= main_~i~1 0)} is VALID [2018-11-23 12:27:13,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {7270#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7270#(= main_~i~1 0)} is VALID [2018-11-23 12:27:13,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {7270#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:13,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:13,789 INFO L273 TraceCheckUtils]: 9: Hoare triple {7271#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:13,789 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:13,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {7272#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:13,790 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:13,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {7273#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:13,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:13,792 INFO L273 TraceCheckUtils]: 15: Hoare triple {7274#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:13,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:13,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {7275#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:13,794 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:13,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {7276#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:13,795 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:13,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {7277#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:13,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:13,797 INFO L273 TraceCheckUtils]: 23: Hoare triple {7278#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:13,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:13,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {7279#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:13,799 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:13,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {7280#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:13,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:13,801 INFO L273 TraceCheckUtils]: 29: Hoare triple {7281#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:13,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:13,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {7282#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:13,803 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:13,804 INFO L273 TraceCheckUtils]: 33: Hoare triple {7283#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7284#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:13,805 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 1000); {7269#false} is VALID [2018-11-23 12:27:13,805 INFO L256 TraceCheckUtils]: 35: Hoare triple {7269#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:27:13,805 INFO L273 TraceCheckUtils]: 36: Hoare triple {7268#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7268#true} is VALID [2018-11-23 12:27:13,805 INFO L273 TraceCheckUtils]: 37: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:13,805 INFO L273 TraceCheckUtils]: 38: Hoare triple {7268#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7268#true} is VALID [2018-11-23 12:27:13,806 INFO L273 TraceCheckUtils]: 39: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:13,806 INFO L273 TraceCheckUtils]: 40: Hoare triple {7268#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7268#true} is VALID [2018-11-23 12:27:13,806 INFO L273 TraceCheckUtils]: 41: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:13,806 INFO L273 TraceCheckUtils]: 42: Hoare triple {7268#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7268#true} is VALID [2018-11-23 12:27:13,807 INFO L273 TraceCheckUtils]: 43: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:13,807 INFO L273 TraceCheckUtils]: 44: Hoare triple {7268#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7268#true} is VALID [2018-11-23 12:27:13,807 INFO L273 TraceCheckUtils]: 45: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:13,807 INFO L273 TraceCheckUtils]: 46: Hoare triple {7268#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7268#true} is VALID [2018-11-23 12:27:13,807 INFO L273 TraceCheckUtils]: 47: Hoare triple {7268#true} assume !(~i~0 < 1000); {7268#true} is VALID [2018-11-23 12:27:13,808 INFO L273 TraceCheckUtils]: 48: Hoare triple {7268#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:27:13,808 INFO L273 TraceCheckUtils]: 49: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:13,808 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7268#true} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:27:13,808 INFO L273 TraceCheckUtils]: 51: Hoare triple {7269#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:27:13,808 INFO L256 TraceCheckUtils]: 52: Hoare triple {7269#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:27:13,809 INFO L273 TraceCheckUtils]: 53: Hoare triple {7268#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7268#true} is VALID [2018-11-23 12:27:13,809 INFO L273 TraceCheckUtils]: 54: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:13,809 INFO L273 TraceCheckUtils]: 55: Hoare triple {7268#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7268#true} is VALID [2018-11-23 12:27:13,809 INFO L273 TraceCheckUtils]: 56: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:13,809 INFO L273 TraceCheckUtils]: 57: Hoare triple {7268#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7268#true} is VALID [2018-11-23 12:27:13,810 INFO L273 TraceCheckUtils]: 58: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:13,810 INFO L273 TraceCheckUtils]: 59: Hoare triple {7268#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7268#true} is VALID [2018-11-23 12:27:13,810 INFO L273 TraceCheckUtils]: 60: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:13,810 INFO L273 TraceCheckUtils]: 61: Hoare triple {7268#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7268#true} is VALID [2018-11-23 12:27:13,810 INFO L273 TraceCheckUtils]: 62: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:13,810 INFO L273 TraceCheckUtils]: 63: Hoare triple {7268#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7268#true} is VALID [2018-11-23 12:27:13,811 INFO L273 TraceCheckUtils]: 64: Hoare triple {7268#true} assume !(~i~0 < 1000); {7268#true} is VALID [2018-11-23 12:27:13,811 INFO L273 TraceCheckUtils]: 65: Hoare triple {7268#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:27:13,811 INFO L273 TraceCheckUtils]: 66: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:13,811 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7268#true} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:27:13,811 INFO L273 TraceCheckUtils]: 68: Hoare triple {7269#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {7269#false} is VALID [2018-11-23 12:27:13,811 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:13,811 INFO L273 TraceCheckUtils]: 70: Hoare triple {7269#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7269#false} is VALID [2018-11-23 12:27:13,811 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:13,812 INFO L273 TraceCheckUtils]: 72: Hoare triple {7269#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7269#false} is VALID [2018-11-23 12:27:13,812 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:13,812 INFO L273 TraceCheckUtils]: 74: Hoare triple {7269#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7269#false} is VALID [2018-11-23 12:27:13,812 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:13,812 INFO L273 TraceCheckUtils]: 76: Hoare triple {7269#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7269#false} is VALID [2018-11-23 12:27:13,812 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 999); {7269#false} is VALID [2018-11-23 12:27:13,812 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:27:13,812 INFO L256 TraceCheckUtils]: 79: Hoare triple {7269#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:27:13,812 INFO L273 TraceCheckUtils]: 80: Hoare triple {7268#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7268#true} is VALID [2018-11-23 12:27:13,813 INFO L273 TraceCheckUtils]: 81: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:13,813 INFO L273 TraceCheckUtils]: 82: Hoare triple {7268#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7268#true} is VALID [2018-11-23 12:27:13,813 INFO L273 TraceCheckUtils]: 83: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:13,813 INFO L273 TraceCheckUtils]: 84: Hoare triple {7268#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7268#true} is VALID [2018-11-23 12:27:13,813 INFO L273 TraceCheckUtils]: 85: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:13,813 INFO L273 TraceCheckUtils]: 86: Hoare triple {7268#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7268#true} is VALID [2018-11-23 12:27:13,813 INFO L273 TraceCheckUtils]: 87: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:13,813 INFO L273 TraceCheckUtils]: 88: Hoare triple {7268#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7268#true} is VALID [2018-11-23 12:27:13,814 INFO L273 TraceCheckUtils]: 89: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:13,814 INFO L273 TraceCheckUtils]: 90: Hoare triple {7268#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7268#true} is VALID [2018-11-23 12:27:13,814 INFO L273 TraceCheckUtils]: 91: Hoare triple {7268#true} assume !(~i~0 < 1000); {7268#true} is VALID [2018-11-23 12:27:13,814 INFO L273 TraceCheckUtils]: 92: Hoare triple {7268#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:27:13,814 INFO L273 TraceCheckUtils]: 93: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:13,814 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7268#true} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:27:13,814 INFO L273 TraceCheckUtils]: 95: Hoare triple {7269#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {7269#false} is VALID [2018-11-23 12:27:13,814 INFO L273 TraceCheckUtils]: 96: Hoare triple {7269#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7269#false} is VALID [2018-11-23 12:27:13,814 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:27:13,819 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:27:13,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:13,819 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:27:13,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:13,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:13,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:13,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:14,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:27:14,106 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:27:14,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:14,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:27:14,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret12 := main(); {7268#true} is VALID [2018-11-23 12:27:14,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7303#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:14,108 INFO L273 TraceCheckUtils]: 6: Hoare triple {7303#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7303#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:14,108 INFO L273 TraceCheckUtils]: 7: Hoare triple {7303#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:14,109 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:14,109 INFO L273 TraceCheckUtils]: 9: Hoare triple {7271#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:14,109 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:14,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {7272#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:14,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:14,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {7273#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:14,112 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:14,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {7274#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:14,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:14,114 INFO L273 TraceCheckUtils]: 17: Hoare triple {7275#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:14,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:14,115 INFO L273 TraceCheckUtils]: 19: Hoare triple {7276#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:14,116 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:14,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {7277#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:14,117 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:14,118 INFO L273 TraceCheckUtils]: 23: Hoare triple {7278#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:14,118 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:14,119 INFO L273 TraceCheckUtils]: 25: Hoare triple {7279#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:14,119 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:14,120 INFO L273 TraceCheckUtils]: 27: Hoare triple {7280#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:14,121 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:14,122 INFO L273 TraceCheckUtils]: 29: Hoare triple {7281#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:14,122 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:14,123 INFO L273 TraceCheckUtils]: 31: Hoare triple {7282#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:14,123 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:14,124 INFO L273 TraceCheckUtils]: 33: Hoare triple {7283#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7284#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:14,125 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 1000); {7269#false} is VALID [2018-11-23 12:27:14,125 INFO L256 TraceCheckUtils]: 35: Hoare triple {7269#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:27:14,125 INFO L273 TraceCheckUtils]: 36: Hoare triple {7269#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7269#false} is VALID [2018-11-23 12:27:14,125 INFO L273 TraceCheckUtils]: 37: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:14,126 INFO L273 TraceCheckUtils]: 38: Hoare triple {7269#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7269#false} is VALID [2018-11-23 12:27:14,126 INFO L273 TraceCheckUtils]: 39: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:14,126 INFO L273 TraceCheckUtils]: 40: Hoare triple {7269#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7269#false} is VALID [2018-11-23 12:27:14,126 INFO L273 TraceCheckUtils]: 41: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:14,127 INFO L273 TraceCheckUtils]: 42: Hoare triple {7269#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7269#false} is VALID [2018-11-23 12:27:14,127 INFO L273 TraceCheckUtils]: 43: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:14,127 INFO L273 TraceCheckUtils]: 44: Hoare triple {7269#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7269#false} is VALID [2018-11-23 12:27:14,127 INFO L273 TraceCheckUtils]: 45: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:14,127 INFO L273 TraceCheckUtils]: 46: Hoare triple {7269#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7269#false} is VALID [2018-11-23 12:27:14,128 INFO L273 TraceCheckUtils]: 47: Hoare triple {7269#false} assume !(~i~0 < 1000); {7269#false} is VALID [2018-11-23 12:27:14,128 INFO L273 TraceCheckUtils]: 48: Hoare triple {7269#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:27:14,128 INFO L273 TraceCheckUtils]: 49: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:27:14,128 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7269#false} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:27:14,128 INFO L273 TraceCheckUtils]: 51: Hoare triple {7269#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:27:14,129 INFO L256 TraceCheckUtils]: 52: Hoare triple {7269#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:27:14,129 INFO L273 TraceCheckUtils]: 53: Hoare triple {7269#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7269#false} is VALID [2018-11-23 12:27:14,129 INFO L273 TraceCheckUtils]: 54: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:14,129 INFO L273 TraceCheckUtils]: 55: Hoare triple {7269#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7269#false} is VALID [2018-11-23 12:27:14,129 INFO L273 TraceCheckUtils]: 56: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:14,129 INFO L273 TraceCheckUtils]: 57: Hoare triple {7269#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7269#false} is VALID [2018-11-23 12:27:14,129 INFO L273 TraceCheckUtils]: 58: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:14,130 INFO L273 TraceCheckUtils]: 59: Hoare triple {7269#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7269#false} is VALID [2018-11-23 12:27:14,130 INFO L273 TraceCheckUtils]: 60: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:14,130 INFO L273 TraceCheckUtils]: 61: Hoare triple {7269#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7269#false} is VALID [2018-11-23 12:27:14,130 INFO L273 TraceCheckUtils]: 62: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:14,130 INFO L273 TraceCheckUtils]: 63: Hoare triple {7269#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7269#false} is VALID [2018-11-23 12:27:14,130 INFO L273 TraceCheckUtils]: 64: Hoare triple {7269#false} assume !(~i~0 < 1000); {7269#false} is VALID [2018-11-23 12:27:14,130 INFO L273 TraceCheckUtils]: 65: Hoare triple {7269#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:27:14,130 INFO L273 TraceCheckUtils]: 66: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:27:14,130 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7269#false} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:27:14,131 INFO L273 TraceCheckUtils]: 68: Hoare triple {7269#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {7269#false} is VALID [2018-11-23 12:27:14,131 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:14,131 INFO L273 TraceCheckUtils]: 70: Hoare triple {7269#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7269#false} is VALID [2018-11-23 12:27:14,131 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:14,131 INFO L273 TraceCheckUtils]: 72: Hoare triple {7269#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7269#false} is VALID [2018-11-23 12:27:14,131 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:14,131 INFO L273 TraceCheckUtils]: 74: Hoare triple {7269#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7269#false} is VALID [2018-11-23 12:27:14,131 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:14,132 INFO L273 TraceCheckUtils]: 76: Hoare triple {7269#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7269#false} is VALID [2018-11-23 12:27:14,132 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 999); {7269#false} is VALID [2018-11-23 12:27:14,132 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:27:14,132 INFO L256 TraceCheckUtils]: 79: Hoare triple {7269#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:27:14,132 INFO L273 TraceCheckUtils]: 80: Hoare triple {7269#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7269#false} is VALID [2018-11-23 12:27:14,132 INFO L273 TraceCheckUtils]: 81: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:14,132 INFO L273 TraceCheckUtils]: 82: Hoare triple {7269#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7269#false} is VALID [2018-11-23 12:27:14,132 INFO L273 TraceCheckUtils]: 83: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:14,132 INFO L273 TraceCheckUtils]: 84: Hoare triple {7269#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7269#false} is VALID [2018-11-23 12:27:14,133 INFO L273 TraceCheckUtils]: 85: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:14,133 INFO L273 TraceCheckUtils]: 86: Hoare triple {7269#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7269#false} is VALID [2018-11-23 12:27:14,133 INFO L273 TraceCheckUtils]: 87: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:14,133 INFO L273 TraceCheckUtils]: 88: Hoare triple {7269#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7269#false} is VALID [2018-11-23 12:27:14,133 INFO L273 TraceCheckUtils]: 89: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:14,133 INFO L273 TraceCheckUtils]: 90: Hoare triple {7269#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7269#false} is VALID [2018-11-23 12:27:14,133 INFO L273 TraceCheckUtils]: 91: Hoare triple {7269#false} assume !(~i~0 < 1000); {7269#false} is VALID [2018-11-23 12:27:14,133 INFO L273 TraceCheckUtils]: 92: Hoare triple {7269#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:27:14,134 INFO L273 TraceCheckUtils]: 93: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:27:14,134 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7269#false} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:27:14,134 INFO L273 TraceCheckUtils]: 95: Hoare triple {7269#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {7269#false} is VALID [2018-11-23 12:27:14,134 INFO L273 TraceCheckUtils]: 96: Hoare triple {7269#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7269#false} is VALID [2018-11-23 12:27:14,134 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:27:14,138 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:27:14,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:14,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:27:14,158 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:27:14,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:14,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:27:14,229 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:27:14,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:27:14,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:27:14,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:27:14,231 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2018-11-23 12:27:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:14,674 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 12:27:14,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:27:14,675 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:27:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:27:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:27:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:27:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:27:14,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2018-11-23 12:27:14,777 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:27:14,779 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:27:14,779 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:27:14,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:27:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:27:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 12:27:14,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:14,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 12:27:14,810 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 12:27:14,810 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 12:27:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:14,812 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:27:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:27:14,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:14,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:14,813 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 12:27:14,813 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 12:27:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:14,815 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:27:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:27:14,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:14,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:14,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:14,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:14,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:27:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 12:27:14,818 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2018-11-23 12:27:14,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:14,818 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 12:27:14,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:27:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 12:27:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:27:14,819 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:14,819 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:27:14,819 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:14,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:14,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1244541881, now seen corresponding path program 15 times [2018-11-23 12:27:14,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:14,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:14,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:14,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:14,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:15,206 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:27:15,206 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:27:15,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:15,207 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:27:15,207 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret12 := main(); {7985#true} is VALID [2018-11-23 12:27:15,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7987#(= main_~i~1 0)} is VALID [2018-11-23 12:27:15,207 INFO L273 TraceCheckUtils]: 6: Hoare triple {7987#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7987#(= main_~i~1 0)} is VALID [2018-11-23 12:27:15,208 INFO L273 TraceCheckUtils]: 7: Hoare triple {7987#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7988#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:15,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {7988#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7988#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:15,209 INFO L273 TraceCheckUtils]: 9: Hoare triple {7988#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7989#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:15,209 INFO L273 TraceCheckUtils]: 10: Hoare triple {7989#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7989#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:15,210 INFO L273 TraceCheckUtils]: 11: Hoare triple {7989#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7990#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:15,210 INFO L273 TraceCheckUtils]: 12: Hoare triple {7990#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7990#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:15,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {7990#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7991#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:15,212 INFO L273 TraceCheckUtils]: 14: Hoare triple {7991#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7991#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:15,212 INFO L273 TraceCheckUtils]: 15: Hoare triple {7991#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7992#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:15,213 INFO L273 TraceCheckUtils]: 16: Hoare triple {7992#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7992#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:15,214 INFO L273 TraceCheckUtils]: 17: Hoare triple {7992#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7993#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:15,214 INFO L273 TraceCheckUtils]: 18: Hoare triple {7993#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7993#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:15,215 INFO L273 TraceCheckUtils]: 19: Hoare triple {7993#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7994#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:15,216 INFO L273 TraceCheckUtils]: 20: Hoare triple {7994#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7994#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:15,216 INFO L273 TraceCheckUtils]: 21: Hoare triple {7994#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7995#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:15,217 INFO L273 TraceCheckUtils]: 22: Hoare triple {7995#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7995#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:15,218 INFO L273 TraceCheckUtils]: 23: Hoare triple {7995#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7996#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:15,218 INFO L273 TraceCheckUtils]: 24: Hoare triple {7996#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7996#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:15,219 INFO L273 TraceCheckUtils]: 25: Hoare triple {7996#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7997#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:15,220 INFO L273 TraceCheckUtils]: 26: Hoare triple {7997#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7997#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:15,220 INFO L273 TraceCheckUtils]: 27: Hoare triple {7997#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7998#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:15,221 INFO L273 TraceCheckUtils]: 28: Hoare triple {7998#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7998#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:15,222 INFO L273 TraceCheckUtils]: 29: Hoare triple {7998#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7999#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:15,222 INFO L273 TraceCheckUtils]: 30: Hoare triple {7999#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7999#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:15,223 INFO L273 TraceCheckUtils]: 31: Hoare triple {7999#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8000#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:15,223 INFO L273 TraceCheckUtils]: 32: Hoare triple {8000#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8000#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:15,224 INFO L273 TraceCheckUtils]: 33: Hoare triple {8000#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8001#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:15,225 INFO L273 TraceCheckUtils]: 34: Hoare triple {8001#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8001#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:15,225 INFO L273 TraceCheckUtils]: 35: Hoare triple {8001#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8002#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:15,226 INFO L273 TraceCheckUtils]: 36: Hoare triple {8002#(<= main_~i~1 15)} assume !(~i~1 < 1000); {7986#false} is VALID [2018-11-23 12:27:15,226 INFO L256 TraceCheckUtils]: 37: Hoare triple {7986#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:27:15,227 INFO L273 TraceCheckUtils]: 38: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7985#true} is VALID [2018-11-23 12:27:15,227 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,227 INFO L273 TraceCheckUtils]: 40: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,227 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,227 INFO L273 TraceCheckUtils]: 42: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,228 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,228 INFO L273 TraceCheckUtils]: 44: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,228 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,228 INFO L273 TraceCheckUtils]: 46: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,228 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,229 INFO L273 TraceCheckUtils]: 48: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,229 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 1000); {7985#true} is VALID [2018-11-23 12:27:15,229 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:15,229 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:15,229 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7986#false} #70#return; {7986#false} is VALID [2018-11-23 12:27:15,229 INFO L273 TraceCheckUtils]: 53: Hoare triple {7986#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:27:15,229 INFO L256 TraceCheckUtils]: 54: Hoare triple {7986#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:27:15,230 INFO L273 TraceCheckUtils]: 55: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7985#true} is VALID [2018-11-23 12:27:15,230 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,230 INFO L273 TraceCheckUtils]: 57: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,230 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,230 INFO L273 TraceCheckUtils]: 59: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,230 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,230 INFO L273 TraceCheckUtils]: 61: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,230 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,231 INFO L273 TraceCheckUtils]: 63: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,231 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,231 INFO L273 TraceCheckUtils]: 65: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,231 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 1000); {7985#true} is VALID [2018-11-23 12:27:15,231 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:15,231 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:15,231 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7986#false} #72#return; {7986#false} is VALID [2018-11-23 12:27:15,231 INFO L273 TraceCheckUtils]: 70: Hoare triple {7986#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {7986#false} is VALID [2018-11-23 12:27:15,232 INFO L273 TraceCheckUtils]: 71: Hoare triple {7986#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7986#false} is VALID [2018-11-23 12:27:15,232 INFO L273 TraceCheckUtils]: 72: Hoare triple {7986#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7986#false} is VALID [2018-11-23 12:27:15,232 INFO L273 TraceCheckUtils]: 73: Hoare triple {7986#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7986#false} is VALID [2018-11-23 12:27:15,232 INFO L273 TraceCheckUtils]: 74: Hoare triple {7986#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7986#false} is VALID [2018-11-23 12:27:15,232 INFO L273 TraceCheckUtils]: 75: Hoare triple {7986#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7986#false} is VALID [2018-11-23 12:27:15,232 INFO L273 TraceCheckUtils]: 76: Hoare triple {7986#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7986#false} is VALID [2018-11-23 12:27:15,232 INFO L273 TraceCheckUtils]: 77: Hoare triple {7986#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7986#false} is VALID [2018-11-23 12:27:15,232 INFO L273 TraceCheckUtils]: 78: Hoare triple {7986#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7986#false} is VALID [2018-11-23 12:27:15,232 INFO L273 TraceCheckUtils]: 79: Hoare triple {7986#false} assume !(~i~2 < 999); {7986#false} is VALID [2018-11-23 12:27:15,233 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:27:15,233 INFO L256 TraceCheckUtils]: 81: Hoare triple {7986#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:27:15,233 INFO L273 TraceCheckUtils]: 82: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7985#true} is VALID [2018-11-23 12:27:15,233 INFO L273 TraceCheckUtils]: 83: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,233 INFO L273 TraceCheckUtils]: 84: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,233 INFO L273 TraceCheckUtils]: 85: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,233 INFO L273 TraceCheckUtils]: 86: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,233 INFO L273 TraceCheckUtils]: 87: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,234 INFO L273 TraceCheckUtils]: 88: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,234 INFO L273 TraceCheckUtils]: 89: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,234 INFO L273 TraceCheckUtils]: 90: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,234 INFO L273 TraceCheckUtils]: 91: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,234 INFO L273 TraceCheckUtils]: 92: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,234 INFO L273 TraceCheckUtils]: 93: Hoare triple {7985#true} assume !(~i~0 < 1000); {7985#true} is VALID [2018-11-23 12:27:15,234 INFO L273 TraceCheckUtils]: 94: Hoare triple {7985#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:15,234 INFO L273 TraceCheckUtils]: 95: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:15,234 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7985#true} {7986#false} #74#return; {7986#false} is VALID [2018-11-23 12:27:15,235 INFO L273 TraceCheckUtils]: 97: Hoare triple {7986#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {7986#false} is VALID [2018-11-23 12:27:15,235 INFO L273 TraceCheckUtils]: 98: Hoare triple {7986#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7986#false} is VALID [2018-11-23 12:27:15,235 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:27:15,239 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:27:15,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:15,240 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:27:15,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:15,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:27:15,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:15,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:15,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:27:15,490 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:27:15,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:15,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:27:15,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret12 := main(); {7985#true} is VALID [2018-11-23 12:27:15,491 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7985#true} is VALID [2018-11-23 12:27:15,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:15,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {7985#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7985#true} is VALID [2018-11-23 12:27:15,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:15,492 INFO L273 TraceCheckUtils]: 9: Hoare triple {7985#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7985#true} is VALID [2018-11-23 12:27:15,492 INFO L273 TraceCheckUtils]: 10: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:15,492 INFO L273 TraceCheckUtils]: 11: Hoare triple {7985#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7985#true} is VALID [2018-11-23 12:27:15,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:15,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {7985#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7985#true} is VALID [2018-11-23 12:27:15,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:15,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {7985#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7985#true} is VALID [2018-11-23 12:27:15,493 INFO L273 TraceCheckUtils]: 16: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:15,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {7985#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7985#true} is VALID [2018-11-23 12:27:15,493 INFO L273 TraceCheckUtils]: 18: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:15,493 INFO L273 TraceCheckUtils]: 19: Hoare triple {7985#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7985#true} is VALID [2018-11-23 12:27:15,493 INFO L273 TraceCheckUtils]: 20: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:15,494 INFO L273 TraceCheckUtils]: 21: Hoare triple {7985#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7985#true} is VALID [2018-11-23 12:27:15,494 INFO L273 TraceCheckUtils]: 22: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:15,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {7985#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7985#true} is VALID [2018-11-23 12:27:15,494 INFO L273 TraceCheckUtils]: 24: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:15,494 INFO L273 TraceCheckUtils]: 25: Hoare triple {7985#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7985#true} is VALID [2018-11-23 12:27:15,494 INFO L273 TraceCheckUtils]: 26: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:15,494 INFO L273 TraceCheckUtils]: 27: Hoare triple {7985#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7985#true} is VALID [2018-11-23 12:27:15,494 INFO L273 TraceCheckUtils]: 28: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:15,494 INFO L273 TraceCheckUtils]: 29: Hoare triple {7985#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7985#true} is VALID [2018-11-23 12:27:15,495 INFO L273 TraceCheckUtils]: 30: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:15,495 INFO L273 TraceCheckUtils]: 31: Hoare triple {7985#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7985#true} is VALID [2018-11-23 12:27:15,495 INFO L273 TraceCheckUtils]: 32: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:15,495 INFO L273 TraceCheckUtils]: 33: Hoare triple {7985#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7985#true} is VALID [2018-11-23 12:27:15,495 INFO L273 TraceCheckUtils]: 34: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:15,495 INFO L273 TraceCheckUtils]: 35: Hoare triple {7985#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7985#true} is VALID [2018-11-23 12:27:15,495 INFO L273 TraceCheckUtils]: 36: Hoare triple {7985#true} assume !(~i~1 < 1000); {7985#true} is VALID [2018-11-23 12:27:15,495 INFO L256 TraceCheckUtils]: 37: Hoare triple {7985#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:27:15,496 INFO L273 TraceCheckUtils]: 38: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7985#true} is VALID [2018-11-23 12:27:15,496 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,496 INFO L273 TraceCheckUtils]: 40: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,496 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,496 INFO L273 TraceCheckUtils]: 42: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,496 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,496 INFO L273 TraceCheckUtils]: 44: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,496 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,496 INFO L273 TraceCheckUtils]: 46: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,497 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,497 INFO L273 TraceCheckUtils]: 48: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,497 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 1000); {7985#true} is VALID [2018-11-23 12:27:15,497 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:15,497 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:15,497 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7985#true} #70#return; {7985#true} is VALID [2018-11-23 12:27:15,497 INFO L273 TraceCheckUtils]: 53: Hoare triple {7985#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:27:15,497 INFO L256 TraceCheckUtils]: 54: Hoare triple {7985#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:27:15,498 INFO L273 TraceCheckUtils]: 55: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7985#true} is VALID [2018-11-23 12:27:15,498 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,498 INFO L273 TraceCheckUtils]: 57: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,498 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,498 INFO L273 TraceCheckUtils]: 59: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,498 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,498 INFO L273 TraceCheckUtils]: 61: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,498 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,499 INFO L273 TraceCheckUtils]: 63: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,499 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:15,499 INFO L273 TraceCheckUtils]: 65: Hoare triple {7985#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7985#true} is VALID [2018-11-23 12:27:15,499 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 1000); {7985#true} is VALID [2018-11-23 12:27:15,499 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:15,499 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:15,499 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7985#true} #72#return; {7985#true} is VALID [2018-11-23 12:27:15,499 INFO L273 TraceCheckUtils]: 70: Hoare triple {7985#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {7985#true} is VALID [2018-11-23 12:27:15,499 INFO L273 TraceCheckUtils]: 71: Hoare triple {7985#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7985#true} is VALID [2018-11-23 12:27:15,500 INFO L273 TraceCheckUtils]: 72: Hoare triple {7985#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7985#true} is VALID [2018-11-23 12:27:15,500 INFO L273 TraceCheckUtils]: 73: Hoare triple {7985#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7985#true} is VALID [2018-11-23 12:27:15,500 INFO L273 TraceCheckUtils]: 74: Hoare triple {7985#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7985#true} is VALID [2018-11-23 12:27:15,500 INFO L273 TraceCheckUtils]: 75: Hoare triple {7985#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7985#true} is VALID [2018-11-23 12:27:15,500 INFO L273 TraceCheckUtils]: 76: Hoare triple {7985#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7985#true} is VALID [2018-11-23 12:27:15,500 INFO L273 TraceCheckUtils]: 77: Hoare triple {7985#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7985#true} is VALID [2018-11-23 12:27:15,500 INFO L273 TraceCheckUtils]: 78: Hoare triple {7985#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7985#true} is VALID [2018-11-23 12:27:15,500 INFO L273 TraceCheckUtils]: 79: Hoare triple {7985#true} assume !(~i~2 < 999); {7985#true} is VALID [2018-11-23 12:27:15,501 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:27:15,501 INFO L256 TraceCheckUtils]: 81: Hoare triple {7985#true} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:27:15,501 INFO L273 TraceCheckUtils]: 82: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8252#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:27:15,502 INFO L273 TraceCheckUtils]: 83: Hoare triple {8252#(<= mapavg_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8252#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:27:15,502 INFO L273 TraceCheckUtils]: 84: Hoare triple {8252#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8259#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:27:15,502 INFO L273 TraceCheckUtils]: 85: Hoare triple {8259#(<= mapavg_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8259#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:27:15,503 INFO L273 TraceCheckUtils]: 86: Hoare triple {8259#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8266#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:27:15,503 INFO L273 TraceCheckUtils]: 87: Hoare triple {8266#(<= mapavg_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8266#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:27:15,504 INFO L273 TraceCheckUtils]: 88: Hoare triple {8266#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8273#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:27:15,504 INFO L273 TraceCheckUtils]: 89: Hoare triple {8273#(<= mapavg_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8273#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:27:15,504 INFO L273 TraceCheckUtils]: 90: Hoare triple {8273#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8280#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:27:15,505 INFO L273 TraceCheckUtils]: 91: Hoare triple {8280#(<= mapavg_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8280#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:27:15,506 INFO L273 TraceCheckUtils]: 92: Hoare triple {8280#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8287#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:27:15,506 INFO L273 TraceCheckUtils]: 93: Hoare triple {8287#(<= mapavg_~i~0 5)} assume !(~i~0 < 1000); {7986#false} is VALID [2018-11-23 12:27:15,507 INFO L273 TraceCheckUtils]: 94: Hoare triple {7986#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {7986#false} is VALID [2018-11-23 12:27:15,507 INFO L273 TraceCheckUtils]: 95: Hoare triple {7986#false} assume true; {7986#false} is VALID [2018-11-23 12:27:15,507 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7986#false} {7985#true} #74#return; {7986#false} is VALID [2018-11-23 12:27:15,507 INFO L273 TraceCheckUtils]: 97: Hoare triple {7986#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {7986#false} is VALID [2018-11-23 12:27:15,508 INFO L273 TraceCheckUtils]: 98: Hoare triple {7986#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7986#false} is VALID [2018-11-23 12:27:15,508 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:27:15,512 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:27:15,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:15,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2018-11-23 12:27:15,533 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:27:15,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:15,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:27:15,659 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:27:15,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:27:15,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:27:15,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:15,660 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2018-11-23 12:27:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:16,035 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-23 12:27:16,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:27:16,036 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:27:16,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:16,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:27:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:27:16,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 100 transitions. [2018-11-23 12:27:16,151 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:27:16,154 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:27:16,154 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:27:16,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:27:16,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:27:16,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:16,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 12:27:16,181 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 12:27:16,181 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 12:27:16,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:16,183 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:27:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:27:16,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:16,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:16,183 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 12:27:16,183 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 12:27:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:16,185 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:27:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:27:16,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:16,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:16,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:16,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:27:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 12:27:16,188 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2018-11-23 12:27:16,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:16,188 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 12:27:16,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:27:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 12:27:16,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:27:16,189 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:16,189 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:27:16,189 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:16,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:16,190 INFO L82 PathProgramCache]: Analyzing trace with hash -261735289, now seen corresponding path program 16 times [2018-11-23 12:27:16,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:16,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:16,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:16,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:16,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:16,617 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:27:16,617 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:27:16,618 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:16,618 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:27:16,618 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret12 := main(); {8737#true} is VALID [2018-11-23 12:27:16,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8739#(= main_~i~1 0)} is VALID [2018-11-23 12:27:16,618 INFO L273 TraceCheckUtils]: 6: Hoare triple {8739#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8739#(= main_~i~1 0)} is VALID [2018-11-23 12:27:16,619 INFO L273 TraceCheckUtils]: 7: Hoare triple {8739#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:16,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:16,620 INFO L273 TraceCheckUtils]: 9: Hoare triple {8740#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:16,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:16,621 INFO L273 TraceCheckUtils]: 11: Hoare triple {8741#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:16,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:16,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {8742#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:16,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:16,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {8743#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:16,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:16,624 INFO L273 TraceCheckUtils]: 17: Hoare triple {8744#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:16,625 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:16,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {8745#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:16,626 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:16,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {8746#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:16,628 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:16,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {8747#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:16,629 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:16,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {8748#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:16,630 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:16,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {8749#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:16,631 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:16,632 INFO L273 TraceCheckUtils]: 29: Hoare triple {8750#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:16,633 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:16,633 INFO L273 TraceCheckUtils]: 31: Hoare triple {8751#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:16,634 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:16,635 INFO L273 TraceCheckUtils]: 33: Hoare triple {8752#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:16,635 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:16,636 INFO L273 TraceCheckUtils]: 35: Hoare triple {8753#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:16,637 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:16,637 INFO L273 TraceCheckUtils]: 37: Hoare triple {8754#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8755#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:16,638 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 1000); {8738#false} is VALID [2018-11-23 12:27:16,638 INFO L256 TraceCheckUtils]: 39: Hoare triple {8738#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:27:16,638 INFO L273 TraceCheckUtils]: 40: Hoare triple {8737#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8737#true} is VALID [2018-11-23 12:27:16,639 INFO L273 TraceCheckUtils]: 41: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,639 INFO L273 TraceCheckUtils]: 42: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,639 INFO L273 TraceCheckUtils]: 43: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,639 INFO L273 TraceCheckUtils]: 44: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,639 INFO L273 TraceCheckUtils]: 45: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,640 INFO L273 TraceCheckUtils]: 46: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,640 INFO L273 TraceCheckUtils]: 47: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,640 INFO L273 TraceCheckUtils]: 48: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,640 INFO L273 TraceCheckUtils]: 49: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,640 INFO L273 TraceCheckUtils]: 50: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,641 INFO L273 TraceCheckUtils]: 51: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,641 INFO L273 TraceCheckUtils]: 52: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,641 INFO L273 TraceCheckUtils]: 53: Hoare triple {8737#true} assume !(~i~0 < 1000); {8737#true} is VALID [2018-11-23 12:27:16,641 INFO L273 TraceCheckUtils]: 54: Hoare triple {8737#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:27:16,641 INFO L273 TraceCheckUtils]: 55: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:16,641 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8737#true} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:27:16,641 INFO L273 TraceCheckUtils]: 57: Hoare triple {8738#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:27:16,642 INFO L256 TraceCheckUtils]: 58: Hoare triple {8738#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:27:16,642 INFO L273 TraceCheckUtils]: 59: Hoare triple {8737#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8737#true} is VALID [2018-11-23 12:27:16,642 INFO L273 TraceCheckUtils]: 60: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,642 INFO L273 TraceCheckUtils]: 61: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,642 INFO L273 TraceCheckUtils]: 62: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,642 INFO L273 TraceCheckUtils]: 63: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,642 INFO L273 TraceCheckUtils]: 64: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,642 INFO L273 TraceCheckUtils]: 65: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,642 INFO L273 TraceCheckUtils]: 66: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,643 INFO L273 TraceCheckUtils]: 67: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,643 INFO L273 TraceCheckUtils]: 68: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,643 INFO L273 TraceCheckUtils]: 69: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,643 INFO L273 TraceCheckUtils]: 70: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,643 INFO L273 TraceCheckUtils]: 71: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,643 INFO L273 TraceCheckUtils]: 72: Hoare triple {8737#true} assume !(~i~0 < 1000); {8737#true} is VALID [2018-11-23 12:27:16,643 INFO L273 TraceCheckUtils]: 73: Hoare triple {8737#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:27:16,643 INFO L273 TraceCheckUtils]: 74: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:16,644 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8737#true} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:27:16,644 INFO L273 TraceCheckUtils]: 76: Hoare triple {8738#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {8738#false} is VALID [2018-11-23 12:27:16,644 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:16,644 INFO L273 TraceCheckUtils]: 78: Hoare triple {8738#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8738#false} is VALID [2018-11-23 12:27:16,644 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:16,644 INFO L273 TraceCheckUtils]: 80: Hoare triple {8738#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8738#false} is VALID [2018-11-23 12:27:16,644 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:16,644 INFO L273 TraceCheckUtils]: 82: Hoare triple {8738#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8738#false} is VALID [2018-11-23 12:27:16,645 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:16,645 INFO L273 TraceCheckUtils]: 84: Hoare triple {8738#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8738#false} is VALID [2018-11-23 12:27:16,645 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 999); {8738#false} is VALID [2018-11-23 12:27:16,645 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:27:16,645 INFO L256 TraceCheckUtils]: 87: Hoare triple {8738#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:27:16,645 INFO L273 TraceCheckUtils]: 88: Hoare triple {8737#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8737#true} is VALID [2018-11-23 12:27:16,645 INFO L273 TraceCheckUtils]: 89: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,645 INFO L273 TraceCheckUtils]: 90: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,645 INFO L273 TraceCheckUtils]: 91: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,646 INFO L273 TraceCheckUtils]: 92: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,646 INFO L273 TraceCheckUtils]: 93: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,646 INFO L273 TraceCheckUtils]: 94: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,646 INFO L273 TraceCheckUtils]: 95: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,646 INFO L273 TraceCheckUtils]: 96: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,646 INFO L273 TraceCheckUtils]: 97: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,646 INFO L273 TraceCheckUtils]: 98: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,646 INFO L273 TraceCheckUtils]: 99: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:16,646 INFO L273 TraceCheckUtils]: 100: Hoare triple {8737#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8737#true} is VALID [2018-11-23 12:27:16,647 INFO L273 TraceCheckUtils]: 101: Hoare triple {8737#true} assume !(~i~0 < 1000); {8737#true} is VALID [2018-11-23 12:27:16,647 INFO L273 TraceCheckUtils]: 102: Hoare triple {8737#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:27:16,647 INFO L273 TraceCheckUtils]: 103: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:16,647 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8737#true} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:27:16,647 INFO L273 TraceCheckUtils]: 105: Hoare triple {8738#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {8738#false} is VALID [2018-11-23 12:27:16,647 INFO L273 TraceCheckUtils]: 106: Hoare triple {8738#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8738#false} is VALID [2018-11-23 12:27:16,647 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:27:16,653 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:27:16,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:16,653 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:27:16,662 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:16,715 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:16,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:16,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:17,008 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:27:17,009 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:27:17,009 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:17,009 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:27:17,009 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret12 := main(); {8737#true} is VALID [2018-11-23 12:27:17,010 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8774#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:17,011 INFO L273 TraceCheckUtils]: 6: Hoare triple {8774#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8774#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:17,011 INFO L273 TraceCheckUtils]: 7: Hoare triple {8774#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:17,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:17,012 INFO L273 TraceCheckUtils]: 9: Hoare triple {8740#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:17,012 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:17,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {8741#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:17,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:17,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {8742#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:17,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:17,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {8743#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:17,016 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:17,017 INFO L273 TraceCheckUtils]: 17: Hoare triple {8744#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:17,017 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:17,018 INFO L273 TraceCheckUtils]: 19: Hoare triple {8745#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:17,018 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:17,019 INFO L273 TraceCheckUtils]: 21: Hoare triple {8746#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:17,020 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:17,020 INFO L273 TraceCheckUtils]: 23: Hoare triple {8747#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:17,021 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:17,022 INFO L273 TraceCheckUtils]: 25: Hoare triple {8748#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:17,022 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:17,023 INFO L273 TraceCheckUtils]: 27: Hoare triple {8749#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:17,024 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:17,024 INFO L273 TraceCheckUtils]: 29: Hoare triple {8750#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:17,025 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:17,026 INFO L273 TraceCheckUtils]: 31: Hoare triple {8751#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:17,026 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:17,027 INFO L273 TraceCheckUtils]: 33: Hoare triple {8752#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:17,027 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:17,028 INFO L273 TraceCheckUtils]: 35: Hoare triple {8753#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:17,029 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:17,030 INFO L273 TraceCheckUtils]: 37: Hoare triple {8754#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8755#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:17,030 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 1000); {8738#false} is VALID [2018-11-23 12:27:17,030 INFO L256 TraceCheckUtils]: 39: Hoare triple {8738#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:27:17,031 INFO L273 TraceCheckUtils]: 40: Hoare triple {8738#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8738#false} is VALID [2018-11-23 12:27:17,031 INFO L273 TraceCheckUtils]: 41: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,031 INFO L273 TraceCheckUtils]: 42: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,031 INFO L273 TraceCheckUtils]: 43: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,031 INFO L273 TraceCheckUtils]: 44: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,032 INFO L273 TraceCheckUtils]: 45: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,032 INFO L273 TraceCheckUtils]: 46: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,032 INFO L273 TraceCheckUtils]: 47: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,032 INFO L273 TraceCheckUtils]: 48: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,032 INFO L273 TraceCheckUtils]: 49: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,033 INFO L273 TraceCheckUtils]: 50: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,033 INFO L273 TraceCheckUtils]: 51: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,033 INFO L273 TraceCheckUtils]: 52: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,033 INFO L273 TraceCheckUtils]: 53: Hoare triple {8738#false} assume !(~i~0 < 1000); {8738#false} is VALID [2018-11-23 12:27:17,033 INFO L273 TraceCheckUtils]: 54: Hoare triple {8738#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:27:17,033 INFO L273 TraceCheckUtils]: 55: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:27:17,033 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8738#false} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:27:17,033 INFO L273 TraceCheckUtils]: 57: Hoare triple {8738#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:27:17,033 INFO L256 TraceCheckUtils]: 58: Hoare triple {8738#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:27:17,034 INFO L273 TraceCheckUtils]: 59: Hoare triple {8738#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8738#false} is VALID [2018-11-23 12:27:17,034 INFO L273 TraceCheckUtils]: 60: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,034 INFO L273 TraceCheckUtils]: 61: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,034 INFO L273 TraceCheckUtils]: 62: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,034 INFO L273 TraceCheckUtils]: 63: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,034 INFO L273 TraceCheckUtils]: 64: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,034 INFO L273 TraceCheckUtils]: 65: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,034 INFO L273 TraceCheckUtils]: 66: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,035 INFO L273 TraceCheckUtils]: 67: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,035 INFO L273 TraceCheckUtils]: 68: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,035 INFO L273 TraceCheckUtils]: 69: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,035 INFO L273 TraceCheckUtils]: 70: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,035 INFO L273 TraceCheckUtils]: 71: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,035 INFO L273 TraceCheckUtils]: 72: Hoare triple {8738#false} assume !(~i~0 < 1000); {8738#false} is VALID [2018-11-23 12:27:17,035 INFO L273 TraceCheckUtils]: 73: Hoare triple {8738#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:27:17,035 INFO L273 TraceCheckUtils]: 74: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:27:17,035 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8738#false} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:27:17,036 INFO L273 TraceCheckUtils]: 76: Hoare triple {8738#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {8738#false} is VALID [2018-11-23 12:27:17,036 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:17,036 INFO L273 TraceCheckUtils]: 78: Hoare triple {8738#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8738#false} is VALID [2018-11-23 12:27:17,036 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:17,036 INFO L273 TraceCheckUtils]: 80: Hoare triple {8738#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8738#false} is VALID [2018-11-23 12:27:17,036 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:17,036 INFO L273 TraceCheckUtils]: 82: Hoare triple {8738#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8738#false} is VALID [2018-11-23 12:27:17,036 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:17,037 INFO L273 TraceCheckUtils]: 84: Hoare triple {8738#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8738#false} is VALID [2018-11-23 12:27:17,037 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 999); {8738#false} is VALID [2018-11-23 12:27:17,037 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:27:17,037 INFO L256 TraceCheckUtils]: 87: Hoare triple {8738#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:27:17,037 INFO L273 TraceCheckUtils]: 88: Hoare triple {8738#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8738#false} is VALID [2018-11-23 12:27:17,037 INFO L273 TraceCheckUtils]: 89: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,037 INFO L273 TraceCheckUtils]: 90: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,037 INFO L273 TraceCheckUtils]: 91: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,038 INFO L273 TraceCheckUtils]: 92: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,038 INFO L273 TraceCheckUtils]: 93: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,038 INFO L273 TraceCheckUtils]: 94: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,038 INFO L273 TraceCheckUtils]: 95: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,038 INFO L273 TraceCheckUtils]: 96: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,038 INFO L273 TraceCheckUtils]: 97: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,038 INFO L273 TraceCheckUtils]: 98: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,038 INFO L273 TraceCheckUtils]: 99: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:17,038 INFO L273 TraceCheckUtils]: 100: Hoare triple {8738#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8738#false} is VALID [2018-11-23 12:27:17,039 INFO L273 TraceCheckUtils]: 101: Hoare triple {8738#false} assume !(~i~0 < 1000); {8738#false} is VALID [2018-11-23 12:27:17,039 INFO L273 TraceCheckUtils]: 102: Hoare triple {8738#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:27:17,039 INFO L273 TraceCheckUtils]: 103: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:27:17,039 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8738#false} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:27:17,039 INFO L273 TraceCheckUtils]: 105: Hoare triple {8738#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {8738#false} is VALID [2018-11-23 12:27:17,039 INFO L273 TraceCheckUtils]: 106: Hoare triple {8738#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8738#false} is VALID [2018-11-23 12:27:17,039 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:27:17,045 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:27:17,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:17,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:27:17,066 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:27:17,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:17,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:27:17,142 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:27:17,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:27:17,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:27:17,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:27:17,143 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2018-11-23 12:27:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:17,827 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-23 12:27:17,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:17,827 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:27:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:27:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:27:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:27:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:27:17,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 86 transitions. [2018-11-23 12:27:17,979 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:27:17,981 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:27:17,981 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:27:17,982 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:27:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:27:18,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 12:27:18,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:18,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 12:27:18,038 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 12:27:18,038 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 12:27:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:18,040 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:27:18,041 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:27:18,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:18,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:18,041 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 12:27:18,041 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 12:27:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:18,043 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:27:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:27:18,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:18,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:18,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:18,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:27:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 12:27:18,045 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2018-11-23 12:27:18,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:18,046 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 12:27:18,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:27:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:27:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 12:27:18,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:18,047 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:27:18,047 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:18,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:18,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1057421335, now seen corresponding path program 17 times [2018-11-23 12:27:18,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:18,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:18,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:18,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:18,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:18,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:27:18,532 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:27:18,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:18,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:27:18,532 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret12 := main(); {9519#true} is VALID [2018-11-23 12:27:18,533 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9521#(= main_~i~1 0)} is VALID [2018-11-23 12:27:18,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {9521#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9521#(= main_~i~1 0)} is VALID [2018-11-23 12:27:18,534 INFO L273 TraceCheckUtils]: 7: Hoare triple {9521#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9522#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:18,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {9522#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9522#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:18,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {9522#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9523#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:18,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {9523#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9523#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:18,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {9523#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9524#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:18,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {9524#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9524#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:18,538 INFO L273 TraceCheckUtils]: 13: Hoare triple {9524#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9525#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:18,539 INFO L273 TraceCheckUtils]: 14: Hoare triple {9525#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9525#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:18,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {9525#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9526#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:18,540 INFO L273 TraceCheckUtils]: 16: Hoare triple {9526#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9526#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:18,541 INFO L273 TraceCheckUtils]: 17: Hoare triple {9526#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9527#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:18,541 INFO L273 TraceCheckUtils]: 18: Hoare triple {9527#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9527#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:18,542 INFO L273 TraceCheckUtils]: 19: Hoare triple {9527#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9528#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:18,543 INFO L273 TraceCheckUtils]: 20: Hoare triple {9528#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9528#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:18,543 INFO L273 TraceCheckUtils]: 21: Hoare triple {9528#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9529#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:18,544 INFO L273 TraceCheckUtils]: 22: Hoare triple {9529#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9529#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:18,545 INFO L273 TraceCheckUtils]: 23: Hoare triple {9529#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9530#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:18,545 INFO L273 TraceCheckUtils]: 24: Hoare triple {9530#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9530#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:18,546 INFO L273 TraceCheckUtils]: 25: Hoare triple {9530#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9531#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:18,547 INFO L273 TraceCheckUtils]: 26: Hoare triple {9531#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9531#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:18,547 INFO L273 TraceCheckUtils]: 27: Hoare triple {9531#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9532#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:18,551 INFO L273 TraceCheckUtils]: 28: Hoare triple {9532#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9532#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:18,551 INFO L273 TraceCheckUtils]: 29: Hoare triple {9532#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9533#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:18,552 INFO L273 TraceCheckUtils]: 30: Hoare triple {9533#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9533#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:18,552 INFO L273 TraceCheckUtils]: 31: Hoare triple {9533#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9534#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:18,553 INFO L273 TraceCheckUtils]: 32: Hoare triple {9534#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9534#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:18,553 INFO L273 TraceCheckUtils]: 33: Hoare triple {9534#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9535#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:18,553 INFO L273 TraceCheckUtils]: 34: Hoare triple {9535#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9535#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:18,554 INFO L273 TraceCheckUtils]: 35: Hoare triple {9535#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9536#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:18,554 INFO L273 TraceCheckUtils]: 36: Hoare triple {9536#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9536#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:18,555 INFO L273 TraceCheckUtils]: 37: Hoare triple {9536#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9537#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:18,555 INFO L273 TraceCheckUtils]: 38: Hoare triple {9537#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9537#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:18,556 INFO L273 TraceCheckUtils]: 39: Hoare triple {9537#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9538#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:18,557 INFO L273 TraceCheckUtils]: 40: Hoare triple {9538#(<= main_~i~1 17)} assume !(~i~1 < 1000); {9520#false} is VALID [2018-11-23 12:27:18,557 INFO L256 TraceCheckUtils]: 41: Hoare triple {9520#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:27:18,557 INFO L273 TraceCheckUtils]: 42: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9519#true} is VALID [2018-11-23 12:27:18,558 INFO L273 TraceCheckUtils]: 43: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,558 INFO L273 TraceCheckUtils]: 44: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,558 INFO L273 TraceCheckUtils]: 45: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,558 INFO L273 TraceCheckUtils]: 46: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,558 INFO L273 TraceCheckUtils]: 47: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,559 INFO L273 TraceCheckUtils]: 48: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,559 INFO L273 TraceCheckUtils]: 49: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,559 INFO L273 TraceCheckUtils]: 50: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,559 INFO L273 TraceCheckUtils]: 51: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,559 INFO L273 TraceCheckUtils]: 52: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,560 INFO L273 TraceCheckUtils]: 53: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,560 INFO L273 TraceCheckUtils]: 54: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,560 INFO L273 TraceCheckUtils]: 55: Hoare triple {9519#true} assume !(~i~0 < 1000); {9519#true} is VALID [2018-11-23 12:27:18,560 INFO L273 TraceCheckUtils]: 56: Hoare triple {9519#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:27:18,560 INFO L273 TraceCheckUtils]: 57: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:18,560 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9519#true} {9520#false} #70#return; {9520#false} is VALID [2018-11-23 12:27:18,561 INFO L273 TraceCheckUtils]: 59: Hoare triple {9520#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:27:18,561 INFO L256 TraceCheckUtils]: 60: Hoare triple {9520#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:27:18,561 INFO L273 TraceCheckUtils]: 61: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9519#true} is VALID [2018-11-23 12:27:18,561 INFO L273 TraceCheckUtils]: 62: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,561 INFO L273 TraceCheckUtils]: 63: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,561 INFO L273 TraceCheckUtils]: 64: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,561 INFO L273 TraceCheckUtils]: 65: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,561 INFO L273 TraceCheckUtils]: 66: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,561 INFO L273 TraceCheckUtils]: 67: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,562 INFO L273 TraceCheckUtils]: 68: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,562 INFO L273 TraceCheckUtils]: 69: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,562 INFO L273 TraceCheckUtils]: 70: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,562 INFO L273 TraceCheckUtils]: 71: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,562 INFO L273 TraceCheckUtils]: 72: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,562 INFO L273 TraceCheckUtils]: 73: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,562 INFO L273 TraceCheckUtils]: 74: Hoare triple {9519#true} assume !(~i~0 < 1000); {9519#true} is VALID [2018-11-23 12:27:18,562 INFO L273 TraceCheckUtils]: 75: Hoare triple {9519#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:27:18,563 INFO L273 TraceCheckUtils]: 76: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:18,563 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9519#true} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:27:18,563 INFO L273 TraceCheckUtils]: 78: Hoare triple {9520#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {9520#false} is VALID [2018-11-23 12:27:18,563 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:18,563 INFO L273 TraceCheckUtils]: 80: Hoare triple {9520#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9520#false} is VALID [2018-11-23 12:27:18,563 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:18,563 INFO L273 TraceCheckUtils]: 82: Hoare triple {9520#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9520#false} is VALID [2018-11-23 12:27:18,563 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:18,563 INFO L273 TraceCheckUtils]: 84: Hoare triple {9520#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9520#false} is VALID [2018-11-23 12:27:18,564 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:18,564 INFO L273 TraceCheckUtils]: 86: Hoare triple {9520#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9520#false} is VALID [2018-11-23 12:27:18,564 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 999); {9520#false} is VALID [2018-11-23 12:27:18,564 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:27:18,564 INFO L256 TraceCheckUtils]: 89: Hoare triple {9520#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:27:18,564 INFO L273 TraceCheckUtils]: 90: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9519#true} is VALID [2018-11-23 12:27:18,564 INFO L273 TraceCheckUtils]: 91: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,564 INFO L273 TraceCheckUtils]: 92: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,564 INFO L273 TraceCheckUtils]: 93: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,565 INFO L273 TraceCheckUtils]: 94: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,565 INFO L273 TraceCheckUtils]: 95: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,565 INFO L273 TraceCheckUtils]: 96: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,565 INFO L273 TraceCheckUtils]: 97: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,565 INFO L273 TraceCheckUtils]: 98: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,565 INFO L273 TraceCheckUtils]: 99: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,565 INFO L273 TraceCheckUtils]: 100: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,565 INFO L273 TraceCheckUtils]: 101: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:18,566 INFO L273 TraceCheckUtils]: 102: Hoare triple {9519#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9519#true} is VALID [2018-11-23 12:27:18,566 INFO L273 TraceCheckUtils]: 103: Hoare triple {9519#true} assume !(~i~0 < 1000); {9519#true} is VALID [2018-11-23 12:27:18,566 INFO L273 TraceCheckUtils]: 104: Hoare triple {9519#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:27:18,566 INFO L273 TraceCheckUtils]: 105: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:18,566 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9519#true} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:27:18,566 INFO L273 TraceCheckUtils]: 107: Hoare triple {9520#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {9520#false} is VALID [2018-11-23 12:27:18,566 INFO L273 TraceCheckUtils]: 108: Hoare triple {9520#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {9520#false} is VALID [2018-11-23 12:27:18,566 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:27:18,572 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:27:18,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:18,572 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:27:18,584 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:19,250 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-23 12:27:19,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:19,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:19,548 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:27:19,548 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:27:19,548 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:19,549 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:27:19,549 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret12 := main(); {9519#true} is VALID [2018-11-23 12:27:19,549 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9519#true} is VALID [2018-11-23 12:27:19,550 INFO L273 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,550 INFO L273 TraceCheckUtils]: 7: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,550 INFO L273 TraceCheckUtils]: 8: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,550 INFO L273 TraceCheckUtils]: 9: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,551 INFO L273 TraceCheckUtils]: 10: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,551 INFO L273 TraceCheckUtils]: 13: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,551 INFO L273 TraceCheckUtils]: 14: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,551 INFO L273 TraceCheckUtils]: 15: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,552 INFO L273 TraceCheckUtils]: 16: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,552 INFO L273 TraceCheckUtils]: 17: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,552 INFO L273 TraceCheckUtils]: 19: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,552 INFO L273 TraceCheckUtils]: 20: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,553 INFO L273 TraceCheckUtils]: 21: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,553 INFO L273 TraceCheckUtils]: 22: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,553 INFO L273 TraceCheckUtils]: 23: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,553 INFO L273 TraceCheckUtils]: 24: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,553 INFO L273 TraceCheckUtils]: 25: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,553 INFO L273 TraceCheckUtils]: 26: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,554 INFO L273 TraceCheckUtils]: 28: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,554 INFO L273 TraceCheckUtils]: 29: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,554 INFO L273 TraceCheckUtils]: 30: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,554 INFO L273 TraceCheckUtils]: 31: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,554 INFO L273 TraceCheckUtils]: 32: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,555 INFO L273 TraceCheckUtils]: 33: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,555 INFO L273 TraceCheckUtils]: 34: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,555 INFO L273 TraceCheckUtils]: 35: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,555 INFO L273 TraceCheckUtils]: 36: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,555 INFO L273 TraceCheckUtils]: 37: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,555 INFO L273 TraceCheckUtils]: 38: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:19,556 INFO L273 TraceCheckUtils]: 39: Hoare triple {9519#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9519#true} is VALID [2018-11-23 12:27:19,556 INFO L273 TraceCheckUtils]: 40: Hoare triple {9519#true} assume !(~i~1 < 1000); {9519#true} is VALID [2018-11-23 12:27:19,556 INFO L256 TraceCheckUtils]: 41: Hoare triple {9519#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:27:19,570 INFO L273 TraceCheckUtils]: 42: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9668#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:27:19,579 INFO L273 TraceCheckUtils]: 43: Hoare triple {9668#(<= mapavg_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9668#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:27:19,582 INFO L273 TraceCheckUtils]: 44: Hoare triple {9668#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9675#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:27:19,583 INFO L273 TraceCheckUtils]: 45: Hoare triple {9675#(<= mapavg_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9675#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:27:19,587 INFO L273 TraceCheckUtils]: 46: Hoare triple {9675#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9682#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:27:19,587 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= mapavg_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9682#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:27:19,588 INFO L273 TraceCheckUtils]: 48: Hoare triple {9682#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9689#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:27:19,588 INFO L273 TraceCheckUtils]: 49: Hoare triple {9689#(<= mapavg_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9689#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:27:19,588 INFO L273 TraceCheckUtils]: 50: Hoare triple {9689#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9696#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:27:19,589 INFO L273 TraceCheckUtils]: 51: Hoare triple {9696#(<= mapavg_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9696#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:27:19,589 INFO L273 TraceCheckUtils]: 52: Hoare triple {9696#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9703#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:27:19,590 INFO L273 TraceCheckUtils]: 53: Hoare triple {9703#(<= mapavg_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9703#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:27:19,590 INFO L273 TraceCheckUtils]: 54: Hoare triple {9703#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9710#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:27:19,591 INFO L273 TraceCheckUtils]: 55: Hoare triple {9710#(<= mapavg_~i~0 6)} assume !(~i~0 < 1000); {9520#false} is VALID [2018-11-23 12:27:19,591 INFO L273 TraceCheckUtils]: 56: Hoare triple {9520#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:27:19,591 INFO L273 TraceCheckUtils]: 57: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:27:19,591 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9520#false} {9519#true} #70#return; {9520#false} is VALID [2018-11-23 12:27:19,591 INFO L273 TraceCheckUtils]: 59: Hoare triple {9520#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:27:19,592 INFO L256 TraceCheckUtils]: 60: Hoare triple {9520#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {9520#false} is VALID [2018-11-23 12:27:19,592 INFO L273 TraceCheckUtils]: 61: Hoare triple {9520#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9520#false} is VALID [2018-11-23 12:27:19,592 INFO L273 TraceCheckUtils]: 62: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:19,592 INFO L273 TraceCheckUtils]: 63: Hoare triple {9520#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9520#false} is VALID [2018-11-23 12:27:19,592 INFO L273 TraceCheckUtils]: 64: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:19,593 INFO L273 TraceCheckUtils]: 65: Hoare triple {9520#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9520#false} is VALID [2018-11-23 12:27:19,593 INFO L273 TraceCheckUtils]: 66: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:19,593 INFO L273 TraceCheckUtils]: 67: Hoare triple {9520#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9520#false} is VALID [2018-11-23 12:27:19,593 INFO L273 TraceCheckUtils]: 68: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:19,593 INFO L273 TraceCheckUtils]: 69: Hoare triple {9520#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9520#false} is VALID [2018-11-23 12:27:19,594 INFO L273 TraceCheckUtils]: 70: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:19,594 INFO L273 TraceCheckUtils]: 71: Hoare triple {9520#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9520#false} is VALID [2018-11-23 12:27:19,594 INFO L273 TraceCheckUtils]: 72: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:19,594 INFO L273 TraceCheckUtils]: 73: Hoare triple {9520#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9520#false} is VALID [2018-11-23 12:27:19,594 INFO L273 TraceCheckUtils]: 74: Hoare triple {9520#false} assume !(~i~0 < 1000); {9520#false} is VALID [2018-11-23 12:27:19,594 INFO L273 TraceCheckUtils]: 75: Hoare triple {9520#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:27:19,595 INFO L273 TraceCheckUtils]: 76: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:27:19,595 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9520#false} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:27:19,595 INFO L273 TraceCheckUtils]: 78: Hoare triple {9520#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {9520#false} is VALID [2018-11-23 12:27:19,595 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:19,595 INFO L273 TraceCheckUtils]: 80: Hoare triple {9520#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9520#false} is VALID [2018-11-23 12:27:19,595 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:19,595 INFO L273 TraceCheckUtils]: 82: Hoare triple {9520#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9520#false} is VALID [2018-11-23 12:27:19,595 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:19,595 INFO L273 TraceCheckUtils]: 84: Hoare triple {9520#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9520#false} is VALID [2018-11-23 12:27:19,596 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:19,596 INFO L273 TraceCheckUtils]: 86: Hoare triple {9520#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9520#false} is VALID [2018-11-23 12:27:19,596 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 999); {9520#false} is VALID [2018-11-23 12:27:19,596 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:27:19,596 INFO L256 TraceCheckUtils]: 89: Hoare triple {9520#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {9520#false} is VALID [2018-11-23 12:27:19,596 INFO L273 TraceCheckUtils]: 90: Hoare triple {9520#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9520#false} is VALID [2018-11-23 12:27:19,596 INFO L273 TraceCheckUtils]: 91: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:19,596 INFO L273 TraceCheckUtils]: 92: Hoare triple {9520#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9520#false} is VALID [2018-11-23 12:27:19,596 INFO L273 TraceCheckUtils]: 93: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:19,597 INFO L273 TraceCheckUtils]: 94: Hoare triple {9520#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9520#false} is VALID [2018-11-23 12:27:19,597 INFO L273 TraceCheckUtils]: 95: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:19,597 INFO L273 TraceCheckUtils]: 96: Hoare triple {9520#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9520#false} is VALID [2018-11-23 12:27:19,597 INFO L273 TraceCheckUtils]: 97: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:19,597 INFO L273 TraceCheckUtils]: 98: Hoare triple {9520#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9520#false} is VALID [2018-11-23 12:27:19,597 INFO L273 TraceCheckUtils]: 99: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:19,597 INFO L273 TraceCheckUtils]: 100: Hoare triple {9520#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9520#false} is VALID [2018-11-23 12:27:19,597 INFO L273 TraceCheckUtils]: 101: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:19,598 INFO L273 TraceCheckUtils]: 102: Hoare triple {9520#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9520#false} is VALID [2018-11-23 12:27:19,598 INFO L273 TraceCheckUtils]: 103: Hoare triple {9520#false} assume !(~i~0 < 1000); {9520#false} is VALID [2018-11-23 12:27:19,598 INFO L273 TraceCheckUtils]: 104: Hoare triple {9520#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:27:19,598 INFO L273 TraceCheckUtils]: 105: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:27:19,598 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9520#false} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:27:19,598 INFO L273 TraceCheckUtils]: 107: Hoare triple {9520#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {9520#false} is VALID [2018-11-23 12:27:19,598 INFO L273 TraceCheckUtils]: 108: Hoare triple {9520#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {9520#false} is VALID [2018-11-23 12:27:19,598 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:27:19,603 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:27:19,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:19,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-23 12:27:19,625 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:27:19,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:19,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:27:19,720 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:27:19,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:27:19,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:27:19,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:27:19,721 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2018-11-23 12:27:21,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:21,294 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-11-23 12:27:21,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:27:21,294 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:27:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:27:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:27:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:27:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:27:21,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 106 transitions. [2018-11-23 12:27:21,407 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:27:21,409 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:27:21,409 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:27:21,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:27:21,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:27:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 12:27:21,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:21,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 12:27:21,500 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 12:27:21,500 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 12:27:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:21,503 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:27:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:27:21,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:21,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:21,504 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 12:27:21,504 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 12:27:21,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:21,506 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:27:21,506 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:27:21,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:21,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:21,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:21,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:27:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 12:27:21,508 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2018-11-23 12:27:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:21,509 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 12:27:21,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:27:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:27:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:27:21,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:21,510 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:27:21,510 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:21,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:21,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1308787753, now seen corresponding path program 18 times [2018-11-23 12:27:21,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:21,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:21,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:21,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:21,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:22,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:27:22,145 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:27:22,145 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:22,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:27:22,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret12 := main(); {10337#true} is VALID [2018-11-23 12:27:22,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10339#(= main_~i~1 0)} is VALID [2018-11-23 12:27:22,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {10339#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10339#(= main_~i~1 0)} is VALID [2018-11-23 12:27:22,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {10339#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10340#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:22,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {10340#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10340#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:22,148 INFO L273 TraceCheckUtils]: 9: Hoare triple {10340#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10341#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:22,148 INFO L273 TraceCheckUtils]: 10: Hoare triple {10341#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10341#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:22,149 INFO L273 TraceCheckUtils]: 11: Hoare triple {10341#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10342#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:22,149 INFO L273 TraceCheckUtils]: 12: Hoare triple {10342#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10342#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:22,150 INFO L273 TraceCheckUtils]: 13: Hoare triple {10342#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10343#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:22,150 INFO L273 TraceCheckUtils]: 14: Hoare triple {10343#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10343#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:22,151 INFO L273 TraceCheckUtils]: 15: Hoare triple {10343#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10344#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:22,151 INFO L273 TraceCheckUtils]: 16: Hoare triple {10344#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10344#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:22,152 INFO L273 TraceCheckUtils]: 17: Hoare triple {10344#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10345#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:22,152 INFO L273 TraceCheckUtils]: 18: Hoare triple {10345#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10345#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:22,153 INFO L273 TraceCheckUtils]: 19: Hoare triple {10345#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10346#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:22,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {10346#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10346#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:22,157 INFO L273 TraceCheckUtils]: 21: Hoare triple {10346#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10347#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:22,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {10347#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10347#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:22,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {10347#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10348#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:22,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {10348#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10348#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:22,160 INFO L273 TraceCheckUtils]: 25: Hoare triple {10348#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10349#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:22,160 INFO L273 TraceCheckUtils]: 26: Hoare triple {10349#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10349#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:22,161 INFO L273 TraceCheckUtils]: 27: Hoare triple {10349#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10350#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:22,161 INFO L273 TraceCheckUtils]: 28: Hoare triple {10350#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10350#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:22,162 INFO L273 TraceCheckUtils]: 29: Hoare triple {10350#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10351#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:22,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {10351#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10351#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:22,163 INFO L273 TraceCheckUtils]: 31: Hoare triple {10351#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10352#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:22,166 INFO L273 TraceCheckUtils]: 32: Hoare triple {10352#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10352#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:22,166 INFO L273 TraceCheckUtils]: 33: Hoare triple {10352#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10353#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:22,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {10353#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10353#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:22,167 INFO L273 TraceCheckUtils]: 35: Hoare triple {10353#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10354#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:22,167 INFO L273 TraceCheckUtils]: 36: Hoare triple {10354#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10354#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:22,168 INFO L273 TraceCheckUtils]: 37: Hoare triple {10354#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10355#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:22,168 INFO L273 TraceCheckUtils]: 38: Hoare triple {10355#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10355#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:22,169 INFO L273 TraceCheckUtils]: 39: Hoare triple {10355#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10356#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:22,169 INFO L273 TraceCheckUtils]: 40: Hoare triple {10356#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10356#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:22,170 INFO L273 TraceCheckUtils]: 41: Hoare triple {10356#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10357#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:22,170 INFO L273 TraceCheckUtils]: 42: Hoare triple {10357#(<= main_~i~1 18)} assume !(~i~1 < 1000); {10338#false} is VALID [2018-11-23 12:27:22,170 INFO L256 TraceCheckUtils]: 43: Hoare triple {10338#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:27:22,171 INFO L273 TraceCheckUtils]: 44: Hoare triple {10337#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10337#true} is VALID [2018-11-23 12:27:22,171 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,171 INFO L273 TraceCheckUtils]: 46: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,171 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,171 INFO L273 TraceCheckUtils]: 48: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,172 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,172 INFO L273 TraceCheckUtils]: 50: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,172 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,172 INFO L273 TraceCheckUtils]: 52: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,172 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,173 INFO L273 TraceCheckUtils]: 54: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,173 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,173 INFO L273 TraceCheckUtils]: 56: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,173 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,173 INFO L273 TraceCheckUtils]: 58: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,173 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 1000); {10337#true} is VALID [2018-11-23 12:27:22,174 INFO L273 TraceCheckUtils]: 60: Hoare triple {10337#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:22,174 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:22,174 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10338#false} #70#return; {10338#false} is VALID [2018-11-23 12:27:22,174 INFO L273 TraceCheckUtils]: 63: Hoare triple {10338#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:27:22,174 INFO L256 TraceCheckUtils]: 64: Hoare triple {10338#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:27:22,175 INFO L273 TraceCheckUtils]: 65: Hoare triple {10337#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10337#true} is VALID [2018-11-23 12:27:22,175 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,175 INFO L273 TraceCheckUtils]: 67: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,175 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,175 INFO L273 TraceCheckUtils]: 69: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,175 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,175 INFO L273 TraceCheckUtils]: 71: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,176 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,176 INFO L273 TraceCheckUtils]: 73: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,176 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,176 INFO L273 TraceCheckUtils]: 75: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,176 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,176 INFO L273 TraceCheckUtils]: 77: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,176 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,176 INFO L273 TraceCheckUtils]: 79: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,176 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 1000); {10337#true} is VALID [2018-11-23 12:27:22,177 INFO L273 TraceCheckUtils]: 81: Hoare triple {10337#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:22,177 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:22,177 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10338#false} #72#return; {10338#false} is VALID [2018-11-23 12:27:22,177 INFO L273 TraceCheckUtils]: 84: Hoare triple {10338#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {10338#false} is VALID [2018-11-23 12:27:22,177 INFO L273 TraceCheckUtils]: 85: Hoare triple {10338#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10338#false} is VALID [2018-11-23 12:27:22,177 INFO L273 TraceCheckUtils]: 86: Hoare triple {10338#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10338#false} is VALID [2018-11-23 12:27:22,177 INFO L273 TraceCheckUtils]: 87: Hoare triple {10338#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10338#false} is VALID [2018-11-23 12:27:22,177 INFO L273 TraceCheckUtils]: 88: Hoare triple {10338#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10338#false} is VALID [2018-11-23 12:27:22,178 INFO L273 TraceCheckUtils]: 89: Hoare triple {10338#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10338#false} is VALID [2018-11-23 12:27:22,178 INFO L273 TraceCheckUtils]: 90: Hoare triple {10338#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10338#false} is VALID [2018-11-23 12:27:22,178 INFO L273 TraceCheckUtils]: 91: Hoare triple {10338#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10338#false} is VALID [2018-11-23 12:27:22,178 INFO L273 TraceCheckUtils]: 92: Hoare triple {10338#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10338#false} is VALID [2018-11-23 12:27:22,178 INFO L273 TraceCheckUtils]: 93: Hoare triple {10338#false} assume !(~i~2 < 999); {10338#false} is VALID [2018-11-23 12:27:22,178 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:27:22,178 INFO L256 TraceCheckUtils]: 95: Hoare triple {10338#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:27:22,178 INFO L273 TraceCheckUtils]: 96: Hoare triple {10337#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10337#true} is VALID [2018-11-23 12:27:22,178 INFO L273 TraceCheckUtils]: 97: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,179 INFO L273 TraceCheckUtils]: 98: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,179 INFO L273 TraceCheckUtils]: 99: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,179 INFO L273 TraceCheckUtils]: 100: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,179 INFO L273 TraceCheckUtils]: 101: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,179 INFO L273 TraceCheckUtils]: 102: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,179 INFO L273 TraceCheckUtils]: 103: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,179 INFO L273 TraceCheckUtils]: 104: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,179 INFO L273 TraceCheckUtils]: 105: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,179 INFO L273 TraceCheckUtils]: 106: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,180 INFO L273 TraceCheckUtils]: 107: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,180 INFO L273 TraceCheckUtils]: 108: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,180 INFO L273 TraceCheckUtils]: 109: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,180 INFO L273 TraceCheckUtils]: 110: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,180 INFO L273 TraceCheckUtils]: 111: Hoare triple {10337#true} assume !(~i~0 < 1000); {10337#true} is VALID [2018-11-23 12:27:22,180 INFO L273 TraceCheckUtils]: 112: Hoare triple {10337#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:22,180 INFO L273 TraceCheckUtils]: 113: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:22,180 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10337#true} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:27:22,180 INFO L273 TraceCheckUtils]: 115: Hoare triple {10338#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {10338#false} is VALID [2018-11-23 12:27:22,181 INFO L273 TraceCheckUtils]: 116: Hoare triple {10338#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {10338#false} is VALID [2018-11-23 12:27:22,181 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:27:22,187 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:27:22,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:22,187 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:27:22,197 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:22,464 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:27:22,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:22,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:22,777 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:27:22,777 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:27:22,777 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:22,777 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:27:22,778 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret12 := main(); {10337#true} is VALID [2018-11-23 12:27:22,778 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10337#true} is VALID [2018-11-23 12:27:22,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,779 INFO L273 TraceCheckUtils]: 13: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,779 INFO L273 TraceCheckUtils]: 19: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,779 INFO L273 TraceCheckUtils]: 20: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,779 INFO L273 TraceCheckUtils]: 21: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,780 INFO L273 TraceCheckUtils]: 22: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,780 INFO L273 TraceCheckUtils]: 25: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,780 INFO L273 TraceCheckUtils]: 26: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,780 INFO L273 TraceCheckUtils]: 27: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,780 INFO L273 TraceCheckUtils]: 28: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,780 INFO L273 TraceCheckUtils]: 29: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,780 INFO L273 TraceCheckUtils]: 30: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,781 INFO L273 TraceCheckUtils]: 31: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,781 INFO L273 TraceCheckUtils]: 34: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,781 INFO L273 TraceCheckUtils]: 35: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,781 INFO L273 TraceCheckUtils]: 36: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,781 INFO L273 TraceCheckUtils]: 37: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,781 INFO L273 TraceCheckUtils]: 38: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,781 INFO L273 TraceCheckUtils]: 39: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,782 INFO L273 TraceCheckUtils]: 40: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:22,782 INFO L273 TraceCheckUtils]: 41: Hoare triple {10337#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10337#true} is VALID [2018-11-23 12:27:22,782 INFO L273 TraceCheckUtils]: 42: Hoare triple {10337#true} assume !(~i~1 < 1000); {10337#true} is VALID [2018-11-23 12:27:22,782 INFO L256 TraceCheckUtils]: 43: Hoare triple {10337#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:27:22,782 INFO L273 TraceCheckUtils]: 44: Hoare triple {10337#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10337#true} is VALID [2018-11-23 12:27:22,782 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,782 INFO L273 TraceCheckUtils]: 46: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,782 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,783 INFO L273 TraceCheckUtils]: 48: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,783 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,783 INFO L273 TraceCheckUtils]: 50: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,783 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,783 INFO L273 TraceCheckUtils]: 52: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,783 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,783 INFO L273 TraceCheckUtils]: 54: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,783 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,783 INFO L273 TraceCheckUtils]: 56: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,784 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,784 INFO L273 TraceCheckUtils]: 58: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,784 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 1000); {10337#true} is VALID [2018-11-23 12:27:22,784 INFO L273 TraceCheckUtils]: 60: Hoare triple {10337#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:22,784 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:22,784 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10337#true} #70#return; {10337#true} is VALID [2018-11-23 12:27:22,784 INFO L273 TraceCheckUtils]: 63: Hoare triple {10337#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10337#true} is VALID [2018-11-23 12:27:22,784 INFO L256 TraceCheckUtils]: 64: Hoare triple {10337#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:27:22,784 INFO L273 TraceCheckUtils]: 65: Hoare triple {10337#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10337#true} is VALID [2018-11-23 12:27:22,785 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,785 INFO L273 TraceCheckUtils]: 67: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,785 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,785 INFO L273 TraceCheckUtils]: 69: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,785 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,785 INFO L273 TraceCheckUtils]: 71: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,785 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,785 INFO L273 TraceCheckUtils]: 73: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,785 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,786 INFO L273 TraceCheckUtils]: 75: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,786 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,786 INFO L273 TraceCheckUtils]: 77: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,786 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:22,786 INFO L273 TraceCheckUtils]: 79: Hoare triple {10337#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#true} is VALID [2018-11-23 12:27:22,786 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 1000); {10337#true} is VALID [2018-11-23 12:27:22,786 INFO L273 TraceCheckUtils]: 81: Hoare triple {10337#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:22,786 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:22,786 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10337#true} #72#return; {10337#true} is VALID [2018-11-23 12:27:22,788 INFO L273 TraceCheckUtils]: 84: Hoare triple {10337#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {10613#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:22,788 INFO L273 TraceCheckUtils]: 85: Hoare triple {10613#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10613#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:22,790 INFO L273 TraceCheckUtils]: 86: Hoare triple {10613#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10620#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:22,790 INFO L273 TraceCheckUtils]: 87: Hoare triple {10620#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10620#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:22,792 INFO L273 TraceCheckUtils]: 88: Hoare triple {10620#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10627#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:22,792 INFO L273 TraceCheckUtils]: 89: Hoare triple {10627#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10627#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:22,794 INFO L273 TraceCheckUtils]: 90: Hoare triple {10627#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10634#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:22,794 INFO L273 TraceCheckUtils]: 91: Hoare triple {10634#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10634#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:22,796 INFO L273 TraceCheckUtils]: 92: Hoare triple {10634#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10641#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:22,796 INFO L273 TraceCheckUtils]: 93: Hoare triple {10641#(<= main_~i~2 4)} assume !(~i~2 < 999); {10338#false} is VALID [2018-11-23 12:27:22,796 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:27:22,797 INFO L256 TraceCheckUtils]: 95: Hoare triple {10338#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {10338#false} is VALID [2018-11-23 12:27:22,797 INFO L273 TraceCheckUtils]: 96: Hoare triple {10338#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10338#false} is VALID [2018-11-23 12:27:22,797 INFO L273 TraceCheckUtils]: 97: Hoare triple {10338#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:22,797 INFO L273 TraceCheckUtils]: 98: Hoare triple {10338#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10338#false} is VALID [2018-11-23 12:27:22,797 INFO L273 TraceCheckUtils]: 99: Hoare triple {10338#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:22,797 INFO L273 TraceCheckUtils]: 100: Hoare triple {10338#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10338#false} is VALID [2018-11-23 12:27:22,797 INFO L273 TraceCheckUtils]: 101: Hoare triple {10338#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:22,797 INFO L273 TraceCheckUtils]: 102: Hoare triple {10338#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10338#false} is VALID [2018-11-23 12:27:22,797 INFO L273 TraceCheckUtils]: 103: Hoare triple {10338#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:22,798 INFO L273 TraceCheckUtils]: 104: Hoare triple {10338#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10338#false} is VALID [2018-11-23 12:27:22,798 INFO L273 TraceCheckUtils]: 105: Hoare triple {10338#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:22,798 INFO L273 TraceCheckUtils]: 106: Hoare triple {10338#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10338#false} is VALID [2018-11-23 12:27:22,798 INFO L273 TraceCheckUtils]: 107: Hoare triple {10338#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:22,798 INFO L273 TraceCheckUtils]: 108: Hoare triple {10338#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10338#false} is VALID [2018-11-23 12:27:22,798 INFO L273 TraceCheckUtils]: 109: Hoare triple {10338#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:22,798 INFO L273 TraceCheckUtils]: 110: Hoare triple {10338#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10338#false} is VALID [2018-11-23 12:27:22,798 INFO L273 TraceCheckUtils]: 111: Hoare triple {10338#false} assume !(~i~0 < 1000); {10338#false} is VALID [2018-11-23 12:27:22,799 INFO L273 TraceCheckUtils]: 112: Hoare triple {10338#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {10338#false} is VALID [2018-11-23 12:27:22,799 INFO L273 TraceCheckUtils]: 113: Hoare triple {10338#false} assume true; {10338#false} is VALID [2018-11-23 12:27:22,799 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10338#false} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:27:22,799 INFO L273 TraceCheckUtils]: 115: Hoare triple {10338#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {10338#false} is VALID [2018-11-23 12:27:22,799 INFO L273 TraceCheckUtils]: 116: Hoare triple {10338#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {10338#false} is VALID [2018-11-23 12:27:22,799 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:27:22,804 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:27:22,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:22,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2018-11-23 12:27:22,824 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:27:22,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:22,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:27:22,962 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:27:22,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:27:22,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:27:22,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:22,963 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2018-11-23 12:27:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:23,857 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-11-23 12:27:23,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:27:23,857 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:27:23,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:27:23,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:27:23,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 101 transitions. [2018-11-23 12:27:24,135 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:27:24,137 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:27:24,137 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 12:27:24,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 12:27:24,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-23 12:27:24,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:24,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 85 states. [2018-11-23 12:27:24,169 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 85 states. [2018-11-23 12:27:24,169 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 85 states. [2018-11-23 12:27:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:24,172 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:27:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:27:24,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:24,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:24,173 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 87 states. [2018-11-23 12:27:24,173 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 87 states. [2018-11-23 12:27:24,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:24,174 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:27:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:27:24,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:24,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:24,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:24,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:27:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-23 12:27:24,177 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2018-11-23 12:27:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:24,177 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-23 12:27:24,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:27:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-23 12:27:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 12:27:24,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:24,179 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:27:24,179 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:24,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:24,179 INFO L82 PathProgramCache]: Analyzing trace with hash -242984311, now seen corresponding path program 19 times [2018-11-23 12:27:24,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:24,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:24,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:24,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:24,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:24,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:27:24,789 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:27:24,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:24,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:27:24,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret12 := main(); {11201#true} is VALID [2018-11-23 12:27:24,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11203#(= main_~i~1 0)} is VALID [2018-11-23 12:27:24,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {11203#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11203#(= main_~i~1 0)} is VALID [2018-11-23 12:27:24,792 INFO L273 TraceCheckUtils]: 7: Hoare triple {11203#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:24,792 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:24,793 INFO L273 TraceCheckUtils]: 9: Hoare triple {11204#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:24,793 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:24,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {11205#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:24,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:24,794 INFO L273 TraceCheckUtils]: 13: Hoare triple {11206#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:24,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:24,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {11207#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:24,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:24,797 INFO L273 TraceCheckUtils]: 17: Hoare triple {11208#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:24,797 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:24,798 INFO L273 TraceCheckUtils]: 19: Hoare triple {11209#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:24,799 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:24,799 INFO L273 TraceCheckUtils]: 21: Hoare triple {11210#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:24,800 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:24,801 INFO L273 TraceCheckUtils]: 23: Hoare triple {11211#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:24,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:24,802 INFO L273 TraceCheckUtils]: 25: Hoare triple {11212#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:24,802 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:24,803 INFO L273 TraceCheckUtils]: 27: Hoare triple {11213#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:24,804 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:24,804 INFO L273 TraceCheckUtils]: 29: Hoare triple {11214#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:24,805 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:24,806 INFO L273 TraceCheckUtils]: 31: Hoare triple {11215#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:24,806 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:24,807 INFO L273 TraceCheckUtils]: 33: Hoare triple {11216#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:24,807 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:24,808 INFO L273 TraceCheckUtils]: 35: Hoare triple {11217#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:24,809 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:24,809 INFO L273 TraceCheckUtils]: 37: Hoare triple {11218#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:24,810 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:24,811 INFO L273 TraceCheckUtils]: 39: Hoare triple {11219#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:24,811 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:24,812 INFO L273 TraceCheckUtils]: 41: Hoare triple {11220#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:24,813 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:24,813 INFO L273 TraceCheckUtils]: 43: Hoare triple {11221#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11222#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:24,814 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 1000); {11202#false} is VALID [2018-11-23 12:27:24,814 INFO L256 TraceCheckUtils]: 45: Hoare triple {11202#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {11201#true} is VALID [2018-11-23 12:27:24,814 INFO L273 TraceCheckUtils]: 46: Hoare triple {11201#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11201#true} is VALID [2018-11-23 12:27:24,815 INFO L273 TraceCheckUtils]: 47: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,815 INFO L273 TraceCheckUtils]: 48: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,815 INFO L273 TraceCheckUtils]: 49: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,815 INFO L273 TraceCheckUtils]: 50: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,815 INFO L273 TraceCheckUtils]: 51: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,816 INFO L273 TraceCheckUtils]: 52: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,816 INFO L273 TraceCheckUtils]: 53: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,816 INFO L273 TraceCheckUtils]: 54: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,816 INFO L273 TraceCheckUtils]: 55: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,816 INFO L273 TraceCheckUtils]: 56: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,817 INFO L273 TraceCheckUtils]: 57: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,817 INFO L273 TraceCheckUtils]: 58: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,817 INFO L273 TraceCheckUtils]: 59: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,817 INFO L273 TraceCheckUtils]: 60: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,817 INFO L273 TraceCheckUtils]: 61: Hoare triple {11201#true} assume !(~i~0 < 1000); {11201#true} is VALID [2018-11-23 12:27:24,818 INFO L273 TraceCheckUtils]: 62: Hoare triple {11201#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:27:24,818 INFO L273 TraceCheckUtils]: 63: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:24,818 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11201#true} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:27:24,818 INFO L273 TraceCheckUtils]: 65: Hoare triple {11202#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:27:24,818 INFO L256 TraceCheckUtils]: 66: Hoare triple {11202#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {11201#true} is VALID [2018-11-23 12:27:24,819 INFO L273 TraceCheckUtils]: 67: Hoare triple {11201#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11201#true} is VALID [2018-11-23 12:27:24,819 INFO L273 TraceCheckUtils]: 68: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,819 INFO L273 TraceCheckUtils]: 69: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,819 INFO L273 TraceCheckUtils]: 70: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,819 INFO L273 TraceCheckUtils]: 71: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,819 INFO L273 TraceCheckUtils]: 72: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,819 INFO L273 TraceCheckUtils]: 73: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,820 INFO L273 TraceCheckUtils]: 74: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,820 INFO L273 TraceCheckUtils]: 75: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,820 INFO L273 TraceCheckUtils]: 76: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,820 INFO L273 TraceCheckUtils]: 77: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,820 INFO L273 TraceCheckUtils]: 78: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,820 INFO L273 TraceCheckUtils]: 79: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,820 INFO L273 TraceCheckUtils]: 80: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,820 INFO L273 TraceCheckUtils]: 81: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,820 INFO L273 TraceCheckUtils]: 82: Hoare triple {11201#true} assume !(~i~0 < 1000); {11201#true} is VALID [2018-11-23 12:27:24,821 INFO L273 TraceCheckUtils]: 83: Hoare triple {11201#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:27:24,821 INFO L273 TraceCheckUtils]: 84: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:24,821 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11201#true} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:27:24,821 INFO L273 TraceCheckUtils]: 86: Hoare triple {11202#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {11202#false} is VALID [2018-11-23 12:27:24,821 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:24,821 INFO L273 TraceCheckUtils]: 88: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:24,821 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:24,821 INFO L273 TraceCheckUtils]: 90: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:24,822 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:24,822 INFO L273 TraceCheckUtils]: 92: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:24,822 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:24,822 INFO L273 TraceCheckUtils]: 94: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:24,822 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:24,822 INFO L273 TraceCheckUtils]: 96: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:24,822 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 999); {11202#false} is VALID [2018-11-23 12:27:24,822 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:27:24,822 INFO L256 TraceCheckUtils]: 99: Hoare triple {11202#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {11201#true} is VALID [2018-11-23 12:27:24,823 INFO L273 TraceCheckUtils]: 100: Hoare triple {11201#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11201#true} is VALID [2018-11-23 12:27:24,823 INFO L273 TraceCheckUtils]: 101: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,823 INFO L273 TraceCheckUtils]: 102: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,823 INFO L273 TraceCheckUtils]: 103: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,823 INFO L273 TraceCheckUtils]: 104: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,823 INFO L273 TraceCheckUtils]: 105: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,823 INFO L273 TraceCheckUtils]: 106: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,823 INFO L273 TraceCheckUtils]: 107: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,823 INFO L273 TraceCheckUtils]: 108: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,824 INFO L273 TraceCheckUtils]: 109: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,824 INFO L273 TraceCheckUtils]: 110: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,824 INFO L273 TraceCheckUtils]: 111: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,824 INFO L273 TraceCheckUtils]: 112: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,824 INFO L273 TraceCheckUtils]: 113: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:24,824 INFO L273 TraceCheckUtils]: 114: Hoare triple {11201#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11201#true} is VALID [2018-11-23 12:27:24,824 INFO L273 TraceCheckUtils]: 115: Hoare triple {11201#true} assume !(~i~0 < 1000); {11201#true} is VALID [2018-11-23 12:27:24,825 INFO L273 TraceCheckUtils]: 116: Hoare triple {11201#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:27:24,825 INFO L273 TraceCheckUtils]: 117: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:24,825 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11201#true} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:27:24,825 INFO L273 TraceCheckUtils]: 119: Hoare triple {11202#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {11202#false} is VALID [2018-11-23 12:27:24,825 INFO L273 TraceCheckUtils]: 120: Hoare triple {11202#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11202#false} is VALID [2018-11-23 12:27:24,825 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:27:24,832 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:27:24,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:24,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:27:24,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:24,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:25,255 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:27:25,256 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:27:25,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:25,256 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:27:25,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret12 := main(); {11201#true} is VALID [2018-11-23 12:27:25,257 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11241#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:25,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {11241#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11241#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:25,258 INFO L273 TraceCheckUtils]: 7: Hoare triple {11241#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:25,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:25,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {11204#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:25,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:25,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {11205#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:25,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:25,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {11206#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:25,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:25,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {11207#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:25,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:25,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {11208#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:25,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:25,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {11209#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:25,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:25,266 INFO L273 TraceCheckUtils]: 21: Hoare triple {11210#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:25,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:25,267 INFO L273 TraceCheckUtils]: 23: Hoare triple {11211#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:25,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:25,269 INFO L273 TraceCheckUtils]: 25: Hoare triple {11212#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:25,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:25,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {11213#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:25,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:25,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {11214#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:25,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:25,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {11215#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:25,273 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:25,274 INFO L273 TraceCheckUtils]: 33: Hoare triple {11216#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:25,274 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:25,275 INFO L273 TraceCheckUtils]: 35: Hoare triple {11217#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:25,276 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:25,276 INFO L273 TraceCheckUtils]: 37: Hoare triple {11218#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:25,277 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:25,278 INFO L273 TraceCheckUtils]: 39: Hoare triple {11219#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:25,278 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:25,279 INFO L273 TraceCheckUtils]: 41: Hoare triple {11220#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:25,279 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:25,280 INFO L273 TraceCheckUtils]: 43: Hoare triple {11221#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11222#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:25,281 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 1000); {11202#false} is VALID [2018-11-23 12:27:25,281 INFO L256 TraceCheckUtils]: 45: Hoare triple {11202#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {11202#false} is VALID [2018-11-23 12:27:25,281 INFO L273 TraceCheckUtils]: 46: Hoare triple {11202#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11202#false} is VALID [2018-11-23 12:27:25,281 INFO L273 TraceCheckUtils]: 47: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,282 INFO L273 TraceCheckUtils]: 48: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,282 INFO L273 TraceCheckUtils]: 49: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,282 INFO L273 TraceCheckUtils]: 50: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,282 INFO L273 TraceCheckUtils]: 51: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,282 INFO L273 TraceCheckUtils]: 52: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,283 INFO L273 TraceCheckUtils]: 53: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,283 INFO L273 TraceCheckUtils]: 54: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,283 INFO L273 TraceCheckUtils]: 55: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,283 INFO L273 TraceCheckUtils]: 56: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,283 INFO L273 TraceCheckUtils]: 57: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,284 INFO L273 TraceCheckUtils]: 58: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,284 INFO L273 TraceCheckUtils]: 59: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,284 INFO L273 TraceCheckUtils]: 60: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,284 INFO L273 TraceCheckUtils]: 61: Hoare triple {11202#false} assume !(~i~0 < 1000); {11202#false} is VALID [2018-11-23 12:27:25,284 INFO L273 TraceCheckUtils]: 62: Hoare triple {11202#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:27:25,285 INFO L273 TraceCheckUtils]: 63: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:27:25,285 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11202#false} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:27:25,285 INFO L273 TraceCheckUtils]: 65: Hoare triple {11202#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:27:25,285 INFO L256 TraceCheckUtils]: 66: Hoare triple {11202#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {11202#false} is VALID [2018-11-23 12:27:25,285 INFO L273 TraceCheckUtils]: 67: Hoare triple {11202#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11202#false} is VALID [2018-11-23 12:27:25,286 INFO L273 TraceCheckUtils]: 68: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,286 INFO L273 TraceCheckUtils]: 69: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,286 INFO L273 TraceCheckUtils]: 70: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,286 INFO L273 TraceCheckUtils]: 71: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,286 INFO L273 TraceCheckUtils]: 72: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,286 INFO L273 TraceCheckUtils]: 73: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,286 INFO L273 TraceCheckUtils]: 74: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,287 INFO L273 TraceCheckUtils]: 75: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,287 INFO L273 TraceCheckUtils]: 76: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,287 INFO L273 TraceCheckUtils]: 77: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,287 INFO L273 TraceCheckUtils]: 78: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,287 INFO L273 TraceCheckUtils]: 79: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,287 INFO L273 TraceCheckUtils]: 80: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,287 INFO L273 TraceCheckUtils]: 81: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,287 INFO L273 TraceCheckUtils]: 82: Hoare triple {11202#false} assume !(~i~0 < 1000); {11202#false} is VALID [2018-11-23 12:27:25,287 INFO L273 TraceCheckUtils]: 83: Hoare triple {11202#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:27:25,288 INFO L273 TraceCheckUtils]: 84: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:27:25,288 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11202#false} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:27:25,288 INFO L273 TraceCheckUtils]: 86: Hoare triple {11202#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {11202#false} is VALID [2018-11-23 12:27:25,288 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:25,288 INFO L273 TraceCheckUtils]: 88: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:25,288 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:25,288 INFO L273 TraceCheckUtils]: 90: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:25,288 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:25,288 INFO L273 TraceCheckUtils]: 92: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:25,289 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:25,289 INFO L273 TraceCheckUtils]: 94: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:25,289 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:25,289 INFO L273 TraceCheckUtils]: 96: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:25,289 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 999); {11202#false} is VALID [2018-11-23 12:27:25,289 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:27:25,289 INFO L256 TraceCheckUtils]: 99: Hoare triple {11202#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {11202#false} is VALID [2018-11-23 12:27:25,289 INFO L273 TraceCheckUtils]: 100: Hoare triple {11202#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11202#false} is VALID [2018-11-23 12:27:25,289 INFO L273 TraceCheckUtils]: 101: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,290 INFO L273 TraceCheckUtils]: 102: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,290 INFO L273 TraceCheckUtils]: 103: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,290 INFO L273 TraceCheckUtils]: 104: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,290 INFO L273 TraceCheckUtils]: 105: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,290 INFO L273 TraceCheckUtils]: 106: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,290 INFO L273 TraceCheckUtils]: 107: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,290 INFO L273 TraceCheckUtils]: 108: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,290 INFO L273 TraceCheckUtils]: 109: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,291 INFO L273 TraceCheckUtils]: 110: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,291 INFO L273 TraceCheckUtils]: 111: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,291 INFO L273 TraceCheckUtils]: 112: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,291 INFO L273 TraceCheckUtils]: 113: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:25,291 INFO L273 TraceCheckUtils]: 114: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:25,291 INFO L273 TraceCheckUtils]: 115: Hoare triple {11202#false} assume !(~i~0 < 1000); {11202#false} is VALID [2018-11-23 12:27:25,291 INFO L273 TraceCheckUtils]: 116: Hoare triple {11202#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:27:25,291 INFO L273 TraceCheckUtils]: 117: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:27:25,291 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11202#false} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:27:25,292 INFO L273 TraceCheckUtils]: 119: Hoare triple {11202#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {11202#false} is VALID [2018-11-23 12:27:25,292 INFO L273 TraceCheckUtils]: 120: Hoare triple {11202#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11202#false} is VALID [2018-11-23 12:27:25,292 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:27:25,298 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:27:25,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:25,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:27:25,319 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:27:25,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:25,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:27:25,396 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:27:25,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:27:25,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:27:25,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:27:25,397 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2018-11-23 12:27:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:26,112 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-23 12:27:26,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:27:26,112 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:27:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:26,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:27:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:27:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:27:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:27:26,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 92 transitions. [2018-11-23 12:27:26,263 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:27:26,265 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:27:26,265 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:27:26,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:27:26,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:27:26,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 12:27:26,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:26,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 12:27:26,302 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 12:27:26,302 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 12:27:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:26,304 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:27:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:27:26,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:26,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:26,305 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 12:27:26,305 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 12:27:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:26,307 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:27:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:27:26,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:26,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:26,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:26,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:27:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-23 12:27:26,310 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2018-11-23 12:27:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:26,310 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-23 12:27:26,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:27:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:27:26,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:27:26,312 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:26,312 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:27:26,312 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:26,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:26,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1110011285, now seen corresponding path program 20 times [2018-11-23 12:27:26,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:26,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:26,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:26,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:26,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:27,096 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:27:27,096 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:27:27,096 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:27,096 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:27:27,097 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret12 := main(); {12084#true} is VALID [2018-11-23 12:27:27,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12086#(= main_~i~1 0)} is VALID [2018-11-23 12:27:27,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {12086#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12086#(= main_~i~1 0)} is VALID [2018-11-23 12:27:27,098 INFO L273 TraceCheckUtils]: 7: Hoare triple {12086#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:27,098 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:27,099 INFO L273 TraceCheckUtils]: 9: Hoare triple {12087#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:27,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:27,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {12088#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:27,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:27,101 INFO L273 TraceCheckUtils]: 13: Hoare triple {12089#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:27,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:27,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {12090#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:27,103 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:27,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {12091#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:27,104 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:27,105 INFO L273 TraceCheckUtils]: 19: Hoare triple {12092#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:27,105 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:27,106 INFO L273 TraceCheckUtils]: 21: Hoare triple {12093#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:27,106 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:27,107 INFO L273 TraceCheckUtils]: 23: Hoare triple {12094#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:27,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:27,108 INFO L273 TraceCheckUtils]: 25: Hoare triple {12095#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:27,109 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:27,109 INFO L273 TraceCheckUtils]: 27: Hoare triple {12096#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:27,110 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:27,110 INFO L273 TraceCheckUtils]: 29: Hoare triple {12097#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:27,111 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:27,112 INFO L273 TraceCheckUtils]: 31: Hoare triple {12098#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:27,112 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:27,113 INFO L273 TraceCheckUtils]: 33: Hoare triple {12099#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:27,113 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:27,114 INFO L273 TraceCheckUtils]: 35: Hoare triple {12100#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:27,115 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:27,115 INFO L273 TraceCheckUtils]: 37: Hoare triple {12101#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:27,116 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:27,116 INFO L273 TraceCheckUtils]: 39: Hoare triple {12102#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:27,117 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:27,118 INFO L273 TraceCheckUtils]: 41: Hoare triple {12103#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:27,118 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:27,119 INFO L273 TraceCheckUtils]: 43: Hoare triple {12104#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:27,119 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:27,120 INFO L273 TraceCheckUtils]: 45: Hoare triple {12105#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12106#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:27,121 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 1000); {12085#false} is VALID [2018-11-23 12:27:27,121 INFO L256 TraceCheckUtils]: 47: Hoare triple {12085#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {12084#true} is VALID [2018-11-23 12:27:27,121 INFO L273 TraceCheckUtils]: 48: Hoare triple {12084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12084#true} is VALID [2018-11-23 12:27:27,121 INFO L273 TraceCheckUtils]: 49: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,121 INFO L273 TraceCheckUtils]: 50: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,122 INFO L273 TraceCheckUtils]: 51: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,122 INFO L273 TraceCheckUtils]: 52: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,122 INFO L273 TraceCheckUtils]: 53: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,122 INFO L273 TraceCheckUtils]: 54: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,122 INFO L273 TraceCheckUtils]: 55: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,123 INFO L273 TraceCheckUtils]: 56: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,123 INFO L273 TraceCheckUtils]: 57: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,123 INFO L273 TraceCheckUtils]: 58: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,123 INFO L273 TraceCheckUtils]: 59: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,123 INFO L273 TraceCheckUtils]: 60: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,123 INFO L273 TraceCheckUtils]: 61: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,124 INFO L273 TraceCheckUtils]: 62: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,124 INFO L273 TraceCheckUtils]: 63: Hoare triple {12084#true} assume !(~i~0 < 1000); {12084#true} is VALID [2018-11-23 12:27:27,124 INFO L273 TraceCheckUtils]: 64: Hoare triple {12084#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:27:27,124 INFO L273 TraceCheckUtils]: 65: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:27,124 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12084#true} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:27:27,124 INFO L273 TraceCheckUtils]: 67: Hoare triple {12085#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:27:27,124 INFO L256 TraceCheckUtils]: 68: Hoare triple {12085#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {12084#true} is VALID [2018-11-23 12:27:27,124 INFO L273 TraceCheckUtils]: 69: Hoare triple {12084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12084#true} is VALID [2018-11-23 12:27:27,125 INFO L273 TraceCheckUtils]: 70: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,125 INFO L273 TraceCheckUtils]: 71: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,125 INFO L273 TraceCheckUtils]: 72: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,125 INFO L273 TraceCheckUtils]: 73: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,125 INFO L273 TraceCheckUtils]: 74: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,125 INFO L273 TraceCheckUtils]: 75: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,125 INFO L273 TraceCheckUtils]: 76: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,125 INFO L273 TraceCheckUtils]: 77: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,125 INFO L273 TraceCheckUtils]: 78: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,126 INFO L273 TraceCheckUtils]: 79: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,126 INFO L273 TraceCheckUtils]: 80: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,126 INFO L273 TraceCheckUtils]: 81: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,126 INFO L273 TraceCheckUtils]: 82: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,126 INFO L273 TraceCheckUtils]: 83: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,126 INFO L273 TraceCheckUtils]: 84: Hoare triple {12084#true} assume !(~i~0 < 1000); {12084#true} is VALID [2018-11-23 12:27:27,127 INFO L273 TraceCheckUtils]: 85: Hoare triple {12084#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:27:27,127 INFO L273 TraceCheckUtils]: 86: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:27,127 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12084#true} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:27:27,127 INFO L273 TraceCheckUtils]: 88: Hoare triple {12085#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {12085#false} is VALID [2018-11-23 12:27:27,127 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:27,128 INFO L273 TraceCheckUtils]: 90: Hoare triple {12085#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12085#false} is VALID [2018-11-23 12:27:27,128 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:27,128 INFO L273 TraceCheckUtils]: 92: Hoare triple {12085#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12085#false} is VALID [2018-11-23 12:27:27,128 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:27,128 INFO L273 TraceCheckUtils]: 94: Hoare triple {12085#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12085#false} is VALID [2018-11-23 12:27:27,128 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:27,129 INFO L273 TraceCheckUtils]: 96: Hoare triple {12085#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12085#false} is VALID [2018-11-23 12:27:27,129 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:27,129 INFO L273 TraceCheckUtils]: 98: Hoare triple {12085#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12085#false} is VALID [2018-11-23 12:27:27,129 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 999); {12085#false} is VALID [2018-11-23 12:27:27,129 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:27:27,129 INFO L256 TraceCheckUtils]: 101: Hoare triple {12085#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {12084#true} is VALID [2018-11-23 12:27:27,130 INFO L273 TraceCheckUtils]: 102: Hoare triple {12084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12084#true} is VALID [2018-11-23 12:27:27,130 INFO L273 TraceCheckUtils]: 103: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,130 INFO L273 TraceCheckUtils]: 104: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,130 INFO L273 TraceCheckUtils]: 105: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,130 INFO L273 TraceCheckUtils]: 106: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,130 INFO L273 TraceCheckUtils]: 107: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,131 INFO L273 TraceCheckUtils]: 108: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,131 INFO L273 TraceCheckUtils]: 109: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,131 INFO L273 TraceCheckUtils]: 110: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,131 INFO L273 TraceCheckUtils]: 111: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,131 INFO L273 TraceCheckUtils]: 112: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,132 INFO L273 TraceCheckUtils]: 113: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,132 INFO L273 TraceCheckUtils]: 114: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,132 INFO L273 TraceCheckUtils]: 115: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:27,132 INFO L273 TraceCheckUtils]: 116: Hoare triple {12084#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12084#true} is VALID [2018-11-23 12:27:27,132 INFO L273 TraceCheckUtils]: 117: Hoare triple {12084#true} assume !(~i~0 < 1000); {12084#true} is VALID [2018-11-23 12:27:27,132 INFO L273 TraceCheckUtils]: 118: Hoare triple {12084#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:27:27,133 INFO L273 TraceCheckUtils]: 119: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:27,133 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12084#true} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:27:27,133 INFO L273 TraceCheckUtils]: 121: Hoare triple {12085#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {12085#false} is VALID [2018-11-23 12:27:27,133 INFO L273 TraceCheckUtils]: 122: Hoare triple {12085#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12085#false} is VALID [2018-11-23 12:27:27,133 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:27:27,142 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:27:27,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:27,143 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:27:27,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:27,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:27,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:27,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:27,434 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:27:27,434 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:27:27,435 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:27,435 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:27:27,435 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret12 := main(); {12084#true} is VALID [2018-11-23 12:27:27,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12125#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:27,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {12125#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12125#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:27,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {12125#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:27,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:27,437 INFO L273 TraceCheckUtils]: 9: Hoare triple {12087#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:27,438 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:27,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {12088#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:27,439 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:27,439 INFO L273 TraceCheckUtils]: 13: Hoare triple {12089#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:27,440 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:27,441 INFO L273 TraceCheckUtils]: 15: Hoare triple {12090#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:27,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:27,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {12091#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:27,442 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:27,443 INFO L273 TraceCheckUtils]: 19: Hoare triple {12092#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:27,444 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:27,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {12093#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:27,445 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:27,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {12094#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:27,446 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:27,447 INFO L273 TraceCheckUtils]: 25: Hoare triple {12095#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:27,447 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:27,448 INFO L273 TraceCheckUtils]: 27: Hoare triple {12096#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:27,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:27,449 INFO L273 TraceCheckUtils]: 29: Hoare triple {12097#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:27,450 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:27,450 INFO L273 TraceCheckUtils]: 31: Hoare triple {12098#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:27,451 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:27,451 INFO L273 TraceCheckUtils]: 33: Hoare triple {12099#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:27,452 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:27,453 INFO L273 TraceCheckUtils]: 35: Hoare triple {12100#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:27,453 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:27,454 INFO L273 TraceCheckUtils]: 37: Hoare triple {12101#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:27,454 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:27,455 INFO L273 TraceCheckUtils]: 39: Hoare triple {12102#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:27,456 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:27,456 INFO L273 TraceCheckUtils]: 41: Hoare triple {12103#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:27,457 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:27,458 INFO L273 TraceCheckUtils]: 43: Hoare triple {12104#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:27,458 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:27,459 INFO L273 TraceCheckUtils]: 45: Hoare triple {12105#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12106#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:27,459 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 1000); {12085#false} is VALID [2018-11-23 12:27:27,460 INFO L256 TraceCheckUtils]: 47: Hoare triple {12085#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {12085#false} is VALID [2018-11-23 12:27:27,460 INFO L273 TraceCheckUtils]: 48: Hoare triple {12085#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12085#false} is VALID [2018-11-23 12:27:27,460 INFO L273 TraceCheckUtils]: 49: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,460 INFO L273 TraceCheckUtils]: 50: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,460 INFO L273 TraceCheckUtils]: 51: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,461 INFO L273 TraceCheckUtils]: 52: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,461 INFO L273 TraceCheckUtils]: 53: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,461 INFO L273 TraceCheckUtils]: 54: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,461 INFO L273 TraceCheckUtils]: 55: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,461 INFO L273 TraceCheckUtils]: 56: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,462 INFO L273 TraceCheckUtils]: 57: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,462 INFO L273 TraceCheckUtils]: 58: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,462 INFO L273 TraceCheckUtils]: 59: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,462 INFO L273 TraceCheckUtils]: 60: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,462 INFO L273 TraceCheckUtils]: 61: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,462 INFO L273 TraceCheckUtils]: 62: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,463 INFO L273 TraceCheckUtils]: 63: Hoare triple {12085#false} assume !(~i~0 < 1000); {12085#false} is VALID [2018-11-23 12:27:27,463 INFO L273 TraceCheckUtils]: 64: Hoare triple {12085#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:27:27,463 INFO L273 TraceCheckUtils]: 65: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:27:27,463 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12085#false} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:27:27,463 INFO L273 TraceCheckUtils]: 67: Hoare triple {12085#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:27:27,463 INFO L256 TraceCheckUtils]: 68: Hoare triple {12085#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {12085#false} is VALID [2018-11-23 12:27:27,464 INFO L273 TraceCheckUtils]: 69: Hoare triple {12085#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12085#false} is VALID [2018-11-23 12:27:27,464 INFO L273 TraceCheckUtils]: 70: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,464 INFO L273 TraceCheckUtils]: 71: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,464 INFO L273 TraceCheckUtils]: 72: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,464 INFO L273 TraceCheckUtils]: 73: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,464 INFO L273 TraceCheckUtils]: 74: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,464 INFO L273 TraceCheckUtils]: 75: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,464 INFO L273 TraceCheckUtils]: 76: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,464 INFO L273 TraceCheckUtils]: 77: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,465 INFO L273 TraceCheckUtils]: 78: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,465 INFO L273 TraceCheckUtils]: 79: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,465 INFO L273 TraceCheckUtils]: 80: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,465 INFO L273 TraceCheckUtils]: 81: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,465 INFO L273 TraceCheckUtils]: 82: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,465 INFO L273 TraceCheckUtils]: 83: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,465 INFO L273 TraceCheckUtils]: 84: Hoare triple {12085#false} assume !(~i~0 < 1000); {12085#false} is VALID [2018-11-23 12:27:27,465 INFO L273 TraceCheckUtils]: 85: Hoare triple {12085#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:27:27,465 INFO L273 TraceCheckUtils]: 86: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:27:27,466 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12085#false} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:27:27,466 INFO L273 TraceCheckUtils]: 88: Hoare triple {12085#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {12085#false} is VALID [2018-11-23 12:27:27,466 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:27,466 INFO L273 TraceCheckUtils]: 90: Hoare triple {12085#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12085#false} is VALID [2018-11-23 12:27:27,466 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:27,466 INFO L273 TraceCheckUtils]: 92: Hoare triple {12085#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12085#false} is VALID [2018-11-23 12:27:27,466 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:27,466 INFO L273 TraceCheckUtils]: 94: Hoare triple {12085#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12085#false} is VALID [2018-11-23 12:27:27,466 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:27,467 INFO L273 TraceCheckUtils]: 96: Hoare triple {12085#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12085#false} is VALID [2018-11-23 12:27:27,467 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:27,467 INFO L273 TraceCheckUtils]: 98: Hoare triple {12085#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12085#false} is VALID [2018-11-23 12:27:27,467 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 999); {12085#false} is VALID [2018-11-23 12:27:27,467 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:27:27,467 INFO L256 TraceCheckUtils]: 101: Hoare triple {12085#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {12085#false} is VALID [2018-11-23 12:27:27,467 INFO L273 TraceCheckUtils]: 102: Hoare triple {12085#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12085#false} is VALID [2018-11-23 12:27:27,467 INFO L273 TraceCheckUtils]: 103: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,467 INFO L273 TraceCheckUtils]: 104: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,468 INFO L273 TraceCheckUtils]: 105: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,468 INFO L273 TraceCheckUtils]: 106: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,468 INFO L273 TraceCheckUtils]: 107: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,468 INFO L273 TraceCheckUtils]: 108: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,468 INFO L273 TraceCheckUtils]: 109: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,468 INFO L273 TraceCheckUtils]: 110: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,468 INFO L273 TraceCheckUtils]: 111: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,468 INFO L273 TraceCheckUtils]: 112: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,468 INFO L273 TraceCheckUtils]: 113: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,469 INFO L273 TraceCheckUtils]: 114: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,469 INFO L273 TraceCheckUtils]: 115: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:27,469 INFO L273 TraceCheckUtils]: 116: Hoare triple {12085#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12085#false} is VALID [2018-11-23 12:27:27,469 INFO L273 TraceCheckUtils]: 117: Hoare triple {12085#false} assume !(~i~0 < 1000); {12085#false} is VALID [2018-11-23 12:27:27,469 INFO L273 TraceCheckUtils]: 118: Hoare triple {12085#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:27:27,469 INFO L273 TraceCheckUtils]: 119: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:27:27,469 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12085#false} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:27:27,469 INFO L273 TraceCheckUtils]: 121: Hoare triple {12085#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {12085#false} is VALID [2018-11-23 12:27:27,469 INFO L273 TraceCheckUtils]: 122: Hoare triple {12085#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12085#false} is VALID [2018-11-23 12:27:27,470 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:27:27,477 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:27:27,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:27,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:27:27,496 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:27:27,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:27,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:27:27,578 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:27:27,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:27:27,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:27:27,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:27,579 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2018-11-23 12:27:28,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:28,145 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-23 12:27:28,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:27:28,145 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:27:28,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:27:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:27:28,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 94 transitions. [2018-11-23 12:27:28,279 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:27:28,281 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:27:28,281 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:27:28,282 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:27:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:27:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 12:27:28,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:28,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 12:27:28,313 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 12:27:28,313 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 12:27:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:28,315 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:27:28,315 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:27:28,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:28,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:28,316 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 12:27:28,316 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 12:27:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:28,318 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:27:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:27:28,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:28,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:28,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:28,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:27:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-23 12:27:28,321 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-23 12:27:28,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:28,321 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-23 12:27:28,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:27:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-23 12:27:28,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:27:28,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:28,322 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:27:28,322 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:28,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:28,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1099277875, now seen corresponding path program 21 times [2018-11-23 12:27:28,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:28,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:28,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:28,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:28,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:28,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:27:28,769 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:27:28,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:28,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:27:28,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret12 := main(); {12984#true} is VALID [2018-11-23 12:27:28,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12986#(= main_~i~1 0)} is VALID [2018-11-23 12:27:28,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {12986#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12986#(= main_~i~1 0)} is VALID [2018-11-23 12:27:28,771 INFO L273 TraceCheckUtils]: 7: Hoare triple {12986#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12987#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:28,772 INFO L273 TraceCheckUtils]: 8: Hoare triple {12987#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12987#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:28,772 INFO L273 TraceCheckUtils]: 9: Hoare triple {12987#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12988#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:28,772 INFO L273 TraceCheckUtils]: 10: Hoare triple {12988#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12988#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:28,773 INFO L273 TraceCheckUtils]: 11: Hoare triple {12988#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12989#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:28,773 INFO L273 TraceCheckUtils]: 12: Hoare triple {12989#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12989#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:28,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {12989#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12990#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:28,774 INFO L273 TraceCheckUtils]: 14: Hoare triple {12990#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12990#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:28,775 INFO L273 TraceCheckUtils]: 15: Hoare triple {12990#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12991#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:28,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {12991#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12991#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:28,776 INFO L273 TraceCheckUtils]: 17: Hoare triple {12991#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12992#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:28,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {12992#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12992#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:28,777 INFO L273 TraceCheckUtils]: 19: Hoare triple {12992#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12993#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:28,778 INFO L273 TraceCheckUtils]: 20: Hoare triple {12993#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12993#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:28,779 INFO L273 TraceCheckUtils]: 21: Hoare triple {12993#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12994#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:28,779 INFO L273 TraceCheckUtils]: 22: Hoare triple {12994#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12994#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:28,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {12994#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12995#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:28,781 INFO L273 TraceCheckUtils]: 24: Hoare triple {12995#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12995#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:28,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {12995#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12996#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:28,782 INFO L273 TraceCheckUtils]: 26: Hoare triple {12996#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12996#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:28,783 INFO L273 TraceCheckUtils]: 27: Hoare triple {12996#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12997#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:28,783 INFO L273 TraceCheckUtils]: 28: Hoare triple {12997#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12997#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:28,784 INFO L273 TraceCheckUtils]: 29: Hoare triple {12997#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12998#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:28,784 INFO L273 TraceCheckUtils]: 30: Hoare triple {12998#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12998#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:28,785 INFO L273 TraceCheckUtils]: 31: Hoare triple {12998#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12999#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:28,786 INFO L273 TraceCheckUtils]: 32: Hoare triple {12999#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12999#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:28,786 INFO L273 TraceCheckUtils]: 33: Hoare triple {12999#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13000#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:28,787 INFO L273 TraceCheckUtils]: 34: Hoare triple {13000#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13000#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:28,788 INFO L273 TraceCheckUtils]: 35: Hoare triple {13000#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13001#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:28,788 INFO L273 TraceCheckUtils]: 36: Hoare triple {13001#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13001#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:28,789 INFO L273 TraceCheckUtils]: 37: Hoare triple {13001#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13002#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:28,789 INFO L273 TraceCheckUtils]: 38: Hoare triple {13002#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13002#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:28,790 INFO L273 TraceCheckUtils]: 39: Hoare triple {13002#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13003#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:28,791 INFO L273 TraceCheckUtils]: 40: Hoare triple {13003#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13003#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:28,791 INFO L273 TraceCheckUtils]: 41: Hoare triple {13003#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13004#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:28,792 INFO L273 TraceCheckUtils]: 42: Hoare triple {13004#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13004#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:28,811 INFO L273 TraceCheckUtils]: 43: Hoare triple {13004#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13005#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:28,825 INFO L273 TraceCheckUtils]: 44: Hoare triple {13005#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13005#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:28,840 INFO L273 TraceCheckUtils]: 45: Hoare triple {13005#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13006#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:28,849 INFO L273 TraceCheckUtils]: 46: Hoare triple {13006#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13006#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:28,865 INFO L273 TraceCheckUtils]: 47: Hoare triple {13006#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13007#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:28,874 INFO L273 TraceCheckUtils]: 48: Hoare triple {13007#(<= main_~i~1 21)} assume !(~i~1 < 1000); {12985#false} is VALID [2018-11-23 12:27:28,874 INFO L256 TraceCheckUtils]: 49: Hoare triple {12985#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:27:28,874 INFO L273 TraceCheckUtils]: 50: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12984#true} is VALID [2018-11-23 12:27:28,874 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,875 INFO L273 TraceCheckUtils]: 52: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,875 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,875 INFO L273 TraceCheckUtils]: 54: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,875 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,875 INFO L273 TraceCheckUtils]: 56: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,876 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,876 INFO L273 TraceCheckUtils]: 58: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,876 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,876 INFO L273 TraceCheckUtils]: 60: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,876 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,876 INFO L273 TraceCheckUtils]: 62: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,876 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,877 INFO L273 TraceCheckUtils]: 64: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,877 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 1000); {12984#true} is VALID [2018-11-23 12:27:28,877 INFO L273 TraceCheckUtils]: 66: Hoare triple {12984#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:27:28,877 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:28,877 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12985#false} #70#return; {12985#false} is VALID [2018-11-23 12:27:28,877 INFO L273 TraceCheckUtils]: 69: Hoare triple {12985#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:27:28,878 INFO L256 TraceCheckUtils]: 70: Hoare triple {12985#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:27:28,878 INFO L273 TraceCheckUtils]: 71: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12984#true} is VALID [2018-11-23 12:27:28,878 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,878 INFO L273 TraceCheckUtils]: 73: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,878 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,878 INFO L273 TraceCheckUtils]: 75: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,879 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,879 INFO L273 TraceCheckUtils]: 77: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,879 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,879 INFO L273 TraceCheckUtils]: 79: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,879 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,879 INFO L273 TraceCheckUtils]: 81: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,880 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,880 INFO L273 TraceCheckUtils]: 83: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,880 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,880 INFO L273 TraceCheckUtils]: 85: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,880 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 1000); {12984#true} is VALID [2018-11-23 12:27:28,880 INFO L273 TraceCheckUtils]: 87: Hoare triple {12984#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:27:28,881 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:28,881 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12985#false} #72#return; {12985#false} is VALID [2018-11-23 12:27:28,881 INFO L273 TraceCheckUtils]: 90: Hoare triple {12985#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {12985#false} is VALID [2018-11-23 12:27:28,881 INFO L273 TraceCheckUtils]: 91: Hoare triple {12985#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12985#false} is VALID [2018-11-23 12:27:28,881 INFO L273 TraceCheckUtils]: 92: Hoare triple {12985#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12985#false} is VALID [2018-11-23 12:27:28,881 INFO L273 TraceCheckUtils]: 93: Hoare triple {12985#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12985#false} is VALID [2018-11-23 12:27:28,882 INFO L273 TraceCheckUtils]: 94: Hoare triple {12985#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12985#false} is VALID [2018-11-23 12:27:28,882 INFO L273 TraceCheckUtils]: 95: Hoare triple {12985#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12985#false} is VALID [2018-11-23 12:27:28,882 INFO L273 TraceCheckUtils]: 96: Hoare triple {12985#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12985#false} is VALID [2018-11-23 12:27:28,882 INFO L273 TraceCheckUtils]: 97: Hoare triple {12985#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12985#false} is VALID [2018-11-23 12:27:28,882 INFO L273 TraceCheckUtils]: 98: Hoare triple {12985#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12985#false} is VALID [2018-11-23 12:27:28,882 INFO L273 TraceCheckUtils]: 99: Hoare triple {12985#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12985#false} is VALID [2018-11-23 12:27:28,883 INFO L273 TraceCheckUtils]: 100: Hoare triple {12985#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12985#false} is VALID [2018-11-23 12:27:28,883 INFO L273 TraceCheckUtils]: 101: Hoare triple {12985#false} assume !(~i~2 < 999); {12985#false} is VALID [2018-11-23 12:27:28,883 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:27:28,883 INFO L256 TraceCheckUtils]: 103: Hoare triple {12985#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:27:28,883 INFO L273 TraceCheckUtils]: 104: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12984#true} is VALID [2018-11-23 12:27:28,883 INFO L273 TraceCheckUtils]: 105: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,884 INFO L273 TraceCheckUtils]: 106: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,884 INFO L273 TraceCheckUtils]: 107: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,884 INFO L273 TraceCheckUtils]: 108: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,884 INFO L273 TraceCheckUtils]: 109: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,884 INFO L273 TraceCheckUtils]: 110: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,884 INFO L273 TraceCheckUtils]: 111: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,884 INFO L273 TraceCheckUtils]: 112: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,885 INFO L273 TraceCheckUtils]: 113: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,885 INFO L273 TraceCheckUtils]: 114: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,885 INFO L273 TraceCheckUtils]: 115: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,885 INFO L273 TraceCheckUtils]: 116: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,885 INFO L273 TraceCheckUtils]: 117: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:28,886 INFO L273 TraceCheckUtils]: 118: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:28,886 INFO L273 TraceCheckUtils]: 119: Hoare triple {12984#true} assume !(~i~0 < 1000); {12984#true} is VALID [2018-11-23 12:27:28,886 INFO L273 TraceCheckUtils]: 120: Hoare triple {12984#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:27:28,886 INFO L273 TraceCheckUtils]: 121: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:28,886 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12984#true} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:27:28,886 INFO L273 TraceCheckUtils]: 123: Hoare triple {12985#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {12985#false} is VALID [2018-11-23 12:27:28,887 INFO L273 TraceCheckUtils]: 124: Hoare triple {12985#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12985#false} is VALID [2018-11-23 12:27:28,887 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:27:28,897 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:27:28,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:28,897 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:27:28,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:29,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:27:29,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:29,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:29,313 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:27:29,313 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:27:29,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:29,314 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:27:29,314 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret12 := main(); {12984#true} is VALID [2018-11-23 12:27:29,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12984#true} is VALID [2018-11-23 12:27:29,314 INFO L273 TraceCheckUtils]: 6: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,314 INFO L273 TraceCheckUtils]: 7: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,315 INFO L273 TraceCheckUtils]: 8: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,315 INFO L273 TraceCheckUtils]: 9: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,315 INFO L273 TraceCheckUtils]: 10: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,315 INFO L273 TraceCheckUtils]: 11: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,316 INFO L273 TraceCheckUtils]: 17: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,316 INFO L273 TraceCheckUtils]: 18: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,316 INFO L273 TraceCheckUtils]: 19: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,316 INFO L273 TraceCheckUtils]: 20: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,316 INFO L273 TraceCheckUtils]: 21: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,317 INFO L273 TraceCheckUtils]: 24: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,317 INFO L273 TraceCheckUtils]: 26: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,317 INFO L273 TraceCheckUtils]: 27: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,317 INFO L273 TraceCheckUtils]: 28: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,317 INFO L273 TraceCheckUtils]: 29: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,318 INFO L273 TraceCheckUtils]: 30: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,318 INFO L273 TraceCheckUtils]: 31: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,318 INFO L273 TraceCheckUtils]: 32: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,318 INFO L273 TraceCheckUtils]: 33: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,318 INFO L273 TraceCheckUtils]: 34: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,318 INFO L273 TraceCheckUtils]: 35: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,318 INFO L273 TraceCheckUtils]: 36: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,319 INFO L273 TraceCheckUtils]: 37: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,319 INFO L273 TraceCheckUtils]: 38: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,319 INFO L273 TraceCheckUtils]: 39: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,319 INFO L273 TraceCheckUtils]: 40: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,319 INFO L273 TraceCheckUtils]: 41: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,319 INFO L273 TraceCheckUtils]: 42: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,320 INFO L273 TraceCheckUtils]: 43: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,320 INFO L273 TraceCheckUtils]: 44: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,320 INFO L273 TraceCheckUtils]: 45: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,320 INFO L273 TraceCheckUtils]: 46: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:29,320 INFO L273 TraceCheckUtils]: 47: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:29,320 INFO L273 TraceCheckUtils]: 48: Hoare triple {12984#true} assume !(~i~1 < 1000); {12984#true} is VALID [2018-11-23 12:27:29,320 INFO L256 TraceCheckUtils]: 49: Hoare triple {12984#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:27:29,320 INFO L273 TraceCheckUtils]: 50: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12984#true} is VALID [2018-11-23 12:27:29,320 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:29,321 INFO L273 TraceCheckUtils]: 52: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:29,321 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:29,321 INFO L273 TraceCheckUtils]: 54: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:29,321 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:29,321 INFO L273 TraceCheckUtils]: 56: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:29,321 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:29,321 INFO L273 TraceCheckUtils]: 58: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:29,321 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:29,321 INFO L273 TraceCheckUtils]: 60: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:29,322 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:29,322 INFO L273 TraceCheckUtils]: 62: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:29,322 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:29,322 INFO L273 TraceCheckUtils]: 64: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:29,322 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 1000); {12984#true} is VALID [2018-11-23 12:27:29,322 INFO L273 TraceCheckUtils]: 66: Hoare triple {12984#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:27:29,322 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:29,322 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12984#true} #70#return; {12984#true} is VALID [2018-11-23 12:27:29,322 INFO L273 TraceCheckUtils]: 69: Hoare triple {12984#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12984#true} is VALID [2018-11-23 12:27:29,323 INFO L256 TraceCheckUtils]: 70: Hoare triple {12984#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:27:29,323 INFO L273 TraceCheckUtils]: 71: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12984#true} is VALID [2018-11-23 12:27:29,323 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:29,323 INFO L273 TraceCheckUtils]: 73: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:29,323 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:29,323 INFO L273 TraceCheckUtils]: 75: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:29,323 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:29,323 INFO L273 TraceCheckUtils]: 77: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:29,323 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:29,323 INFO L273 TraceCheckUtils]: 79: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:29,324 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:29,324 INFO L273 TraceCheckUtils]: 81: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:29,324 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:29,324 INFO L273 TraceCheckUtils]: 83: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:29,324 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:29,324 INFO L273 TraceCheckUtils]: 85: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:29,324 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 1000); {12984#true} is VALID [2018-11-23 12:27:29,324 INFO L273 TraceCheckUtils]: 87: Hoare triple {12984#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:27:29,324 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:29,325 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12984#true} #72#return; {12984#true} is VALID [2018-11-23 12:27:29,325 INFO L273 TraceCheckUtils]: 90: Hoare triple {12984#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {13281#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:29,325 INFO L273 TraceCheckUtils]: 91: Hoare triple {13281#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13281#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:29,326 INFO L273 TraceCheckUtils]: 92: Hoare triple {13281#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13288#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:29,326 INFO L273 TraceCheckUtils]: 93: Hoare triple {13288#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13288#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:29,327 INFO L273 TraceCheckUtils]: 94: Hoare triple {13288#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13295#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:29,327 INFO L273 TraceCheckUtils]: 95: Hoare triple {13295#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13295#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:29,327 INFO L273 TraceCheckUtils]: 96: Hoare triple {13295#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13302#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:29,328 INFO L273 TraceCheckUtils]: 97: Hoare triple {13302#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13302#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:29,329 INFO L273 TraceCheckUtils]: 98: Hoare triple {13302#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13309#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:29,329 INFO L273 TraceCheckUtils]: 99: Hoare triple {13309#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13309#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:29,330 INFO L273 TraceCheckUtils]: 100: Hoare triple {13309#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13316#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:29,331 INFO L273 TraceCheckUtils]: 101: Hoare triple {13316#(<= main_~i~2 5)} assume !(~i~2 < 999); {12985#false} is VALID [2018-11-23 12:27:29,331 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:27:29,331 INFO L256 TraceCheckUtils]: 103: Hoare triple {12985#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {12985#false} is VALID [2018-11-23 12:27:29,331 INFO L273 TraceCheckUtils]: 104: Hoare triple {12985#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12985#false} is VALID [2018-11-23 12:27:29,331 INFO L273 TraceCheckUtils]: 105: Hoare triple {12985#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:27:29,332 INFO L273 TraceCheckUtils]: 106: Hoare triple {12985#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12985#false} is VALID [2018-11-23 12:27:29,332 INFO L273 TraceCheckUtils]: 107: Hoare triple {12985#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:27:29,332 INFO L273 TraceCheckUtils]: 108: Hoare triple {12985#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12985#false} is VALID [2018-11-23 12:27:29,332 INFO L273 TraceCheckUtils]: 109: Hoare triple {12985#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:27:29,332 INFO L273 TraceCheckUtils]: 110: Hoare triple {12985#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12985#false} is VALID [2018-11-23 12:27:29,332 INFO L273 TraceCheckUtils]: 111: Hoare triple {12985#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:27:29,333 INFO L273 TraceCheckUtils]: 112: Hoare triple {12985#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12985#false} is VALID [2018-11-23 12:27:29,333 INFO L273 TraceCheckUtils]: 113: Hoare triple {12985#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:27:29,333 INFO L273 TraceCheckUtils]: 114: Hoare triple {12985#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12985#false} is VALID [2018-11-23 12:27:29,333 INFO L273 TraceCheckUtils]: 115: Hoare triple {12985#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:27:29,333 INFO L273 TraceCheckUtils]: 116: Hoare triple {12985#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12985#false} is VALID [2018-11-23 12:27:29,334 INFO L273 TraceCheckUtils]: 117: Hoare triple {12985#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:27:29,334 INFO L273 TraceCheckUtils]: 118: Hoare triple {12985#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12985#false} is VALID [2018-11-23 12:27:29,334 INFO L273 TraceCheckUtils]: 119: Hoare triple {12985#false} assume !(~i~0 < 1000); {12985#false} is VALID [2018-11-23 12:27:29,334 INFO L273 TraceCheckUtils]: 120: Hoare triple {12985#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {12985#false} is VALID [2018-11-23 12:27:29,334 INFO L273 TraceCheckUtils]: 121: Hoare triple {12985#false} assume true; {12985#false} is VALID [2018-11-23 12:27:29,335 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12985#false} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:27:29,335 INFO L273 TraceCheckUtils]: 123: Hoare triple {12985#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {12985#false} is VALID [2018-11-23 12:27:29,335 INFO L273 TraceCheckUtils]: 124: Hoare triple {12985#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12985#false} is VALID [2018-11-23 12:27:29,335 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:27:29,341 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:27:29,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:29,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2018-11-23 12:27:29,361 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:27:29,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:29,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:27:29,461 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:27:29,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:27:29,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:27:29,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:27:29,462 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2018-11-23 12:27:30,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:30,056 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-11-23 12:27:30,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:27:30,056 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:27:30,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:27:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:27:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:27:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:27:30,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 109 transitions. [2018-11-23 12:27:30,198 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:27:30,201 INFO L225 Difference]: With dead ends: 135 [2018-11-23 12:27:30,201 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:27:30,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:27:30,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:27:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-23 12:27:30,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:30,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 93 states. [2018-11-23 12:27:30,249 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 93 states. [2018-11-23 12:27:30,249 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 93 states. [2018-11-23 12:27:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:30,251 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:27:30,252 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:27:30,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:30,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:30,252 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 95 states. [2018-11-23 12:27:30,252 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 95 states. [2018-11-23 12:27:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:30,254 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:27:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:27:30,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:30,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:30,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:30,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 12:27:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-11-23 12:27:30,257 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2018-11-23 12:27:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:30,257 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-11-23 12:27:30,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:27:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-23 12:27:30,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:27:30,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:30,258 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:27:30,258 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:30,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:30,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1514657069, now seen corresponding path program 22 times [2018-11-23 12:27:30,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:30,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:30,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:30,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:30,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:30,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:27:30,723 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:27:30,723 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:30,723 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:27:30,724 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret12 := main(); {13919#true} is VALID [2018-11-23 12:27:30,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13921#(= main_~i~1 0)} is VALID [2018-11-23 12:27:30,725 INFO L273 TraceCheckUtils]: 6: Hoare triple {13921#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13921#(= main_~i~1 0)} is VALID [2018-11-23 12:27:30,725 INFO L273 TraceCheckUtils]: 7: Hoare triple {13921#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:30,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:30,726 INFO L273 TraceCheckUtils]: 9: Hoare triple {13922#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:30,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:30,727 INFO L273 TraceCheckUtils]: 11: Hoare triple {13923#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:30,727 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:30,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {13924#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:30,733 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:30,734 INFO L273 TraceCheckUtils]: 15: Hoare triple {13925#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:30,734 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:30,735 INFO L273 TraceCheckUtils]: 17: Hoare triple {13926#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:30,735 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:30,735 INFO L273 TraceCheckUtils]: 19: Hoare triple {13927#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:30,736 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:30,736 INFO L273 TraceCheckUtils]: 21: Hoare triple {13928#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:30,736 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:30,737 INFO L273 TraceCheckUtils]: 23: Hoare triple {13929#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:30,738 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:30,738 INFO L273 TraceCheckUtils]: 25: Hoare triple {13930#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:30,739 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:30,739 INFO L273 TraceCheckUtils]: 27: Hoare triple {13931#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:30,740 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:30,741 INFO L273 TraceCheckUtils]: 29: Hoare triple {13932#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:30,741 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:30,742 INFO L273 TraceCheckUtils]: 31: Hoare triple {13933#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:30,742 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:30,743 INFO L273 TraceCheckUtils]: 33: Hoare triple {13934#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:30,744 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:30,744 INFO L273 TraceCheckUtils]: 35: Hoare triple {13935#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:30,745 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:30,745 INFO L273 TraceCheckUtils]: 37: Hoare triple {13936#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:30,746 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:30,747 INFO L273 TraceCheckUtils]: 39: Hoare triple {13937#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:30,747 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:30,748 INFO L273 TraceCheckUtils]: 41: Hoare triple {13938#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:30,748 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:30,749 INFO L273 TraceCheckUtils]: 43: Hoare triple {13939#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:30,749 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:30,750 INFO L273 TraceCheckUtils]: 45: Hoare triple {13940#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:30,751 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:30,751 INFO L273 TraceCheckUtils]: 47: Hoare triple {13941#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:30,752 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:30,752 INFO L273 TraceCheckUtils]: 49: Hoare triple {13942#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13943#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:30,753 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 1000); {13920#false} is VALID [2018-11-23 12:27:30,753 INFO L256 TraceCheckUtils]: 51: Hoare triple {13920#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {13919#true} is VALID [2018-11-23 12:27:30,753 INFO L273 TraceCheckUtils]: 52: Hoare triple {13919#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13919#true} is VALID [2018-11-23 12:27:30,754 INFO L273 TraceCheckUtils]: 53: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,754 INFO L273 TraceCheckUtils]: 54: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,754 INFO L273 TraceCheckUtils]: 55: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,754 INFO L273 TraceCheckUtils]: 56: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,754 INFO L273 TraceCheckUtils]: 57: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,755 INFO L273 TraceCheckUtils]: 58: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,755 INFO L273 TraceCheckUtils]: 59: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,755 INFO L273 TraceCheckUtils]: 60: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,755 INFO L273 TraceCheckUtils]: 61: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,755 INFO L273 TraceCheckUtils]: 62: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,755 INFO L273 TraceCheckUtils]: 63: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,756 INFO L273 TraceCheckUtils]: 64: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,756 INFO L273 TraceCheckUtils]: 65: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,756 INFO L273 TraceCheckUtils]: 66: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,756 INFO L273 TraceCheckUtils]: 67: Hoare triple {13919#true} assume !(~i~0 < 1000); {13919#true} is VALID [2018-11-23 12:27:30,756 INFO L273 TraceCheckUtils]: 68: Hoare triple {13919#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:27:30,756 INFO L273 TraceCheckUtils]: 69: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:30,756 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13919#true} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:27:30,756 INFO L273 TraceCheckUtils]: 71: Hoare triple {13920#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:27:30,756 INFO L256 TraceCheckUtils]: 72: Hoare triple {13920#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {13919#true} is VALID [2018-11-23 12:27:30,757 INFO L273 TraceCheckUtils]: 73: Hoare triple {13919#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13919#true} is VALID [2018-11-23 12:27:30,757 INFO L273 TraceCheckUtils]: 74: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,757 INFO L273 TraceCheckUtils]: 75: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,757 INFO L273 TraceCheckUtils]: 76: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,757 INFO L273 TraceCheckUtils]: 77: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,757 INFO L273 TraceCheckUtils]: 78: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,757 INFO L273 TraceCheckUtils]: 79: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,757 INFO L273 TraceCheckUtils]: 80: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,757 INFO L273 TraceCheckUtils]: 81: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,758 INFO L273 TraceCheckUtils]: 82: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,758 INFO L273 TraceCheckUtils]: 83: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,758 INFO L273 TraceCheckUtils]: 84: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,758 INFO L273 TraceCheckUtils]: 85: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,758 INFO L273 TraceCheckUtils]: 86: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,758 INFO L273 TraceCheckUtils]: 87: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,758 INFO L273 TraceCheckUtils]: 88: Hoare triple {13919#true} assume !(~i~0 < 1000); {13919#true} is VALID [2018-11-23 12:27:30,758 INFO L273 TraceCheckUtils]: 89: Hoare triple {13919#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:27:30,758 INFO L273 TraceCheckUtils]: 90: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:30,759 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13919#true} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:27:30,759 INFO L273 TraceCheckUtils]: 92: Hoare triple {13920#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {13920#false} is VALID [2018-11-23 12:27:30,759 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:30,759 INFO L273 TraceCheckUtils]: 94: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:30,759 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:30,759 INFO L273 TraceCheckUtils]: 96: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:30,759 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:30,759 INFO L273 TraceCheckUtils]: 98: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:30,759 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:30,759 INFO L273 TraceCheckUtils]: 100: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:30,760 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:30,760 INFO L273 TraceCheckUtils]: 102: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:30,760 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:30,760 INFO L273 TraceCheckUtils]: 104: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:30,760 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 999); {13920#false} is VALID [2018-11-23 12:27:30,760 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:27:30,760 INFO L256 TraceCheckUtils]: 107: Hoare triple {13920#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {13919#true} is VALID [2018-11-23 12:27:30,760 INFO L273 TraceCheckUtils]: 108: Hoare triple {13919#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13919#true} is VALID [2018-11-23 12:27:30,760 INFO L273 TraceCheckUtils]: 109: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,761 INFO L273 TraceCheckUtils]: 110: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,761 INFO L273 TraceCheckUtils]: 111: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,761 INFO L273 TraceCheckUtils]: 112: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,761 INFO L273 TraceCheckUtils]: 113: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,761 INFO L273 TraceCheckUtils]: 114: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,761 INFO L273 TraceCheckUtils]: 115: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,761 INFO L273 TraceCheckUtils]: 116: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,761 INFO L273 TraceCheckUtils]: 117: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,761 INFO L273 TraceCheckUtils]: 118: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,762 INFO L273 TraceCheckUtils]: 119: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,762 INFO L273 TraceCheckUtils]: 120: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,762 INFO L273 TraceCheckUtils]: 121: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:30,762 INFO L273 TraceCheckUtils]: 122: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:30,762 INFO L273 TraceCheckUtils]: 123: Hoare triple {13919#true} assume !(~i~0 < 1000); {13919#true} is VALID [2018-11-23 12:27:30,762 INFO L273 TraceCheckUtils]: 124: Hoare triple {13919#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:27:30,762 INFO L273 TraceCheckUtils]: 125: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:30,762 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13919#true} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:27:30,762 INFO L273 TraceCheckUtils]: 127: Hoare triple {13920#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {13920#false} is VALID [2018-11-23 12:27:30,763 INFO L273 TraceCheckUtils]: 128: Hoare triple {13920#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {13920#false} is VALID [2018-11-23 12:27:30,763 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:27:30,770 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:27:30,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:30,770 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:27:30,778 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:30,841 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:30,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:30,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:31,186 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:27:31,187 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:27:31,187 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:31,187 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:27:31,188 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret12 := main(); {13919#true} is VALID [2018-11-23 12:27:31,188 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13962#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:31,189 INFO L273 TraceCheckUtils]: 6: Hoare triple {13962#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13962#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:31,189 INFO L273 TraceCheckUtils]: 7: Hoare triple {13962#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:31,190 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:31,190 INFO L273 TraceCheckUtils]: 9: Hoare triple {13922#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:31,191 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:31,191 INFO L273 TraceCheckUtils]: 11: Hoare triple {13923#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:31,191 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:31,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {13924#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:31,192 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:31,193 INFO L273 TraceCheckUtils]: 15: Hoare triple {13925#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:31,193 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:31,194 INFO L273 TraceCheckUtils]: 17: Hoare triple {13926#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:31,194 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:31,195 INFO L273 TraceCheckUtils]: 19: Hoare triple {13927#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:31,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:31,196 INFO L273 TraceCheckUtils]: 21: Hoare triple {13928#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:31,197 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:31,197 INFO L273 TraceCheckUtils]: 23: Hoare triple {13929#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:31,198 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:31,198 INFO L273 TraceCheckUtils]: 25: Hoare triple {13930#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:31,199 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:31,200 INFO L273 TraceCheckUtils]: 27: Hoare triple {13931#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:31,200 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:31,201 INFO L273 TraceCheckUtils]: 29: Hoare triple {13932#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:31,201 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:31,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {13933#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:31,202 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:31,203 INFO L273 TraceCheckUtils]: 33: Hoare triple {13934#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:31,204 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:31,204 INFO L273 TraceCheckUtils]: 35: Hoare triple {13935#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:31,205 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:31,205 INFO L273 TraceCheckUtils]: 37: Hoare triple {13936#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:31,206 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:31,207 INFO L273 TraceCheckUtils]: 39: Hoare triple {13937#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:31,207 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:31,208 INFO L273 TraceCheckUtils]: 41: Hoare triple {13938#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:31,208 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:31,209 INFO L273 TraceCheckUtils]: 43: Hoare triple {13939#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:31,209 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:31,210 INFO L273 TraceCheckUtils]: 45: Hoare triple {13940#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:31,211 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:31,211 INFO L273 TraceCheckUtils]: 47: Hoare triple {13941#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:31,212 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:31,213 INFO L273 TraceCheckUtils]: 49: Hoare triple {13942#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13943#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:31,213 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 1000); {13920#false} is VALID [2018-11-23 12:27:31,213 INFO L256 TraceCheckUtils]: 51: Hoare triple {13920#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {13920#false} is VALID [2018-11-23 12:27:31,214 INFO L273 TraceCheckUtils]: 52: Hoare triple {13920#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13920#false} is VALID [2018-11-23 12:27:31,214 INFO L273 TraceCheckUtils]: 53: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,214 INFO L273 TraceCheckUtils]: 54: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,214 INFO L273 TraceCheckUtils]: 55: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,214 INFO L273 TraceCheckUtils]: 56: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,215 INFO L273 TraceCheckUtils]: 57: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,215 INFO L273 TraceCheckUtils]: 58: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,215 INFO L273 TraceCheckUtils]: 59: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,215 INFO L273 TraceCheckUtils]: 60: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,215 INFO L273 TraceCheckUtils]: 61: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,215 INFO L273 TraceCheckUtils]: 62: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,216 INFO L273 TraceCheckUtils]: 63: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,216 INFO L273 TraceCheckUtils]: 64: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,216 INFO L273 TraceCheckUtils]: 65: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,216 INFO L273 TraceCheckUtils]: 66: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,216 INFO L273 TraceCheckUtils]: 67: Hoare triple {13920#false} assume !(~i~0 < 1000); {13920#false} is VALID [2018-11-23 12:27:31,217 INFO L273 TraceCheckUtils]: 68: Hoare triple {13920#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:27:31,217 INFO L273 TraceCheckUtils]: 69: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:27:31,217 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13920#false} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:27:31,217 INFO L273 TraceCheckUtils]: 71: Hoare triple {13920#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:27:31,217 INFO L256 TraceCheckUtils]: 72: Hoare triple {13920#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {13920#false} is VALID [2018-11-23 12:27:31,218 INFO L273 TraceCheckUtils]: 73: Hoare triple {13920#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13920#false} is VALID [2018-11-23 12:27:31,218 INFO L273 TraceCheckUtils]: 74: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,218 INFO L273 TraceCheckUtils]: 75: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,218 INFO L273 TraceCheckUtils]: 76: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,218 INFO L273 TraceCheckUtils]: 77: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,218 INFO L273 TraceCheckUtils]: 78: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,218 INFO L273 TraceCheckUtils]: 79: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,219 INFO L273 TraceCheckUtils]: 80: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,219 INFO L273 TraceCheckUtils]: 81: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,219 INFO L273 TraceCheckUtils]: 82: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,219 INFO L273 TraceCheckUtils]: 83: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,219 INFO L273 TraceCheckUtils]: 84: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,219 INFO L273 TraceCheckUtils]: 85: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,219 INFO L273 TraceCheckUtils]: 86: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,219 INFO L273 TraceCheckUtils]: 87: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,219 INFO L273 TraceCheckUtils]: 88: Hoare triple {13920#false} assume !(~i~0 < 1000); {13920#false} is VALID [2018-11-23 12:27:31,220 INFO L273 TraceCheckUtils]: 89: Hoare triple {13920#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:27:31,220 INFO L273 TraceCheckUtils]: 90: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:27:31,220 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13920#false} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:27:31,220 INFO L273 TraceCheckUtils]: 92: Hoare triple {13920#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {13920#false} is VALID [2018-11-23 12:27:31,220 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:31,220 INFO L273 TraceCheckUtils]: 94: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:31,220 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:31,220 INFO L273 TraceCheckUtils]: 96: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:31,220 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:31,220 INFO L273 TraceCheckUtils]: 98: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:31,221 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:31,221 INFO L273 TraceCheckUtils]: 100: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:31,221 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:31,221 INFO L273 TraceCheckUtils]: 102: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:31,221 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:31,221 INFO L273 TraceCheckUtils]: 104: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:31,221 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 999); {13920#false} is VALID [2018-11-23 12:27:31,221 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:27:31,221 INFO L256 TraceCheckUtils]: 107: Hoare triple {13920#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {13920#false} is VALID [2018-11-23 12:27:31,222 INFO L273 TraceCheckUtils]: 108: Hoare triple {13920#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13920#false} is VALID [2018-11-23 12:27:31,222 INFO L273 TraceCheckUtils]: 109: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,222 INFO L273 TraceCheckUtils]: 110: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,222 INFO L273 TraceCheckUtils]: 111: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,222 INFO L273 TraceCheckUtils]: 112: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,222 INFO L273 TraceCheckUtils]: 113: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,222 INFO L273 TraceCheckUtils]: 114: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,222 INFO L273 TraceCheckUtils]: 115: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,222 INFO L273 TraceCheckUtils]: 116: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,223 INFO L273 TraceCheckUtils]: 117: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,223 INFO L273 TraceCheckUtils]: 118: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,223 INFO L273 TraceCheckUtils]: 119: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,223 INFO L273 TraceCheckUtils]: 120: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,223 INFO L273 TraceCheckUtils]: 121: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:31,223 INFO L273 TraceCheckUtils]: 122: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:31,223 INFO L273 TraceCheckUtils]: 123: Hoare triple {13920#false} assume !(~i~0 < 1000); {13920#false} is VALID [2018-11-23 12:27:31,223 INFO L273 TraceCheckUtils]: 124: Hoare triple {13920#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:27:31,223 INFO L273 TraceCheckUtils]: 125: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:27:31,224 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13920#false} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:27:31,224 INFO L273 TraceCheckUtils]: 127: Hoare triple {13920#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {13920#false} is VALID [2018-11-23 12:27:31,224 INFO L273 TraceCheckUtils]: 128: Hoare triple {13920#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {13920#false} is VALID [2018-11-23 12:27:31,224 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:27:31,234 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:27:31,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:31,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:27:31,259 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:27:31,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:31,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:27:31,342 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:27:31,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:27:31,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:27:31,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:31,344 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2018-11-23 12:27:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,325 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 12:27:32,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:27:32,325 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:27:32,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:27:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:32,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:27:32,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 98 transitions. [2018-11-23 12:27:32,423 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:27:32,425 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:27:32,425 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:27:32,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:32,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:27:32,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-23 12:27:32,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:32,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-23 12:27:32,470 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-23 12:27:32,470 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-23 12:27:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,471 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:27:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:27:32,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:32,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:32,472 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-23 12:27:32,472 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-23 12:27:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,474 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:27:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:27:32,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:32,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:32,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:32,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:27:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-23 12:27:32,477 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2018-11-23 12:27:32,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:32,477 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-23 12:27:32,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:27:32,477 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:27:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 12:27:32,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:32,479 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:27:32,479 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:32,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:32,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1289554703, now seen corresponding path program 23 times [2018-11-23 12:27:32,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:32,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:32,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:32,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:32,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:33,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:27:33,385 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:27:33,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:27:33,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:27:33,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret12 := main(); {14872#true} is VALID [2018-11-23 12:27:33,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14874#(= main_~i~1 0)} is VALID [2018-11-23 12:27:33,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {14874#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14874#(= main_~i~1 0)} is VALID [2018-11-23 12:27:33,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {14874#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14875#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:33,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {14875#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14875#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:33,391 INFO L273 TraceCheckUtils]: 9: Hoare triple {14875#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14876#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:33,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {14876#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14876#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:33,391 INFO L273 TraceCheckUtils]: 11: Hoare triple {14876#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14877#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:33,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {14877#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14877#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:33,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {14877#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14878#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:33,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {14878#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14878#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:33,393 INFO L273 TraceCheckUtils]: 15: Hoare triple {14878#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14879#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:33,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {14879#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14879#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:33,394 INFO L273 TraceCheckUtils]: 17: Hoare triple {14879#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14880#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:33,395 INFO L273 TraceCheckUtils]: 18: Hoare triple {14880#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14880#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:33,396 INFO L273 TraceCheckUtils]: 19: Hoare triple {14880#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14881#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:33,396 INFO L273 TraceCheckUtils]: 20: Hoare triple {14881#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14881#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:33,397 INFO L273 TraceCheckUtils]: 21: Hoare triple {14881#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14882#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:33,398 INFO L273 TraceCheckUtils]: 22: Hoare triple {14882#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14882#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:33,398 INFO L273 TraceCheckUtils]: 23: Hoare triple {14882#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14883#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:33,399 INFO L273 TraceCheckUtils]: 24: Hoare triple {14883#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14883#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:33,399 INFO L273 TraceCheckUtils]: 25: Hoare triple {14883#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14884#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:33,400 INFO L273 TraceCheckUtils]: 26: Hoare triple {14884#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14884#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:33,401 INFO L273 TraceCheckUtils]: 27: Hoare triple {14884#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14885#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:33,401 INFO L273 TraceCheckUtils]: 28: Hoare triple {14885#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14885#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:33,402 INFO L273 TraceCheckUtils]: 29: Hoare triple {14885#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14886#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:33,403 INFO L273 TraceCheckUtils]: 30: Hoare triple {14886#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14886#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:33,403 INFO L273 TraceCheckUtils]: 31: Hoare triple {14886#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14887#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:33,404 INFO L273 TraceCheckUtils]: 32: Hoare triple {14887#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14887#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:33,404 INFO L273 TraceCheckUtils]: 33: Hoare triple {14887#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14888#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:33,405 INFO L273 TraceCheckUtils]: 34: Hoare triple {14888#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14888#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:33,406 INFO L273 TraceCheckUtils]: 35: Hoare triple {14888#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14889#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:33,406 INFO L273 TraceCheckUtils]: 36: Hoare triple {14889#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14889#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:33,407 INFO L273 TraceCheckUtils]: 37: Hoare triple {14889#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14890#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:33,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {14890#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14890#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:33,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {14890#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14891#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:33,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {14891#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14891#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:33,410 INFO L273 TraceCheckUtils]: 41: Hoare triple {14891#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14892#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:33,410 INFO L273 TraceCheckUtils]: 42: Hoare triple {14892#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14892#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:33,411 INFO L273 TraceCheckUtils]: 43: Hoare triple {14892#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14893#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:33,411 INFO L273 TraceCheckUtils]: 44: Hoare triple {14893#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14893#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:33,412 INFO L273 TraceCheckUtils]: 45: Hoare triple {14893#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14894#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:33,413 INFO L273 TraceCheckUtils]: 46: Hoare triple {14894#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14894#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:33,413 INFO L273 TraceCheckUtils]: 47: Hoare triple {14894#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14895#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:33,414 INFO L273 TraceCheckUtils]: 48: Hoare triple {14895#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14895#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:33,415 INFO L273 TraceCheckUtils]: 49: Hoare triple {14895#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14896#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:33,415 INFO L273 TraceCheckUtils]: 50: Hoare triple {14896#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14896#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:33,416 INFO L273 TraceCheckUtils]: 51: Hoare triple {14896#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14897#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:33,417 INFO L273 TraceCheckUtils]: 52: Hoare triple {14897#(<= main_~i~1 23)} assume !(~i~1 < 1000); {14873#false} is VALID [2018-11-23 12:27:33,417 INFO L256 TraceCheckUtils]: 53: Hoare triple {14873#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:27:33,417 INFO L273 TraceCheckUtils]: 54: Hoare triple {14872#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {14872#true} is VALID [2018-11-23 12:27:33,417 INFO L273 TraceCheckUtils]: 55: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,417 INFO L273 TraceCheckUtils]: 56: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,418 INFO L273 TraceCheckUtils]: 57: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,418 INFO L273 TraceCheckUtils]: 58: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,418 INFO L273 TraceCheckUtils]: 59: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,418 INFO L273 TraceCheckUtils]: 60: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,418 INFO L273 TraceCheckUtils]: 61: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,418 INFO L273 TraceCheckUtils]: 62: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,419 INFO L273 TraceCheckUtils]: 63: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,419 INFO L273 TraceCheckUtils]: 64: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,419 INFO L273 TraceCheckUtils]: 65: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,419 INFO L273 TraceCheckUtils]: 66: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,419 INFO L273 TraceCheckUtils]: 67: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,420 INFO L273 TraceCheckUtils]: 68: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,420 INFO L273 TraceCheckUtils]: 69: Hoare triple {14872#true} assume !(~i~0 < 1000); {14872#true} is VALID [2018-11-23 12:27:33,420 INFO L273 TraceCheckUtils]: 70: Hoare triple {14872#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:27:33,420 INFO L273 TraceCheckUtils]: 71: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:27:33,420 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14872#true} {14873#false} #70#return; {14873#false} is VALID [2018-11-23 12:27:33,420 INFO L273 TraceCheckUtils]: 73: Hoare triple {14873#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:27:33,420 INFO L256 TraceCheckUtils]: 74: Hoare triple {14873#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:27:33,420 INFO L273 TraceCheckUtils]: 75: Hoare triple {14872#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {14872#true} is VALID [2018-11-23 12:27:33,420 INFO L273 TraceCheckUtils]: 76: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,421 INFO L273 TraceCheckUtils]: 77: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,421 INFO L273 TraceCheckUtils]: 78: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,421 INFO L273 TraceCheckUtils]: 79: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,421 INFO L273 TraceCheckUtils]: 80: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,421 INFO L273 TraceCheckUtils]: 81: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,421 INFO L273 TraceCheckUtils]: 82: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,421 INFO L273 TraceCheckUtils]: 83: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,421 INFO L273 TraceCheckUtils]: 84: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,421 INFO L273 TraceCheckUtils]: 85: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,421 INFO L273 TraceCheckUtils]: 86: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,422 INFO L273 TraceCheckUtils]: 87: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,422 INFO L273 TraceCheckUtils]: 88: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,422 INFO L273 TraceCheckUtils]: 89: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,422 INFO L273 TraceCheckUtils]: 90: Hoare triple {14872#true} assume !(~i~0 < 1000); {14872#true} is VALID [2018-11-23 12:27:33,422 INFO L273 TraceCheckUtils]: 91: Hoare triple {14872#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:27:33,422 INFO L273 TraceCheckUtils]: 92: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:27:33,422 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14872#true} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:27:33,422 INFO L273 TraceCheckUtils]: 94: Hoare triple {14873#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {14873#false} is VALID [2018-11-23 12:27:33,422 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:27:33,423 INFO L273 TraceCheckUtils]: 96: Hoare triple {14873#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14873#false} is VALID [2018-11-23 12:27:33,423 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:27:33,423 INFO L273 TraceCheckUtils]: 98: Hoare triple {14873#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14873#false} is VALID [2018-11-23 12:27:33,423 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:27:33,423 INFO L273 TraceCheckUtils]: 100: Hoare triple {14873#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14873#false} is VALID [2018-11-23 12:27:33,423 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:27:33,423 INFO L273 TraceCheckUtils]: 102: Hoare triple {14873#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14873#false} is VALID [2018-11-23 12:27:33,423 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:27:33,423 INFO L273 TraceCheckUtils]: 104: Hoare triple {14873#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14873#false} is VALID [2018-11-23 12:27:33,424 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:27:33,424 INFO L273 TraceCheckUtils]: 106: Hoare triple {14873#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14873#false} is VALID [2018-11-23 12:27:33,424 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 999); {14873#false} is VALID [2018-11-23 12:27:33,424 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:27:33,424 INFO L256 TraceCheckUtils]: 109: Hoare triple {14873#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:27:33,424 INFO L273 TraceCheckUtils]: 110: Hoare triple {14872#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {14872#true} is VALID [2018-11-23 12:27:33,424 INFO L273 TraceCheckUtils]: 111: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,424 INFO L273 TraceCheckUtils]: 112: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,424 INFO L273 TraceCheckUtils]: 113: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,425 INFO L273 TraceCheckUtils]: 114: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,425 INFO L273 TraceCheckUtils]: 115: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,425 INFO L273 TraceCheckUtils]: 116: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,425 INFO L273 TraceCheckUtils]: 117: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,425 INFO L273 TraceCheckUtils]: 118: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,425 INFO L273 TraceCheckUtils]: 119: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,425 INFO L273 TraceCheckUtils]: 120: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,425 INFO L273 TraceCheckUtils]: 121: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,425 INFO L273 TraceCheckUtils]: 122: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,426 INFO L273 TraceCheckUtils]: 123: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:27:33,426 INFO L273 TraceCheckUtils]: 124: Hoare triple {14872#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14872#true} is VALID [2018-11-23 12:27:33,426 INFO L273 TraceCheckUtils]: 125: Hoare triple {14872#true} assume !(~i~0 < 1000); {14872#true} is VALID [2018-11-23 12:27:33,426 INFO L273 TraceCheckUtils]: 126: Hoare triple {14872#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:27:33,426 INFO L273 TraceCheckUtils]: 127: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:27:33,426 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14872#true} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:27:33,426 INFO L273 TraceCheckUtils]: 129: Hoare triple {14873#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {14873#false} is VALID [2018-11-23 12:27:33,426 INFO L273 TraceCheckUtils]: 130: Hoare triple {14873#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {14873#false} is VALID [2018-11-23 12:27:33,427 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:27:33,434 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:27:33,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:33,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:27:33,445 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:37,824 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-23 12:27:37,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:37,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:38,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:27:38,638 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:27:38,638 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:27:38,638 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:27:38,638 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret12 := main(); {14872#true} is VALID [2018-11-23 12:27:38,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14872#true} is VALID [2018-11-23 12:27:38,639 INFO L273 TraceCheckUtils]: 6: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,639 INFO L273 TraceCheckUtils]: 10: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,639 INFO L273 TraceCheckUtils]: 11: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,640 INFO L273 TraceCheckUtils]: 15: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,640 INFO L273 TraceCheckUtils]: 16: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,641 INFO L273 TraceCheckUtils]: 21: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,641 INFO L273 TraceCheckUtils]: 22: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,641 INFO L273 TraceCheckUtils]: 23: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,641 INFO L273 TraceCheckUtils]: 24: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,641 INFO L273 TraceCheckUtils]: 25: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,641 INFO L273 TraceCheckUtils]: 26: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,641 INFO L273 TraceCheckUtils]: 27: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,642 INFO L273 TraceCheckUtils]: 28: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,642 INFO L273 TraceCheckUtils]: 29: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,642 INFO L273 TraceCheckUtils]: 30: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,642 INFO L273 TraceCheckUtils]: 31: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,642 INFO L273 TraceCheckUtils]: 32: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,642 INFO L273 TraceCheckUtils]: 33: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,642 INFO L273 TraceCheckUtils]: 34: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,642 INFO L273 TraceCheckUtils]: 35: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,642 INFO L273 TraceCheckUtils]: 36: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,643 INFO L273 TraceCheckUtils]: 37: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,643 INFO L273 TraceCheckUtils]: 38: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,643 INFO L273 TraceCheckUtils]: 39: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,643 INFO L273 TraceCheckUtils]: 40: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,643 INFO L273 TraceCheckUtils]: 41: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,643 INFO L273 TraceCheckUtils]: 42: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,643 INFO L273 TraceCheckUtils]: 43: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,643 INFO L273 TraceCheckUtils]: 44: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,643 INFO L273 TraceCheckUtils]: 45: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,644 INFO L273 TraceCheckUtils]: 46: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,644 INFO L273 TraceCheckUtils]: 47: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,644 INFO L273 TraceCheckUtils]: 48: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,644 INFO L273 TraceCheckUtils]: 49: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,644 INFO L273 TraceCheckUtils]: 50: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:27:38,644 INFO L273 TraceCheckUtils]: 51: Hoare triple {14872#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14872#true} is VALID [2018-11-23 12:27:38,644 INFO L273 TraceCheckUtils]: 52: Hoare triple {14872#true} assume !(~i~1 < 1000); {14872#true} is VALID [2018-11-23 12:27:38,644 INFO L256 TraceCheckUtils]: 53: Hoare triple {14872#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:27:38,645 INFO L273 TraceCheckUtils]: 54: Hoare triple {14872#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15063#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:27:38,645 INFO L273 TraceCheckUtils]: 55: Hoare triple {15063#(<= mapavg_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15063#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:27:38,645 INFO L273 TraceCheckUtils]: 56: Hoare triple {15063#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15070#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:27:38,646 INFO L273 TraceCheckUtils]: 57: Hoare triple {15070#(<= mapavg_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15070#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:27:38,646 INFO L273 TraceCheckUtils]: 58: Hoare triple {15070#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15077#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:27:38,647 INFO L273 TraceCheckUtils]: 59: Hoare triple {15077#(<= mapavg_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15077#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:27:38,647 INFO L273 TraceCheckUtils]: 60: Hoare triple {15077#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15084#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:27:38,647 INFO L273 TraceCheckUtils]: 61: Hoare triple {15084#(<= mapavg_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15084#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:27:38,648 INFO L273 TraceCheckUtils]: 62: Hoare triple {15084#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15091#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:27:38,649 INFO L273 TraceCheckUtils]: 63: Hoare triple {15091#(<= mapavg_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15091#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:27:38,649 INFO L273 TraceCheckUtils]: 64: Hoare triple {15091#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15098#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:27:38,650 INFO L273 TraceCheckUtils]: 65: Hoare triple {15098#(<= mapavg_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15098#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:27:38,651 INFO L273 TraceCheckUtils]: 66: Hoare triple {15098#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15105#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:27:38,651 INFO L273 TraceCheckUtils]: 67: Hoare triple {15105#(<= mapavg_~i~0 6)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15105#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:27:38,652 INFO L273 TraceCheckUtils]: 68: Hoare triple {15105#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15112#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:27:38,652 INFO L273 TraceCheckUtils]: 69: Hoare triple {15112#(<= mapavg_~i~0 7)} assume !(~i~0 < 1000); {14873#false} is VALID [2018-11-23 12:27:38,653 INFO L273 TraceCheckUtils]: 70: Hoare triple {14873#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:27:38,653 INFO L273 TraceCheckUtils]: 71: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:27:38,653 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14873#false} {14872#true} #70#return; {14873#false} is VALID [2018-11-23 12:27:38,653 INFO L273 TraceCheckUtils]: 73: Hoare triple {14873#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:27:38,653 INFO L256 TraceCheckUtils]: 74: Hoare triple {14873#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {14873#false} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 75: Hoare triple {14873#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {14873#false} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 76: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 77: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 78: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 79: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:27:38,655 INFO L273 TraceCheckUtils]: 80: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:27:38,655 INFO L273 TraceCheckUtils]: 81: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:27:38,655 INFO L273 TraceCheckUtils]: 82: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:27:38,655 INFO L273 TraceCheckUtils]: 83: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:27:38,655 INFO L273 TraceCheckUtils]: 84: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 85: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 86: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 87: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 88: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 89: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 90: Hoare triple {14873#false} assume !(~i~0 < 1000); {14873#false} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 91: Hoare triple {14873#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 92: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:27:38,657 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14873#false} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 94: Hoare triple {14873#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {14873#false} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 96: Hoare triple {14873#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14873#false} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 98: Hoare triple {14873#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14873#false} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 100: Hoare triple {14873#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14873#false} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 102: Hoare triple {14873#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14873#false} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 104: Hoare triple {14873#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14873#false} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 106: Hoare triple {14873#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14873#false} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 999); {14873#false} is VALID [2018-11-23 12:27:38,658 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:27:38,659 INFO L256 TraceCheckUtils]: 109: Hoare triple {14873#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {14873#false} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 110: Hoare triple {14873#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {14873#false} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 111: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 112: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 113: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 114: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 115: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 116: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 117: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:27:38,660 INFO L273 TraceCheckUtils]: 118: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:27:38,660 INFO L273 TraceCheckUtils]: 119: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:27:38,660 INFO L273 TraceCheckUtils]: 120: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:27:38,660 INFO L273 TraceCheckUtils]: 121: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:27:38,660 INFO L273 TraceCheckUtils]: 122: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:27:38,660 INFO L273 TraceCheckUtils]: 123: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:27:38,660 INFO L273 TraceCheckUtils]: 124: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:27:38,660 INFO L273 TraceCheckUtils]: 125: Hoare triple {14873#false} assume !(~i~0 < 1000); {14873#false} is VALID [2018-11-23 12:27:38,660 INFO L273 TraceCheckUtils]: 126: Hoare triple {14873#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:27:38,661 INFO L273 TraceCheckUtils]: 127: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:27:38,661 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14873#false} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:27:38,661 INFO L273 TraceCheckUtils]: 129: Hoare triple {14873#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {14873#false} is VALID [2018-11-23 12:27:38,661 INFO L273 TraceCheckUtils]: 130: Hoare triple {14873#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {14873#false} is VALID [2018-11-23 12:27:38,661 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:27:38,668 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:27:38,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:38,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2018-11-23 12:27:38,690 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:27:38,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:38,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:27:38,854 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:27:38,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:27:38,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:27:38,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:27:38,855 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2018-11-23 12:27:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:39,652 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-11-23 12:27:39,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:27:39,652 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:27:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:27:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:27:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:27:39,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:27:39,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 120 transitions. [2018-11-23 12:27:39,856 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:27:39,859 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:27:39,859 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:27:39,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:27:39,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:27:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-23 12:27:39,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:39,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2018-11-23 12:27:39,909 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2018-11-23 12:27:39,909 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2018-11-23 12:27:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:39,911 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:27:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:27:39,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:39,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:39,912 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2018-11-23 12:27:39,912 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2018-11-23 12:27:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:39,914 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:27:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:27:39,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:39,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:39,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:39,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:39,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 12:27:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-11-23 12:27:39,917 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2018-11-23 12:27:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:39,918 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-11-23 12:27:39,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:27:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-23 12:27:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-23 12:27:39,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:39,919 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:27:39,919 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:39,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:39,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1283933361, now seen corresponding path program 24 times [2018-11-23 12:27:39,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:39,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:39,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:39,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:39,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:40,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:27:40,629 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:27:40,629 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:27:40,629 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:27:40,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret12 := main(); {15862#true} is VALID [2018-11-23 12:27:40,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15864#(= main_~i~1 0)} is VALID [2018-11-23 12:27:40,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {15864#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15864#(= main_~i~1 0)} is VALID [2018-11-23 12:27:40,631 INFO L273 TraceCheckUtils]: 7: Hoare triple {15864#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15865#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:40,631 INFO L273 TraceCheckUtils]: 8: Hoare triple {15865#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15865#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:40,632 INFO L273 TraceCheckUtils]: 9: Hoare triple {15865#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15866#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:40,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {15866#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15866#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:40,633 INFO L273 TraceCheckUtils]: 11: Hoare triple {15866#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15867#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:40,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {15867#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15867#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:40,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {15867#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15868#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:40,635 INFO L273 TraceCheckUtils]: 14: Hoare triple {15868#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15868#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:40,636 INFO L273 TraceCheckUtils]: 15: Hoare triple {15868#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15869#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:40,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {15869#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15869#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:40,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {15869#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15870#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:40,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {15870#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15870#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:40,638 INFO L273 TraceCheckUtils]: 19: Hoare triple {15870#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15871#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:40,659 INFO L273 TraceCheckUtils]: 20: Hoare triple {15871#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15871#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:40,673 INFO L273 TraceCheckUtils]: 21: Hoare triple {15871#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15872#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:40,681 INFO L273 TraceCheckUtils]: 22: Hoare triple {15872#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15872#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:40,684 INFO L273 TraceCheckUtils]: 23: Hoare triple {15872#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15873#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:40,685 INFO L273 TraceCheckUtils]: 24: Hoare triple {15873#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15873#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:40,685 INFO L273 TraceCheckUtils]: 25: Hoare triple {15873#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15874#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:40,686 INFO L273 TraceCheckUtils]: 26: Hoare triple {15874#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15874#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:40,686 INFO L273 TraceCheckUtils]: 27: Hoare triple {15874#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15875#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:40,686 INFO L273 TraceCheckUtils]: 28: Hoare triple {15875#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15875#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:40,687 INFO L273 TraceCheckUtils]: 29: Hoare triple {15875#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15876#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:40,687 INFO L273 TraceCheckUtils]: 30: Hoare triple {15876#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15876#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:40,687 INFO L273 TraceCheckUtils]: 31: Hoare triple {15876#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15877#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:40,688 INFO L273 TraceCheckUtils]: 32: Hoare triple {15877#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15877#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:40,688 INFO L273 TraceCheckUtils]: 33: Hoare triple {15877#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15878#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:40,689 INFO L273 TraceCheckUtils]: 34: Hoare triple {15878#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15878#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:40,689 INFO L273 TraceCheckUtils]: 35: Hoare triple {15878#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15879#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:40,690 INFO L273 TraceCheckUtils]: 36: Hoare triple {15879#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15879#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:40,691 INFO L273 TraceCheckUtils]: 37: Hoare triple {15879#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15880#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:40,691 INFO L273 TraceCheckUtils]: 38: Hoare triple {15880#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15880#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:40,692 INFO L273 TraceCheckUtils]: 39: Hoare triple {15880#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15881#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:40,693 INFO L273 TraceCheckUtils]: 40: Hoare triple {15881#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15881#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:40,693 INFO L273 TraceCheckUtils]: 41: Hoare triple {15881#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15882#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:40,694 INFO L273 TraceCheckUtils]: 42: Hoare triple {15882#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15882#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:40,695 INFO L273 TraceCheckUtils]: 43: Hoare triple {15882#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15883#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:40,695 INFO L273 TraceCheckUtils]: 44: Hoare triple {15883#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15883#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:40,696 INFO L273 TraceCheckUtils]: 45: Hoare triple {15883#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15884#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:40,696 INFO L273 TraceCheckUtils]: 46: Hoare triple {15884#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15884#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:40,697 INFO L273 TraceCheckUtils]: 47: Hoare triple {15884#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15885#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:40,698 INFO L273 TraceCheckUtils]: 48: Hoare triple {15885#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15885#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:40,698 INFO L273 TraceCheckUtils]: 49: Hoare triple {15885#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15886#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:40,699 INFO L273 TraceCheckUtils]: 50: Hoare triple {15886#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15886#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:40,700 INFO L273 TraceCheckUtils]: 51: Hoare triple {15886#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15887#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:40,700 INFO L273 TraceCheckUtils]: 52: Hoare triple {15887#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15887#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:40,701 INFO L273 TraceCheckUtils]: 53: Hoare triple {15887#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15888#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:40,701 INFO L273 TraceCheckUtils]: 54: Hoare triple {15888#(<= main_~i~1 24)} assume !(~i~1 < 1000); {15863#false} is VALID [2018-11-23 12:27:40,702 INFO L256 TraceCheckUtils]: 55: Hoare triple {15863#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:27:40,702 INFO L273 TraceCheckUtils]: 56: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15862#true} is VALID [2018-11-23 12:27:40,702 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,702 INFO L273 TraceCheckUtils]: 58: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,702 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,702 INFO L273 TraceCheckUtils]: 60: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,703 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,703 INFO L273 TraceCheckUtils]: 62: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,703 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,703 INFO L273 TraceCheckUtils]: 64: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,703 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,703 INFO L273 TraceCheckUtils]: 66: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,704 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,704 INFO L273 TraceCheckUtils]: 68: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,704 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,704 INFO L273 TraceCheckUtils]: 70: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,704 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,705 INFO L273 TraceCheckUtils]: 72: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,705 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 1000); {15862#true} is VALID [2018-11-23 12:27:40,705 INFO L273 TraceCheckUtils]: 74: Hoare triple {15862#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:27:40,705 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:27:40,705 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15863#false} #70#return; {15863#false} is VALID [2018-11-23 12:27:40,705 INFO L273 TraceCheckUtils]: 77: Hoare triple {15863#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:27:40,706 INFO L256 TraceCheckUtils]: 78: Hoare triple {15863#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:27:40,706 INFO L273 TraceCheckUtils]: 79: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15862#true} is VALID [2018-11-23 12:27:40,706 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,706 INFO L273 TraceCheckUtils]: 81: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,706 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,706 INFO L273 TraceCheckUtils]: 83: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,707 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,707 INFO L273 TraceCheckUtils]: 85: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,707 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,707 INFO L273 TraceCheckUtils]: 87: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,707 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,707 INFO L273 TraceCheckUtils]: 89: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,707 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,708 INFO L273 TraceCheckUtils]: 91: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,708 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,708 INFO L273 TraceCheckUtils]: 93: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,708 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,708 INFO L273 TraceCheckUtils]: 95: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,708 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 1000); {15862#true} is VALID [2018-11-23 12:27:40,708 INFO L273 TraceCheckUtils]: 97: Hoare triple {15862#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:27:40,708 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:27:40,708 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15863#false} #72#return; {15863#false} is VALID [2018-11-23 12:27:40,709 INFO L273 TraceCheckUtils]: 100: Hoare triple {15863#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {15863#false} is VALID [2018-11-23 12:27:40,709 INFO L273 TraceCheckUtils]: 101: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:27:40,709 INFO L273 TraceCheckUtils]: 102: Hoare triple {15863#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15863#false} is VALID [2018-11-23 12:27:40,709 INFO L273 TraceCheckUtils]: 103: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:27:40,709 INFO L273 TraceCheckUtils]: 104: Hoare triple {15863#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15863#false} is VALID [2018-11-23 12:27:40,709 INFO L273 TraceCheckUtils]: 105: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:27:40,709 INFO L273 TraceCheckUtils]: 106: Hoare triple {15863#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15863#false} is VALID [2018-11-23 12:27:40,709 INFO L273 TraceCheckUtils]: 107: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:27:40,709 INFO L273 TraceCheckUtils]: 108: Hoare triple {15863#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15863#false} is VALID [2018-11-23 12:27:40,709 INFO L273 TraceCheckUtils]: 109: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:27:40,710 INFO L273 TraceCheckUtils]: 110: Hoare triple {15863#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15863#false} is VALID [2018-11-23 12:27:40,710 INFO L273 TraceCheckUtils]: 111: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:27:40,710 INFO L273 TraceCheckUtils]: 112: Hoare triple {15863#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15863#false} is VALID [2018-11-23 12:27:40,710 INFO L273 TraceCheckUtils]: 113: Hoare triple {15863#false} assume !(~i~2 < 999); {15863#false} is VALID [2018-11-23 12:27:40,710 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:27:40,710 INFO L256 TraceCheckUtils]: 115: Hoare triple {15863#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:27:40,710 INFO L273 TraceCheckUtils]: 116: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15862#true} is VALID [2018-11-23 12:27:40,710 INFO L273 TraceCheckUtils]: 117: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,710 INFO L273 TraceCheckUtils]: 118: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,711 INFO L273 TraceCheckUtils]: 119: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,711 INFO L273 TraceCheckUtils]: 120: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,711 INFO L273 TraceCheckUtils]: 121: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,711 INFO L273 TraceCheckUtils]: 122: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,711 INFO L273 TraceCheckUtils]: 123: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,711 INFO L273 TraceCheckUtils]: 124: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,711 INFO L273 TraceCheckUtils]: 125: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,711 INFO L273 TraceCheckUtils]: 126: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,711 INFO L273 TraceCheckUtils]: 127: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,712 INFO L273 TraceCheckUtils]: 128: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,712 INFO L273 TraceCheckUtils]: 129: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,712 INFO L273 TraceCheckUtils]: 130: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,712 INFO L273 TraceCheckUtils]: 131: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:40,712 INFO L273 TraceCheckUtils]: 132: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:40,712 INFO L273 TraceCheckUtils]: 133: Hoare triple {15862#true} assume !(~i~0 < 1000); {15862#true} is VALID [2018-11-23 12:27:40,712 INFO L273 TraceCheckUtils]: 134: Hoare triple {15862#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:27:40,712 INFO L273 TraceCheckUtils]: 135: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:27:40,712 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15862#true} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:27:40,712 INFO L273 TraceCheckUtils]: 137: Hoare triple {15863#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {15863#false} is VALID [2018-11-23 12:27:40,713 INFO L273 TraceCheckUtils]: 138: Hoare triple {15863#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {15863#false} is VALID [2018-11-23 12:27:40,713 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:27:40,722 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:27:40,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:40,723 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:27:40,732 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:41,227 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-23 12:27:41,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:41,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:42,526 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:27:42,526 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:27:42,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:27:42,527 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:27:42,527 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret12 := main(); {15862#true} is VALID [2018-11-23 12:27:42,527 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15862#true} is VALID [2018-11-23 12:27:42,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,528 INFO L273 TraceCheckUtils]: 7: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,528 INFO L273 TraceCheckUtils]: 8: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,529 INFO L273 TraceCheckUtils]: 13: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,529 INFO L273 TraceCheckUtils]: 17: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,529 INFO L273 TraceCheckUtils]: 18: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,529 INFO L273 TraceCheckUtils]: 19: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,529 INFO L273 TraceCheckUtils]: 20: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,530 INFO L273 TraceCheckUtils]: 21: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,530 INFO L273 TraceCheckUtils]: 22: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,530 INFO L273 TraceCheckUtils]: 23: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,530 INFO L273 TraceCheckUtils]: 24: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,530 INFO L273 TraceCheckUtils]: 25: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,530 INFO L273 TraceCheckUtils]: 26: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,530 INFO L273 TraceCheckUtils]: 27: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,530 INFO L273 TraceCheckUtils]: 28: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,530 INFO L273 TraceCheckUtils]: 29: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,530 INFO L273 TraceCheckUtils]: 30: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,531 INFO L273 TraceCheckUtils]: 31: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,531 INFO L273 TraceCheckUtils]: 32: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,531 INFO L273 TraceCheckUtils]: 33: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,531 INFO L273 TraceCheckUtils]: 34: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,531 INFO L273 TraceCheckUtils]: 35: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,531 INFO L273 TraceCheckUtils]: 36: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,531 INFO L273 TraceCheckUtils]: 37: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,531 INFO L273 TraceCheckUtils]: 38: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,531 INFO L273 TraceCheckUtils]: 39: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,532 INFO L273 TraceCheckUtils]: 40: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,532 INFO L273 TraceCheckUtils]: 41: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,532 INFO L273 TraceCheckUtils]: 42: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,532 INFO L273 TraceCheckUtils]: 43: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,532 INFO L273 TraceCheckUtils]: 44: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,532 INFO L273 TraceCheckUtils]: 45: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,532 INFO L273 TraceCheckUtils]: 46: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,532 INFO L273 TraceCheckUtils]: 47: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,532 INFO L273 TraceCheckUtils]: 48: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,533 INFO L273 TraceCheckUtils]: 49: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,533 INFO L273 TraceCheckUtils]: 50: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:27:42,533 INFO L273 TraceCheckUtils]: 51: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:27:42,533 INFO L273 TraceCheckUtils]: 52: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16048#(< main_~i~1 1000)} is VALID [2018-11-23 12:27:42,534 INFO L273 TraceCheckUtils]: 53: Hoare triple {16048#(< main_~i~1 1000)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16052#(<= main_~i~1 1000)} is VALID [2018-11-23 12:27:42,534 INFO L273 TraceCheckUtils]: 54: Hoare triple {16052#(<= main_~i~1 1000)} assume !(~i~1 < 1000); {15862#true} is VALID [2018-11-23 12:27:42,534 INFO L256 TraceCheckUtils]: 55: Hoare triple {15862#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:27:42,534 INFO L273 TraceCheckUtils]: 56: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15862#true} is VALID [2018-11-23 12:27:42,534 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,534 INFO L273 TraceCheckUtils]: 58: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,534 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,534 INFO L273 TraceCheckUtils]: 60: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,535 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,535 INFO L273 TraceCheckUtils]: 62: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,535 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,535 INFO L273 TraceCheckUtils]: 64: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,535 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,535 INFO L273 TraceCheckUtils]: 66: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,535 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,535 INFO L273 TraceCheckUtils]: 68: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,535 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,535 INFO L273 TraceCheckUtils]: 70: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,536 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,536 INFO L273 TraceCheckUtils]: 72: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,536 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 1000); {15862#true} is VALID [2018-11-23 12:27:42,536 INFO L273 TraceCheckUtils]: 74: Hoare triple {15862#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:27:42,536 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:27:42,536 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15862#true} #70#return; {15862#true} is VALID [2018-11-23 12:27:42,536 INFO L273 TraceCheckUtils]: 77: Hoare triple {15862#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {15862#true} is VALID [2018-11-23 12:27:42,536 INFO L256 TraceCheckUtils]: 78: Hoare triple {15862#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:27:42,536 INFO L273 TraceCheckUtils]: 79: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15862#true} is VALID [2018-11-23 12:27:42,537 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,537 INFO L273 TraceCheckUtils]: 81: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,537 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,537 INFO L273 TraceCheckUtils]: 83: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,537 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,537 INFO L273 TraceCheckUtils]: 85: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,537 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,537 INFO L273 TraceCheckUtils]: 87: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,537 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,537 INFO L273 TraceCheckUtils]: 89: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,538 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,538 INFO L273 TraceCheckUtils]: 91: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,538 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,538 INFO L273 TraceCheckUtils]: 93: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,538 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:27:42,538 INFO L273 TraceCheckUtils]: 95: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:27:42,538 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 1000); {15862#true} is VALID [2018-11-23 12:27:42,538 INFO L273 TraceCheckUtils]: 97: Hoare triple {15862#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:27:42,538 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:27:42,539 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15862#true} #72#return; {15862#true} is VALID [2018-11-23 12:27:42,539 INFO L273 TraceCheckUtils]: 100: Hoare triple {15862#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {16194#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:42,539 INFO L273 TraceCheckUtils]: 101: Hoare triple {16194#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16194#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:42,540 INFO L273 TraceCheckUtils]: 102: Hoare triple {16194#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16201#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:42,540 INFO L273 TraceCheckUtils]: 103: Hoare triple {16201#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16201#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:42,541 INFO L273 TraceCheckUtils]: 104: Hoare triple {16201#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16208#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:42,541 INFO L273 TraceCheckUtils]: 105: Hoare triple {16208#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16208#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:42,541 INFO L273 TraceCheckUtils]: 106: Hoare triple {16208#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16215#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:42,542 INFO L273 TraceCheckUtils]: 107: Hoare triple {16215#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16215#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:42,542 INFO L273 TraceCheckUtils]: 108: Hoare triple {16215#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16222#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:42,542 INFO L273 TraceCheckUtils]: 109: Hoare triple {16222#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16222#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:42,543 INFO L273 TraceCheckUtils]: 110: Hoare triple {16222#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16229#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:42,543 INFO L273 TraceCheckUtils]: 111: Hoare triple {16229#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16229#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:42,544 INFO L273 TraceCheckUtils]: 112: Hoare triple {16229#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16236#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:42,544 INFO L273 TraceCheckUtils]: 113: Hoare triple {16236#(<= main_~i~2 6)} assume !(~i~2 < 999); {15863#false} is VALID [2018-11-23 12:27:42,544 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:27:42,545 INFO L256 TraceCheckUtils]: 115: Hoare triple {15863#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {15863#false} is VALID [2018-11-23 12:27:42,545 INFO L273 TraceCheckUtils]: 116: Hoare triple {15863#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15863#false} is VALID [2018-11-23 12:27:42,545 INFO L273 TraceCheckUtils]: 117: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:27:42,545 INFO L273 TraceCheckUtils]: 118: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:27:42,545 INFO L273 TraceCheckUtils]: 119: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:27:42,546 INFO L273 TraceCheckUtils]: 120: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:27:42,546 INFO L273 TraceCheckUtils]: 121: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:27:42,546 INFO L273 TraceCheckUtils]: 122: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:27:42,546 INFO L273 TraceCheckUtils]: 123: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:27:42,546 INFO L273 TraceCheckUtils]: 124: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:27:42,546 INFO L273 TraceCheckUtils]: 125: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:27:42,547 INFO L273 TraceCheckUtils]: 126: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:27:42,547 INFO L273 TraceCheckUtils]: 127: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:27:42,547 INFO L273 TraceCheckUtils]: 128: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:27:42,547 INFO L273 TraceCheckUtils]: 129: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:27:42,547 INFO L273 TraceCheckUtils]: 130: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:27:42,548 INFO L273 TraceCheckUtils]: 131: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:27:42,548 INFO L273 TraceCheckUtils]: 132: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:27:42,548 INFO L273 TraceCheckUtils]: 133: Hoare triple {15863#false} assume !(~i~0 < 1000); {15863#false} is VALID [2018-11-23 12:27:42,548 INFO L273 TraceCheckUtils]: 134: Hoare triple {15863#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {15863#false} is VALID [2018-11-23 12:27:42,548 INFO L273 TraceCheckUtils]: 135: Hoare triple {15863#false} assume true; {15863#false} is VALID [2018-11-23 12:27:42,549 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15863#false} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:27:42,549 INFO L273 TraceCheckUtils]: 137: Hoare triple {15863#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {15863#false} is VALID [2018-11-23 12:27:42,549 INFO L273 TraceCheckUtils]: 138: Hoare triple {15863#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {15863#false} is VALID [2018-11-23 12:27:42,549 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:27:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 345 proven. 36 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-11-23 12:27:42,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:42,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11] total 36 [2018-11-23 12:27:42,577 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 140 [2018-11-23 12:27:42,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:42,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:27:43,239 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:27:43,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:27:43,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:27:43,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=819, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:27:43,241 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 36 states. [2018-11-23 12:27:45,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:45,201 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-11-23 12:27:45,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:27:45,201 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 140 [2018-11-23 12:27:45,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:27:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2018-11-23 12:27:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:27:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2018-11-23 12:27:45,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 119 transitions. [2018-11-23 12:27:45,707 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:27:45,712 INFO L225 Difference]: With dead ends: 150 [2018-11-23 12:27:45,712 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:27:45,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=511, Invalid=1295, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:27:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:27:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-23 12:27:45,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:45,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 105 states. [2018-11-23 12:27:45,788 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 105 states. [2018-11-23 12:27:45,788 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 105 states. [2018-11-23 12:27:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:45,793 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:27:45,793 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:27:45,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:45,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:45,794 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 106 states. [2018-11-23 12:27:45,794 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 106 states. [2018-11-23 12:27:45,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:45,796 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:27:45,796 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:27:45,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:45,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:45,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:45,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 12:27:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-23 12:27:45,800 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 140 [2018-11-23 12:27:45,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:45,800 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-23 12:27:45,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:27:45,800 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:27:45,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 12:27:45,802 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:45,802 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:27:45,802 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:45,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:45,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1736133359, now seen corresponding path program 25 times [2018-11-23 12:27:45,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:45,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:45,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:45,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:45,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:46,439 INFO L256 TraceCheckUtils]: 0: Hoare triple {16922#true} call ULTIMATE.init(); {16922#true} is VALID [2018-11-23 12:27:46,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {16922#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16922#true} is VALID [2018-11-23 12:27:46,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {16922#true} assume true; {16922#true} is VALID [2018-11-23 12:27:46,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16922#true} {16922#true} #66#return; {16922#true} is VALID [2018-11-23 12:27:46,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {16922#true} call #t~ret12 := main(); {16922#true} is VALID [2018-11-23 12:27:46,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {16922#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16924#(= main_~i~1 0)} is VALID [2018-11-23 12:27:46,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {16924#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16924#(= main_~i~1 0)} is VALID [2018-11-23 12:27:46,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {16924#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16925#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:46,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {16925#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16925#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:46,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {16925#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16926#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:46,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {16926#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16926#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:46,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {16926#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16927#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:46,443 INFO L273 TraceCheckUtils]: 12: Hoare triple {16927#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16927#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:46,444 INFO L273 TraceCheckUtils]: 13: Hoare triple {16927#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16928#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:46,445 INFO L273 TraceCheckUtils]: 14: Hoare triple {16928#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16928#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:46,445 INFO L273 TraceCheckUtils]: 15: Hoare triple {16928#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16929#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:46,446 INFO L273 TraceCheckUtils]: 16: Hoare triple {16929#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16929#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:46,447 INFO L273 TraceCheckUtils]: 17: Hoare triple {16929#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16930#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:46,447 INFO L273 TraceCheckUtils]: 18: Hoare triple {16930#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16930#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:46,448 INFO L273 TraceCheckUtils]: 19: Hoare triple {16930#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16931#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:46,448 INFO L273 TraceCheckUtils]: 20: Hoare triple {16931#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16931#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:46,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {16931#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16932#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:46,450 INFO L273 TraceCheckUtils]: 22: Hoare triple {16932#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16932#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:46,450 INFO L273 TraceCheckUtils]: 23: Hoare triple {16932#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16933#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:46,451 INFO L273 TraceCheckUtils]: 24: Hoare triple {16933#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16933#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:46,452 INFO L273 TraceCheckUtils]: 25: Hoare triple {16933#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16934#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:46,452 INFO L273 TraceCheckUtils]: 26: Hoare triple {16934#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16934#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:46,453 INFO L273 TraceCheckUtils]: 27: Hoare triple {16934#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16935#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:46,453 INFO L273 TraceCheckUtils]: 28: Hoare triple {16935#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16935#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:46,454 INFO L273 TraceCheckUtils]: 29: Hoare triple {16935#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16936#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:46,455 INFO L273 TraceCheckUtils]: 30: Hoare triple {16936#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16936#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:46,455 INFO L273 TraceCheckUtils]: 31: Hoare triple {16936#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16937#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:46,456 INFO L273 TraceCheckUtils]: 32: Hoare triple {16937#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16937#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:46,457 INFO L273 TraceCheckUtils]: 33: Hoare triple {16937#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16938#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:46,457 INFO L273 TraceCheckUtils]: 34: Hoare triple {16938#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16938#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:46,458 INFO L273 TraceCheckUtils]: 35: Hoare triple {16938#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16939#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:46,458 INFO L273 TraceCheckUtils]: 36: Hoare triple {16939#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16939#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:46,459 INFO L273 TraceCheckUtils]: 37: Hoare triple {16939#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16940#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:46,460 INFO L273 TraceCheckUtils]: 38: Hoare triple {16940#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16940#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:46,460 INFO L273 TraceCheckUtils]: 39: Hoare triple {16940#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16941#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:46,461 INFO L273 TraceCheckUtils]: 40: Hoare triple {16941#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16941#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:46,462 INFO L273 TraceCheckUtils]: 41: Hoare triple {16941#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16942#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:46,462 INFO L273 TraceCheckUtils]: 42: Hoare triple {16942#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16942#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:46,463 INFO L273 TraceCheckUtils]: 43: Hoare triple {16942#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16943#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:46,463 INFO L273 TraceCheckUtils]: 44: Hoare triple {16943#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16943#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:46,464 INFO L273 TraceCheckUtils]: 45: Hoare triple {16943#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16944#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:46,465 INFO L273 TraceCheckUtils]: 46: Hoare triple {16944#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16944#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:46,465 INFO L273 TraceCheckUtils]: 47: Hoare triple {16944#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16945#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:46,466 INFO L273 TraceCheckUtils]: 48: Hoare triple {16945#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16945#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:46,467 INFO L273 TraceCheckUtils]: 49: Hoare triple {16945#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16946#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:46,467 INFO L273 TraceCheckUtils]: 50: Hoare triple {16946#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16946#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:46,468 INFO L273 TraceCheckUtils]: 51: Hoare triple {16946#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16947#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:46,468 INFO L273 TraceCheckUtils]: 52: Hoare triple {16947#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16947#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:46,469 INFO L273 TraceCheckUtils]: 53: Hoare triple {16947#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16948#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:46,470 INFO L273 TraceCheckUtils]: 54: Hoare triple {16948#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16948#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:46,470 INFO L273 TraceCheckUtils]: 55: Hoare triple {16948#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16949#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:46,471 INFO L273 TraceCheckUtils]: 56: Hoare triple {16949#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16949#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:46,472 INFO L273 TraceCheckUtils]: 57: Hoare triple {16949#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16950#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:46,472 INFO L273 TraceCheckUtils]: 58: Hoare triple {16950#(<= main_~i~1 26)} assume !(~i~1 < 1000); {16923#false} is VALID [2018-11-23 12:27:46,472 INFO L256 TraceCheckUtils]: 59: Hoare triple {16923#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {16922#true} is VALID [2018-11-23 12:27:46,473 INFO L273 TraceCheckUtils]: 60: Hoare triple {16922#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16922#true} is VALID [2018-11-23 12:27:46,473 INFO L273 TraceCheckUtils]: 61: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,473 INFO L273 TraceCheckUtils]: 62: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,473 INFO L273 TraceCheckUtils]: 63: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,473 INFO L273 TraceCheckUtils]: 64: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,474 INFO L273 TraceCheckUtils]: 65: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,474 INFO L273 TraceCheckUtils]: 66: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,474 INFO L273 TraceCheckUtils]: 67: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,474 INFO L273 TraceCheckUtils]: 68: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,474 INFO L273 TraceCheckUtils]: 69: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,475 INFO L273 TraceCheckUtils]: 70: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,475 INFO L273 TraceCheckUtils]: 71: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,475 INFO L273 TraceCheckUtils]: 72: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,475 INFO L273 TraceCheckUtils]: 73: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,475 INFO L273 TraceCheckUtils]: 74: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,476 INFO L273 TraceCheckUtils]: 75: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,476 INFO L273 TraceCheckUtils]: 76: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,476 INFO L273 TraceCheckUtils]: 77: Hoare triple {16922#true} assume !(~i~0 < 1000); {16922#true} is VALID [2018-11-23 12:27:46,476 INFO L273 TraceCheckUtils]: 78: Hoare triple {16922#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {16922#true} is VALID [2018-11-23 12:27:46,476 INFO L273 TraceCheckUtils]: 79: Hoare triple {16922#true} assume true; {16922#true} is VALID [2018-11-23 12:27:46,476 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {16922#true} {16923#false} #70#return; {16923#false} is VALID [2018-11-23 12:27:46,477 INFO L273 TraceCheckUtils]: 81: Hoare triple {16923#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {16923#false} is VALID [2018-11-23 12:27:46,477 INFO L256 TraceCheckUtils]: 82: Hoare triple {16923#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {16922#true} is VALID [2018-11-23 12:27:46,477 INFO L273 TraceCheckUtils]: 83: Hoare triple {16922#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16922#true} is VALID [2018-11-23 12:27:46,477 INFO L273 TraceCheckUtils]: 84: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,477 INFO L273 TraceCheckUtils]: 85: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,477 INFO L273 TraceCheckUtils]: 86: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,477 INFO L273 TraceCheckUtils]: 87: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,478 INFO L273 TraceCheckUtils]: 88: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,478 INFO L273 TraceCheckUtils]: 89: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,478 INFO L273 TraceCheckUtils]: 90: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,478 INFO L273 TraceCheckUtils]: 91: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,478 INFO L273 TraceCheckUtils]: 92: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,478 INFO L273 TraceCheckUtils]: 93: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,478 INFO L273 TraceCheckUtils]: 94: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,478 INFO L273 TraceCheckUtils]: 95: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,478 INFO L273 TraceCheckUtils]: 96: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,479 INFO L273 TraceCheckUtils]: 97: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,479 INFO L273 TraceCheckUtils]: 98: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,479 INFO L273 TraceCheckUtils]: 99: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,479 INFO L273 TraceCheckUtils]: 100: Hoare triple {16922#true} assume !(~i~0 < 1000); {16922#true} is VALID [2018-11-23 12:27:46,479 INFO L273 TraceCheckUtils]: 101: Hoare triple {16922#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {16922#true} is VALID [2018-11-23 12:27:46,479 INFO L273 TraceCheckUtils]: 102: Hoare triple {16922#true} assume true; {16922#true} is VALID [2018-11-23 12:27:46,479 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {16922#true} {16923#false} #72#return; {16923#false} is VALID [2018-11-23 12:27:46,479 INFO L273 TraceCheckUtils]: 104: Hoare triple {16923#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {16923#false} is VALID [2018-11-23 12:27:46,479 INFO L273 TraceCheckUtils]: 105: Hoare triple {16923#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16923#false} is VALID [2018-11-23 12:27:46,480 INFO L273 TraceCheckUtils]: 106: Hoare triple {16923#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16923#false} is VALID [2018-11-23 12:27:46,480 INFO L273 TraceCheckUtils]: 107: Hoare triple {16923#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16923#false} is VALID [2018-11-23 12:27:46,480 INFO L273 TraceCheckUtils]: 108: Hoare triple {16923#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16923#false} is VALID [2018-11-23 12:27:46,480 INFO L273 TraceCheckUtils]: 109: Hoare triple {16923#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16923#false} is VALID [2018-11-23 12:27:46,480 INFO L273 TraceCheckUtils]: 110: Hoare triple {16923#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16923#false} is VALID [2018-11-23 12:27:46,480 INFO L273 TraceCheckUtils]: 111: Hoare triple {16923#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16923#false} is VALID [2018-11-23 12:27:46,480 INFO L273 TraceCheckUtils]: 112: Hoare triple {16923#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16923#false} is VALID [2018-11-23 12:27:46,480 INFO L273 TraceCheckUtils]: 113: Hoare triple {16923#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16923#false} is VALID [2018-11-23 12:27:46,480 INFO L273 TraceCheckUtils]: 114: Hoare triple {16923#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16923#false} is VALID [2018-11-23 12:27:46,480 INFO L273 TraceCheckUtils]: 115: Hoare triple {16923#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16923#false} is VALID [2018-11-23 12:27:46,481 INFO L273 TraceCheckUtils]: 116: Hoare triple {16923#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16923#false} is VALID [2018-11-23 12:27:46,481 INFO L273 TraceCheckUtils]: 117: Hoare triple {16923#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16923#false} is VALID [2018-11-23 12:27:46,481 INFO L273 TraceCheckUtils]: 118: Hoare triple {16923#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16923#false} is VALID [2018-11-23 12:27:46,481 INFO L273 TraceCheckUtils]: 119: Hoare triple {16923#false} assume !(~i~2 < 999); {16923#false} is VALID [2018-11-23 12:27:46,481 INFO L273 TraceCheckUtils]: 120: Hoare triple {16923#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {16923#false} is VALID [2018-11-23 12:27:46,481 INFO L256 TraceCheckUtils]: 121: Hoare triple {16923#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {16922#true} is VALID [2018-11-23 12:27:46,481 INFO L273 TraceCheckUtils]: 122: Hoare triple {16922#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16922#true} is VALID [2018-11-23 12:27:46,481 INFO L273 TraceCheckUtils]: 123: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,481 INFO L273 TraceCheckUtils]: 124: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,482 INFO L273 TraceCheckUtils]: 125: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,482 INFO L273 TraceCheckUtils]: 126: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,482 INFO L273 TraceCheckUtils]: 127: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,482 INFO L273 TraceCheckUtils]: 128: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,482 INFO L273 TraceCheckUtils]: 129: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,482 INFO L273 TraceCheckUtils]: 130: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,482 INFO L273 TraceCheckUtils]: 131: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,482 INFO L273 TraceCheckUtils]: 132: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,482 INFO L273 TraceCheckUtils]: 133: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,482 INFO L273 TraceCheckUtils]: 134: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,483 INFO L273 TraceCheckUtils]: 135: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,483 INFO L273 TraceCheckUtils]: 136: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,483 INFO L273 TraceCheckUtils]: 137: Hoare triple {16922#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16922#true} is VALID [2018-11-23 12:27:46,483 INFO L273 TraceCheckUtils]: 138: Hoare triple {16922#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16922#true} is VALID [2018-11-23 12:27:46,483 INFO L273 TraceCheckUtils]: 139: Hoare triple {16922#true} assume !(~i~0 < 1000); {16922#true} is VALID [2018-11-23 12:27:46,483 INFO L273 TraceCheckUtils]: 140: Hoare triple {16922#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {16922#true} is VALID [2018-11-23 12:27:46,483 INFO L273 TraceCheckUtils]: 141: Hoare triple {16922#true} assume true; {16922#true} is VALID [2018-11-23 12:27:46,483 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {16922#true} {16923#false} #74#return; {16923#false} is VALID [2018-11-23 12:27:46,483 INFO L273 TraceCheckUtils]: 143: Hoare triple {16923#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {16923#false} is VALID [2018-11-23 12:27:46,484 INFO L273 TraceCheckUtils]: 144: Hoare triple {16923#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {16923#false} is VALID [2018-11-23 12:27:46,484 INFO L273 TraceCheckUtils]: 145: Hoare triple {16923#false} assume !false; {16923#false} is VALID [2018-11-23 12:27:46,493 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:27:46,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:46,494 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:27:46,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:46,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:46,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {16922#true} call ULTIMATE.init(); {16922#true} is VALID [2018-11-23 12:27:46,850 INFO L273 TraceCheckUtils]: 1: Hoare triple {16922#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16922#true} is VALID [2018-11-23 12:27:46,850 INFO L273 TraceCheckUtils]: 2: Hoare triple {16922#true} assume true; {16922#true} is VALID [2018-11-23 12:27:46,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16922#true} {16922#true} #66#return; {16922#true} is VALID [2018-11-23 12:27:46,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {16922#true} call #t~ret12 := main(); {16922#true} is VALID [2018-11-23 12:27:46,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {16922#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16969#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:46,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {16969#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16969#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:46,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {16969#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16925#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:46,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {16925#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16925#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:46,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {16925#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16926#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:46,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {16926#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16926#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:46,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {16926#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16927#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:46,854 INFO L273 TraceCheckUtils]: 12: Hoare triple {16927#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16927#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:46,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {16927#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16928#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:46,855 INFO L273 TraceCheckUtils]: 14: Hoare triple {16928#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16928#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:46,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {16928#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16929#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:46,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {16929#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16929#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:46,857 INFO L273 TraceCheckUtils]: 17: Hoare triple {16929#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16930#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:46,858 INFO L273 TraceCheckUtils]: 18: Hoare triple {16930#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16930#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:46,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {16930#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16931#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:46,859 INFO L273 TraceCheckUtils]: 20: Hoare triple {16931#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16931#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:46,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {16931#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16932#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:46,860 INFO L273 TraceCheckUtils]: 22: Hoare triple {16932#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16932#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:46,861 INFO L273 TraceCheckUtils]: 23: Hoare triple {16932#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16933#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:46,861 INFO L273 TraceCheckUtils]: 24: Hoare triple {16933#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16933#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:46,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {16933#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16934#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:46,863 INFO L273 TraceCheckUtils]: 26: Hoare triple {16934#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16934#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:46,863 INFO L273 TraceCheckUtils]: 27: Hoare triple {16934#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16935#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:46,864 INFO L273 TraceCheckUtils]: 28: Hoare triple {16935#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16935#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:46,865 INFO L273 TraceCheckUtils]: 29: Hoare triple {16935#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16936#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:46,865 INFO L273 TraceCheckUtils]: 30: Hoare triple {16936#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16936#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:46,866 INFO L273 TraceCheckUtils]: 31: Hoare triple {16936#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16937#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:46,866 INFO L273 TraceCheckUtils]: 32: Hoare triple {16937#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16937#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:46,867 INFO L273 TraceCheckUtils]: 33: Hoare triple {16937#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16938#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:46,868 INFO L273 TraceCheckUtils]: 34: Hoare triple {16938#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16938#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:46,868 INFO L273 TraceCheckUtils]: 35: Hoare triple {16938#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16939#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:46,869 INFO L273 TraceCheckUtils]: 36: Hoare triple {16939#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16939#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:46,869 INFO L273 TraceCheckUtils]: 37: Hoare triple {16939#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16940#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:46,870 INFO L273 TraceCheckUtils]: 38: Hoare triple {16940#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16940#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:46,871 INFO L273 TraceCheckUtils]: 39: Hoare triple {16940#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16941#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:46,871 INFO L273 TraceCheckUtils]: 40: Hoare triple {16941#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16941#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:46,872 INFO L273 TraceCheckUtils]: 41: Hoare triple {16941#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16942#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:46,873 INFO L273 TraceCheckUtils]: 42: Hoare triple {16942#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16942#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:46,873 INFO L273 TraceCheckUtils]: 43: Hoare triple {16942#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16943#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:46,874 INFO L273 TraceCheckUtils]: 44: Hoare triple {16943#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16943#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:46,874 INFO L273 TraceCheckUtils]: 45: Hoare triple {16943#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16944#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:46,875 INFO L273 TraceCheckUtils]: 46: Hoare triple {16944#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16944#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:46,876 INFO L273 TraceCheckUtils]: 47: Hoare triple {16944#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16945#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:46,876 INFO L273 TraceCheckUtils]: 48: Hoare triple {16945#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16945#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:46,877 INFO L273 TraceCheckUtils]: 49: Hoare triple {16945#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16946#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:46,878 INFO L273 TraceCheckUtils]: 50: Hoare triple {16946#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16946#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:46,878 INFO L273 TraceCheckUtils]: 51: Hoare triple {16946#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16947#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:46,879 INFO L273 TraceCheckUtils]: 52: Hoare triple {16947#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16947#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:46,879 INFO L273 TraceCheckUtils]: 53: Hoare triple {16947#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16948#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:46,880 INFO L273 TraceCheckUtils]: 54: Hoare triple {16948#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16948#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:46,881 INFO L273 TraceCheckUtils]: 55: Hoare triple {16948#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16949#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:46,881 INFO L273 TraceCheckUtils]: 56: Hoare triple {16949#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16949#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:46,882 INFO L273 TraceCheckUtils]: 57: Hoare triple {16949#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16950#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:46,883 INFO L273 TraceCheckUtils]: 58: Hoare triple {16950#(<= main_~i~1 26)} assume !(~i~1 < 1000); {16923#false} is VALID [2018-11-23 12:27:46,883 INFO L256 TraceCheckUtils]: 59: Hoare triple {16923#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {16923#false} is VALID [2018-11-23 12:27:46,883 INFO L273 TraceCheckUtils]: 60: Hoare triple {16923#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16923#false} is VALID [2018-11-23 12:27:46,883 INFO L273 TraceCheckUtils]: 61: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,883 INFO L273 TraceCheckUtils]: 62: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,884 INFO L273 TraceCheckUtils]: 63: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,884 INFO L273 TraceCheckUtils]: 64: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,884 INFO L273 TraceCheckUtils]: 65: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,884 INFO L273 TraceCheckUtils]: 66: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,884 INFO L273 TraceCheckUtils]: 67: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,884 INFO L273 TraceCheckUtils]: 68: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,885 INFO L273 TraceCheckUtils]: 69: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,885 INFO L273 TraceCheckUtils]: 70: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,885 INFO L273 TraceCheckUtils]: 71: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,885 INFO L273 TraceCheckUtils]: 72: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,885 INFO L273 TraceCheckUtils]: 73: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,886 INFO L273 TraceCheckUtils]: 74: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,886 INFO L273 TraceCheckUtils]: 75: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,886 INFO L273 TraceCheckUtils]: 76: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,886 INFO L273 TraceCheckUtils]: 77: Hoare triple {16923#false} assume !(~i~0 < 1000); {16923#false} is VALID [2018-11-23 12:27:46,886 INFO L273 TraceCheckUtils]: 78: Hoare triple {16923#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {16923#false} is VALID [2018-11-23 12:27:46,886 INFO L273 TraceCheckUtils]: 79: Hoare triple {16923#false} assume true; {16923#false} is VALID [2018-11-23 12:27:46,887 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {16923#false} {16923#false} #70#return; {16923#false} is VALID [2018-11-23 12:27:46,887 INFO L273 TraceCheckUtils]: 81: Hoare triple {16923#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {16923#false} is VALID [2018-11-23 12:27:46,887 INFO L256 TraceCheckUtils]: 82: Hoare triple {16923#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {16923#false} is VALID [2018-11-23 12:27:46,887 INFO L273 TraceCheckUtils]: 83: Hoare triple {16923#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16923#false} is VALID [2018-11-23 12:27:46,887 INFO L273 TraceCheckUtils]: 84: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,888 INFO L273 TraceCheckUtils]: 85: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,888 INFO L273 TraceCheckUtils]: 86: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,888 INFO L273 TraceCheckUtils]: 87: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,888 INFO L273 TraceCheckUtils]: 88: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,888 INFO L273 TraceCheckUtils]: 89: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,888 INFO L273 TraceCheckUtils]: 90: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,889 INFO L273 TraceCheckUtils]: 91: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,889 INFO L273 TraceCheckUtils]: 92: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,889 INFO L273 TraceCheckUtils]: 93: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,889 INFO L273 TraceCheckUtils]: 94: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,889 INFO L273 TraceCheckUtils]: 95: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,889 INFO L273 TraceCheckUtils]: 96: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,889 INFO L273 TraceCheckUtils]: 97: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,889 INFO L273 TraceCheckUtils]: 98: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,890 INFO L273 TraceCheckUtils]: 99: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,890 INFO L273 TraceCheckUtils]: 100: Hoare triple {16923#false} assume !(~i~0 < 1000); {16923#false} is VALID [2018-11-23 12:27:46,890 INFO L273 TraceCheckUtils]: 101: Hoare triple {16923#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {16923#false} is VALID [2018-11-23 12:27:46,890 INFO L273 TraceCheckUtils]: 102: Hoare triple {16923#false} assume true; {16923#false} is VALID [2018-11-23 12:27:46,890 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {16923#false} {16923#false} #72#return; {16923#false} is VALID [2018-11-23 12:27:46,890 INFO L273 TraceCheckUtils]: 104: Hoare triple {16923#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {16923#false} is VALID [2018-11-23 12:27:46,890 INFO L273 TraceCheckUtils]: 105: Hoare triple {16923#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16923#false} is VALID [2018-11-23 12:27:46,890 INFO L273 TraceCheckUtils]: 106: Hoare triple {16923#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16923#false} is VALID [2018-11-23 12:27:46,890 INFO L273 TraceCheckUtils]: 107: Hoare triple {16923#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16923#false} is VALID [2018-11-23 12:27:46,890 INFO L273 TraceCheckUtils]: 108: Hoare triple {16923#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16923#false} is VALID [2018-11-23 12:27:46,891 INFO L273 TraceCheckUtils]: 109: Hoare triple {16923#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16923#false} is VALID [2018-11-23 12:27:46,891 INFO L273 TraceCheckUtils]: 110: Hoare triple {16923#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16923#false} is VALID [2018-11-23 12:27:46,891 INFO L273 TraceCheckUtils]: 111: Hoare triple {16923#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16923#false} is VALID [2018-11-23 12:27:46,891 INFO L273 TraceCheckUtils]: 112: Hoare triple {16923#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16923#false} is VALID [2018-11-23 12:27:46,891 INFO L273 TraceCheckUtils]: 113: Hoare triple {16923#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16923#false} is VALID [2018-11-23 12:27:46,891 INFO L273 TraceCheckUtils]: 114: Hoare triple {16923#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16923#false} is VALID [2018-11-23 12:27:46,891 INFO L273 TraceCheckUtils]: 115: Hoare triple {16923#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16923#false} is VALID [2018-11-23 12:27:46,891 INFO L273 TraceCheckUtils]: 116: Hoare triple {16923#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16923#false} is VALID [2018-11-23 12:27:46,891 INFO L273 TraceCheckUtils]: 117: Hoare triple {16923#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16923#false} is VALID [2018-11-23 12:27:46,892 INFO L273 TraceCheckUtils]: 118: Hoare triple {16923#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16923#false} is VALID [2018-11-23 12:27:46,892 INFO L273 TraceCheckUtils]: 119: Hoare triple {16923#false} assume !(~i~2 < 999); {16923#false} is VALID [2018-11-23 12:27:46,892 INFO L273 TraceCheckUtils]: 120: Hoare triple {16923#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {16923#false} is VALID [2018-11-23 12:27:46,892 INFO L256 TraceCheckUtils]: 121: Hoare triple {16923#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {16923#false} is VALID [2018-11-23 12:27:46,892 INFO L273 TraceCheckUtils]: 122: Hoare triple {16923#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16923#false} is VALID [2018-11-23 12:27:46,892 INFO L273 TraceCheckUtils]: 123: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,892 INFO L273 TraceCheckUtils]: 124: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,892 INFO L273 TraceCheckUtils]: 125: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,892 INFO L273 TraceCheckUtils]: 126: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,892 INFO L273 TraceCheckUtils]: 127: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,893 INFO L273 TraceCheckUtils]: 128: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,893 INFO L273 TraceCheckUtils]: 129: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,893 INFO L273 TraceCheckUtils]: 130: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,893 INFO L273 TraceCheckUtils]: 131: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,893 INFO L273 TraceCheckUtils]: 132: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,893 INFO L273 TraceCheckUtils]: 133: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,893 INFO L273 TraceCheckUtils]: 134: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,893 INFO L273 TraceCheckUtils]: 135: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,893 INFO L273 TraceCheckUtils]: 136: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,894 INFO L273 TraceCheckUtils]: 137: Hoare triple {16923#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16923#false} is VALID [2018-11-23 12:27:46,894 INFO L273 TraceCheckUtils]: 138: Hoare triple {16923#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16923#false} is VALID [2018-11-23 12:27:46,894 INFO L273 TraceCheckUtils]: 139: Hoare triple {16923#false} assume !(~i~0 < 1000); {16923#false} is VALID [2018-11-23 12:27:46,894 INFO L273 TraceCheckUtils]: 140: Hoare triple {16923#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {16923#false} is VALID [2018-11-23 12:27:46,894 INFO L273 TraceCheckUtils]: 141: Hoare triple {16923#false} assume true; {16923#false} is VALID [2018-11-23 12:27:46,894 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {16923#false} {16923#false} #74#return; {16923#false} is VALID [2018-11-23 12:27:46,894 INFO L273 TraceCheckUtils]: 143: Hoare triple {16923#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {16923#false} is VALID [2018-11-23 12:27:46,894 INFO L273 TraceCheckUtils]: 144: Hoare triple {16923#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {16923#false} is VALID [2018-11-23 12:27:46,894 INFO L273 TraceCheckUtils]: 145: Hoare triple {16923#false} assume !false; {16923#false} is VALID [2018-11-23 12:27:46,905 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:27:46,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:46,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:27:46,924 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:27:46,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:46,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:27:47,016 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:27:47,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:27:47,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:27:47,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:27:47,018 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2018-11-23 12:27:47,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:47,992 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-11-23 12:27:47,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:27:47,993 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:27:47,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:27:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:27:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:27:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:27:47,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 106 transitions. [2018-11-23 12:27:48,097 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:27:48,100 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:27:48,100 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:27:48,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:27:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:27:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-23 12:27:48,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:48,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-23 12:27:48,156 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-23 12:27:48,156 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-23 12:27:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:48,160 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:27:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:27:48,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:48,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:48,160 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-23 12:27:48,160 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-23 12:27:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:48,162 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:27:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:27:48,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:48,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:48,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:48,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:27:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-23 12:27:48,165 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2018-11-23 12:27:48,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:48,166 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-23 12:27:48,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:27:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:27:48,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:27:48,167 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:48,167 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:27:48,167 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:48,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:48,168 INFO L82 PathProgramCache]: Analyzing trace with hash 570812147, now seen corresponding path program 26 times [2018-11-23 12:27:48,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:48,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:48,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:48,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:48,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:49,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {17993#true} call ULTIMATE.init(); {17993#true} is VALID [2018-11-23 12:27:49,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {17993#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17993#true} is VALID [2018-11-23 12:27:49,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {17993#true} assume true; {17993#true} is VALID [2018-11-23 12:27:49,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17993#true} {17993#true} #66#return; {17993#true} is VALID [2018-11-23 12:27:49,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {17993#true} call #t~ret12 := main(); {17993#true} is VALID [2018-11-23 12:27:49,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {17993#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17995#(= main_~i~1 0)} is VALID [2018-11-23 12:27:49,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {17995#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17995#(= main_~i~1 0)} is VALID [2018-11-23 12:27:49,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {17995#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17996#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:49,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {17996#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17996#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:49,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {17996#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17997#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:49,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {17997#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17997#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:49,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {17997#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17998#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:49,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {17998#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17998#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:49,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {17998#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17999#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:49,372 INFO L273 TraceCheckUtils]: 14: Hoare triple {17999#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17999#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:49,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {17999#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18000#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:49,373 INFO L273 TraceCheckUtils]: 16: Hoare triple {18000#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18000#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:49,374 INFO L273 TraceCheckUtils]: 17: Hoare triple {18000#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18001#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:49,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {18001#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18001#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:49,375 INFO L273 TraceCheckUtils]: 19: Hoare triple {18001#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18002#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:49,376 INFO L273 TraceCheckUtils]: 20: Hoare triple {18002#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18002#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:49,377 INFO L273 TraceCheckUtils]: 21: Hoare triple {18002#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18003#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:49,377 INFO L273 TraceCheckUtils]: 22: Hoare triple {18003#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18003#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:49,378 INFO L273 TraceCheckUtils]: 23: Hoare triple {18003#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18004#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:49,378 INFO L273 TraceCheckUtils]: 24: Hoare triple {18004#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18004#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:49,379 INFO L273 TraceCheckUtils]: 25: Hoare triple {18004#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18005#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:49,380 INFO L273 TraceCheckUtils]: 26: Hoare triple {18005#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18005#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:49,380 INFO L273 TraceCheckUtils]: 27: Hoare triple {18005#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18006#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:49,381 INFO L273 TraceCheckUtils]: 28: Hoare triple {18006#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18006#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:49,382 INFO L273 TraceCheckUtils]: 29: Hoare triple {18006#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18007#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:49,382 INFO L273 TraceCheckUtils]: 30: Hoare triple {18007#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18007#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:49,383 INFO L273 TraceCheckUtils]: 31: Hoare triple {18007#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18008#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:49,383 INFO L273 TraceCheckUtils]: 32: Hoare triple {18008#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18008#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:49,384 INFO L273 TraceCheckUtils]: 33: Hoare triple {18008#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18009#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:49,385 INFO L273 TraceCheckUtils]: 34: Hoare triple {18009#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18009#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:49,385 INFO L273 TraceCheckUtils]: 35: Hoare triple {18009#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18010#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:49,386 INFO L273 TraceCheckUtils]: 36: Hoare triple {18010#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18010#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:49,387 INFO L273 TraceCheckUtils]: 37: Hoare triple {18010#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18011#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:49,387 INFO L273 TraceCheckUtils]: 38: Hoare triple {18011#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18011#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:49,388 INFO L273 TraceCheckUtils]: 39: Hoare triple {18011#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18012#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:49,388 INFO L273 TraceCheckUtils]: 40: Hoare triple {18012#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18012#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:49,389 INFO L273 TraceCheckUtils]: 41: Hoare triple {18012#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18013#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:49,390 INFO L273 TraceCheckUtils]: 42: Hoare triple {18013#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18013#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:49,390 INFO L273 TraceCheckUtils]: 43: Hoare triple {18013#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18014#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:49,391 INFO L273 TraceCheckUtils]: 44: Hoare triple {18014#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18014#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:49,391 INFO L273 TraceCheckUtils]: 45: Hoare triple {18014#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18015#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:49,392 INFO L273 TraceCheckUtils]: 46: Hoare triple {18015#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18015#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:49,393 INFO L273 TraceCheckUtils]: 47: Hoare triple {18015#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18016#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:49,393 INFO L273 TraceCheckUtils]: 48: Hoare triple {18016#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18016#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:49,394 INFO L273 TraceCheckUtils]: 49: Hoare triple {18016#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18017#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:49,394 INFO L273 TraceCheckUtils]: 50: Hoare triple {18017#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18017#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:49,395 INFO L273 TraceCheckUtils]: 51: Hoare triple {18017#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18018#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:49,396 INFO L273 TraceCheckUtils]: 52: Hoare triple {18018#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18018#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:49,396 INFO L273 TraceCheckUtils]: 53: Hoare triple {18018#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18019#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:49,397 INFO L273 TraceCheckUtils]: 54: Hoare triple {18019#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18019#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:49,398 INFO L273 TraceCheckUtils]: 55: Hoare triple {18019#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18020#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:49,398 INFO L273 TraceCheckUtils]: 56: Hoare triple {18020#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18020#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:49,399 INFO L273 TraceCheckUtils]: 57: Hoare triple {18020#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18021#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:49,399 INFO L273 TraceCheckUtils]: 58: Hoare triple {18021#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18021#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:49,400 INFO L273 TraceCheckUtils]: 59: Hoare triple {18021#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18022#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:49,401 INFO L273 TraceCheckUtils]: 60: Hoare triple {18022#(<= main_~i~1 27)} assume !(~i~1 < 1000); {17994#false} is VALID [2018-11-23 12:27:49,401 INFO L256 TraceCheckUtils]: 61: Hoare triple {17994#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {17993#true} is VALID [2018-11-23 12:27:49,401 INFO L273 TraceCheckUtils]: 62: Hoare triple {17993#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17993#true} is VALID [2018-11-23 12:27:49,401 INFO L273 TraceCheckUtils]: 63: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,402 INFO L273 TraceCheckUtils]: 64: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,402 INFO L273 TraceCheckUtils]: 65: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,402 INFO L273 TraceCheckUtils]: 66: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,402 INFO L273 TraceCheckUtils]: 67: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,402 INFO L273 TraceCheckUtils]: 68: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,403 INFO L273 TraceCheckUtils]: 69: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,403 INFO L273 TraceCheckUtils]: 70: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,403 INFO L273 TraceCheckUtils]: 71: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,403 INFO L273 TraceCheckUtils]: 72: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,403 INFO L273 TraceCheckUtils]: 73: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,403 INFO L273 TraceCheckUtils]: 74: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,404 INFO L273 TraceCheckUtils]: 75: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,404 INFO L273 TraceCheckUtils]: 76: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,404 INFO L273 TraceCheckUtils]: 77: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,404 INFO L273 TraceCheckUtils]: 78: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,404 INFO L273 TraceCheckUtils]: 79: Hoare triple {17993#true} assume !(~i~0 < 1000); {17993#true} is VALID [2018-11-23 12:27:49,404 INFO L273 TraceCheckUtils]: 80: Hoare triple {17993#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {17993#true} is VALID [2018-11-23 12:27:49,404 INFO L273 TraceCheckUtils]: 81: Hoare triple {17993#true} assume true; {17993#true} is VALID [2018-11-23 12:27:49,404 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {17993#true} {17994#false} #70#return; {17994#false} is VALID [2018-11-23 12:27:49,404 INFO L273 TraceCheckUtils]: 83: Hoare triple {17994#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {17994#false} is VALID [2018-11-23 12:27:49,405 INFO L256 TraceCheckUtils]: 84: Hoare triple {17994#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {17993#true} is VALID [2018-11-23 12:27:49,405 INFO L273 TraceCheckUtils]: 85: Hoare triple {17993#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17993#true} is VALID [2018-11-23 12:27:49,405 INFO L273 TraceCheckUtils]: 86: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,405 INFO L273 TraceCheckUtils]: 87: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,405 INFO L273 TraceCheckUtils]: 88: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,405 INFO L273 TraceCheckUtils]: 89: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,405 INFO L273 TraceCheckUtils]: 90: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,405 INFO L273 TraceCheckUtils]: 91: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,405 INFO L273 TraceCheckUtils]: 92: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,406 INFO L273 TraceCheckUtils]: 93: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,406 INFO L273 TraceCheckUtils]: 94: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,406 INFO L273 TraceCheckUtils]: 95: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,406 INFO L273 TraceCheckUtils]: 96: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,406 INFO L273 TraceCheckUtils]: 97: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,406 INFO L273 TraceCheckUtils]: 98: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,406 INFO L273 TraceCheckUtils]: 99: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,406 INFO L273 TraceCheckUtils]: 100: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,406 INFO L273 TraceCheckUtils]: 101: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,406 INFO L273 TraceCheckUtils]: 102: Hoare triple {17993#true} assume !(~i~0 < 1000); {17993#true} is VALID [2018-11-23 12:27:49,407 INFO L273 TraceCheckUtils]: 103: Hoare triple {17993#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {17993#true} is VALID [2018-11-23 12:27:49,407 INFO L273 TraceCheckUtils]: 104: Hoare triple {17993#true} assume true; {17993#true} is VALID [2018-11-23 12:27:49,407 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {17993#true} {17994#false} #72#return; {17994#false} is VALID [2018-11-23 12:27:49,407 INFO L273 TraceCheckUtils]: 106: Hoare triple {17994#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {17994#false} is VALID [2018-11-23 12:27:49,407 INFO L273 TraceCheckUtils]: 107: Hoare triple {17994#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17994#false} is VALID [2018-11-23 12:27:49,407 INFO L273 TraceCheckUtils]: 108: Hoare triple {17994#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17994#false} is VALID [2018-11-23 12:27:49,407 INFO L273 TraceCheckUtils]: 109: Hoare triple {17994#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17994#false} is VALID [2018-11-23 12:27:49,407 INFO L273 TraceCheckUtils]: 110: Hoare triple {17994#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17994#false} is VALID [2018-11-23 12:27:49,407 INFO L273 TraceCheckUtils]: 111: Hoare triple {17994#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17994#false} is VALID [2018-11-23 12:27:49,408 INFO L273 TraceCheckUtils]: 112: Hoare triple {17994#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17994#false} is VALID [2018-11-23 12:27:49,408 INFO L273 TraceCheckUtils]: 113: Hoare triple {17994#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17994#false} is VALID [2018-11-23 12:27:49,408 INFO L273 TraceCheckUtils]: 114: Hoare triple {17994#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17994#false} is VALID [2018-11-23 12:27:49,408 INFO L273 TraceCheckUtils]: 115: Hoare triple {17994#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17994#false} is VALID [2018-11-23 12:27:49,408 INFO L273 TraceCheckUtils]: 116: Hoare triple {17994#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17994#false} is VALID [2018-11-23 12:27:49,408 INFO L273 TraceCheckUtils]: 117: Hoare triple {17994#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17994#false} is VALID [2018-11-23 12:27:49,408 INFO L273 TraceCheckUtils]: 118: Hoare triple {17994#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17994#false} is VALID [2018-11-23 12:27:49,408 INFO L273 TraceCheckUtils]: 119: Hoare triple {17994#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17994#false} is VALID [2018-11-23 12:27:49,408 INFO L273 TraceCheckUtils]: 120: Hoare triple {17994#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17994#false} is VALID [2018-11-23 12:27:49,408 INFO L273 TraceCheckUtils]: 121: Hoare triple {17994#false} assume !(~i~2 < 999); {17994#false} is VALID [2018-11-23 12:27:49,409 INFO L273 TraceCheckUtils]: 122: Hoare triple {17994#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {17994#false} is VALID [2018-11-23 12:27:49,409 INFO L256 TraceCheckUtils]: 123: Hoare triple {17994#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {17993#true} is VALID [2018-11-23 12:27:49,409 INFO L273 TraceCheckUtils]: 124: Hoare triple {17993#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17993#true} is VALID [2018-11-23 12:27:49,409 INFO L273 TraceCheckUtils]: 125: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,409 INFO L273 TraceCheckUtils]: 126: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,409 INFO L273 TraceCheckUtils]: 127: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,409 INFO L273 TraceCheckUtils]: 128: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,409 INFO L273 TraceCheckUtils]: 129: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,409 INFO L273 TraceCheckUtils]: 130: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,410 INFO L273 TraceCheckUtils]: 131: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,410 INFO L273 TraceCheckUtils]: 132: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,410 INFO L273 TraceCheckUtils]: 133: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,410 INFO L273 TraceCheckUtils]: 134: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,410 INFO L273 TraceCheckUtils]: 135: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,410 INFO L273 TraceCheckUtils]: 136: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,410 INFO L273 TraceCheckUtils]: 137: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,410 INFO L273 TraceCheckUtils]: 138: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,410 INFO L273 TraceCheckUtils]: 139: Hoare triple {17993#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17993#true} is VALID [2018-11-23 12:27:49,410 INFO L273 TraceCheckUtils]: 140: Hoare triple {17993#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17993#true} is VALID [2018-11-23 12:27:49,411 INFO L273 TraceCheckUtils]: 141: Hoare triple {17993#true} assume !(~i~0 < 1000); {17993#true} is VALID [2018-11-23 12:27:49,411 INFO L273 TraceCheckUtils]: 142: Hoare triple {17993#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {17993#true} is VALID [2018-11-23 12:27:49,411 INFO L273 TraceCheckUtils]: 143: Hoare triple {17993#true} assume true; {17993#true} is VALID [2018-11-23 12:27:49,411 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {17993#true} {17994#false} #74#return; {17994#false} is VALID [2018-11-23 12:27:49,411 INFO L273 TraceCheckUtils]: 145: Hoare triple {17994#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {17994#false} is VALID [2018-11-23 12:27:49,411 INFO L273 TraceCheckUtils]: 146: Hoare triple {17994#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {17994#false} is VALID [2018-11-23 12:27:49,411 INFO L273 TraceCheckUtils]: 147: Hoare triple {17994#false} assume !false; {17994#false} is VALID [2018-11-23 12:27:49,421 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:27:49,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:49,422 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:27:49,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:49,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:49,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:49,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:49,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {17993#true} call ULTIMATE.init(); {17993#true} is VALID [2018-11-23 12:27:49,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {17993#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17993#true} is VALID [2018-11-23 12:27:49,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {17993#true} assume true; {17993#true} is VALID [2018-11-23 12:27:49,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17993#true} {17993#true} #66#return; {17993#true} is VALID [2018-11-23 12:27:49,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {17993#true} call #t~ret12 := main(); {17993#true} is VALID [2018-11-23 12:27:49,826 INFO L273 TraceCheckUtils]: 5: Hoare triple {17993#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {18041#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:49,826 INFO L273 TraceCheckUtils]: 6: Hoare triple {18041#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18041#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:49,827 INFO L273 TraceCheckUtils]: 7: Hoare triple {18041#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17996#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:49,827 INFO L273 TraceCheckUtils]: 8: Hoare triple {17996#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17996#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:49,827 INFO L273 TraceCheckUtils]: 9: Hoare triple {17996#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17997#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:49,828 INFO L273 TraceCheckUtils]: 10: Hoare triple {17997#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17997#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:49,828 INFO L273 TraceCheckUtils]: 11: Hoare triple {17997#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17998#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:49,828 INFO L273 TraceCheckUtils]: 12: Hoare triple {17998#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17998#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:49,829 INFO L273 TraceCheckUtils]: 13: Hoare triple {17998#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17999#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:49,829 INFO L273 TraceCheckUtils]: 14: Hoare triple {17999#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17999#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:49,830 INFO L273 TraceCheckUtils]: 15: Hoare triple {17999#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18000#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:49,830 INFO L273 TraceCheckUtils]: 16: Hoare triple {18000#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18000#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:49,831 INFO L273 TraceCheckUtils]: 17: Hoare triple {18000#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18001#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:49,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {18001#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18001#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:49,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {18001#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18002#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:49,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {18002#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18002#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:49,834 INFO L273 TraceCheckUtils]: 21: Hoare triple {18002#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18003#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:49,834 INFO L273 TraceCheckUtils]: 22: Hoare triple {18003#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18003#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:49,835 INFO L273 TraceCheckUtils]: 23: Hoare triple {18003#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18004#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:49,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {18004#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18004#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:49,836 INFO L273 TraceCheckUtils]: 25: Hoare triple {18004#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18005#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:49,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {18005#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18005#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:49,837 INFO L273 TraceCheckUtils]: 27: Hoare triple {18005#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18006#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:49,838 INFO L273 TraceCheckUtils]: 28: Hoare triple {18006#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18006#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:49,839 INFO L273 TraceCheckUtils]: 29: Hoare triple {18006#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18007#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:49,839 INFO L273 TraceCheckUtils]: 30: Hoare triple {18007#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18007#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:49,840 INFO L273 TraceCheckUtils]: 31: Hoare triple {18007#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18008#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:49,840 INFO L273 TraceCheckUtils]: 32: Hoare triple {18008#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18008#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:49,841 INFO L273 TraceCheckUtils]: 33: Hoare triple {18008#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18009#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:49,842 INFO L273 TraceCheckUtils]: 34: Hoare triple {18009#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18009#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:49,842 INFO L273 TraceCheckUtils]: 35: Hoare triple {18009#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18010#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:49,843 INFO L273 TraceCheckUtils]: 36: Hoare triple {18010#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18010#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:49,844 INFO L273 TraceCheckUtils]: 37: Hoare triple {18010#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18011#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:49,844 INFO L273 TraceCheckUtils]: 38: Hoare triple {18011#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18011#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:49,845 INFO L273 TraceCheckUtils]: 39: Hoare triple {18011#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18012#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:49,845 INFO L273 TraceCheckUtils]: 40: Hoare triple {18012#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18012#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:49,846 INFO L273 TraceCheckUtils]: 41: Hoare triple {18012#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18013#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:49,847 INFO L273 TraceCheckUtils]: 42: Hoare triple {18013#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18013#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:49,847 INFO L273 TraceCheckUtils]: 43: Hoare triple {18013#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18014#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:49,848 INFO L273 TraceCheckUtils]: 44: Hoare triple {18014#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18014#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:49,849 INFO L273 TraceCheckUtils]: 45: Hoare triple {18014#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18015#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:49,849 INFO L273 TraceCheckUtils]: 46: Hoare triple {18015#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18015#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:49,850 INFO L273 TraceCheckUtils]: 47: Hoare triple {18015#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18016#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:49,850 INFO L273 TraceCheckUtils]: 48: Hoare triple {18016#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18016#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:49,851 INFO L273 TraceCheckUtils]: 49: Hoare triple {18016#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18017#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:49,852 INFO L273 TraceCheckUtils]: 50: Hoare triple {18017#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18017#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:49,852 INFO L273 TraceCheckUtils]: 51: Hoare triple {18017#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18018#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:49,853 INFO L273 TraceCheckUtils]: 52: Hoare triple {18018#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18018#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:49,854 INFO L273 TraceCheckUtils]: 53: Hoare triple {18018#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18019#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:49,854 INFO L273 TraceCheckUtils]: 54: Hoare triple {18019#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18019#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:49,855 INFO L273 TraceCheckUtils]: 55: Hoare triple {18019#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18020#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:49,855 INFO L273 TraceCheckUtils]: 56: Hoare triple {18020#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18020#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:49,856 INFO L273 TraceCheckUtils]: 57: Hoare triple {18020#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18021#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:49,857 INFO L273 TraceCheckUtils]: 58: Hoare triple {18021#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18021#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:49,857 INFO L273 TraceCheckUtils]: 59: Hoare triple {18021#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {18022#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:49,858 INFO L273 TraceCheckUtils]: 60: Hoare triple {18022#(<= main_~i~1 27)} assume !(~i~1 < 1000); {17994#false} is VALID [2018-11-23 12:27:49,858 INFO L256 TraceCheckUtils]: 61: Hoare triple {17994#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {17994#false} is VALID [2018-11-23 12:27:49,858 INFO L273 TraceCheckUtils]: 62: Hoare triple {17994#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17994#false} is VALID [2018-11-23 12:27:49,859 INFO L273 TraceCheckUtils]: 63: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,859 INFO L273 TraceCheckUtils]: 64: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,859 INFO L273 TraceCheckUtils]: 65: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,859 INFO L273 TraceCheckUtils]: 66: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,859 INFO L273 TraceCheckUtils]: 67: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,860 INFO L273 TraceCheckUtils]: 68: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,860 INFO L273 TraceCheckUtils]: 69: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,860 INFO L273 TraceCheckUtils]: 70: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,860 INFO L273 TraceCheckUtils]: 71: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,860 INFO L273 TraceCheckUtils]: 72: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,860 INFO L273 TraceCheckUtils]: 73: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,861 INFO L273 TraceCheckUtils]: 74: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,861 INFO L273 TraceCheckUtils]: 75: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,861 INFO L273 TraceCheckUtils]: 76: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,861 INFO L273 TraceCheckUtils]: 77: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,861 INFO L273 TraceCheckUtils]: 78: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,861 INFO L273 TraceCheckUtils]: 79: Hoare triple {17994#false} assume !(~i~0 < 1000); {17994#false} is VALID [2018-11-23 12:27:49,861 INFO L273 TraceCheckUtils]: 80: Hoare triple {17994#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {17994#false} is VALID [2018-11-23 12:27:49,861 INFO L273 TraceCheckUtils]: 81: Hoare triple {17994#false} assume true; {17994#false} is VALID [2018-11-23 12:27:49,861 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {17994#false} {17994#false} #70#return; {17994#false} is VALID [2018-11-23 12:27:49,862 INFO L273 TraceCheckUtils]: 83: Hoare triple {17994#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {17994#false} is VALID [2018-11-23 12:27:49,862 INFO L256 TraceCheckUtils]: 84: Hoare triple {17994#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {17994#false} is VALID [2018-11-23 12:27:49,862 INFO L273 TraceCheckUtils]: 85: Hoare triple {17994#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17994#false} is VALID [2018-11-23 12:27:49,862 INFO L273 TraceCheckUtils]: 86: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,862 INFO L273 TraceCheckUtils]: 87: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,862 INFO L273 TraceCheckUtils]: 88: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,862 INFO L273 TraceCheckUtils]: 89: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,862 INFO L273 TraceCheckUtils]: 90: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,862 INFO L273 TraceCheckUtils]: 91: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,862 INFO L273 TraceCheckUtils]: 92: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,863 INFO L273 TraceCheckUtils]: 93: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,863 INFO L273 TraceCheckUtils]: 94: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,863 INFO L273 TraceCheckUtils]: 95: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,863 INFO L273 TraceCheckUtils]: 96: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,863 INFO L273 TraceCheckUtils]: 97: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,863 INFO L273 TraceCheckUtils]: 98: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,863 INFO L273 TraceCheckUtils]: 99: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,863 INFO L273 TraceCheckUtils]: 100: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,863 INFO L273 TraceCheckUtils]: 101: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,864 INFO L273 TraceCheckUtils]: 102: Hoare triple {17994#false} assume !(~i~0 < 1000); {17994#false} is VALID [2018-11-23 12:27:49,864 INFO L273 TraceCheckUtils]: 103: Hoare triple {17994#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {17994#false} is VALID [2018-11-23 12:27:49,864 INFO L273 TraceCheckUtils]: 104: Hoare triple {17994#false} assume true; {17994#false} is VALID [2018-11-23 12:27:49,864 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {17994#false} {17994#false} #72#return; {17994#false} is VALID [2018-11-23 12:27:49,864 INFO L273 TraceCheckUtils]: 106: Hoare triple {17994#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {17994#false} is VALID [2018-11-23 12:27:49,864 INFO L273 TraceCheckUtils]: 107: Hoare triple {17994#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17994#false} is VALID [2018-11-23 12:27:49,864 INFO L273 TraceCheckUtils]: 108: Hoare triple {17994#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17994#false} is VALID [2018-11-23 12:27:49,864 INFO L273 TraceCheckUtils]: 109: Hoare triple {17994#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17994#false} is VALID [2018-11-23 12:27:49,864 INFO L273 TraceCheckUtils]: 110: Hoare triple {17994#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17994#false} is VALID [2018-11-23 12:27:49,864 INFO L273 TraceCheckUtils]: 111: Hoare triple {17994#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17994#false} is VALID [2018-11-23 12:27:49,865 INFO L273 TraceCheckUtils]: 112: Hoare triple {17994#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17994#false} is VALID [2018-11-23 12:27:49,865 INFO L273 TraceCheckUtils]: 113: Hoare triple {17994#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17994#false} is VALID [2018-11-23 12:27:49,865 INFO L273 TraceCheckUtils]: 114: Hoare triple {17994#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17994#false} is VALID [2018-11-23 12:27:49,865 INFO L273 TraceCheckUtils]: 115: Hoare triple {17994#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17994#false} is VALID [2018-11-23 12:27:49,865 INFO L273 TraceCheckUtils]: 116: Hoare triple {17994#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17994#false} is VALID [2018-11-23 12:27:49,865 INFO L273 TraceCheckUtils]: 117: Hoare triple {17994#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17994#false} is VALID [2018-11-23 12:27:49,865 INFO L273 TraceCheckUtils]: 118: Hoare triple {17994#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17994#false} is VALID [2018-11-23 12:27:49,865 INFO L273 TraceCheckUtils]: 119: Hoare triple {17994#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17994#false} is VALID [2018-11-23 12:27:49,865 INFO L273 TraceCheckUtils]: 120: Hoare triple {17994#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17994#false} is VALID [2018-11-23 12:27:49,866 INFO L273 TraceCheckUtils]: 121: Hoare triple {17994#false} assume !(~i~2 < 999); {17994#false} is VALID [2018-11-23 12:27:49,866 INFO L273 TraceCheckUtils]: 122: Hoare triple {17994#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {17994#false} is VALID [2018-11-23 12:27:49,866 INFO L256 TraceCheckUtils]: 123: Hoare triple {17994#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {17994#false} is VALID [2018-11-23 12:27:49,866 INFO L273 TraceCheckUtils]: 124: Hoare triple {17994#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17994#false} is VALID [2018-11-23 12:27:49,866 INFO L273 TraceCheckUtils]: 125: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,866 INFO L273 TraceCheckUtils]: 126: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,866 INFO L273 TraceCheckUtils]: 127: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,866 INFO L273 TraceCheckUtils]: 128: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,866 INFO L273 TraceCheckUtils]: 129: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,867 INFO L273 TraceCheckUtils]: 130: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,867 INFO L273 TraceCheckUtils]: 131: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,867 INFO L273 TraceCheckUtils]: 132: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,867 INFO L273 TraceCheckUtils]: 133: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,867 INFO L273 TraceCheckUtils]: 134: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,867 INFO L273 TraceCheckUtils]: 135: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,867 INFO L273 TraceCheckUtils]: 136: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,867 INFO L273 TraceCheckUtils]: 137: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,867 INFO L273 TraceCheckUtils]: 138: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,867 INFO L273 TraceCheckUtils]: 139: Hoare triple {17994#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17994#false} is VALID [2018-11-23 12:27:49,868 INFO L273 TraceCheckUtils]: 140: Hoare triple {17994#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17994#false} is VALID [2018-11-23 12:27:49,868 INFO L273 TraceCheckUtils]: 141: Hoare triple {17994#false} assume !(~i~0 < 1000); {17994#false} is VALID [2018-11-23 12:27:49,868 INFO L273 TraceCheckUtils]: 142: Hoare triple {17994#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {17994#false} is VALID [2018-11-23 12:27:49,868 INFO L273 TraceCheckUtils]: 143: Hoare triple {17994#false} assume true; {17994#false} is VALID [2018-11-23 12:27:49,868 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {17994#false} {17994#false} #74#return; {17994#false} is VALID [2018-11-23 12:27:49,868 INFO L273 TraceCheckUtils]: 145: Hoare triple {17994#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {17994#false} is VALID [2018-11-23 12:27:49,868 INFO L273 TraceCheckUtils]: 146: Hoare triple {17994#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {17994#false} is VALID [2018-11-23 12:27:49,868 INFO L273 TraceCheckUtils]: 147: Hoare triple {17994#false} assume !false; {17994#false} is VALID [2018-11-23 12:27:49,878 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:27:49,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:49,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 12:27:49,899 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 148 [2018-11-23 12:27:49,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:49,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:27:50,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:50,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:27:50,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:27:50,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:27:50,062 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 31 states. [2018-11-23 12:27:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:50,931 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2018-11-23 12:27:50,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:27:50,932 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 148 [2018-11-23 12:27:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:27:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 108 transitions. [2018-11-23 12:27:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:27:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 108 transitions. [2018-11-23 12:27:50,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 108 transitions. [2018-11-23 12:27:51,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:51,079 INFO L225 Difference]: With dead ends: 156 [2018-11-23 12:27:51,080 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 12:27:51,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:27:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 12:27:51,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-11-23 12:27:51,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:51,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 109 states. [2018-11-23 12:27:51,130 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 109 states. [2018-11-23 12:27:51,130 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 109 states. [2018-11-23 12:27:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:51,132 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-11-23 12:27:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-11-23 12:27:51,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:51,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:51,133 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 110 states. [2018-11-23 12:27:51,133 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 110 states. [2018-11-23 12:27:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:51,135 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-11-23 12:27:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-11-23 12:27:51,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:51,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:51,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:51,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 12:27:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-11-23 12:27:51,139 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 148 [2018-11-23 12:27:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:51,139 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-11-23 12:27:51,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:27:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-23 12:27:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-23 12:27:51,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:51,140 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 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:27:51,140 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:51,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:51,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1342318677, now seen corresponding path program 27 times [2018-11-23 12:27:51,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:51,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:51,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:51,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:51,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:51,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {19081#true} call ULTIMATE.init(); {19081#true} is VALID [2018-11-23 12:27:51,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {19081#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19081#true} is VALID [2018-11-23 12:27:51,800 INFO L273 TraceCheckUtils]: 2: Hoare triple {19081#true} assume true; {19081#true} is VALID [2018-11-23 12:27:51,800 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19081#true} {19081#true} #66#return; {19081#true} is VALID [2018-11-23 12:27:51,800 INFO L256 TraceCheckUtils]: 4: Hoare triple {19081#true} call #t~ret12 := main(); {19081#true} is VALID [2018-11-23 12:27:51,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {19081#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19083#(= main_~i~1 0)} is VALID [2018-11-23 12:27:51,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {19083#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19083#(= main_~i~1 0)} is VALID [2018-11-23 12:27:51,802 INFO L273 TraceCheckUtils]: 7: Hoare triple {19083#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19084#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:51,802 INFO L273 TraceCheckUtils]: 8: Hoare triple {19084#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19084#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:51,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {19084#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19085#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:51,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {19085#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19085#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:51,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {19085#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19086#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:51,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {19086#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19086#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:51,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {19086#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19087#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:51,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {19087#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19087#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:51,805 INFO L273 TraceCheckUtils]: 15: Hoare triple {19087#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19088#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:51,805 INFO L273 TraceCheckUtils]: 16: Hoare triple {19088#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19088#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:51,806 INFO L273 TraceCheckUtils]: 17: Hoare triple {19088#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19089#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:51,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {19089#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19089#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:51,807 INFO L273 TraceCheckUtils]: 19: Hoare triple {19089#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19090#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:51,808 INFO L273 TraceCheckUtils]: 20: Hoare triple {19090#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19090#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:51,808 INFO L273 TraceCheckUtils]: 21: Hoare triple {19090#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19091#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:51,809 INFO L273 TraceCheckUtils]: 22: Hoare triple {19091#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19091#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:51,810 INFO L273 TraceCheckUtils]: 23: Hoare triple {19091#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19092#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:51,810 INFO L273 TraceCheckUtils]: 24: Hoare triple {19092#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19092#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:51,811 INFO L273 TraceCheckUtils]: 25: Hoare triple {19092#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19093#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:51,811 INFO L273 TraceCheckUtils]: 26: Hoare triple {19093#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19093#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:51,812 INFO L273 TraceCheckUtils]: 27: Hoare triple {19093#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19094#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:51,813 INFO L273 TraceCheckUtils]: 28: Hoare triple {19094#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19094#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:51,813 INFO L273 TraceCheckUtils]: 29: Hoare triple {19094#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19095#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:51,814 INFO L273 TraceCheckUtils]: 30: Hoare triple {19095#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19095#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:51,815 INFO L273 TraceCheckUtils]: 31: Hoare triple {19095#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19096#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:51,815 INFO L273 TraceCheckUtils]: 32: Hoare triple {19096#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19096#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:51,816 INFO L273 TraceCheckUtils]: 33: Hoare triple {19096#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19097#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:51,816 INFO L273 TraceCheckUtils]: 34: Hoare triple {19097#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19097#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:51,817 INFO L273 TraceCheckUtils]: 35: Hoare triple {19097#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19098#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:51,818 INFO L273 TraceCheckUtils]: 36: Hoare triple {19098#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19098#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:51,818 INFO L273 TraceCheckUtils]: 37: Hoare triple {19098#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19099#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:51,819 INFO L273 TraceCheckUtils]: 38: Hoare triple {19099#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19099#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:51,820 INFO L273 TraceCheckUtils]: 39: Hoare triple {19099#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19100#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:51,820 INFO L273 TraceCheckUtils]: 40: Hoare triple {19100#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19100#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:51,821 INFO L273 TraceCheckUtils]: 41: Hoare triple {19100#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19101#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:51,821 INFO L273 TraceCheckUtils]: 42: Hoare triple {19101#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19101#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:51,822 INFO L273 TraceCheckUtils]: 43: Hoare triple {19101#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19102#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:51,823 INFO L273 TraceCheckUtils]: 44: Hoare triple {19102#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19102#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:51,823 INFO L273 TraceCheckUtils]: 45: Hoare triple {19102#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19103#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:51,824 INFO L273 TraceCheckUtils]: 46: Hoare triple {19103#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19103#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:51,825 INFO L273 TraceCheckUtils]: 47: Hoare triple {19103#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19104#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:51,825 INFO L273 TraceCheckUtils]: 48: Hoare triple {19104#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19104#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:51,826 INFO L273 TraceCheckUtils]: 49: Hoare triple {19104#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19105#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:51,826 INFO L273 TraceCheckUtils]: 50: Hoare triple {19105#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19105#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:51,827 INFO L273 TraceCheckUtils]: 51: Hoare triple {19105#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19106#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:51,828 INFO L273 TraceCheckUtils]: 52: Hoare triple {19106#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19106#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:51,828 INFO L273 TraceCheckUtils]: 53: Hoare triple {19106#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19107#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:51,829 INFO L273 TraceCheckUtils]: 54: Hoare triple {19107#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19107#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:51,830 INFO L273 TraceCheckUtils]: 55: Hoare triple {19107#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19108#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:51,830 INFO L273 TraceCheckUtils]: 56: Hoare triple {19108#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19108#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:51,831 INFO L273 TraceCheckUtils]: 57: Hoare triple {19108#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19109#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:51,831 INFO L273 TraceCheckUtils]: 58: Hoare triple {19109#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19109#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:51,832 INFO L273 TraceCheckUtils]: 59: Hoare triple {19109#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19110#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:51,833 INFO L273 TraceCheckUtils]: 60: Hoare triple {19110#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19110#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:51,833 INFO L273 TraceCheckUtils]: 61: Hoare triple {19110#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19111#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:51,834 INFO L273 TraceCheckUtils]: 62: Hoare triple {19111#(<= main_~i~1 28)} assume !(~i~1 < 1000); {19082#false} is VALID [2018-11-23 12:27:51,834 INFO L256 TraceCheckUtils]: 63: Hoare triple {19082#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {19081#true} is VALID [2018-11-23 12:27:51,834 INFO L273 TraceCheckUtils]: 64: Hoare triple {19081#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19081#true} is VALID [2018-11-23 12:27:51,835 INFO L273 TraceCheckUtils]: 65: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,835 INFO L273 TraceCheckUtils]: 66: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,835 INFO L273 TraceCheckUtils]: 67: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,835 INFO L273 TraceCheckUtils]: 68: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,835 INFO L273 TraceCheckUtils]: 69: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,835 INFO L273 TraceCheckUtils]: 70: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,836 INFO L273 TraceCheckUtils]: 71: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,836 INFO L273 TraceCheckUtils]: 72: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,836 INFO L273 TraceCheckUtils]: 73: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,836 INFO L273 TraceCheckUtils]: 74: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,836 INFO L273 TraceCheckUtils]: 75: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,837 INFO L273 TraceCheckUtils]: 76: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,837 INFO L273 TraceCheckUtils]: 77: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,837 INFO L273 TraceCheckUtils]: 78: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,837 INFO L273 TraceCheckUtils]: 79: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,837 INFO L273 TraceCheckUtils]: 80: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,837 INFO L273 TraceCheckUtils]: 81: Hoare triple {19081#true} assume !(~i~0 < 1000); {19081#true} is VALID [2018-11-23 12:27:51,837 INFO L273 TraceCheckUtils]: 82: Hoare triple {19081#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {19081#true} is VALID [2018-11-23 12:27:51,838 INFO L273 TraceCheckUtils]: 83: Hoare triple {19081#true} assume true; {19081#true} is VALID [2018-11-23 12:27:51,838 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {19081#true} {19082#false} #70#return; {19082#false} is VALID [2018-11-23 12:27:51,838 INFO L273 TraceCheckUtils]: 85: Hoare triple {19082#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {19082#false} is VALID [2018-11-23 12:27:51,838 INFO L256 TraceCheckUtils]: 86: Hoare triple {19082#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {19081#true} is VALID [2018-11-23 12:27:51,838 INFO L273 TraceCheckUtils]: 87: Hoare triple {19081#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19081#true} is VALID [2018-11-23 12:27:51,838 INFO L273 TraceCheckUtils]: 88: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,838 INFO L273 TraceCheckUtils]: 89: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,838 INFO L273 TraceCheckUtils]: 90: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,838 INFO L273 TraceCheckUtils]: 91: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,838 INFO L273 TraceCheckUtils]: 92: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,839 INFO L273 TraceCheckUtils]: 93: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,839 INFO L273 TraceCheckUtils]: 94: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,839 INFO L273 TraceCheckUtils]: 95: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,839 INFO L273 TraceCheckUtils]: 96: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,839 INFO L273 TraceCheckUtils]: 97: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,839 INFO L273 TraceCheckUtils]: 98: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,839 INFO L273 TraceCheckUtils]: 99: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,839 INFO L273 TraceCheckUtils]: 100: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,839 INFO L273 TraceCheckUtils]: 101: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,840 INFO L273 TraceCheckUtils]: 102: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,840 INFO L273 TraceCheckUtils]: 103: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,840 INFO L273 TraceCheckUtils]: 104: Hoare triple {19081#true} assume !(~i~0 < 1000); {19081#true} is VALID [2018-11-23 12:27:51,840 INFO L273 TraceCheckUtils]: 105: Hoare triple {19081#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {19081#true} is VALID [2018-11-23 12:27:51,840 INFO L273 TraceCheckUtils]: 106: Hoare triple {19081#true} assume true; {19081#true} is VALID [2018-11-23 12:27:51,840 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {19081#true} {19082#false} #72#return; {19082#false} is VALID [2018-11-23 12:27:51,840 INFO L273 TraceCheckUtils]: 108: Hoare triple {19082#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {19082#false} is VALID [2018-11-23 12:27:51,840 INFO L273 TraceCheckUtils]: 109: Hoare triple {19082#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19082#false} is VALID [2018-11-23 12:27:51,840 INFO L273 TraceCheckUtils]: 110: Hoare triple {19082#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19082#false} is VALID [2018-11-23 12:27:51,840 INFO L273 TraceCheckUtils]: 111: Hoare triple {19082#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19082#false} is VALID [2018-11-23 12:27:51,841 INFO L273 TraceCheckUtils]: 112: Hoare triple {19082#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19082#false} is VALID [2018-11-23 12:27:51,841 INFO L273 TraceCheckUtils]: 113: Hoare triple {19082#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19082#false} is VALID [2018-11-23 12:27:51,841 INFO L273 TraceCheckUtils]: 114: Hoare triple {19082#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19082#false} is VALID [2018-11-23 12:27:51,841 INFO L273 TraceCheckUtils]: 115: Hoare triple {19082#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19082#false} is VALID [2018-11-23 12:27:51,841 INFO L273 TraceCheckUtils]: 116: Hoare triple {19082#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19082#false} is VALID [2018-11-23 12:27:51,841 INFO L273 TraceCheckUtils]: 117: Hoare triple {19082#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19082#false} is VALID [2018-11-23 12:27:51,841 INFO L273 TraceCheckUtils]: 118: Hoare triple {19082#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19082#false} is VALID [2018-11-23 12:27:51,841 INFO L273 TraceCheckUtils]: 119: Hoare triple {19082#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19082#false} is VALID [2018-11-23 12:27:51,841 INFO L273 TraceCheckUtils]: 120: Hoare triple {19082#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19082#false} is VALID [2018-11-23 12:27:51,842 INFO L273 TraceCheckUtils]: 121: Hoare triple {19082#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19082#false} is VALID [2018-11-23 12:27:51,842 INFO L273 TraceCheckUtils]: 122: Hoare triple {19082#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19082#false} is VALID [2018-11-23 12:27:51,842 INFO L273 TraceCheckUtils]: 123: Hoare triple {19082#false} assume !(~i~2 < 999); {19082#false} is VALID [2018-11-23 12:27:51,842 INFO L273 TraceCheckUtils]: 124: Hoare triple {19082#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {19082#false} is VALID [2018-11-23 12:27:51,842 INFO L256 TraceCheckUtils]: 125: Hoare triple {19082#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {19081#true} is VALID [2018-11-23 12:27:51,842 INFO L273 TraceCheckUtils]: 126: Hoare triple {19081#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19081#true} is VALID [2018-11-23 12:27:51,842 INFO L273 TraceCheckUtils]: 127: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,842 INFO L273 TraceCheckUtils]: 128: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,842 INFO L273 TraceCheckUtils]: 129: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,843 INFO L273 TraceCheckUtils]: 130: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,843 INFO L273 TraceCheckUtils]: 131: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,843 INFO L273 TraceCheckUtils]: 132: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,843 INFO L273 TraceCheckUtils]: 133: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,843 INFO L273 TraceCheckUtils]: 134: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,843 INFO L273 TraceCheckUtils]: 135: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,843 INFO L273 TraceCheckUtils]: 136: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,843 INFO L273 TraceCheckUtils]: 137: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,843 INFO L273 TraceCheckUtils]: 138: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,843 INFO L273 TraceCheckUtils]: 139: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,844 INFO L273 TraceCheckUtils]: 140: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,844 INFO L273 TraceCheckUtils]: 141: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:51,844 INFO L273 TraceCheckUtils]: 142: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:51,844 INFO L273 TraceCheckUtils]: 143: Hoare triple {19081#true} assume !(~i~0 < 1000); {19081#true} is VALID [2018-11-23 12:27:51,844 INFO L273 TraceCheckUtils]: 144: Hoare triple {19081#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {19081#true} is VALID [2018-11-23 12:27:51,844 INFO L273 TraceCheckUtils]: 145: Hoare triple {19081#true} assume true; {19081#true} is VALID [2018-11-23 12:27:51,844 INFO L268 TraceCheckUtils]: 146: Hoare quadruple {19081#true} {19082#false} #74#return; {19082#false} is VALID [2018-11-23 12:27:51,844 INFO L273 TraceCheckUtils]: 147: Hoare triple {19082#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {19082#false} is VALID [2018-11-23 12:27:51,844 INFO L273 TraceCheckUtils]: 148: Hoare triple {19082#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {19082#false} is VALID [2018-11-23 12:27:51,845 INFO L273 TraceCheckUtils]: 149: Hoare triple {19082#false} assume !false; {19082#false} is VALID [2018-11-23 12:27:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:27:51,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:51,885 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:27:51,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:52,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:27:52,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:52,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:52,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {19081#true} call ULTIMATE.init(); {19081#true} is VALID [2018-11-23 12:27:52,372 INFO L273 TraceCheckUtils]: 1: Hoare triple {19081#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19081#true} is VALID [2018-11-23 12:27:52,372 INFO L273 TraceCheckUtils]: 2: Hoare triple {19081#true} assume true; {19081#true} is VALID [2018-11-23 12:27:52,372 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19081#true} {19081#true} #66#return; {19081#true} is VALID [2018-11-23 12:27:52,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {19081#true} call #t~ret12 := main(); {19081#true} is VALID [2018-11-23 12:27:52,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {19081#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19081#true} is VALID [2018-11-23 12:27:52,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,373 INFO L273 TraceCheckUtils]: 7: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,374 INFO L273 TraceCheckUtils]: 14: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,375 INFO L273 TraceCheckUtils]: 16: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,375 INFO L273 TraceCheckUtils]: 17: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,375 INFO L273 TraceCheckUtils]: 19: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,375 INFO L273 TraceCheckUtils]: 20: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,375 INFO L273 TraceCheckUtils]: 21: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,375 INFO L273 TraceCheckUtils]: 22: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,375 INFO L273 TraceCheckUtils]: 23: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,375 INFO L273 TraceCheckUtils]: 24: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,376 INFO L273 TraceCheckUtils]: 25: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,376 INFO L273 TraceCheckUtils]: 26: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,376 INFO L273 TraceCheckUtils]: 27: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,376 INFO L273 TraceCheckUtils]: 28: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,376 INFO L273 TraceCheckUtils]: 29: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,376 INFO L273 TraceCheckUtils]: 30: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,376 INFO L273 TraceCheckUtils]: 31: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,376 INFO L273 TraceCheckUtils]: 32: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,376 INFO L273 TraceCheckUtils]: 33: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,376 INFO L273 TraceCheckUtils]: 34: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,377 INFO L273 TraceCheckUtils]: 35: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,377 INFO L273 TraceCheckUtils]: 36: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,377 INFO L273 TraceCheckUtils]: 37: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,377 INFO L273 TraceCheckUtils]: 38: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,377 INFO L273 TraceCheckUtils]: 39: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,377 INFO L273 TraceCheckUtils]: 40: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,377 INFO L273 TraceCheckUtils]: 41: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,377 INFO L273 TraceCheckUtils]: 42: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,377 INFO L273 TraceCheckUtils]: 43: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,378 INFO L273 TraceCheckUtils]: 44: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,378 INFO L273 TraceCheckUtils]: 45: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,378 INFO L273 TraceCheckUtils]: 46: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,378 INFO L273 TraceCheckUtils]: 47: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,378 INFO L273 TraceCheckUtils]: 48: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,378 INFO L273 TraceCheckUtils]: 49: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,378 INFO L273 TraceCheckUtils]: 50: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,378 INFO L273 TraceCheckUtils]: 51: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,378 INFO L273 TraceCheckUtils]: 52: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,378 INFO L273 TraceCheckUtils]: 53: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,379 INFO L273 TraceCheckUtils]: 54: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,379 INFO L273 TraceCheckUtils]: 55: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,379 INFO L273 TraceCheckUtils]: 56: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,379 INFO L273 TraceCheckUtils]: 57: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,379 INFO L273 TraceCheckUtils]: 58: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,379 INFO L273 TraceCheckUtils]: 59: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,379 INFO L273 TraceCheckUtils]: 60: Hoare triple {19081#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19081#true} is VALID [2018-11-23 12:27:52,379 INFO L273 TraceCheckUtils]: 61: Hoare triple {19081#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19081#true} is VALID [2018-11-23 12:27:52,379 INFO L273 TraceCheckUtils]: 62: Hoare triple {19081#true} assume !(~i~1 < 1000); {19081#true} is VALID [2018-11-23 12:27:52,380 INFO L256 TraceCheckUtils]: 63: Hoare triple {19081#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {19081#true} is VALID [2018-11-23 12:27:52,380 INFO L273 TraceCheckUtils]: 64: Hoare triple {19081#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19081#true} is VALID [2018-11-23 12:27:52,380 INFO L273 TraceCheckUtils]: 65: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,380 INFO L273 TraceCheckUtils]: 66: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,380 INFO L273 TraceCheckUtils]: 67: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,380 INFO L273 TraceCheckUtils]: 68: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,380 INFO L273 TraceCheckUtils]: 69: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,380 INFO L273 TraceCheckUtils]: 70: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,380 INFO L273 TraceCheckUtils]: 71: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,380 INFO L273 TraceCheckUtils]: 72: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,381 INFO L273 TraceCheckUtils]: 73: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,381 INFO L273 TraceCheckUtils]: 74: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,381 INFO L273 TraceCheckUtils]: 75: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,381 INFO L273 TraceCheckUtils]: 76: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,381 INFO L273 TraceCheckUtils]: 77: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,381 INFO L273 TraceCheckUtils]: 78: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,381 INFO L273 TraceCheckUtils]: 79: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,381 INFO L273 TraceCheckUtils]: 80: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,381 INFO L273 TraceCheckUtils]: 81: Hoare triple {19081#true} assume !(~i~0 < 1000); {19081#true} is VALID [2018-11-23 12:27:52,382 INFO L273 TraceCheckUtils]: 82: Hoare triple {19081#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {19081#true} is VALID [2018-11-23 12:27:52,382 INFO L273 TraceCheckUtils]: 83: Hoare triple {19081#true} assume true; {19081#true} is VALID [2018-11-23 12:27:52,382 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {19081#true} {19081#true} #70#return; {19081#true} is VALID [2018-11-23 12:27:52,382 INFO L273 TraceCheckUtils]: 85: Hoare triple {19081#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {19081#true} is VALID [2018-11-23 12:27:52,382 INFO L256 TraceCheckUtils]: 86: Hoare triple {19081#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {19081#true} is VALID [2018-11-23 12:27:52,382 INFO L273 TraceCheckUtils]: 87: Hoare triple {19081#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19081#true} is VALID [2018-11-23 12:27:52,382 INFO L273 TraceCheckUtils]: 88: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,382 INFO L273 TraceCheckUtils]: 89: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,382 INFO L273 TraceCheckUtils]: 90: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,383 INFO L273 TraceCheckUtils]: 91: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,383 INFO L273 TraceCheckUtils]: 92: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,383 INFO L273 TraceCheckUtils]: 93: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,383 INFO L273 TraceCheckUtils]: 94: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,383 INFO L273 TraceCheckUtils]: 95: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,383 INFO L273 TraceCheckUtils]: 96: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,383 INFO L273 TraceCheckUtils]: 97: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,383 INFO L273 TraceCheckUtils]: 98: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,383 INFO L273 TraceCheckUtils]: 99: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,383 INFO L273 TraceCheckUtils]: 100: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,384 INFO L273 TraceCheckUtils]: 101: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,384 INFO L273 TraceCheckUtils]: 102: Hoare triple {19081#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19081#true} is VALID [2018-11-23 12:27:52,384 INFO L273 TraceCheckUtils]: 103: Hoare triple {19081#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19081#true} is VALID [2018-11-23 12:27:52,384 INFO L273 TraceCheckUtils]: 104: Hoare triple {19081#true} assume !(~i~0 < 1000); {19081#true} is VALID [2018-11-23 12:27:52,384 INFO L273 TraceCheckUtils]: 105: Hoare triple {19081#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {19081#true} is VALID [2018-11-23 12:27:52,384 INFO L273 TraceCheckUtils]: 106: Hoare triple {19081#true} assume true; {19081#true} is VALID [2018-11-23 12:27:52,384 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {19081#true} {19081#true} #72#return; {19081#true} is VALID [2018-11-23 12:27:52,385 INFO L273 TraceCheckUtils]: 108: Hoare triple {19081#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {19439#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:52,385 INFO L273 TraceCheckUtils]: 109: Hoare triple {19439#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19439#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:52,386 INFO L273 TraceCheckUtils]: 110: Hoare triple {19439#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19446#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:52,386 INFO L273 TraceCheckUtils]: 111: Hoare triple {19446#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19446#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:52,386 INFO L273 TraceCheckUtils]: 112: Hoare triple {19446#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19453#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:52,387 INFO L273 TraceCheckUtils]: 113: Hoare triple {19453#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19453#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:52,387 INFO L273 TraceCheckUtils]: 114: Hoare triple {19453#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19460#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:52,387 INFO L273 TraceCheckUtils]: 115: Hoare triple {19460#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19460#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:52,388 INFO L273 TraceCheckUtils]: 116: Hoare triple {19460#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19467#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:52,388 INFO L273 TraceCheckUtils]: 117: Hoare triple {19467#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19467#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:52,389 INFO L273 TraceCheckUtils]: 118: Hoare triple {19467#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19474#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:52,389 INFO L273 TraceCheckUtils]: 119: Hoare triple {19474#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19474#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:52,390 INFO L273 TraceCheckUtils]: 120: Hoare triple {19474#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19481#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:52,391 INFO L273 TraceCheckUtils]: 121: Hoare triple {19481#(<= main_~i~2 6)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19481#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:52,391 INFO L273 TraceCheckUtils]: 122: Hoare triple {19481#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19488#(<= main_~i~2 7)} is VALID [2018-11-23 12:27:52,410 INFO L273 TraceCheckUtils]: 123: Hoare triple {19488#(<= main_~i~2 7)} assume !(~i~2 < 999); {19082#false} is VALID [2018-11-23 12:27:52,411 INFO L273 TraceCheckUtils]: 124: Hoare triple {19082#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {19082#false} is VALID [2018-11-23 12:27:52,411 INFO L256 TraceCheckUtils]: 125: Hoare triple {19082#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {19082#false} is VALID [2018-11-23 12:27:52,411 INFO L273 TraceCheckUtils]: 126: Hoare triple {19082#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19082#false} is VALID [2018-11-23 12:27:52,411 INFO L273 TraceCheckUtils]: 127: Hoare triple {19082#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19082#false} is VALID [2018-11-23 12:27:52,411 INFO L273 TraceCheckUtils]: 128: Hoare triple {19082#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19082#false} is VALID [2018-11-23 12:27:52,411 INFO L273 TraceCheckUtils]: 129: Hoare triple {19082#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19082#false} is VALID [2018-11-23 12:27:52,411 INFO L273 TraceCheckUtils]: 130: Hoare triple {19082#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19082#false} is VALID [2018-11-23 12:27:52,411 INFO L273 TraceCheckUtils]: 131: Hoare triple {19082#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19082#false} is VALID [2018-11-23 12:27:52,412 INFO L273 TraceCheckUtils]: 132: Hoare triple {19082#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19082#false} is VALID [2018-11-23 12:27:52,412 INFO L273 TraceCheckUtils]: 133: Hoare triple {19082#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19082#false} is VALID [2018-11-23 12:27:52,412 INFO L273 TraceCheckUtils]: 134: Hoare triple {19082#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19082#false} is VALID [2018-11-23 12:27:52,412 INFO L273 TraceCheckUtils]: 135: Hoare triple {19082#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19082#false} is VALID [2018-11-23 12:27:52,412 INFO L273 TraceCheckUtils]: 136: Hoare triple {19082#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19082#false} is VALID [2018-11-23 12:27:52,412 INFO L273 TraceCheckUtils]: 137: Hoare triple {19082#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19082#false} is VALID [2018-11-23 12:27:52,412 INFO L273 TraceCheckUtils]: 138: Hoare triple {19082#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19082#false} is VALID [2018-11-23 12:27:52,412 INFO L273 TraceCheckUtils]: 139: Hoare triple {19082#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19082#false} is VALID [2018-11-23 12:27:52,413 INFO L273 TraceCheckUtils]: 140: Hoare triple {19082#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19082#false} is VALID [2018-11-23 12:27:52,413 INFO L273 TraceCheckUtils]: 141: Hoare triple {19082#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19082#false} is VALID [2018-11-23 12:27:52,413 INFO L273 TraceCheckUtils]: 142: Hoare triple {19082#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19082#false} is VALID [2018-11-23 12:27:52,413 INFO L273 TraceCheckUtils]: 143: Hoare triple {19082#false} assume !(~i~0 < 1000); {19082#false} is VALID [2018-11-23 12:27:52,413 INFO L273 TraceCheckUtils]: 144: Hoare triple {19082#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {19082#false} is VALID [2018-11-23 12:27:52,413 INFO L273 TraceCheckUtils]: 145: Hoare triple {19082#false} assume true; {19082#false} is VALID [2018-11-23 12:27:52,414 INFO L268 TraceCheckUtils]: 146: Hoare quadruple {19082#false} {19082#false} #74#return; {19082#false} is VALID [2018-11-23 12:27:52,414 INFO L273 TraceCheckUtils]: 147: Hoare triple {19082#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {19082#false} is VALID [2018-11-23 12:27:52,414 INFO L273 TraceCheckUtils]: 148: Hoare triple {19082#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {19082#false} is VALID [2018-11-23 12:27:52,414 INFO L273 TraceCheckUtils]: 149: Hoare triple {19082#false} assume !false; {19082#false} is VALID [2018-11-23 12:27:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-11-23 12:27:52,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:52,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 10] total 39 [2018-11-23 12:27:52,445 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-11-23 12:27:52,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:52,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 12:27:52,758 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:27:52,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 12:27:52,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 12:27:52,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:27:52,760 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 39 states. [2018-11-23 12:27:54,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:54,017 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-11-23 12:27:54,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 12:27:54,017 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-11-23 12:27:54,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:27:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 127 transitions. [2018-11-23 12:27:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:27:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 127 transitions. [2018-11-23 12:27:54,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 127 transitions. [2018-11-23 12:27:54,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:54,767 INFO L225 Difference]: With dead ends: 161 [2018-11-23 12:27:54,767 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 12:27:54,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:27:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 12:27:54,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-11-23 12:27:54,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:54,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 113 states. [2018-11-23 12:27:54,819 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 113 states. [2018-11-23 12:27:54,819 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 113 states. [2018-11-23 12:27:54,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:54,822 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-23 12:27:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:27:54,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:54,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:54,824 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 115 states. [2018-11-23 12:27:54,824 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 115 states. [2018-11-23 12:27:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:54,826 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-23 12:27:54,827 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:27:54,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:54,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:54,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:54,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 12:27:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-11-23 12:27:54,830 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 150 [2018-11-23 12:27:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:54,830 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-11-23 12:27:54,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 12:27:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:27:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-23 12:27:54,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:54,832 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 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:27:54,832 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:54,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:54,832 INFO L82 PathProgramCache]: Analyzing trace with hash 740164533, now seen corresponding path program 28 times [2018-11-23 12:27:54,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:54,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:54,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:54,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:54,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:56,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {20206#true} call ULTIMATE.init(); {20206#true} is VALID [2018-11-23 12:27:56,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {20206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20206#true} is VALID [2018-11-23 12:27:56,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {20206#true} assume true; {20206#true} is VALID [2018-11-23 12:27:56,720 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20206#true} {20206#true} #66#return; {20206#true} is VALID [2018-11-23 12:27:56,720 INFO L256 TraceCheckUtils]: 4: Hoare triple {20206#true} call #t~ret12 := main(); {20206#true} is VALID [2018-11-23 12:27:56,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {20206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20208#(= main_~i~1 0)} is VALID [2018-11-23 12:27:56,721 INFO L273 TraceCheckUtils]: 6: Hoare triple {20208#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20208#(= main_~i~1 0)} is VALID [2018-11-23 12:27:56,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {20208#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20209#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:56,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {20209#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20209#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:56,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {20209#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20210#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:56,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {20210#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20210#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:56,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {20210#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20211#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:56,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {20211#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20211#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:56,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {20211#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20212#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:56,725 INFO L273 TraceCheckUtils]: 14: Hoare triple {20212#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20212#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:56,725 INFO L273 TraceCheckUtils]: 15: Hoare triple {20212#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20213#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:56,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {20213#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20213#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:56,727 INFO L273 TraceCheckUtils]: 17: Hoare triple {20213#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20214#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:56,727 INFO L273 TraceCheckUtils]: 18: Hoare triple {20214#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20214#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:56,728 INFO L273 TraceCheckUtils]: 19: Hoare triple {20214#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20215#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:56,728 INFO L273 TraceCheckUtils]: 20: Hoare triple {20215#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20215#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:56,729 INFO L273 TraceCheckUtils]: 21: Hoare triple {20215#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20216#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:56,730 INFO L273 TraceCheckUtils]: 22: Hoare triple {20216#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20216#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:56,730 INFO L273 TraceCheckUtils]: 23: Hoare triple {20216#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20217#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:56,731 INFO L273 TraceCheckUtils]: 24: Hoare triple {20217#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20217#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:56,732 INFO L273 TraceCheckUtils]: 25: Hoare triple {20217#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20218#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:56,732 INFO L273 TraceCheckUtils]: 26: Hoare triple {20218#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20218#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:56,733 INFO L273 TraceCheckUtils]: 27: Hoare triple {20218#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20219#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:56,733 INFO L273 TraceCheckUtils]: 28: Hoare triple {20219#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20219#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:56,734 INFO L273 TraceCheckUtils]: 29: Hoare triple {20219#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20220#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:56,735 INFO L273 TraceCheckUtils]: 30: Hoare triple {20220#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20220#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:56,735 INFO L273 TraceCheckUtils]: 31: Hoare triple {20220#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20221#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:56,736 INFO L273 TraceCheckUtils]: 32: Hoare triple {20221#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20221#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:56,737 INFO L273 TraceCheckUtils]: 33: Hoare triple {20221#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20222#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:56,737 INFO L273 TraceCheckUtils]: 34: Hoare triple {20222#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20222#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:56,738 INFO L273 TraceCheckUtils]: 35: Hoare triple {20222#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20223#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:56,738 INFO L273 TraceCheckUtils]: 36: Hoare triple {20223#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20223#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:56,739 INFO L273 TraceCheckUtils]: 37: Hoare triple {20223#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20224#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:56,740 INFO L273 TraceCheckUtils]: 38: Hoare triple {20224#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20224#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:56,740 INFO L273 TraceCheckUtils]: 39: Hoare triple {20224#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20225#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:56,741 INFO L273 TraceCheckUtils]: 40: Hoare triple {20225#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20225#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:56,742 INFO L273 TraceCheckUtils]: 41: Hoare triple {20225#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20226#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:56,742 INFO L273 TraceCheckUtils]: 42: Hoare triple {20226#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20226#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:56,743 INFO L273 TraceCheckUtils]: 43: Hoare triple {20226#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20227#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:56,743 INFO L273 TraceCheckUtils]: 44: Hoare triple {20227#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20227#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:56,744 INFO L273 TraceCheckUtils]: 45: Hoare triple {20227#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20228#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:56,745 INFO L273 TraceCheckUtils]: 46: Hoare triple {20228#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20228#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:56,745 INFO L273 TraceCheckUtils]: 47: Hoare triple {20228#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20229#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:56,746 INFO L273 TraceCheckUtils]: 48: Hoare triple {20229#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20229#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:56,747 INFO L273 TraceCheckUtils]: 49: Hoare triple {20229#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20230#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:56,747 INFO L273 TraceCheckUtils]: 50: Hoare triple {20230#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20230#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:56,748 INFO L273 TraceCheckUtils]: 51: Hoare triple {20230#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20231#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:56,748 INFO L273 TraceCheckUtils]: 52: Hoare triple {20231#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20231#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:56,749 INFO L273 TraceCheckUtils]: 53: Hoare triple {20231#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20232#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:56,750 INFO L273 TraceCheckUtils]: 54: Hoare triple {20232#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20232#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:56,750 INFO L273 TraceCheckUtils]: 55: Hoare triple {20232#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20233#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:56,751 INFO L273 TraceCheckUtils]: 56: Hoare triple {20233#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20233#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:56,752 INFO L273 TraceCheckUtils]: 57: Hoare triple {20233#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20234#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:56,752 INFO L273 TraceCheckUtils]: 58: Hoare triple {20234#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20234#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:56,753 INFO L273 TraceCheckUtils]: 59: Hoare triple {20234#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20235#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:56,753 INFO L273 TraceCheckUtils]: 60: Hoare triple {20235#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20235#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:56,754 INFO L273 TraceCheckUtils]: 61: Hoare triple {20235#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20236#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:56,755 INFO L273 TraceCheckUtils]: 62: Hoare triple {20236#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20236#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:56,755 INFO L273 TraceCheckUtils]: 63: Hoare triple {20236#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20237#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:56,756 INFO L273 TraceCheckUtils]: 64: Hoare triple {20237#(<= main_~i~1 29)} assume !(~i~1 < 1000); {20207#false} is VALID [2018-11-23 12:27:56,756 INFO L256 TraceCheckUtils]: 65: Hoare triple {20207#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {20206#true} is VALID [2018-11-23 12:27:56,756 INFO L273 TraceCheckUtils]: 66: Hoare triple {20206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20206#true} is VALID [2018-11-23 12:27:56,757 INFO L273 TraceCheckUtils]: 67: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,757 INFO L273 TraceCheckUtils]: 68: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,757 INFO L273 TraceCheckUtils]: 69: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,757 INFO L273 TraceCheckUtils]: 70: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,757 INFO L273 TraceCheckUtils]: 71: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,757 INFO L273 TraceCheckUtils]: 72: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,758 INFO L273 TraceCheckUtils]: 73: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,758 INFO L273 TraceCheckUtils]: 74: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,758 INFO L273 TraceCheckUtils]: 75: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,758 INFO L273 TraceCheckUtils]: 76: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,758 INFO L273 TraceCheckUtils]: 77: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,758 INFO L273 TraceCheckUtils]: 78: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,759 INFO L273 TraceCheckUtils]: 79: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,759 INFO L273 TraceCheckUtils]: 80: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,759 INFO L273 TraceCheckUtils]: 81: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,759 INFO L273 TraceCheckUtils]: 82: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,759 INFO L273 TraceCheckUtils]: 83: Hoare triple {20206#true} assume !(~i~0 < 1000); {20206#true} is VALID [2018-11-23 12:27:56,759 INFO L273 TraceCheckUtils]: 84: Hoare triple {20206#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {20206#true} is VALID [2018-11-23 12:27:56,759 INFO L273 TraceCheckUtils]: 85: Hoare triple {20206#true} assume true; {20206#true} is VALID [2018-11-23 12:27:56,759 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {20206#true} {20207#false} #70#return; {20207#false} is VALID [2018-11-23 12:27:56,759 INFO L273 TraceCheckUtils]: 87: Hoare triple {20207#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {20207#false} is VALID [2018-11-23 12:27:56,760 INFO L256 TraceCheckUtils]: 88: Hoare triple {20207#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {20206#true} is VALID [2018-11-23 12:27:56,760 INFO L273 TraceCheckUtils]: 89: Hoare triple {20206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20206#true} is VALID [2018-11-23 12:27:56,760 INFO L273 TraceCheckUtils]: 90: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,760 INFO L273 TraceCheckUtils]: 91: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,760 INFO L273 TraceCheckUtils]: 92: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,760 INFO L273 TraceCheckUtils]: 93: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,760 INFO L273 TraceCheckUtils]: 94: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,760 INFO L273 TraceCheckUtils]: 95: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,760 INFO L273 TraceCheckUtils]: 96: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,761 INFO L273 TraceCheckUtils]: 97: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,761 INFO L273 TraceCheckUtils]: 98: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,761 INFO L273 TraceCheckUtils]: 99: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,761 INFO L273 TraceCheckUtils]: 100: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,761 INFO L273 TraceCheckUtils]: 101: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,761 INFO L273 TraceCheckUtils]: 102: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,761 INFO L273 TraceCheckUtils]: 103: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,761 INFO L273 TraceCheckUtils]: 104: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,761 INFO L273 TraceCheckUtils]: 105: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,762 INFO L273 TraceCheckUtils]: 106: Hoare triple {20206#true} assume !(~i~0 < 1000); {20206#true} is VALID [2018-11-23 12:27:56,762 INFO L273 TraceCheckUtils]: 107: Hoare triple {20206#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {20206#true} is VALID [2018-11-23 12:27:56,762 INFO L273 TraceCheckUtils]: 108: Hoare triple {20206#true} assume true; {20206#true} is VALID [2018-11-23 12:27:56,762 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {20206#true} {20207#false} #72#return; {20207#false} is VALID [2018-11-23 12:27:56,762 INFO L273 TraceCheckUtils]: 110: Hoare triple {20207#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {20207#false} is VALID [2018-11-23 12:27:56,762 INFO L273 TraceCheckUtils]: 111: Hoare triple {20207#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20207#false} is VALID [2018-11-23 12:27:56,763 INFO L273 TraceCheckUtils]: 112: Hoare triple {20207#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20207#false} is VALID [2018-11-23 12:27:56,763 INFO L273 TraceCheckUtils]: 113: Hoare triple {20207#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20207#false} is VALID [2018-11-23 12:27:56,763 INFO L273 TraceCheckUtils]: 114: Hoare triple {20207#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20207#false} is VALID [2018-11-23 12:27:56,763 INFO L273 TraceCheckUtils]: 115: Hoare triple {20207#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20207#false} is VALID [2018-11-23 12:27:56,763 INFO L273 TraceCheckUtils]: 116: Hoare triple {20207#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20207#false} is VALID [2018-11-23 12:27:56,763 INFO L273 TraceCheckUtils]: 117: Hoare triple {20207#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20207#false} is VALID [2018-11-23 12:27:56,764 INFO L273 TraceCheckUtils]: 118: Hoare triple {20207#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20207#false} is VALID [2018-11-23 12:27:56,764 INFO L273 TraceCheckUtils]: 119: Hoare triple {20207#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20207#false} is VALID [2018-11-23 12:27:56,764 INFO L273 TraceCheckUtils]: 120: Hoare triple {20207#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20207#false} is VALID [2018-11-23 12:27:56,764 INFO L273 TraceCheckUtils]: 121: Hoare triple {20207#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20207#false} is VALID [2018-11-23 12:27:56,764 INFO L273 TraceCheckUtils]: 122: Hoare triple {20207#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20207#false} is VALID [2018-11-23 12:27:56,764 INFO L273 TraceCheckUtils]: 123: Hoare triple {20207#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20207#false} is VALID [2018-11-23 12:27:56,765 INFO L273 TraceCheckUtils]: 124: Hoare triple {20207#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20207#false} is VALID [2018-11-23 12:27:56,765 INFO L273 TraceCheckUtils]: 125: Hoare triple {20207#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20207#false} is VALID [2018-11-23 12:27:56,765 INFO L273 TraceCheckUtils]: 126: Hoare triple {20207#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20207#false} is VALID [2018-11-23 12:27:56,765 INFO L273 TraceCheckUtils]: 127: Hoare triple {20207#false} assume !(~i~2 < 999); {20207#false} is VALID [2018-11-23 12:27:56,765 INFO L273 TraceCheckUtils]: 128: Hoare triple {20207#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {20207#false} is VALID [2018-11-23 12:27:56,765 INFO L256 TraceCheckUtils]: 129: Hoare triple {20207#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {20206#true} is VALID [2018-11-23 12:27:56,765 INFO L273 TraceCheckUtils]: 130: Hoare triple {20206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20206#true} is VALID [2018-11-23 12:27:56,766 INFO L273 TraceCheckUtils]: 131: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,766 INFO L273 TraceCheckUtils]: 132: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,766 INFO L273 TraceCheckUtils]: 133: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,766 INFO L273 TraceCheckUtils]: 134: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,766 INFO L273 TraceCheckUtils]: 135: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,766 INFO L273 TraceCheckUtils]: 136: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,767 INFO L273 TraceCheckUtils]: 137: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,767 INFO L273 TraceCheckUtils]: 138: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,767 INFO L273 TraceCheckUtils]: 139: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,767 INFO L273 TraceCheckUtils]: 140: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,767 INFO L273 TraceCheckUtils]: 141: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,767 INFO L273 TraceCheckUtils]: 142: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,768 INFO L273 TraceCheckUtils]: 143: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,768 INFO L273 TraceCheckUtils]: 144: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,768 INFO L273 TraceCheckUtils]: 145: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:56,768 INFO L273 TraceCheckUtils]: 146: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:56,768 INFO L273 TraceCheckUtils]: 147: Hoare triple {20206#true} assume !(~i~0 < 1000); {20206#true} is VALID [2018-11-23 12:27:56,768 INFO L273 TraceCheckUtils]: 148: Hoare triple {20206#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {20206#true} is VALID [2018-11-23 12:27:56,769 INFO L273 TraceCheckUtils]: 149: Hoare triple {20206#true} assume true; {20206#true} is VALID [2018-11-23 12:27:56,769 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {20206#true} {20207#false} #74#return; {20207#false} is VALID [2018-11-23 12:27:56,769 INFO L273 TraceCheckUtils]: 151: Hoare triple {20207#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {20207#false} is VALID [2018-11-23 12:27:56,769 INFO L273 TraceCheckUtils]: 152: Hoare triple {20207#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {20207#false} is VALID [2018-11-23 12:27:56,769 INFO L273 TraceCheckUtils]: 153: Hoare triple {20207#false} assume !false; {20207#false} is VALID [2018-11-23 12:27:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-23 12:27:56,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:56,784 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:27:56,800 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:56,871 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:56,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:56,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:57,208 INFO L256 TraceCheckUtils]: 0: Hoare triple {20206#true} call ULTIMATE.init(); {20206#true} is VALID [2018-11-23 12:27:57,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {20206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20206#true} is VALID [2018-11-23 12:27:57,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {20206#true} assume true; {20206#true} is VALID [2018-11-23 12:27:57,209 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20206#true} {20206#true} #66#return; {20206#true} is VALID [2018-11-23 12:27:57,210 INFO L256 TraceCheckUtils]: 4: Hoare triple {20206#true} call #t~ret12 := main(); {20206#true} is VALID [2018-11-23 12:27:57,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {20206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20206#true} is VALID [2018-11-23 12:27:57,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,211 INFO L273 TraceCheckUtils]: 9: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,211 INFO L273 TraceCheckUtils]: 10: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,211 INFO L273 TraceCheckUtils]: 11: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,211 INFO L273 TraceCheckUtils]: 12: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,211 INFO L273 TraceCheckUtils]: 14: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,212 INFO L273 TraceCheckUtils]: 15: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,212 INFO L273 TraceCheckUtils]: 16: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,212 INFO L273 TraceCheckUtils]: 17: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,212 INFO L273 TraceCheckUtils]: 18: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,212 INFO L273 TraceCheckUtils]: 19: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,212 INFO L273 TraceCheckUtils]: 20: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,212 INFO L273 TraceCheckUtils]: 21: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,212 INFO L273 TraceCheckUtils]: 22: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,212 INFO L273 TraceCheckUtils]: 23: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,212 INFO L273 TraceCheckUtils]: 24: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,213 INFO L273 TraceCheckUtils]: 25: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,213 INFO L273 TraceCheckUtils]: 26: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,213 INFO L273 TraceCheckUtils]: 27: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,213 INFO L273 TraceCheckUtils]: 28: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,213 INFO L273 TraceCheckUtils]: 29: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,213 INFO L273 TraceCheckUtils]: 30: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,213 INFO L273 TraceCheckUtils]: 31: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,213 INFO L273 TraceCheckUtils]: 32: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,213 INFO L273 TraceCheckUtils]: 33: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,213 INFO L273 TraceCheckUtils]: 34: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,214 INFO L273 TraceCheckUtils]: 35: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,214 INFO L273 TraceCheckUtils]: 36: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,214 INFO L273 TraceCheckUtils]: 37: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,214 INFO L273 TraceCheckUtils]: 38: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,214 INFO L273 TraceCheckUtils]: 39: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,214 INFO L273 TraceCheckUtils]: 40: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,214 INFO L273 TraceCheckUtils]: 41: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,214 INFO L273 TraceCheckUtils]: 42: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,214 INFO L273 TraceCheckUtils]: 43: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,215 INFO L273 TraceCheckUtils]: 44: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,215 INFO L273 TraceCheckUtils]: 45: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,215 INFO L273 TraceCheckUtils]: 46: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,215 INFO L273 TraceCheckUtils]: 47: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,215 INFO L273 TraceCheckUtils]: 48: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,215 INFO L273 TraceCheckUtils]: 49: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,215 INFO L273 TraceCheckUtils]: 50: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,215 INFO L273 TraceCheckUtils]: 51: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,215 INFO L273 TraceCheckUtils]: 52: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,215 INFO L273 TraceCheckUtils]: 53: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,216 INFO L273 TraceCheckUtils]: 54: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,216 INFO L273 TraceCheckUtils]: 55: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,216 INFO L273 TraceCheckUtils]: 56: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,216 INFO L273 TraceCheckUtils]: 57: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,216 INFO L273 TraceCheckUtils]: 58: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,216 INFO L273 TraceCheckUtils]: 59: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,216 INFO L273 TraceCheckUtils]: 60: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,216 INFO L273 TraceCheckUtils]: 61: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,216 INFO L273 TraceCheckUtils]: 62: Hoare triple {20206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20206#true} is VALID [2018-11-23 12:27:57,217 INFO L273 TraceCheckUtils]: 63: Hoare triple {20206#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20206#true} is VALID [2018-11-23 12:27:57,217 INFO L273 TraceCheckUtils]: 64: Hoare triple {20206#true} assume !(~i~1 < 1000); {20206#true} is VALID [2018-11-23 12:27:57,217 INFO L256 TraceCheckUtils]: 65: Hoare triple {20206#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {20206#true} is VALID [2018-11-23 12:27:57,217 INFO L273 TraceCheckUtils]: 66: Hoare triple {20206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20206#true} is VALID [2018-11-23 12:27:57,217 INFO L273 TraceCheckUtils]: 67: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,217 INFO L273 TraceCheckUtils]: 68: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,217 INFO L273 TraceCheckUtils]: 69: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,217 INFO L273 TraceCheckUtils]: 70: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,217 INFO L273 TraceCheckUtils]: 71: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,217 INFO L273 TraceCheckUtils]: 72: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,218 INFO L273 TraceCheckUtils]: 73: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,218 INFO L273 TraceCheckUtils]: 74: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,218 INFO L273 TraceCheckUtils]: 75: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,218 INFO L273 TraceCheckUtils]: 76: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,218 INFO L273 TraceCheckUtils]: 77: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,218 INFO L273 TraceCheckUtils]: 78: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,219 INFO L273 TraceCheckUtils]: 79: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,219 INFO L273 TraceCheckUtils]: 80: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,219 INFO L273 TraceCheckUtils]: 81: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,219 INFO L273 TraceCheckUtils]: 82: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,219 INFO L273 TraceCheckUtils]: 83: Hoare triple {20206#true} assume !(~i~0 < 1000); {20206#true} is VALID [2018-11-23 12:27:57,219 INFO L273 TraceCheckUtils]: 84: Hoare triple {20206#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {20206#true} is VALID [2018-11-23 12:27:57,219 INFO L273 TraceCheckUtils]: 85: Hoare triple {20206#true} assume true; {20206#true} is VALID [2018-11-23 12:27:57,219 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {20206#true} {20206#true} #70#return; {20206#true} is VALID [2018-11-23 12:27:57,220 INFO L273 TraceCheckUtils]: 87: Hoare triple {20206#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {20206#true} is VALID [2018-11-23 12:27:57,220 INFO L256 TraceCheckUtils]: 88: Hoare triple {20206#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {20206#true} is VALID [2018-11-23 12:27:57,220 INFO L273 TraceCheckUtils]: 89: Hoare triple {20206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20206#true} is VALID [2018-11-23 12:27:57,220 INFO L273 TraceCheckUtils]: 90: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,220 INFO L273 TraceCheckUtils]: 91: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,220 INFO L273 TraceCheckUtils]: 92: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,220 INFO L273 TraceCheckUtils]: 93: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,220 INFO L273 TraceCheckUtils]: 94: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,220 INFO L273 TraceCheckUtils]: 95: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,220 INFO L273 TraceCheckUtils]: 96: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,221 INFO L273 TraceCheckUtils]: 97: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,221 INFO L273 TraceCheckUtils]: 98: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,221 INFO L273 TraceCheckUtils]: 99: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,221 INFO L273 TraceCheckUtils]: 100: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,221 INFO L273 TraceCheckUtils]: 101: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,221 INFO L273 TraceCheckUtils]: 102: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,221 INFO L273 TraceCheckUtils]: 103: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,221 INFO L273 TraceCheckUtils]: 104: Hoare triple {20206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20206#true} is VALID [2018-11-23 12:27:57,221 INFO L273 TraceCheckUtils]: 105: Hoare triple {20206#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20206#true} is VALID [2018-11-23 12:27:57,221 INFO L273 TraceCheckUtils]: 106: Hoare triple {20206#true} assume !(~i~0 < 1000); {20206#true} is VALID [2018-11-23 12:27:57,222 INFO L273 TraceCheckUtils]: 107: Hoare triple {20206#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {20206#true} is VALID [2018-11-23 12:27:57,222 INFO L273 TraceCheckUtils]: 108: Hoare triple {20206#true} assume true; {20206#true} is VALID [2018-11-23 12:27:57,222 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {20206#true} {20206#true} #72#return; {20206#true} is VALID [2018-11-23 12:27:57,222 INFO L273 TraceCheckUtils]: 110: Hoare triple {20206#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {20206#true} is VALID [2018-11-23 12:27:57,222 INFO L273 TraceCheckUtils]: 111: Hoare triple {20206#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20206#true} is VALID [2018-11-23 12:27:57,222 INFO L273 TraceCheckUtils]: 112: Hoare triple {20206#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20206#true} is VALID [2018-11-23 12:27:57,222 INFO L273 TraceCheckUtils]: 113: Hoare triple {20206#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20206#true} is VALID [2018-11-23 12:27:57,222 INFO L273 TraceCheckUtils]: 114: Hoare triple {20206#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20206#true} is VALID [2018-11-23 12:27:57,222 INFO L273 TraceCheckUtils]: 115: Hoare triple {20206#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20206#true} is VALID [2018-11-23 12:27:57,223 INFO L273 TraceCheckUtils]: 116: Hoare triple {20206#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20206#true} is VALID [2018-11-23 12:27:57,223 INFO L273 TraceCheckUtils]: 117: Hoare triple {20206#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20206#true} is VALID [2018-11-23 12:27:57,223 INFO L273 TraceCheckUtils]: 118: Hoare triple {20206#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20206#true} is VALID [2018-11-23 12:27:57,223 INFO L273 TraceCheckUtils]: 119: Hoare triple {20206#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20206#true} is VALID [2018-11-23 12:27:57,223 INFO L273 TraceCheckUtils]: 120: Hoare triple {20206#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20206#true} is VALID [2018-11-23 12:27:57,223 INFO L273 TraceCheckUtils]: 121: Hoare triple {20206#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20206#true} is VALID [2018-11-23 12:27:57,223 INFO L273 TraceCheckUtils]: 122: Hoare triple {20206#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20206#true} is VALID [2018-11-23 12:27:57,223 INFO L273 TraceCheckUtils]: 123: Hoare triple {20206#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20206#true} is VALID [2018-11-23 12:27:57,223 INFO L273 TraceCheckUtils]: 124: Hoare triple {20206#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20206#true} is VALID [2018-11-23 12:27:57,224 INFO L273 TraceCheckUtils]: 125: Hoare triple {20206#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20206#true} is VALID [2018-11-23 12:27:57,224 INFO L273 TraceCheckUtils]: 126: Hoare triple {20206#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20206#true} is VALID [2018-11-23 12:27:57,224 INFO L273 TraceCheckUtils]: 127: Hoare triple {20206#true} assume !(~i~2 < 999); {20206#true} is VALID [2018-11-23 12:27:57,224 INFO L273 TraceCheckUtils]: 128: Hoare triple {20206#true} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {20206#true} is VALID [2018-11-23 12:27:57,224 INFO L256 TraceCheckUtils]: 129: Hoare triple {20206#true} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {20206#true} is VALID [2018-11-23 12:27:57,225 INFO L273 TraceCheckUtils]: 130: Hoare triple {20206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20631#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:27:57,225 INFO L273 TraceCheckUtils]: 131: Hoare triple {20631#(<= mapavg_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20631#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:27:57,225 INFO L273 TraceCheckUtils]: 132: Hoare triple {20631#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20638#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:27:57,226 INFO L273 TraceCheckUtils]: 133: Hoare triple {20638#(<= mapavg_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20638#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:27:57,226 INFO L273 TraceCheckUtils]: 134: Hoare triple {20638#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20645#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:27:57,226 INFO L273 TraceCheckUtils]: 135: Hoare triple {20645#(<= mapavg_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20645#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:27:57,227 INFO L273 TraceCheckUtils]: 136: Hoare triple {20645#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20652#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:27:57,227 INFO L273 TraceCheckUtils]: 137: Hoare triple {20652#(<= mapavg_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20652#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:27:57,228 INFO L273 TraceCheckUtils]: 138: Hoare triple {20652#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20659#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:27:57,228 INFO L273 TraceCheckUtils]: 139: Hoare triple {20659#(<= mapavg_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20659#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:27:57,229 INFO L273 TraceCheckUtils]: 140: Hoare triple {20659#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20666#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:27:57,229 INFO L273 TraceCheckUtils]: 141: Hoare triple {20666#(<= mapavg_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20666#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:27:57,230 INFO L273 TraceCheckUtils]: 142: Hoare triple {20666#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20673#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:27:57,231 INFO L273 TraceCheckUtils]: 143: Hoare triple {20673#(<= mapavg_~i~0 6)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20673#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:27:57,231 INFO L273 TraceCheckUtils]: 144: Hoare triple {20673#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20680#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:27:57,232 INFO L273 TraceCheckUtils]: 145: Hoare triple {20680#(<= mapavg_~i~0 7)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20680#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:27:57,233 INFO L273 TraceCheckUtils]: 146: Hoare triple {20680#(<= mapavg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20687#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:27:57,233 INFO L273 TraceCheckUtils]: 147: Hoare triple {20687#(<= mapavg_~i~0 8)} assume !(~i~0 < 1000); {20207#false} is VALID [2018-11-23 12:27:57,234 INFO L273 TraceCheckUtils]: 148: Hoare triple {20207#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {20207#false} is VALID [2018-11-23 12:27:57,234 INFO L273 TraceCheckUtils]: 149: Hoare triple {20207#false} assume true; {20207#false} is VALID [2018-11-23 12:27:57,234 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {20207#false} {20206#true} #74#return; {20207#false} is VALID [2018-11-23 12:27:57,234 INFO L273 TraceCheckUtils]: 151: Hoare triple {20207#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {20207#false} is VALID [2018-11-23 12:27:57,234 INFO L273 TraceCheckUtils]: 152: Hoare triple {20207#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {20207#false} is VALID [2018-11-23 12:27:57,235 INFO L273 TraceCheckUtils]: 153: Hoare triple {20207#false} assume !false; {20207#false} is VALID [2018-11-23 12:27:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2018-11-23 12:27:57,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:57,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 11] total 41 [2018-11-23 12:27:57,268 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 154 [2018-11-23 12:27:57,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:57,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:27:57,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:57,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:27:57,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:27:57,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:27:57,393 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 41 states. [2018-11-23 12:27:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:58,220 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2018-11-23 12:27:58,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:27:58,220 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 154 [2018-11-23 12:27:58,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:27:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 134 transitions. [2018-11-23 12:27:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:27:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 134 transitions. [2018-11-23 12:27:58,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 134 transitions. [2018-11-23 12:27:58,759 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:27:58,761 INFO L225 Difference]: With dead ends: 167 [2018-11-23 12:27:58,761 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 12:27:58,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:27:58,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 12:27:58,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-23 12:27:58,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:58,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 117 states. [2018-11-23 12:27:58,840 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 117 states. [2018-11-23 12:27:58,840 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 117 states. [2018-11-23 12:27:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:58,843 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-11-23 12:27:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-23 12:27:58,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:58,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:58,844 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 119 states. [2018-11-23 12:27:58,844 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 119 states. [2018-11-23 12:27:58,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:58,846 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-11-23 12:27:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-23 12:27:58,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:58,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:58,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:58,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 12:27:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-11-23 12:27:58,850 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 154 [2018-11-23 12:27:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:58,850 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-11-23 12:27:58,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:27:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:27:58,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-23 12:27:58,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:58,852 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 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:27:58,852 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:58,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:58,852 INFO L82 PathProgramCache]: Analyzing trace with hash -469800971, now seen corresponding path program 29 times [2018-11-23 12:27:58,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:58,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:58,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:59,801 INFO L256 TraceCheckUtils]: 0: Hoare triple {21368#true} call ULTIMATE.init(); {21368#true} is VALID [2018-11-23 12:27:59,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {21368#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21368#true} is VALID [2018-11-23 12:27:59,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {21368#true} assume true; {21368#true} is VALID [2018-11-23 12:27:59,802 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21368#true} {21368#true} #66#return; {21368#true} is VALID [2018-11-23 12:27:59,802 INFO L256 TraceCheckUtils]: 4: Hoare triple {21368#true} call #t~ret12 := main(); {21368#true} is VALID [2018-11-23 12:27:59,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {21368#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21370#(= main_~i~1 0)} is VALID [2018-11-23 12:27:59,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {21370#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21370#(= main_~i~1 0)} is VALID [2018-11-23 12:27:59,804 INFO L273 TraceCheckUtils]: 7: Hoare triple {21370#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21371#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:59,804 INFO L273 TraceCheckUtils]: 8: Hoare triple {21371#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21371#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:59,805 INFO L273 TraceCheckUtils]: 9: Hoare triple {21371#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21372#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:59,805 INFO L273 TraceCheckUtils]: 10: Hoare triple {21372#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21372#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:59,806 INFO L273 TraceCheckUtils]: 11: Hoare triple {21372#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21373#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:59,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {21373#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21373#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:59,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {21373#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21374#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:59,808 INFO L273 TraceCheckUtils]: 14: Hoare triple {21374#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21374#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:59,809 INFO L273 TraceCheckUtils]: 15: Hoare triple {21374#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21375#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:59,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {21375#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21375#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:59,810 INFO L273 TraceCheckUtils]: 17: Hoare triple {21375#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21376#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:59,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {21376#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21376#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:59,811 INFO L273 TraceCheckUtils]: 19: Hoare triple {21376#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21377#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:59,812 INFO L273 TraceCheckUtils]: 20: Hoare triple {21377#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21377#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:59,812 INFO L273 TraceCheckUtils]: 21: Hoare triple {21377#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21378#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:59,813 INFO L273 TraceCheckUtils]: 22: Hoare triple {21378#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21378#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:59,814 INFO L273 TraceCheckUtils]: 23: Hoare triple {21378#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21379#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:59,814 INFO L273 TraceCheckUtils]: 24: Hoare triple {21379#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21379#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:59,815 INFO L273 TraceCheckUtils]: 25: Hoare triple {21379#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21380#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:59,815 INFO L273 TraceCheckUtils]: 26: Hoare triple {21380#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21380#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:59,816 INFO L273 TraceCheckUtils]: 27: Hoare triple {21380#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21381#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:59,817 INFO L273 TraceCheckUtils]: 28: Hoare triple {21381#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21381#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:59,817 INFO L273 TraceCheckUtils]: 29: Hoare triple {21381#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21382#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:59,818 INFO L273 TraceCheckUtils]: 30: Hoare triple {21382#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21382#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:59,819 INFO L273 TraceCheckUtils]: 31: Hoare triple {21382#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21383#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:59,819 INFO L273 TraceCheckUtils]: 32: Hoare triple {21383#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21383#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:59,820 INFO L273 TraceCheckUtils]: 33: Hoare triple {21383#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21384#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:59,820 INFO L273 TraceCheckUtils]: 34: Hoare triple {21384#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21384#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:59,821 INFO L273 TraceCheckUtils]: 35: Hoare triple {21384#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21385#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:59,822 INFO L273 TraceCheckUtils]: 36: Hoare triple {21385#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21385#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:59,822 INFO L273 TraceCheckUtils]: 37: Hoare triple {21385#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21386#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:59,823 INFO L273 TraceCheckUtils]: 38: Hoare triple {21386#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21386#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:59,824 INFO L273 TraceCheckUtils]: 39: Hoare triple {21386#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21387#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:59,824 INFO L273 TraceCheckUtils]: 40: Hoare triple {21387#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21387#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:59,825 INFO L273 TraceCheckUtils]: 41: Hoare triple {21387#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21388#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:59,825 INFO L273 TraceCheckUtils]: 42: Hoare triple {21388#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21388#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:59,826 INFO L273 TraceCheckUtils]: 43: Hoare triple {21388#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21389#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:59,827 INFO L273 TraceCheckUtils]: 44: Hoare triple {21389#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21389#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:59,827 INFO L273 TraceCheckUtils]: 45: Hoare triple {21389#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21390#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:59,828 INFO L273 TraceCheckUtils]: 46: Hoare triple {21390#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21390#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:59,829 INFO L273 TraceCheckUtils]: 47: Hoare triple {21390#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21391#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:59,829 INFO L273 TraceCheckUtils]: 48: Hoare triple {21391#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21391#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:59,830 INFO L273 TraceCheckUtils]: 49: Hoare triple {21391#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21392#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:59,830 INFO L273 TraceCheckUtils]: 50: Hoare triple {21392#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21392#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:59,831 INFO L273 TraceCheckUtils]: 51: Hoare triple {21392#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21393#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:59,832 INFO L273 TraceCheckUtils]: 52: Hoare triple {21393#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21393#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:59,832 INFO L273 TraceCheckUtils]: 53: Hoare triple {21393#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21394#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:59,833 INFO L273 TraceCheckUtils]: 54: Hoare triple {21394#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21394#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:59,834 INFO L273 TraceCheckUtils]: 55: Hoare triple {21394#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21395#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:59,834 INFO L273 TraceCheckUtils]: 56: Hoare triple {21395#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21395#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:59,835 INFO L273 TraceCheckUtils]: 57: Hoare triple {21395#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21396#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:59,835 INFO L273 TraceCheckUtils]: 58: Hoare triple {21396#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21396#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:59,836 INFO L273 TraceCheckUtils]: 59: Hoare triple {21396#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21397#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:59,837 INFO L273 TraceCheckUtils]: 60: Hoare triple {21397#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21397#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:59,837 INFO L273 TraceCheckUtils]: 61: Hoare triple {21397#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21398#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:59,838 INFO L273 TraceCheckUtils]: 62: Hoare triple {21398#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21398#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:59,839 INFO L273 TraceCheckUtils]: 63: Hoare triple {21398#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21399#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:59,839 INFO L273 TraceCheckUtils]: 64: Hoare triple {21399#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21399#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:59,840 INFO L273 TraceCheckUtils]: 65: Hoare triple {21399#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21400#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:59,841 INFO L273 TraceCheckUtils]: 66: Hoare triple {21400#(<= main_~i~1 30)} assume !(~i~1 < 1000); {21369#false} is VALID [2018-11-23 12:27:59,841 INFO L256 TraceCheckUtils]: 67: Hoare triple {21369#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {21368#true} is VALID [2018-11-23 12:27:59,841 INFO L273 TraceCheckUtils]: 68: Hoare triple {21368#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21368#true} is VALID [2018-11-23 12:27:59,841 INFO L273 TraceCheckUtils]: 69: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,841 INFO L273 TraceCheckUtils]: 70: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,842 INFO L273 TraceCheckUtils]: 71: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,842 INFO L273 TraceCheckUtils]: 72: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,842 INFO L273 TraceCheckUtils]: 73: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,842 INFO L273 TraceCheckUtils]: 74: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,842 INFO L273 TraceCheckUtils]: 75: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,842 INFO L273 TraceCheckUtils]: 76: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,843 INFO L273 TraceCheckUtils]: 77: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,843 INFO L273 TraceCheckUtils]: 78: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,843 INFO L273 TraceCheckUtils]: 79: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,843 INFO L273 TraceCheckUtils]: 80: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,843 INFO L273 TraceCheckUtils]: 81: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,843 INFO L273 TraceCheckUtils]: 82: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,844 INFO L273 TraceCheckUtils]: 83: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,844 INFO L273 TraceCheckUtils]: 84: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,844 INFO L273 TraceCheckUtils]: 85: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,844 INFO L273 TraceCheckUtils]: 86: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,844 INFO L273 TraceCheckUtils]: 87: Hoare triple {21368#true} assume !(~i~0 < 1000); {21368#true} is VALID [2018-11-23 12:27:59,844 INFO L273 TraceCheckUtils]: 88: Hoare triple {21368#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {21368#true} is VALID [2018-11-23 12:27:59,844 INFO L273 TraceCheckUtils]: 89: Hoare triple {21368#true} assume true; {21368#true} is VALID [2018-11-23 12:27:59,844 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {21368#true} {21369#false} #70#return; {21369#false} is VALID [2018-11-23 12:27:59,844 INFO L273 TraceCheckUtils]: 91: Hoare triple {21369#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {21369#false} is VALID [2018-11-23 12:27:59,845 INFO L256 TraceCheckUtils]: 92: Hoare triple {21369#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {21368#true} is VALID [2018-11-23 12:27:59,845 INFO L273 TraceCheckUtils]: 93: Hoare triple {21368#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21368#true} is VALID [2018-11-23 12:27:59,845 INFO L273 TraceCheckUtils]: 94: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,845 INFO L273 TraceCheckUtils]: 95: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,845 INFO L273 TraceCheckUtils]: 96: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,845 INFO L273 TraceCheckUtils]: 97: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,845 INFO L273 TraceCheckUtils]: 98: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,845 INFO L273 TraceCheckUtils]: 99: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,845 INFO L273 TraceCheckUtils]: 100: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,845 INFO L273 TraceCheckUtils]: 101: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,846 INFO L273 TraceCheckUtils]: 102: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,846 INFO L273 TraceCheckUtils]: 103: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,846 INFO L273 TraceCheckUtils]: 104: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,846 INFO L273 TraceCheckUtils]: 105: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,846 INFO L273 TraceCheckUtils]: 106: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,846 INFO L273 TraceCheckUtils]: 107: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,846 INFO L273 TraceCheckUtils]: 108: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,846 INFO L273 TraceCheckUtils]: 109: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,846 INFO L273 TraceCheckUtils]: 110: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,846 INFO L273 TraceCheckUtils]: 111: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,847 INFO L273 TraceCheckUtils]: 112: Hoare triple {21368#true} assume !(~i~0 < 1000); {21368#true} is VALID [2018-11-23 12:27:59,847 INFO L273 TraceCheckUtils]: 113: Hoare triple {21368#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {21368#true} is VALID [2018-11-23 12:27:59,847 INFO L273 TraceCheckUtils]: 114: Hoare triple {21368#true} assume true; {21368#true} is VALID [2018-11-23 12:27:59,847 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {21368#true} {21369#false} #72#return; {21369#false} is VALID [2018-11-23 12:27:59,847 INFO L273 TraceCheckUtils]: 116: Hoare triple {21369#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {21369#false} is VALID [2018-11-23 12:27:59,847 INFO L273 TraceCheckUtils]: 117: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:27:59,847 INFO L273 TraceCheckUtils]: 118: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:27:59,847 INFO L273 TraceCheckUtils]: 119: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:27:59,847 INFO L273 TraceCheckUtils]: 120: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:27:59,848 INFO L273 TraceCheckUtils]: 121: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:27:59,848 INFO L273 TraceCheckUtils]: 122: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:27:59,848 INFO L273 TraceCheckUtils]: 123: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:27:59,848 INFO L273 TraceCheckUtils]: 124: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:27:59,848 INFO L273 TraceCheckUtils]: 125: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:27:59,848 INFO L273 TraceCheckUtils]: 126: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:27:59,848 INFO L273 TraceCheckUtils]: 127: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:27:59,848 INFO L273 TraceCheckUtils]: 128: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:27:59,848 INFO L273 TraceCheckUtils]: 129: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:27:59,848 INFO L273 TraceCheckUtils]: 130: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:27:59,849 INFO L273 TraceCheckUtils]: 131: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:27:59,849 INFO L273 TraceCheckUtils]: 132: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:27:59,849 INFO L273 TraceCheckUtils]: 133: Hoare triple {21369#false} assume !(~i~2 < 999); {21369#false} is VALID [2018-11-23 12:27:59,849 INFO L273 TraceCheckUtils]: 134: Hoare triple {21369#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {21369#false} is VALID [2018-11-23 12:27:59,849 INFO L256 TraceCheckUtils]: 135: Hoare triple {21369#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {21368#true} is VALID [2018-11-23 12:27:59,849 INFO L273 TraceCheckUtils]: 136: Hoare triple {21368#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21368#true} is VALID [2018-11-23 12:27:59,849 INFO L273 TraceCheckUtils]: 137: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,849 INFO L273 TraceCheckUtils]: 138: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,849 INFO L273 TraceCheckUtils]: 139: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,850 INFO L273 TraceCheckUtils]: 140: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,850 INFO L273 TraceCheckUtils]: 141: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,850 INFO L273 TraceCheckUtils]: 142: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,850 INFO L273 TraceCheckUtils]: 143: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,850 INFO L273 TraceCheckUtils]: 144: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,850 INFO L273 TraceCheckUtils]: 145: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,850 INFO L273 TraceCheckUtils]: 146: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,850 INFO L273 TraceCheckUtils]: 147: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,850 INFO L273 TraceCheckUtils]: 148: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,851 INFO L273 TraceCheckUtils]: 149: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,851 INFO L273 TraceCheckUtils]: 150: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,851 INFO L273 TraceCheckUtils]: 151: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,851 INFO L273 TraceCheckUtils]: 152: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,851 INFO L273 TraceCheckUtils]: 153: Hoare triple {21368#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21368#true} is VALID [2018-11-23 12:27:59,851 INFO L273 TraceCheckUtils]: 154: Hoare triple {21368#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21368#true} is VALID [2018-11-23 12:27:59,851 INFO L273 TraceCheckUtils]: 155: Hoare triple {21368#true} assume !(~i~0 < 1000); {21368#true} is VALID [2018-11-23 12:27:59,851 INFO L273 TraceCheckUtils]: 156: Hoare triple {21368#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {21368#true} is VALID [2018-11-23 12:27:59,851 INFO L273 TraceCheckUtils]: 157: Hoare triple {21368#true} assume true; {21368#true} is VALID [2018-11-23 12:27:59,851 INFO L268 TraceCheckUtils]: 158: Hoare quadruple {21368#true} {21369#false} #74#return; {21369#false} is VALID [2018-11-23 12:27:59,852 INFO L273 TraceCheckUtils]: 159: Hoare triple {21369#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {21369#false} is VALID [2018-11-23 12:27:59,852 INFO L273 TraceCheckUtils]: 160: Hoare triple {21369#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {21369#false} is VALID [2018-11-23 12:27:59,852 INFO L273 TraceCheckUtils]: 161: Hoare triple {21369#false} assume !false; {21369#false} is VALID [2018-11-23 12:27:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2018-11-23 12:27:59,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:59,864 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:27:59,874 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:28:10,807 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 12:28:10,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:10,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:11,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {21368#true} call ULTIMATE.init(); {21368#true} is VALID [2018-11-23 12:28:11,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {21368#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21368#true} is VALID [2018-11-23 12:28:11,223 INFO L273 TraceCheckUtils]: 2: Hoare triple {21368#true} assume true; {21368#true} is VALID [2018-11-23 12:28:11,223 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21368#true} {21368#true} #66#return; {21368#true} is VALID [2018-11-23 12:28:11,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {21368#true} call #t~ret12 := main(); {21368#true} is VALID [2018-11-23 12:28:11,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {21368#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21368#true} is VALID [2018-11-23 12:28:11,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,224 INFO L273 TraceCheckUtils]: 8: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,224 INFO L273 TraceCheckUtils]: 11: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,224 INFO L273 TraceCheckUtils]: 12: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,225 INFO L273 TraceCheckUtils]: 13: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,225 INFO L273 TraceCheckUtils]: 14: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,225 INFO L273 TraceCheckUtils]: 15: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,226 INFO L273 TraceCheckUtils]: 24: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,226 INFO L273 TraceCheckUtils]: 25: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,226 INFO L273 TraceCheckUtils]: 26: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,226 INFO L273 TraceCheckUtils]: 27: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,226 INFO L273 TraceCheckUtils]: 28: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,226 INFO L273 TraceCheckUtils]: 29: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,226 INFO L273 TraceCheckUtils]: 30: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,227 INFO L273 TraceCheckUtils]: 32: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,227 INFO L273 TraceCheckUtils]: 33: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,227 INFO L273 TraceCheckUtils]: 34: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,227 INFO L273 TraceCheckUtils]: 35: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,227 INFO L273 TraceCheckUtils]: 37: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,227 INFO L273 TraceCheckUtils]: 38: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,227 INFO L273 TraceCheckUtils]: 39: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,227 INFO L273 TraceCheckUtils]: 40: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,228 INFO L273 TraceCheckUtils]: 41: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,228 INFO L273 TraceCheckUtils]: 42: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,228 INFO L273 TraceCheckUtils]: 43: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,228 INFO L273 TraceCheckUtils]: 44: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,228 INFO L273 TraceCheckUtils]: 45: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,228 INFO L273 TraceCheckUtils]: 46: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,228 INFO L273 TraceCheckUtils]: 47: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,228 INFO L273 TraceCheckUtils]: 48: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,228 INFO L273 TraceCheckUtils]: 49: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,229 INFO L273 TraceCheckUtils]: 50: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,229 INFO L273 TraceCheckUtils]: 51: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,229 INFO L273 TraceCheckUtils]: 52: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,229 INFO L273 TraceCheckUtils]: 53: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,229 INFO L273 TraceCheckUtils]: 54: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,229 INFO L273 TraceCheckUtils]: 55: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,229 INFO L273 TraceCheckUtils]: 56: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,229 INFO L273 TraceCheckUtils]: 57: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,229 INFO L273 TraceCheckUtils]: 58: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,230 INFO L273 TraceCheckUtils]: 59: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,230 INFO L273 TraceCheckUtils]: 60: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,230 INFO L273 TraceCheckUtils]: 61: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,230 INFO L273 TraceCheckUtils]: 62: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,230 INFO L273 TraceCheckUtils]: 63: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,230 INFO L273 TraceCheckUtils]: 64: Hoare triple {21368#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21368#true} is VALID [2018-11-23 12:28:11,230 INFO L273 TraceCheckUtils]: 65: Hoare triple {21368#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21368#true} is VALID [2018-11-23 12:28:11,230 INFO L273 TraceCheckUtils]: 66: Hoare triple {21368#true} assume !(~i~1 < 1000); {21368#true} is VALID [2018-11-23 12:28:11,231 INFO L256 TraceCheckUtils]: 67: Hoare triple {21368#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {21368#true} is VALID [2018-11-23 12:28:11,231 INFO L273 TraceCheckUtils]: 68: Hoare triple {21368#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21608#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:11,233 INFO L273 TraceCheckUtils]: 69: Hoare triple {21608#(<= mapavg_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21608#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:11,233 INFO L273 TraceCheckUtils]: 70: Hoare triple {21608#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21615#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:11,234 INFO L273 TraceCheckUtils]: 71: Hoare triple {21615#(<= mapavg_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21615#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:11,234 INFO L273 TraceCheckUtils]: 72: Hoare triple {21615#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21622#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:11,234 INFO L273 TraceCheckUtils]: 73: Hoare triple {21622#(<= mapavg_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21622#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:11,235 INFO L273 TraceCheckUtils]: 74: Hoare triple {21622#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21629#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:11,235 INFO L273 TraceCheckUtils]: 75: Hoare triple {21629#(<= mapavg_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21629#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:11,236 INFO L273 TraceCheckUtils]: 76: Hoare triple {21629#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21636#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:11,237 INFO L273 TraceCheckUtils]: 77: Hoare triple {21636#(<= mapavg_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21636#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:11,237 INFO L273 TraceCheckUtils]: 78: Hoare triple {21636#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21643#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:11,238 INFO L273 TraceCheckUtils]: 79: Hoare triple {21643#(<= mapavg_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21643#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:11,239 INFO L273 TraceCheckUtils]: 80: Hoare triple {21643#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21650#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:11,239 INFO L273 TraceCheckUtils]: 81: Hoare triple {21650#(<= mapavg_~i~0 6)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21650#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:11,240 INFO L273 TraceCheckUtils]: 82: Hoare triple {21650#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21657#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:11,240 INFO L273 TraceCheckUtils]: 83: Hoare triple {21657#(<= mapavg_~i~0 7)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21657#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:11,241 INFO L273 TraceCheckUtils]: 84: Hoare triple {21657#(<= mapavg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21664#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:28:11,242 INFO L273 TraceCheckUtils]: 85: Hoare triple {21664#(<= mapavg_~i~0 8)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21664#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:28:11,242 INFO L273 TraceCheckUtils]: 86: Hoare triple {21664#(<= mapavg_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21671#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:28:11,243 INFO L273 TraceCheckUtils]: 87: Hoare triple {21671#(<= mapavg_~i~0 9)} assume !(~i~0 < 1000); {21369#false} is VALID [2018-11-23 12:28:11,243 INFO L273 TraceCheckUtils]: 88: Hoare triple {21369#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {21369#false} is VALID [2018-11-23 12:28:11,243 INFO L273 TraceCheckUtils]: 89: Hoare triple {21369#false} assume true; {21369#false} is VALID [2018-11-23 12:28:11,244 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {21369#false} {21368#true} #70#return; {21369#false} is VALID [2018-11-23 12:28:11,244 INFO L273 TraceCheckUtils]: 91: Hoare triple {21369#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {21369#false} is VALID [2018-11-23 12:28:11,244 INFO L256 TraceCheckUtils]: 92: Hoare triple {21369#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {21369#false} is VALID [2018-11-23 12:28:11,244 INFO L273 TraceCheckUtils]: 93: Hoare triple {21369#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21369#false} is VALID [2018-11-23 12:28:11,244 INFO L273 TraceCheckUtils]: 94: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,245 INFO L273 TraceCheckUtils]: 95: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,245 INFO L273 TraceCheckUtils]: 96: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,245 INFO L273 TraceCheckUtils]: 97: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,245 INFO L273 TraceCheckUtils]: 98: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,245 INFO L273 TraceCheckUtils]: 99: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,245 INFO L273 TraceCheckUtils]: 100: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,246 INFO L273 TraceCheckUtils]: 101: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,246 INFO L273 TraceCheckUtils]: 102: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,246 INFO L273 TraceCheckUtils]: 103: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,246 INFO L273 TraceCheckUtils]: 104: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,246 INFO L273 TraceCheckUtils]: 105: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,246 INFO L273 TraceCheckUtils]: 106: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,246 INFO L273 TraceCheckUtils]: 107: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,246 INFO L273 TraceCheckUtils]: 108: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,247 INFO L273 TraceCheckUtils]: 109: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,247 INFO L273 TraceCheckUtils]: 110: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,247 INFO L273 TraceCheckUtils]: 111: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,247 INFO L273 TraceCheckUtils]: 112: Hoare triple {21369#false} assume !(~i~0 < 1000); {21369#false} is VALID [2018-11-23 12:28:11,247 INFO L273 TraceCheckUtils]: 113: Hoare triple {21369#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {21369#false} is VALID [2018-11-23 12:28:11,247 INFO L273 TraceCheckUtils]: 114: Hoare triple {21369#false} assume true; {21369#false} is VALID [2018-11-23 12:28:11,247 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {21369#false} {21369#false} #72#return; {21369#false} is VALID [2018-11-23 12:28:11,247 INFO L273 TraceCheckUtils]: 116: Hoare triple {21369#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {21369#false} is VALID [2018-11-23 12:28:11,247 INFO L273 TraceCheckUtils]: 117: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:28:11,247 INFO L273 TraceCheckUtils]: 118: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:28:11,248 INFO L273 TraceCheckUtils]: 119: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:28:11,248 INFO L273 TraceCheckUtils]: 120: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:28:11,248 INFO L273 TraceCheckUtils]: 121: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:28:11,248 INFO L273 TraceCheckUtils]: 122: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:28:11,248 INFO L273 TraceCheckUtils]: 123: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:28:11,248 INFO L273 TraceCheckUtils]: 124: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:28:11,248 INFO L273 TraceCheckUtils]: 125: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:28:11,248 INFO L273 TraceCheckUtils]: 126: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:28:11,248 INFO L273 TraceCheckUtils]: 127: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:28:11,249 INFO L273 TraceCheckUtils]: 128: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:28:11,249 INFO L273 TraceCheckUtils]: 129: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:28:11,249 INFO L273 TraceCheckUtils]: 130: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:28:11,249 INFO L273 TraceCheckUtils]: 131: Hoare triple {21369#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21369#false} is VALID [2018-11-23 12:28:11,249 INFO L273 TraceCheckUtils]: 132: Hoare triple {21369#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21369#false} is VALID [2018-11-23 12:28:11,249 INFO L273 TraceCheckUtils]: 133: Hoare triple {21369#false} assume !(~i~2 < 999); {21369#false} is VALID [2018-11-23 12:28:11,249 INFO L273 TraceCheckUtils]: 134: Hoare triple {21369#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {21369#false} is VALID [2018-11-23 12:28:11,249 INFO L256 TraceCheckUtils]: 135: Hoare triple {21369#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {21369#false} is VALID [2018-11-23 12:28:11,249 INFO L273 TraceCheckUtils]: 136: Hoare triple {21369#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21369#false} is VALID [2018-11-23 12:28:11,249 INFO L273 TraceCheckUtils]: 137: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,250 INFO L273 TraceCheckUtils]: 138: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,250 INFO L273 TraceCheckUtils]: 139: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,250 INFO L273 TraceCheckUtils]: 140: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,250 INFO L273 TraceCheckUtils]: 141: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,250 INFO L273 TraceCheckUtils]: 142: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,250 INFO L273 TraceCheckUtils]: 143: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,250 INFO L273 TraceCheckUtils]: 144: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,250 INFO L273 TraceCheckUtils]: 145: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,250 INFO L273 TraceCheckUtils]: 146: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,250 INFO L273 TraceCheckUtils]: 147: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,251 INFO L273 TraceCheckUtils]: 148: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,251 INFO L273 TraceCheckUtils]: 149: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,251 INFO L273 TraceCheckUtils]: 150: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,251 INFO L273 TraceCheckUtils]: 151: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,251 INFO L273 TraceCheckUtils]: 152: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,251 INFO L273 TraceCheckUtils]: 153: Hoare triple {21369#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21369#false} is VALID [2018-11-23 12:28:11,251 INFO L273 TraceCheckUtils]: 154: Hoare triple {21369#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#false} is VALID [2018-11-23 12:28:11,251 INFO L273 TraceCheckUtils]: 155: Hoare triple {21369#false} assume !(~i~0 < 1000); {21369#false} is VALID [2018-11-23 12:28:11,251 INFO L273 TraceCheckUtils]: 156: Hoare triple {21369#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {21369#false} is VALID [2018-11-23 12:28:11,252 INFO L273 TraceCheckUtils]: 157: Hoare triple {21369#false} assume true; {21369#false} is VALID [2018-11-23 12:28:11,252 INFO L268 TraceCheckUtils]: 158: Hoare quadruple {21369#false} {21369#false} #74#return; {21369#false} is VALID [2018-11-23 12:28:11,252 INFO L273 TraceCheckUtils]: 159: Hoare triple {21369#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {21369#false} is VALID [2018-11-23 12:28:11,252 INFO L273 TraceCheckUtils]: 160: Hoare triple {21369#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {21369#false} is VALID [2018-11-23 12:28:11,252 INFO L273 TraceCheckUtils]: 161: Hoare triple {21369#false} assume !false; {21369#false} is VALID [2018-11-23 12:28:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1317 trivial. 0 not checked. [2018-11-23 12:28:11,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:11,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12] total 43 [2018-11-23 12:28:11,287 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 162 [2018-11-23 12:28:11,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:11,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:28:11,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:11,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:28:11,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:28:11,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:28:11,412 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 43 states. [2018-11-23 12:28:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:12,428 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2018-11-23 12:28:12,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:28:12,429 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 162 [2018-11-23 12:28:12,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:28:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 138 transitions. [2018-11-23 12:28:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:28:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 138 transitions. [2018-11-23 12:28:12,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 138 transitions. [2018-11-23 12:28:12,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:12,572 INFO L225 Difference]: With dead ends: 173 [2018-11-23 12:28:12,572 INFO L226 Difference]: Without dead ends: 123 [2018-11-23 12:28:12,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:28:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-23 12:28:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-11-23 12:28:12,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:12,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 121 states. [2018-11-23 12:28:12,629 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 121 states. [2018-11-23 12:28:12,629 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 121 states. [2018-11-23 12:28:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:12,631 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-23 12:28:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-23 12:28:12,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:12,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:12,632 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 123 states. [2018-11-23 12:28:12,632 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 123 states. [2018-11-23 12:28:12,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:12,634 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-23 12:28:12,634 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-23 12:28:12,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:12,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:12,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:12,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 12:28:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2018-11-23 12:28:12,637 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 162 [2018-11-23 12:28:12,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:12,637 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2018-11-23 12:28:12,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:28:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:28:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-23 12:28:12,638 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:12,638 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 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:28:12,639 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:12,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:12,639 INFO L82 PathProgramCache]: Analyzing trace with hash 588995125, now seen corresponding path program 30 times [2018-11-23 12:28:12,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:12,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:12,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:12,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:12,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:13,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {22579#true} call ULTIMATE.init(); {22579#true} is VALID [2018-11-23 12:28:13,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {22579#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22579#true} is VALID [2018-11-23 12:28:13,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {22579#true} assume true; {22579#true} is VALID [2018-11-23 12:28:13,490 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22579#true} {22579#true} #66#return; {22579#true} is VALID [2018-11-23 12:28:13,490 INFO L256 TraceCheckUtils]: 4: Hoare triple {22579#true} call #t~ret12 := main(); {22579#true} is VALID [2018-11-23 12:28:13,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {22579#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22581#(= main_~i~1 0)} is VALID [2018-11-23 12:28:13,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {22581#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22581#(= main_~i~1 0)} is VALID [2018-11-23 12:28:13,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {22581#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22582#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:13,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {22582#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22582#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:13,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {22582#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22583#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:13,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {22583#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22583#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:13,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {22583#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22584#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:13,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {22584#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22584#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:13,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {22584#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22585#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:13,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {22585#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22585#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:13,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {22585#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22586#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:13,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {22586#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22586#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:13,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {22586#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22587#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:13,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {22587#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22587#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:13,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {22587#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22588#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:13,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {22588#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22588#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:13,500 INFO L273 TraceCheckUtils]: 21: Hoare triple {22588#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22589#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:13,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {22589#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22589#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:13,502 INFO L273 TraceCheckUtils]: 23: Hoare triple {22589#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22590#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:13,502 INFO L273 TraceCheckUtils]: 24: Hoare triple {22590#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22590#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:13,503 INFO L273 TraceCheckUtils]: 25: Hoare triple {22590#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22591#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:13,503 INFO L273 TraceCheckUtils]: 26: Hoare triple {22591#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22591#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:13,504 INFO L273 TraceCheckUtils]: 27: Hoare triple {22591#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22592#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:13,505 INFO L273 TraceCheckUtils]: 28: Hoare triple {22592#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22592#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:13,505 INFO L273 TraceCheckUtils]: 29: Hoare triple {22592#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22593#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:13,506 INFO L273 TraceCheckUtils]: 30: Hoare triple {22593#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22593#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:13,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {22593#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22594#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:13,507 INFO L273 TraceCheckUtils]: 32: Hoare triple {22594#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22594#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:13,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {22594#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22595#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:13,508 INFO L273 TraceCheckUtils]: 34: Hoare triple {22595#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22595#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:13,509 INFO L273 TraceCheckUtils]: 35: Hoare triple {22595#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22596#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:13,510 INFO L273 TraceCheckUtils]: 36: Hoare triple {22596#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22596#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:13,510 INFO L273 TraceCheckUtils]: 37: Hoare triple {22596#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22597#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:13,511 INFO L273 TraceCheckUtils]: 38: Hoare triple {22597#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22597#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:13,511 INFO L273 TraceCheckUtils]: 39: Hoare triple {22597#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22598#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:13,512 INFO L273 TraceCheckUtils]: 40: Hoare triple {22598#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22598#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:13,513 INFO L273 TraceCheckUtils]: 41: Hoare triple {22598#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22599#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:13,513 INFO L273 TraceCheckUtils]: 42: Hoare triple {22599#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22599#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:13,514 INFO L273 TraceCheckUtils]: 43: Hoare triple {22599#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22600#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:13,514 INFO L273 TraceCheckUtils]: 44: Hoare triple {22600#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22600#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:13,515 INFO L273 TraceCheckUtils]: 45: Hoare triple {22600#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22601#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:13,516 INFO L273 TraceCheckUtils]: 46: Hoare triple {22601#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22601#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:13,516 INFO L273 TraceCheckUtils]: 47: Hoare triple {22601#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22602#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:13,517 INFO L273 TraceCheckUtils]: 48: Hoare triple {22602#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22602#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:13,518 INFO L273 TraceCheckUtils]: 49: Hoare triple {22602#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22603#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:13,518 INFO L273 TraceCheckUtils]: 50: Hoare triple {22603#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22603#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:13,519 INFO L273 TraceCheckUtils]: 51: Hoare triple {22603#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22604#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:13,519 INFO L273 TraceCheckUtils]: 52: Hoare triple {22604#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22604#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:13,520 INFO L273 TraceCheckUtils]: 53: Hoare triple {22604#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22605#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:13,521 INFO L273 TraceCheckUtils]: 54: Hoare triple {22605#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22605#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:13,521 INFO L273 TraceCheckUtils]: 55: Hoare triple {22605#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22606#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:13,522 INFO L273 TraceCheckUtils]: 56: Hoare triple {22606#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22606#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:13,523 INFO L273 TraceCheckUtils]: 57: Hoare triple {22606#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22607#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:13,523 INFO L273 TraceCheckUtils]: 58: Hoare triple {22607#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22607#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:13,524 INFO L273 TraceCheckUtils]: 59: Hoare triple {22607#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22608#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:13,524 INFO L273 TraceCheckUtils]: 60: Hoare triple {22608#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22608#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:13,525 INFO L273 TraceCheckUtils]: 61: Hoare triple {22608#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22609#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:13,526 INFO L273 TraceCheckUtils]: 62: Hoare triple {22609#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22609#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:13,526 INFO L273 TraceCheckUtils]: 63: Hoare triple {22609#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22610#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:13,527 INFO L273 TraceCheckUtils]: 64: Hoare triple {22610#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22610#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:13,528 INFO L273 TraceCheckUtils]: 65: Hoare triple {22610#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22611#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:13,528 INFO L273 TraceCheckUtils]: 66: Hoare triple {22611#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22611#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:13,529 INFO L273 TraceCheckUtils]: 67: Hoare triple {22611#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22612#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:13,529 INFO L273 TraceCheckUtils]: 68: Hoare triple {22612#(<= main_~i~1 31)} assume !(~i~1 < 1000); {22580#false} is VALID [2018-11-23 12:28:13,530 INFO L256 TraceCheckUtils]: 69: Hoare triple {22580#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {22579#true} is VALID [2018-11-23 12:28:13,530 INFO L273 TraceCheckUtils]: 70: Hoare triple {22579#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22579#true} is VALID [2018-11-23 12:28:13,530 INFO L273 TraceCheckUtils]: 71: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,530 INFO L273 TraceCheckUtils]: 72: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,530 INFO L273 TraceCheckUtils]: 73: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,531 INFO L273 TraceCheckUtils]: 74: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,531 INFO L273 TraceCheckUtils]: 75: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,531 INFO L273 TraceCheckUtils]: 76: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,531 INFO L273 TraceCheckUtils]: 77: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,531 INFO L273 TraceCheckUtils]: 78: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,531 INFO L273 TraceCheckUtils]: 79: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,532 INFO L273 TraceCheckUtils]: 80: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,532 INFO L273 TraceCheckUtils]: 81: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,532 INFO L273 TraceCheckUtils]: 82: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,532 INFO L273 TraceCheckUtils]: 83: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,532 INFO L273 TraceCheckUtils]: 84: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,533 INFO L273 TraceCheckUtils]: 85: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,533 INFO L273 TraceCheckUtils]: 86: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,533 INFO L273 TraceCheckUtils]: 87: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,533 INFO L273 TraceCheckUtils]: 88: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,533 INFO L273 TraceCheckUtils]: 89: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,533 INFO L273 TraceCheckUtils]: 90: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,534 INFO L273 TraceCheckUtils]: 91: Hoare triple {22579#true} assume !(~i~0 < 1000); {22579#true} is VALID [2018-11-23 12:28:13,534 INFO L273 TraceCheckUtils]: 92: Hoare triple {22579#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {22579#true} is VALID [2018-11-23 12:28:13,534 INFO L273 TraceCheckUtils]: 93: Hoare triple {22579#true} assume true; {22579#true} is VALID [2018-11-23 12:28:13,534 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {22579#true} {22580#false} #70#return; {22580#false} is VALID [2018-11-23 12:28:13,534 INFO L273 TraceCheckUtils]: 95: Hoare triple {22580#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {22580#false} is VALID [2018-11-23 12:28:13,534 INFO L256 TraceCheckUtils]: 96: Hoare triple {22580#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {22579#true} is VALID [2018-11-23 12:28:13,535 INFO L273 TraceCheckUtils]: 97: Hoare triple {22579#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22579#true} is VALID [2018-11-23 12:28:13,535 INFO L273 TraceCheckUtils]: 98: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,535 INFO L273 TraceCheckUtils]: 99: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,535 INFO L273 TraceCheckUtils]: 100: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,535 INFO L273 TraceCheckUtils]: 101: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,535 INFO L273 TraceCheckUtils]: 102: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,535 INFO L273 TraceCheckUtils]: 103: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,535 INFO L273 TraceCheckUtils]: 104: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,535 INFO L273 TraceCheckUtils]: 105: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,535 INFO L273 TraceCheckUtils]: 106: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,536 INFO L273 TraceCheckUtils]: 107: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,536 INFO L273 TraceCheckUtils]: 108: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,536 INFO L273 TraceCheckUtils]: 109: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,536 INFO L273 TraceCheckUtils]: 110: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,536 INFO L273 TraceCheckUtils]: 111: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,536 INFO L273 TraceCheckUtils]: 112: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,536 INFO L273 TraceCheckUtils]: 113: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,536 INFO L273 TraceCheckUtils]: 114: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,536 INFO L273 TraceCheckUtils]: 115: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,537 INFO L273 TraceCheckUtils]: 116: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,537 INFO L273 TraceCheckUtils]: 117: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,537 INFO L273 TraceCheckUtils]: 118: Hoare triple {22579#true} assume !(~i~0 < 1000); {22579#true} is VALID [2018-11-23 12:28:13,537 INFO L273 TraceCheckUtils]: 119: Hoare triple {22579#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {22579#true} is VALID [2018-11-23 12:28:13,537 INFO L273 TraceCheckUtils]: 120: Hoare triple {22579#true} assume true; {22579#true} is VALID [2018-11-23 12:28:13,537 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {22579#true} {22580#false} #72#return; {22580#false} is VALID [2018-11-23 12:28:13,537 INFO L273 TraceCheckUtils]: 122: Hoare triple {22580#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {22580#false} is VALID [2018-11-23 12:28:13,537 INFO L273 TraceCheckUtils]: 123: Hoare triple {22580#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22580#false} is VALID [2018-11-23 12:28:13,537 INFO L273 TraceCheckUtils]: 124: Hoare triple {22580#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22580#false} is VALID [2018-11-23 12:28:13,537 INFO L273 TraceCheckUtils]: 125: Hoare triple {22580#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22580#false} is VALID [2018-11-23 12:28:13,538 INFO L273 TraceCheckUtils]: 126: Hoare triple {22580#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22580#false} is VALID [2018-11-23 12:28:13,538 INFO L273 TraceCheckUtils]: 127: Hoare triple {22580#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22580#false} is VALID [2018-11-23 12:28:13,538 INFO L273 TraceCheckUtils]: 128: Hoare triple {22580#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22580#false} is VALID [2018-11-23 12:28:13,538 INFO L273 TraceCheckUtils]: 129: Hoare triple {22580#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22580#false} is VALID [2018-11-23 12:28:13,538 INFO L273 TraceCheckUtils]: 130: Hoare triple {22580#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22580#false} is VALID [2018-11-23 12:28:13,538 INFO L273 TraceCheckUtils]: 131: Hoare triple {22580#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22580#false} is VALID [2018-11-23 12:28:13,538 INFO L273 TraceCheckUtils]: 132: Hoare triple {22580#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22580#false} is VALID [2018-11-23 12:28:13,538 INFO L273 TraceCheckUtils]: 133: Hoare triple {22580#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22580#false} is VALID [2018-11-23 12:28:13,538 INFO L273 TraceCheckUtils]: 134: Hoare triple {22580#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22580#false} is VALID [2018-11-23 12:28:13,539 INFO L273 TraceCheckUtils]: 135: Hoare triple {22580#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22580#false} is VALID [2018-11-23 12:28:13,539 INFO L273 TraceCheckUtils]: 136: Hoare triple {22580#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22580#false} is VALID [2018-11-23 12:28:13,539 INFO L273 TraceCheckUtils]: 137: Hoare triple {22580#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22580#false} is VALID [2018-11-23 12:28:13,539 INFO L273 TraceCheckUtils]: 138: Hoare triple {22580#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22580#false} is VALID [2018-11-23 12:28:13,539 INFO L273 TraceCheckUtils]: 139: Hoare triple {22580#false} assume !(~i~2 < 999); {22580#false} is VALID [2018-11-23 12:28:13,539 INFO L273 TraceCheckUtils]: 140: Hoare triple {22580#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {22580#false} is VALID [2018-11-23 12:28:13,539 INFO L256 TraceCheckUtils]: 141: Hoare triple {22580#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {22579#true} is VALID [2018-11-23 12:28:13,539 INFO L273 TraceCheckUtils]: 142: Hoare triple {22579#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22579#true} is VALID [2018-11-23 12:28:13,539 INFO L273 TraceCheckUtils]: 143: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,539 INFO L273 TraceCheckUtils]: 144: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,540 INFO L273 TraceCheckUtils]: 145: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,540 INFO L273 TraceCheckUtils]: 146: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,540 INFO L273 TraceCheckUtils]: 147: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,540 INFO L273 TraceCheckUtils]: 148: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,540 INFO L273 TraceCheckUtils]: 149: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,540 INFO L273 TraceCheckUtils]: 150: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,540 INFO L273 TraceCheckUtils]: 151: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,540 INFO L273 TraceCheckUtils]: 152: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,540 INFO L273 TraceCheckUtils]: 153: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,540 INFO L273 TraceCheckUtils]: 154: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,541 INFO L273 TraceCheckUtils]: 155: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,541 INFO L273 TraceCheckUtils]: 156: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,541 INFO L273 TraceCheckUtils]: 157: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,541 INFO L273 TraceCheckUtils]: 158: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,541 INFO L273 TraceCheckUtils]: 159: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,541 INFO L273 TraceCheckUtils]: 160: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,542 INFO L273 TraceCheckUtils]: 161: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:13,542 INFO L273 TraceCheckUtils]: 162: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:13,542 INFO L273 TraceCheckUtils]: 163: Hoare triple {22579#true} assume !(~i~0 < 1000); {22579#true} is VALID [2018-11-23 12:28:13,542 INFO L273 TraceCheckUtils]: 164: Hoare triple {22579#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {22579#true} is VALID [2018-11-23 12:28:13,542 INFO L273 TraceCheckUtils]: 165: Hoare triple {22579#true} assume true; {22579#true} is VALID [2018-11-23 12:28:13,542 INFO L268 TraceCheckUtils]: 166: Hoare quadruple {22579#true} {22580#false} #74#return; {22580#false} is VALID [2018-11-23 12:28:13,543 INFO L273 TraceCheckUtils]: 167: Hoare triple {22580#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {22580#false} is VALID [2018-11-23 12:28:13,543 INFO L273 TraceCheckUtils]: 168: Hoare triple {22580#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {22580#false} is VALID [2018-11-23 12:28:13,543 INFO L273 TraceCheckUtils]: 169: Hoare triple {22580#false} assume !false; {22580#false} is VALID [2018-11-23 12:28:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2018-11-23 12:28:13,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:13,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:13,578 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:17,821 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:28:17,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:17,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:18,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {22579#true} call ULTIMATE.init(); {22579#true} is VALID [2018-11-23 12:28:18,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {22579#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22579#true} is VALID [2018-11-23 12:28:18,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {22579#true} assume true; {22579#true} is VALID [2018-11-23 12:28:18,485 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22579#true} {22579#true} #66#return; {22579#true} is VALID [2018-11-23 12:28:18,485 INFO L256 TraceCheckUtils]: 4: Hoare triple {22579#true} call #t~ret12 := main(); {22579#true} is VALID [2018-11-23 12:28:18,485 INFO L273 TraceCheckUtils]: 5: Hoare triple {22579#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22579#true} is VALID [2018-11-23 12:28:18,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,486 INFO L273 TraceCheckUtils]: 10: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,486 INFO L273 TraceCheckUtils]: 11: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,487 INFO L273 TraceCheckUtils]: 14: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,487 INFO L273 TraceCheckUtils]: 16: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,487 INFO L273 TraceCheckUtils]: 19: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,487 INFO L273 TraceCheckUtils]: 20: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,487 INFO L273 TraceCheckUtils]: 21: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,488 INFO L273 TraceCheckUtils]: 23: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,488 INFO L273 TraceCheckUtils]: 24: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,488 INFO L273 TraceCheckUtils]: 25: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,488 INFO L273 TraceCheckUtils]: 26: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,488 INFO L273 TraceCheckUtils]: 27: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,488 INFO L273 TraceCheckUtils]: 28: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,488 INFO L273 TraceCheckUtils]: 29: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,488 INFO L273 TraceCheckUtils]: 30: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,488 INFO L273 TraceCheckUtils]: 31: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,488 INFO L273 TraceCheckUtils]: 32: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,489 INFO L273 TraceCheckUtils]: 33: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,489 INFO L273 TraceCheckUtils]: 34: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,489 INFO L273 TraceCheckUtils]: 35: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,489 INFO L273 TraceCheckUtils]: 36: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,489 INFO L273 TraceCheckUtils]: 37: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,489 INFO L273 TraceCheckUtils]: 38: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,489 INFO L273 TraceCheckUtils]: 39: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,489 INFO L273 TraceCheckUtils]: 40: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,489 INFO L273 TraceCheckUtils]: 41: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,490 INFO L273 TraceCheckUtils]: 42: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,490 INFO L273 TraceCheckUtils]: 43: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,490 INFO L273 TraceCheckUtils]: 44: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,490 INFO L273 TraceCheckUtils]: 45: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,490 INFO L273 TraceCheckUtils]: 46: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,490 INFO L273 TraceCheckUtils]: 47: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,490 INFO L273 TraceCheckUtils]: 48: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,490 INFO L273 TraceCheckUtils]: 49: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,490 INFO L273 TraceCheckUtils]: 50: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,490 INFO L273 TraceCheckUtils]: 51: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,491 INFO L273 TraceCheckUtils]: 52: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,491 INFO L273 TraceCheckUtils]: 53: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,491 INFO L273 TraceCheckUtils]: 54: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,491 INFO L273 TraceCheckUtils]: 55: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,491 INFO L273 TraceCheckUtils]: 56: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,491 INFO L273 TraceCheckUtils]: 57: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,491 INFO L273 TraceCheckUtils]: 58: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,491 INFO L273 TraceCheckUtils]: 59: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,491 INFO L273 TraceCheckUtils]: 60: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,491 INFO L273 TraceCheckUtils]: 61: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,492 INFO L273 TraceCheckUtils]: 62: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,492 INFO L273 TraceCheckUtils]: 63: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,492 INFO L273 TraceCheckUtils]: 64: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,492 INFO L273 TraceCheckUtils]: 65: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,492 INFO L273 TraceCheckUtils]: 66: Hoare triple {22579#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22579#true} is VALID [2018-11-23 12:28:18,492 INFO L273 TraceCheckUtils]: 67: Hoare triple {22579#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22579#true} is VALID [2018-11-23 12:28:18,492 INFO L273 TraceCheckUtils]: 68: Hoare triple {22579#true} assume !(~i~1 < 1000); {22579#true} is VALID [2018-11-23 12:28:18,492 INFO L256 TraceCheckUtils]: 69: Hoare triple {22579#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {22579#true} is VALID [2018-11-23 12:28:18,492 INFO L273 TraceCheckUtils]: 70: Hoare triple {22579#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22579#true} is VALID [2018-11-23 12:28:18,493 INFO L273 TraceCheckUtils]: 71: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,493 INFO L273 TraceCheckUtils]: 72: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,493 INFO L273 TraceCheckUtils]: 73: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,493 INFO L273 TraceCheckUtils]: 74: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,493 INFO L273 TraceCheckUtils]: 75: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,493 INFO L273 TraceCheckUtils]: 76: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,493 INFO L273 TraceCheckUtils]: 77: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,493 INFO L273 TraceCheckUtils]: 78: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,493 INFO L273 TraceCheckUtils]: 79: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,493 INFO L273 TraceCheckUtils]: 80: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,494 INFO L273 TraceCheckUtils]: 81: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,494 INFO L273 TraceCheckUtils]: 82: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,494 INFO L273 TraceCheckUtils]: 83: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,494 INFO L273 TraceCheckUtils]: 84: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,494 INFO L273 TraceCheckUtils]: 85: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,494 INFO L273 TraceCheckUtils]: 86: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,494 INFO L273 TraceCheckUtils]: 87: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,494 INFO L273 TraceCheckUtils]: 88: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,494 INFO L273 TraceCheckUtils]: 89: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,494 INFO L273 TraceCheckUtils]: 90: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,495 INFO L273 TraceCheckUtils]: 91: Hoare triple {22579#true} assume !(~i~0 < 1000); {22579#true} is VALID [2018-11-23 12:28:18,495 INFO L273 TraceCheckUtils]: 92: Hoare triple {22579#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {22579#true} is VALID [2018-11-23 12:28:18,495 INFO L273 TraceCheckUtils]: 93: Hoare triple {22579#true} assume true; {22579#true} is VALID [2018-11-23 12:28:18,495 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {22579#true} {22579#true} #70#return; {22579#true} is VALID [2018-11-23 12:28:18,495 INFO L273 TraceCheckUtils]: 95: Hoare triple {22579#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {22579#true} is VALID [2018-11-23 12:28:18,495 INFO L256 TraceCheckUtils]: 96: Hoare triple {22579#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {22579#true} is VALID [2018-11-23 12:28:18,495 INFO L273 TraceCheckUtils]: 97: Hoare triple {22579#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22579#true} is VALID [2018-11-23 12:28:18,495 INFO L273 TraceCheckUtils]: 98: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,495 INFO L273 TraceCheckUtils]: 99: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,496 INFO L273 TraceCheckUtils]: 100: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,496 INFO L273 TraceCheckUtils]: 101: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,496 INFO L273 TraceCheckUtils]: 102: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,496 INFO L273 TraceCheckUtils]: 103: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,496 INFO L273 TraceCheckUtils]: 104: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,496 INFO L273 TraceCheckUtils]: 105: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,496 INFO L273 TraceCheckUtils]: 106: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,496 INFO L273 TraceCheckUtils]: 107: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,496 INFO L273 TraceCheckUtils]: 108: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,496 INFO L273 TraceCheckUtils]: 109: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,497 INFO L273 TraceCheckUtils]: 110: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,497 INFO L273 TraceCheckUtils]: 111: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,497 INFO L273 TraceCheckUtils]: 112: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,497 INFO L273 TraceCheckUtils]: 113: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,497 INFO L273 TraceCheckUtils]: 114: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,497 INFO L273 TraceCheckUtils]: 115: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,497 INFO L273 TraceCheckUtils]: 116: Hoare triple {22579#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22579#true} is VALID [2018-11-23 12:28:18,497 INFO L273 TraceCheckUtils]: 117: Hoare triple {22579#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#true} is VALID [2018-11-23 12:28:18,497 INFO L273 TraceCheckUtils]: 118: Hoare triple {22579#true} assume !(~i~0 < 1000); {22579#true} is VALID [2018-11-23 12:28:18,497 INFO L273 TraceCheckUtils]: 119: Hoare triple {22579#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {22579#true} is VALID [2018-11-23 12:28:18,498 INFO L273 TraceCheckUtils]: 120: Hoare triple {22579#true} assume true; {22579#true} is VALID [2018-11-23 12:28:18,498 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {22579#true} {22579#true} #72#return; {22579#true} is VALID [2018-11-23 12:28:18,498 INFO L273 TraceCheckUtils]: 122: Hoare triple {22579#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {22982#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:18,499 INFO L273 TraceCheckUtils]: 123: Hoare triple {22982#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22982#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:18,499 INFO L273 TraceCheckUtils]: 124: Hoare triple {22982#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22989#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:18,499 INFO L273 TraceCheckUtils]: 125: Hoare triple {22989#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22989#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:18,500 INFO L273 TraceCheckUtils]: 126: Hoare triple {22989#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22996#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:18,500 INFO L273 TraceCheckUtils]: 127: Hoare triple {22996#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22996#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:18,501 INFO L273 TraceCheckUtils]: 128: Hoare triple {22996#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23003#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:18,501 INFO L273 TraceCheckUtils]: 129: Hoare triple {23003#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23003#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:18,501 INFO L273 TraceCheckUtils]: 130: Hoare triple {23003#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23010#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:18,502 INFO L273 TraceCheckUtils]: 131: Hoare triple {23010#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23010#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:18,502 INFO L273 TraceCheckUtils]: 132: Hoare triple {23010#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23017#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:18,503 INFO L273 TraceCheckUtils]: 133: Hoare triple {23017#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23017#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:18,504 INFO L273 TraceCheckUtils]: 134: Hoare triple {23017#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23024#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:18,504 INFO L273 TraceCheckUtils]: 135: Hoare triple {23024#(<= main_~i~2 6)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23024#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:18,505 INFO L273 TraceCheckUtils]: 136: Hoare triple {23024#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23031#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:18,506 INFO L273 TraceCheckUtils]: 137: Hoare triple {23031#(<= main_~i~2 7)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23031#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:18,506 INFO L273 TraceCheckUtils]: 138: Hoare triple {23031#(<= main_~i~2 7)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23038#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:18,507 INFO L273 TraceCheckUtils]: 139: Hoare triple {23038#(<= main_~i~2 8)} assume !(~i~2 < 999); {22580#false} is VALID [2018-11-23 12:28:18,507 INFO L273 TraceCheckUtils]: 140: Hoare triple {22580#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {22580#false} is VALID [2018-11-23 12:28:18,507 INFO L256 TraceCheckUtils]: 141: Hoare triple {22580#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {22580#false} is VALID [2018-11-23 12:28:18,508 INFO L273 TraceCheckUtils]: 142: Hoare triple {22580#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22580#false} is VALID [2018-11-23 12:28:18,508 INFO L273 TraceCheckUtils]: 143: Hoare triple {22580#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22580#false} is VALID [2018-11-23 12:28:18,508 INFO L273 TraceCheckUtils]: 144: Hoare triple {22580#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22580#false} is VALID [2018-11-23 12:28:18,508 INFO L273 TraceCheckUtils]: 145: Hoare triple {22580#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22580#false} is VALID [2018-11-23 12:28:18,508 INFO L273 TraceCheckUtils]: 146: Hoare triple {22580#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22580#false} is VALID [2018-11-23 12:28:18,508 INFO L273 TraceCheckUtils]: 147: Hoare triple {22580#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22580#false} is VALID [2018-11-23 12:28:18,509 INFO L273 TraceCheckUtils]: 148: Hoare triple {22580#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22580#false} is VALID [2018-11-23 12:28:18,509 INFO L273 TraceCheckUtils]: 149: Hoare triple {22580#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22580#false} is VALID [2018-11-23 12:28:18,509 INFO L273 TraceCheckUtils]: 150: Hoare triple {22580#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22580#false} is VALID [2018-11-23 12:28:18,509 INFO L273 TraceCheckUtils]: 151: Hoare triple {22580#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22580#false} is VALID [2018-11-23 12:28:18,509 INFO L273 TraceCheckUtils]: 152: Hoare triple {22580#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22580#false} is VALID [2018-11-23 12:28:18,510 INFO L273 TraceCheckUtils]: 153: Hoare triple {22580#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22580#false} is VALID [2018-11-23 12:28:18,510 INFO L273 TraceCheckUtils]: 154: Hoare triple {22580#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22580#false} is VALID [2018-11-23 12:28:18,510 INFO L273 TraceCheckUtils]: 155: Hoare triple {22580#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22580#false} is VALID [2018-11-23 12:28:18,510 INFO L273 TraceCheckUtils]: 156: Hoare triple {22580#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22580#false} is VALID [2018-11-23 12:28:18,510 INFO L273 TraceCheckUtils]: 157: Hoare triple {22580#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22580#false} is VALID [2018-11-23 12:28:18,510 INFO L273 TraceCheckUtils]: 158: Hoare triple {22580#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22580#false} is VALID [2018-11-23 12:28:18,511 INFO L273 TraceCheckUtils]: 159: Hoare triple {22580#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22580#false} is VALID [2018-11-23 12:28:18,511 INFO L273 TraceCheckUtils]: 160: Hoare triple {22580#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22580#false} is VALID [2018-11-23 12:28:18,511 INFO L273 TraceCheckUtils]: 161: Hoare triple {22580#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22580#false} is VALID [2018-11-23 12:28:18,511 INFO L273 TraceCheckUtils]: 162: Hoare triple {22580#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22580#false} is VALID [2018-11-23 12:28:18,511 INFO L273 TraceCheckUtils]: 163: Hoare triple {22580#false} assume !(~i~0 < 1000); {22580#false} is VALID [2018-11-23 12:28:18,511 INFO L273 TraceCheckUtils]: 164: Hoare triple {22580#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {22580#false} is VALID [2018-11-23 12:28:18,512 INFO L273 TraceCheckUtils]: 165: Hoare triple {22580#false} assume true; {22580#false} is VALID [2018-11-23 12:28:18,512 INFO L268 TraceCheckUtils]: 166: Hoare quadruple {22580#false} {22580#false} #74#return; {22580#false} is VALID [2018-11-23 12:28:18,512 INFO L273 TraceCheckUtils]: 167: Hoare triple {22580#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {22580#false} is VALID [2018-11-23 12:28:18,512 INFO L273 TraceCheckUtils]: 168: Hoare triple {22580#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {22580#false} is VALID [2018-11-23 12:28:18,512 INFO L273 TraceCheckUtils]: 169: Hoare triple {22580#false} assume !false; {22580#false} is VALID [2018-11-23 12:28:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1486 trivial. 0 not checked. [2018-11-23 12:28:18,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:18,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 11] total 43 [2018-11-23 12:28:18,546 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2018-11-23 12:28:18,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:18,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:28:18,675 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:28:18,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:28:18,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:28:18,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:28:18,677 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand 43 states. [2018-11-23 12:28:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:19,904 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2018-11-23 12:28:19,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:28:19,904 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2018-11-23 12:28:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:28:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 135 transitions. [2018-11-23 12:28:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:28:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 135 transitions. [2018-11-23 12:28:19,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 135 transitions. [2018-11-23 12:28:20,040 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:28:20,043 INFO L225 Difference]: With dead ends: 179 [2018-11-23 12:28:20,043 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 12:28:20,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:28:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 12:28:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-11-23 12:28:20,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:20,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 125 states. [2018-11-23 12:28:20,103 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 125 states. [2018-11-23 12:28:20,103 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 125 states. [2018-11-23 12:28:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:20,106 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-11-23 12:28:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:28:20,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:20,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:20,107 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 127 states. [2018-11-23 12:28:20,107 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 127 states. [2018-11-23 12:28:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:20,109 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-11-23 12:28:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:28:20,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:20,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:20,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:20,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 12:28:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-23 12:28:20,112 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 170 [2018-11-23 12:28:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:20,113 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-23 12:28:20,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:28:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:28:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 12:28:20,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:20,114 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:28:20,114 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:20,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1888810859, now seen corresponding path program 31 times [2018-11-23 12:28:20,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:20,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:20,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:20,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:20,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:21,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {23837#true} call ULTIMATE.init(); {23837#true} is VALID [2018-11-23 12:28:21,205 INFO L273 TraceCheckUtils]: 1: Hoare triple {23837#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23837#true} is VALID [2018-11-23 12:28:21,205 INFO L273 TraceCheckUtils]: 2: Hoare triple {23837#true} assume true; {23837#true} is VALID [2018-11-23 12:28:21,205 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23837#true} {23837#true} #66#return; {23837#true} is VALID [2018-11-23 12:28:21,206 INFO L256 TraceCheckUtils]: 4: Hoare triple {23837#true} call #t~ret12 := main(); {23837#true} is VALID [2018-11-23 12:28:21,206 INFO L273 TraceCheckUtils]: 5: Hoare triple {23837#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23839#(= main_~i~1 0)} is VALID [2018-11-23 12:28:21,207 INFO L273 TraceCheckUtils]: 6: Hoare triple {23839#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23839#(= main_~i~1 0)} is VALID [2018-11-23 12:28:21,207 INFO L273 TraceCheckUtils]: 7: Hoare triple {23839#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23840#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:21,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {23840#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23840#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:21,208 INFO L273 TraceCheckUtils]: 9: Hoare triple {23840#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23841#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:21,209 INFO L273 TraceCheckUtils]: 10: Hoare triple {23841#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23841#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:21,209 INFO L273 TraceCheckUtils]: 11: Hoare triple {23841#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23842#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:21,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {23842#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23842#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:21,210 INFO L273 TraceCheckUtils]: 13: Hoare triple {23842#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23843#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:21,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {23843#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23843#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:21,211 INFO L273 TraceCheckUtils]: 15: Hoare triple {23843#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23844#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:21,212 INFO L273 TraceCheckUtils]: 16: Hoare triple {23844#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23844#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:21,212 INFO L273 TraceCheckUtils]: 17: Hoare triple {23844#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23845#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:21,213 INFO L273 TraceCheckUtils]: 18: Hoare triple {23845#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23845#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:21,214 INFO L273 TraceCheckUtils]: 19: Hoare triple {23845#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23846#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:21,214 INFO L273 TraceCheckUtils]: 20: Hoare triple {23846#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23846#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:21,215 INFO L273 TraceCheckUtils]: 21: Hoare triple {23846#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23847#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:21,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {23847#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23847#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:21,216 INFO L273 TraceCheckUtils]: 23: Hoare triple {23847#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23848#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:21,217 INFO L273 TraceCheckUtils]: 24: Hoare triple {23848#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23848#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:21,217 INFO L273 TraceCheckUtils]: 25: Hoare triple {23848#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23849#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:21,218 INFO L273 TraceCheckUtils]: 26: Hoare triple {23849#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23849#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:21,218 INFO L273 TraceCheckUtils]: 27: Hoare triple {23849#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23850#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:21,219 INFO L273 TraceCheckUtils]: 28: Hoare triple {23850#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23850#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:21,220 INFO L273 TraceCheckUtils]: 29: Hoare triple {23850#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23851#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:21,220 INFO L273 TraceCheckUtils]: 30: Hoare triple {23851#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23851#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:21,221 INFO L273 TraceCheckUtils]: 31: Hoare triple {23851#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23852#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:21,221 INFO L273 TraceCheckUtils]: 32: Hoare triple {23852#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23852#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:21,222 INFO L273 TraceCheckUtils]: 33: Hoare triple {23852#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23853#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:21,223 INFO L273 TraceCheckUtils]: 34: Hoare triple {23853#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23853#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:21,223 INFO L273 TraceCheckUtils]: 35: Hoare triple {23853#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23854#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:21,224 INFO L273 TraceCheckUtils]: 36: Hoare triple {23854#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23854#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:21,225 INFO L273 TraceCheckUtils]: 37: Hoare triple {23854#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23855#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:21,225 INFO L273 TraceCheckUtils]: 38: Hoare triple {23855#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23855#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:21,226 INFO L273 TraceCheckUtils]: 39: Hoare triple {23855#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23856#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:21,226 INFO L273 TraceCheckUtils]: 40: Hoare triple {23856#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23856#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:21,227 INFO L273 TraceCheckUtils]: 41: Hoare triple {23856#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23857#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:21,228 INFO L273 TraceCheckUtils]: 42: Hoare triple {23857#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23857#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:21,228 INFO L273 TraceCheckUtils]: 43: Hoare triple {23857#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23858#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:21,229 INFO L273 TraceCheckUtils]: 44: Hoare triple {23858#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23858#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:21,230 INFO L273 TraceCheckUtils]: 45: Hoare triple {23858#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23859#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:21,230 INFO L273 TraceCheckUtils]: 46: Hoare triple {23859#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23859#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:21,231 INFO L273 TraceCheckUtils]: 47: Hoare triple {23859#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23860#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:21,231 INFO L273 TraceCheckUtils]: 48: Hoare triple {23860#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23860#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:21,232 INFO L273 TraceCheckUtils]: 49: Hoare triple {23860#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23861#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:21,233 INFO L273 TraceCheckUtils]: 50: Hoare triple {23861#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23861#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:21,233 INFO L273 TraceCheckUtils]: 51: Hoare triple {23861#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23862#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:21,234 INFO L273 TraceCheckUtils]: 52: Hoare triple {23862#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23862#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:21,235 INFO L273 TraceCheckUtils]: 53: Hoare triple {23862#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23863#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:21,235 INFO L273 TraceCheckUtils]: 54: Hoare triple {23863#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23863#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:21,236 INFO L273 TraceCheckUtils]: 55: Hoare triple {23863#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23864#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:21,236 INFO L273 TraceCheckUtils]: 56: Hoare triple {23864#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23864#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:21,237 INFO L273 TraceCheckUtils]: 57: Hoare triple {23864#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23865#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:21,238 INFO L273 TraceCheckUtils]: 58: Hoare triple {23865#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23865#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:21,238 INFO L273 TraceCheckUtils]: 59: Hoare triple {23865#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23866#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:21,239 INFO L273 TraceCheckUtils]: 60: Hoare triple {23866#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23866#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:21,240 INFO L273 TraceCheckUtils]: 61: Hoare triple {23866#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23867#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:21,240 INFO L273 TraceCheckUtils]: 62: Hoare triple {23867#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23867#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:21,241 INFO L273 TraceCheckUtils]: 63: Hoare triple {23867#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23868#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:21,241 INFO L273 TraceCheckUtils]: 64: Hoare triple {23868#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23868#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:21,242 INFO L273 TraceCheckUtils]: 65: Hoare triple {23868#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23869#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:21,243 INFO L273 TraceCheckUtils]: 66: Hoare triple {23869#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23869#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:21,243 INFO L273 TraceCheckUtils]: 67: Hoare triple {23869#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23870#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:21,244 INFO L273 TraceCheckUtils]: 68: Hoare triple {23870#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23870#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:21,244 INFO L273 TraceCheckUtils]: 69: Hoare triple {23870#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23871#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:21,245 INFO L273 TraceCheckUtils]: 70: Hoare triple {23871#(<= main_~i~1 32)} assume !(~i~1 < 1000); {23838#false} is VALID [2018-11-23 12:28:21,245 INFO L256 TraceCheckUtils]: 71: Hoare triple {23838#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {23837#true} is VALID [2018-11-23 12:28:21,246 INFO L273 TraceCheckUtils]: 72: Hoare triple {23837#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23837#true} is VALID [2018-11-23 12:28:21,246 INFO L273 TraceCheckUtils]: 73: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,246 INFO L273 TraceCheckUtils]: 74: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,246 INFO L273 TraceCheckUtils]: 75: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,246 INFO L273 TraceCheckUtils]: 76: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,246 INFO L273 TraceCheckUtils]: 77: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,247 INFO L273 TraceCheckUtils]: 78: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,247 INFO L273 TraceCheckUtils]: 79: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,247 INFO L273 TraceCheckUtils]: 80: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,247 INFO L273 TraceCheckUtils]: 81: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,247 INFO L273 TraceCheckUtils]: 82: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,248 INFO L273 TraceCheckUtils]: 83: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,248 INFO L273 TraceCheckUtils]: 84: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,248 INFO L273 TraceCheckUtils]: 85: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,248 INFO L273 TraceCheckUtils]: 86: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,248 INFO L273 TraceCheckUtils]: 87: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,248 INFO L273 TraceCheckUtils]: 88: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,248 INFO L273 TraceCheckUtils]: 89: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,248 INFO L273 TraceCheckUtils]: 90: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,248 INFO L273 TraceCheckUtils]: 91: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,249 INFO L273 TraceCheckUtils]: 92: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,249 INFO L273 TraceCheckUtils]: 93: Hoare triple {23837#true} assume !(~i~0 < 1000); {23837#true} is VALID [2018-11-23 12:28:21,249 INFO L273 TraceCheckUtils]: 94: Hoare triple {23837#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {23837#true} is VALID [2018-11-23 12:28:21,249 INFO L273 TraceCheckUtils]: 95: Hoare triple {23837#true} assume true; {23837#true} is VALID [2018-11-23 12:28:21,249 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {23837#true} {23838#false} #70#return; {23838#false} is VALID [2018-11-23 12:28:21,249 INFO L273 TraceCheckUtils]: 97: Hoare triple {23838#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {23838#false} is VALID [2018-11-23 12:28:21,249 INFO L256 TraceCheckUtils]: 98: Hoare triple {23838#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {23837#true} is VALID [2018-11-23 12:28:21,249 INFO L273 TraceCheckUtils]: 99: Hoare triple {23837#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23837#true} is VALID [2018-11-23 12:28:21,249 INFO L273 TraceCheckUtils]: 100: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,250 INFO L273 TraceCheckUtils]: 101: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,250 INFO L273 TraceCheckUtils]: 102: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,250 INFO L273 TraceCheckUtils]: 103: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,250 INFO L273 TraceCheckUtils]: 104: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,250 INFO L273 TraceCheckUtils]: 105: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,250 INFO L273 TraceCheckUtils]: 106: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,250 INFO L273 TraceCheckUtils]: 107: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,250 INFO L273 TraceCheckUtils]: 108: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,250 INFO L273 TraceCheckUtils]: 109: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,250 INFO L273 TraceCheckUtils]: 110: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,251 INFO L273 TraceCheckUtils]: 111: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,251 INFO L273 TraceCheckUtils]: 112: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,251 INFO L273 TraceCheckUtils]: 113: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,251 INFO L273 TraceCheckUtils]: 114: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,251 INFO L273 TraceCheckUtils]: 115: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,251 INFO L273 TraceCheckUtils]: 116: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,251 INFO L273 TraceCheckUtils]: 117: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,251 INFO L273 TraceCheckUtils]: 118: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,251 INFO L273 TraceCheckUtils]: 119: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,251 INFO L273 TraceCheckUtils]: 120: Hoare triple {23837#true} assume !(~i~0 < 1000); {23837#true} is VALID [2018-11-23 12:28:21,252 INFO L273 TraceCheckUtils]: 121: Hoare triple {23837#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {23837#true} is VALID [2018-11-23 12:28:21,252 INFO L273 TraceCheckUtils]: 122: Hoare triple {23837#true} assume true; {23837#true} is VALID [2018-11-23 12:28:21,252 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {23837#true} {23838#false} #72#return; {23838#false} is VALID [2018-11-23 12:28:21,252 INFO L273 TraceCheckUtils]: 124: Hoare triple {23838#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {23838#false} is VALID [2018-11-23 12:28:21,252 INFO L273 TraceCheckUtils]: 125: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,252 INFO L273 TraceCheckUtils]: 126: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,252 INFO L273 TraceCheckUtils]: 127: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,252 INFO L273 TraceCheckUtils]: 128: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,252 INFO L273 TraceCheckUtils]: 129: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,252 INFO L273 TraceCheckUtils]: 130: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,253 INFO L273 TraceCheckUtils]: 131: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,253 INFO L273 TraceCheckUtils]: 132: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,253 INFO L273 TraceCheckUtils]: 133: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,253 INFO L273 TraceCheckUtils]: 134: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,253 INFO L273 TraceCheckUtils]: 135: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,253 INFO L273 TraceCheckUtils]: 136: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,253 INFO L273 TraceCheckUtils]: 137: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,253 INFO L273 TraceCheckUtils]: 138: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,254 INFO L273 TraceCheckUtils]: 139: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,254 INFO L273 TraceCheckUtils]: 140: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,254 INFO L273 TraceCheckUtils]: 141: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,254 INFO L273 TraceCheckUtils]: 142: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,254 INFO L273 TraceCheckUtils]: 143: Hoare triple {23838#false} assume !(~i~2 < 999); {23838#false} is VALID [2018-11-23 12:28:21,254 INFO L273 TraceCheckUtils]: 144: Hoare triple {23838#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {23838#false} is VALID [2018-11-23 12:28:21,254 INFO L256 TraceCheckUtils]: 145: Hoare triple {23838#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {23837#true} is VALID [2018-11-23 12:28:21,254 INFO L273 TraceCheckUtils]: 146: Hoare triple {23837#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23837#true} is VALID [2018-11-23 12:28:21,255 INFO L273 TraceCheckUtils]: 147: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,255 INFO L273 TraceCheckUtils]: 148: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,255 INFO L273 TraceCheckUtils]: 149: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,255 INFO L273 TraceCheckUtils]: 150: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,255 INFO L273 TraceCheckUtils]: 151: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,255 INFO L273 TraceCheckUtils]: 152: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,255 INFO L273 TraceCheckUtils]: 153: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,256 INFO L273 TraceCheckUtils]: 154: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,256 INFO L273 TraceCheckUtils]: 155: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,256 INFO L273 TraceCheckUtils]: 156: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,256 INFO L273 TraceCheckUtils]: 157: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,256 INFO L273 TraceCheckUtils]: 158: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,256 INFO L273 TraceCheckUtils]: 159: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,256 INFO L273 TraceCheckUtils]: 160: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,257 INFO L273 TraceCheckUtils]: 161: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,257 INFO L273 TraceCheckUtils]: 162: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,257 INFO L273 TraceCheckUtils]: 163: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,257 INFO L273 TraceCheckUtils]: 164: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,257 INFO L273 TraceCheckUtils]: 165: Hoare triple {23837#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23837#true} is VALID [2018-11-23 12:28:21,257 INFO L273 TraceCheckUtils]: 166: Hoare triple {23837#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23837#true} is VALID [2018-11-23 12:28:21,257 INFO L273 TraceCheckUtils]: 167: Hoare triple {23837#true} assume !(~i~0 < 1000); {23837#true} is VALID [2018-11-23 12:28:21,258 INFO L273 TraceCheckUtils]: 168: Hoare triple {23837#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {23837#true} is VALID [2018-11-23 12:28:21,258 INFO L273 TraceCheckUtils]: 169: Hoare triple {23837#true} assume true; {23837#true} is VALID [2018-11-23 12:28:21,258 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {23837#true} {23838#false} #74#return; {23838#false} is VALID [2018-11-23 12:28:21,258 INFO L273 TraceCheckUtils]: 171: Hoare triple {23838#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {23838#false} is VALID [2018-11-23 12:28:21,258 INFO L273 TraceCheckUtils]: 172: Hoare triple {23838#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {23838#false} is VALID [2018-11-23 12:28:21,258 INFO L273 TraceCheckUtils]: 173: Hoare triple {23838#false} assume !false; {23838#false} is VALID [2018-11-23 12:28:21,276 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:28:21,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:21,276 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:28:21,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:21,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:21,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {23837#true} call ULTIMATE.init(); {23837#true} is VALID [2018-11-23 12:28:21,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {23837#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23837#true} is VALID [2018-11-23 12:28:21,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {23837#true} assume true; {23837#true} is VALID [2018-11-23 12:28:21,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23837#true} {23837#true} #66#return; {23837#true} is VALID [2018-11-23 12:28:21,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {23837#true} call #t~ret12 := main(); {23837#true} is VALID [2018-11-23 12:28:21,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {23837#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23890#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:21,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {23890#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23890#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:21,771 INFO L273 TraceCheckUtils]: 7: Hoare triple {23890#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23840#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:21,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {23840#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23840#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:21,772 INFO L273 TraceCheckUtils]: 9: Hoare triple {23840#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23841#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:21,772 INFO L273 TraceCheckUtils]: 10: Hoare triple {23841#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23841#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:21,772 INFO L273 TraceCheckUtils]: 11: Hoare triple {23841#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23842#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:21,773 INFO L273 TraceCheckUtils]: 12: Hoare triple {23842#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23842#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:21,773 INFO L273 TraceCheckUtils]: 13: Hoare triple {23842#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23843#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:21,774 INFO L273 TraceCheckUtils]: 14: Hoare triple {23843#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23843#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:21,775 INFO L273 TraceCheckUtils]: 15: Hoare triple {23843#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23844#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:21,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {23844#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23844#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:21,776 INFO L273 TraceCheckUtils]: 17: Hoare triple {23844#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23845#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:21,776 INFO L273 TraceCheckUtils]: 18: Hoare triple {23845#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23845#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:21,777 INFO L273 TraceCheckUtils]: 19: Hoare triple {23845#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23846#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:21,778 INFO L273 TraceCheckUtils]: 20: Hoare triple {23846#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23846#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:21,778 INFO L273 TraceCheckUtils]: 21: Hoare triple {23846#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23847#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:21,779 INFO L273 TraceCheckUtils]: 22: Hoare triple {23847#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23847#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:21,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {23847#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23848#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:21,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {23848#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23848#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:21,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {23848#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23849#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:21,781 INFO L273 TraceCheckUtils]: 26: Hoare triple {23849#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23849#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:21,782 INFO L273 TraceCheckUtils]: 27: Hoare triple {23849#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23850#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:21,783 INFO L273 TraceCheckUtils]: 28: Hoare triple {23850#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23850#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:21,783 INFO L273 TraceCheckUtils]: 29: Hoare triple {23850#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23851#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:21,784 INFO L273 TraceCheckUtils]: 30: Hoare triple {23851#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23851#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:21,785 INFO L273 TraceCheckUtils]: 31: Hoare triple {23851#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23852#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:21,785 INFO L273 TraceCheckUtils]: 32: Hoare triple {23852#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23852#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:21,786 INFO L273 TraceCheckUtils]: 33: Hoare triple {23852#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23853#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:21,786 INFO L273 TraceCheckUtils]: 34: Hoare triple {23853#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23853#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:21,787 INFO L273 TraceCheckUtils]: 35: Hoare triple {23853#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23854#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:21,787 INFO L273 TraceCheckUtils]: 36: Hoare triple {23854#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23854#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:21,788 INFO L273 TraceCheckUtils]: 37: Hoare triple {23854#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23855#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:21,789 INFO L273 TraceCheckUtils]: 38: Hoare triple {23855#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23855#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:21,789 INFO L273 TraceCheckUtils]: 39: Hoare triple {23855#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23856#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:21,790 INFO L273 TraceCheckUtils]: 40: Hoare triple {23856#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23856#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:21,791 INFO L273 TraceCheckUtils]: 41: Hoare triple {23856#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23857#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:21,791 INFO L273 TraceCheckUtils]: 42: Hoare triple {23857#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23857#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:21,792 INFO L273 TraceCheckUtils]: 43: Hoare triple {23857#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23858#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:21,792 INFO L273 TraceCheckUtils]: 44: Hoare triple {23858#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23858#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:21,793 INFO L273 TraceCheckUtils]: 45: Hoare triple {23858#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23859#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:21,794 INFO L273 TraceCheckUtils]: 46: Hoare triple {23859#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23859#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:21,794 INFO L273 TraceCheckUtils]: 47: Hoare triple {23859#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23860#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:21,795 INFO L273 TraceCheckUtils]: 48: Hoare triple {23860#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23860#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:21,796 INFO L273 TraceCheckUtils]: 49: Hoare triple {23860#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23861#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:21,796 INFO L273 TraceCheckUtils]: 50: Hoare triple {23861#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23861#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:21,797 INFO L273 TraceCheckUtils]: 51: Hoare triple {23861#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23862#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:21,797 INFO L273 TraceCheckUtils]: 52: Hoare triple {23862#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23862#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:21,798 INFO L273 TraceCheckUtils]: 53: Hoare triple {23862#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23863#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:21,799 INFO L273 TraceCheckUtils]: 54: Hoare triple {23863#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23863#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:21,799 INFO L273 TraceCheckUtils]: 55: Hoare triple {23863#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23864#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:21,800 INFO L273 TraceCheckUtils]: 56: Hoare triple {23864#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23864#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:21,801 INFO L273 TraceCheckUtils]: 57: Hoare triple {23864#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23865#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:21,801 INFO L273 TraceCheckUtils]: 58: Hoare triple {23865#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23865#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:21,802 INFO L273 TraceCheckUtils]: 59: Hoare triple {23865#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23866#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:21,802 INFO L273 TraceCheckUtils]: 60: Hoare triple {23866#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23866#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:21,803 INFO L273 TraceCheckUtils]: 61: Hoare triple {23866#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23867#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:21,804 INFO L273 TraceCheckUtils]: 62: Hoare triple {23867#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23867#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:21,804 INFO L273 TraceCheckUtils]: 63: Hoare triple {23867#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23868#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:21,805 INFO L273 TraceCheckUtils]: 64: Hoare triple {23868#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23868#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:21,806 INFO L273 TraceCheckUtils]: 65: Hoare triple {23868#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23869#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:21,806 INFO L273 TraceCheckUtils]: 66: Hoare triple {23869#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23869#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:21,807 INFO L273 TraceCheckUtils]: 67: Hoare triple {23869#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23870#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:21,807 INFO L273 TraceCheckUtils]: 68: Hoare triple {23870#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23870#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:21,808 INFO L273 TraceCheckUtils]: 69: Hoare triple {23870#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23871#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:21,809 INFO L273 TraceCheckUtils]: 70: Hoare triple {23871#(<= main_~i~1 32)} assume !(~i~1 < 1000); {23838#false} is VALID [2018-11-23 12:28:21,809 INFO L256 TraceCheckUtils]: 71: Hoare triple {23838#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {23838#false} is VALID [2018-11-23 12:28:21,809 INFO L273 TraceCheckUtils]: 72: Hoare triple {23838#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23838#false} is VALID [2018-11-23 12:28:21,809 INFO L273 TraceCheckUtils]: 73: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,809 INFO L273 TraceCheckUtils]: 74: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,810 INFO L273 TraceCheckUtils]: 75: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,810 INFO L273 TraceCheckUtils]: 76: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,810 INFO L273 TraceCheckUtils]: 77: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,810 INFO L273 TraceCheckUtils]: 78: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,810 INFO L273 TraceCheckUtils]: 79: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,811 INFO L273 TraceCheckUtils]: 80: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,811 INFO L273 TraceCheckUtils]: 81: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,811 INFO L273 TraceCheckUtils]: 82: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,811 INFO L273 TraceCheckUtils]: 83: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,811 INFO L273 TraceCheckUtils]: 84: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,811 INFO L273 TraceCheckUtils]: 85: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,812 INFO L273 TraceCheckUtils]: 86: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,812 INFO L273 TraceCheckUtils]: 87: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,812 INFO L273 TraceCheckUtils]: 88: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,812 INFO L273 TraceCheckUtils]: 89: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,812 INFO L273 TraceCheckUtils]: 90: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,813 INFO L273 TraceCheckUtils]: 91: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,813 INFO L273 TraceCheckUtils]: 92: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,813 INFO L273 TraceCheckUtils]: 93: Hoare triple {23838#false} assume !(~i~0 < 1000); {23838#false} is VALID [2018-11-23 12:28:21,813 INFO L273 TraceCheckUtils]: 94: Hoare triple {23838#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {23838#false} is VALID [2018-11-23 12:28:21,813 INFO L273 TraceCheckUtils]: 95: Hoare triple {23838#false} assume true; {23838#false} is VALID [2018-11-23 12:28:21,813 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {23838#false} {23838#false} #70#return; {23838#false} is VALID [2018-11-23 12:28:21,814 INFO L273 TraceCheckUtils]: 97: Hoare triple {23838#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {23838#false} is VALID [2018-11-23 12:28:21,814 INFO L256 TraceCheckUtils]: 98: Hoare triple {23838#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {23838#false} is VALID [2018-11-23 12:28:21,814 INFO L273 TraceCheckUtils]: 99: Hoare triple {23838#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23838#false} is VALID [2018-11-23 12:28:21,814 INFO L273 TraceCheckUtils]: 100: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,814 INFO L273 TraceCheckUtils]: 101: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,814 INFO L273 TraceCheckUtils]: 102: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,814 INFO L273 TraceCheckUtils]: 103: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,814 INFO L273 TraceCheckUtils]: 104: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,815 INFO L273 TraceCheckUtils]: 105: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,815 INFO L273 TraceCheckUtils]: 106: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,815 INFO L273 TraceCheckUtils]: 107: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,815 INFO L273 TraceCheckUtils]: 108: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,815 INFO L273 TraceCheckUtils]: 109: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,815 INFO L273 TraceCheckUtils]: 110: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,815 INFO L273 TraceCheckUtils]: 111: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,815 INFO L273 TraceCheckUtils]: 112: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,815 INFO L273 TraceCheckUtils]: 113: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,815 INFO L273 TraceCheckUtils]: 114: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,816 INFO L273 TraceCheckUtils]: 115: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,816 INFO L273 TraceCheckUtils]: 116: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,816 INFO L273 TraceCheckUtils]: 117: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,816 INFO L273 TraceCheckUtils]: 118: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,816 INFO L273 TraceCheckUtils]: 119: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,816 INFO L273 TraceCheckUtils]: 120: Hoare triple {23838#false} assume !(~i~0 < 1000); {23838#false} is VALID [2018-11-23 12:28:21,816 INFO L273 TraceCheckUtils]: 121: Hoare triple {23838#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {23838#false} is VALID [2018-11-23 12:28:21,816 INFO L273 TraceCheckUtils]: 122: Hoare triple {23838#false} assume true; {23838#false} is VALID [2018-11-23 12:28:21,816 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {23838#false} {23838#false} #72#return; {23838#false} is VALID [2018-11-23 12:28:21,817 INFO L273 TraceCheckUtils]: 124: Hoare triple {23838#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {23838#false} is VALID [2018-11-23 12:28:21,818 INFO L273 TraceCheckUtils]: 125: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,818 INFO L273 TraceCheckUtils]: 126: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,818 INFO L273 TraceCheckUtils]: 127: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,818 INFO L273 TraceCheckUtils]: 128: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,818 INFO L273 TraceCheckUtils]: 129: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,819 INFO L273 TraceCheckUtils]: 130: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,819 INFO L273 TraceCheckUtils]: 131: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,819 INFO L273 TraceCheckUtils]: 132: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,819 INFO L273 TraceCheckUtils]: 133: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,819 INFO L273 TraceCheckUtils]: 134: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,819 INFO L273 TraceCheckUtils]: 135: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,819 INFO L273 TraceCheckUtils]: 136: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,820 INFO L273 TraceCheckUtils]: 137: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,820 INFO L273 TraceCheckUtils]: 138: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,820 INFO L273 TraceCheckUtils]: 139: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,820 INFO L273 TraceCheckUtils]: 140: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,820 INFO L273 TraceCheckUtils]: 141: Hoare triple {23838#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23838#false} is VALID [2018-11-23 12:28:21,820 INFO L273 TraceCheckUtils]: 142: Hoare triple {23838#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23838#false} is VALID [2018-11-23 12:28:21,821 INFO L273 TraceCheckUtils]: 143: Hoare triple {23838#false} assume !(~i~2 < 999); {23838#false} is VALID [2018-11-23 12:28:21,821 INFO L273 TraceCheckUtils]: 144: Hoare triple {23838#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {23838#false} is VALID [2018-11-23 12:28:21,821 INFO L256 TraceCheckUtils]: 145: Hoare triple {23838#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {23838#false} is VALID [2018-11-23 12:28:21,821 INFO L273 TraceCheckUtils]: 146: Hoare triple {23838#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23838#false} is VALID [2018-11-23 12:28:21,821 INFO L273 TraceCheckUtils]: 147: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,821 INFO L273 TraceCheckUtils]: 148: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,821 INFO L273 TraceCheckUtils]: 149: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,822 INFO L273 TraceCheckUtils]: 150: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,822 INFO L273 TraceCheckUtils]: 151: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,822 INFO L273 TraceCheckUtils]: 152: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,822 INFO L273 TraceCheckUtils]: 153: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,822 INFO L273 TraceCheckUtils]: 154: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,822 INFO L273 TraceCheckUtils]: 155: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,823 INFO L273 TraceCheckUtils]: 156: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,823 INFO L273 TraceCheckUtils]: 157: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,823 INFO L273 TraceCheckUtils]: 158: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,823 INFO L273 TraceCheckUtils]: 159: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,823 INFO L273 TraceCheckUtils]: 160: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,823 INFO L273 TraceCheckUtils]: 161: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,823 INFO L273 TraceCheckUtils]: 162: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,824 INFO L273 TraceCheckUtils]: 163: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,824 INFO L273 TraceCheckUtils]: 164: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,824 INFO L273 TraceCheckUtils]: 165: Hoare triple {23838#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23838#false} is VALID [2018-11-23 12:28:21,824 INFO L273 TraceCheckUtils]: 166: Hoare triple {23838#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23838#false} is VALID [2018-11-23 12:28:21,824 INFO L273 TraceCheckUtils]: 167: Hoare triple {23838#false} assume !(~i~0 < 1000); {23838#false} is VALID [2018-11-23 12:28:21,824 INFO L273 TraceCheckUtils]: 168: Hoare triple {23838#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {23838#false} is VALID [2018-11-23 12:28:21,824 INFO L273 TraceCheckUtils]: 169: Hoare triple {23838#false} assume true; {23838#false} is VALID [2018-11-23 12:28:21,825 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {23838#false} {23838#false} #74#return; {23838#false} is VALID [2018-11-23 12:28:21,825 INFO L273 TraceCheckUtils]: 171: Hoare triple {23838#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {23838#false} is VALID [2018-11-23 12:28:21,825 INFO L273 TraceCheckUtils]: 172: Hoare triple {23838#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {23838#false} is VALID [2018-11-23 12:28:21,825 INFO L273 TraceCheckUtils]: 173: Hoare triple {23838#false} assume !false; {23838#false} is VALID [2018-11-23 12:28:21,843 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:28:21,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:21,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:28:21,873 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:28:21,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:21,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:28:21,986 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:28:21,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:28:21,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:28:21,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:28:21,988 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2018-11-23 12:28:22,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:22,933 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2018-11-23 12:28:22,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:28:22,933 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:28:22,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:28:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:28:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:28:22,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:28:22,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 118 transitions. [2018-11-23 12:28:23,090 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:28:23,092 INFO L225 Difference]: With dead ends: 182 [2018-11-23 12:28:23,093 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:28:23,093 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:28:23,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:28:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-11-23 12:28:23,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:23,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 127 states. [2018-11-23 12:28:23,149 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 127 states. [2018-11-23 12:28:23,149 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 127 states. [2018-11-23 12:28:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:23,151 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:28:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:28:23,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:23,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:23,152 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 128 states. [2018-11-23 12:28:23,152 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 128 states. [2018-11-23 12:28:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:23,154 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:28:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:28:23,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:23,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:23,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:23,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 12:28:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-11-23 12:28:23,156 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2018-11-23 12:28:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:23,156 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-11-23 12:28:23,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:28:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:28:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-23 12:28:23,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:23,157 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:28:23,157 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:23,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:23,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2135919753, now seen corresponding path program 32 times [2018-11-23 12:28:23,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:23,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:23,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:23,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:23,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:23,881 INFO L256 TraceCheckUtils]: 0: Hoare triple {25110#true} call ULTIMATE.init(); {25110#true} is VALID [2018-11-23 12:28:23,881 INFO L273 TraceCheckUtils]: 1: Hoare triple {25110#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25110#true} is VALID [2018-11-23 12:28:23,881 INFO L273 TraceCheckUtils]: 2: Hoare triple {25110#true} assume true; {25110#true} is VALID [2018-11-23 12:28:23,881 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25110#true} {25110#true} #66#return; {25110#true} is VALID [2018-11-23 12:28:23,881 INFO L256 TraceCheckUtils]: 4: Hoare triple {25110#true} call #t~ret12 := main(); {25110#true} is VALID [2018-11-23 12:28:23,882 INFO L273 TraceCheckUtils]: 5: Hoare triple {25110#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {25112#(= main_~i~1 0)} is VALID [2018-11-23 12:28:23,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {25112#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25112#(= main_~i~1 0)} is VALID [2018-11-23 12:28:23,883 INFO L273 TraceCheckUtils]: 7: Hoare triple {25112#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25113#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:23,884 INFO L273 TraceCheckUtils]: 8: Hoare triple {25113#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25113#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:23,884 INFO L273 TraceCheckUtils]: 9: Hoare triple {25113#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25114#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:23,884 INFO L273 TraceCheckUtils]: 10: Hoare triple {25114#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25114#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:23,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {25114#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25115#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:23,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {25115#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25115#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:23,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {25115#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25116#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:23,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {25116#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25116#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:23,887 INFO L273 TraceCheckUtils]: 15: Hoare triple {25116#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25117#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:23,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {25117#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25117#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:23,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {25117#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25118#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:23,889 INFO L273 TraceCheckUtils]: 18: Hoare triple {25118#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25118#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:23,889 INFO L273 TraceCheckUtils]: 19: Hoare triple {25118#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25119#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:23,890 INFO L273 TraceCheckUtils]: 20: Hoare triple {25119#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25119#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:23,891 INFO L273 TraceCheckUtils]: 21: Hoare triple {25119#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25120#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:23,891 INFO L273 TraceCheckUtils]: 22: Hoare triple {25120#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25120#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:23,892 INFO L273 TraceCheckUtils]: 23: Hoare triple {25120#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25121#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:23,892 INFO L273 TraceCheckUtils]: 24: Hoare triple {25121#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25121#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:23,893 INFO L273 TraceCheckUtils]: 25: Hoare triple {25121#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25122#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:23,893 INFO L273 TraceCheckUtils]: 26: Hoare triple {25122#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25122#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:23,894 INFO L273 TraceCheckUtils]: 27: Hoare triple {25122#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25123#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:23,895 INFO L273 TraceCheckUtils]: 28: Hoare triple {25123#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25123#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:23,895 INFO L273 TraceCheckUtils]: 29: Hoare triple {25123#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25124#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:23,896 INFO L273 TraceCheckUtils]: 30: Hoare triple {25124#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25124#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:23,897 INFO L273 TraceCheckUtils]: 31: Hoare triple {25124#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25125#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:23,897 INFO L273 TraceCheckUtils]: 32: Hoare triple {25125#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25125#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:23,898 INFO L273 TraceCheckUtils]: 33: Hoare triple {25125#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25126#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:23,898 INFO L273 TraceCheckUtils]: 34: Hoare triple {25126#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25126#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:23,899 INFO L273 TraceCheckUtils]: 35: Hoare triple {25126#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25127#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:23,900 INFO L273 TraceCheckUtils]: 36: Hoare triple {25127#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25127#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:23,900 INFO L273 TraceCheckUtils]: 37: Hoare triple {25127#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25128#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:23,901 INFO L273 TraceCheckUtils]: 38: Hoare triple {25128#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25128#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:23,902 INFO L273 TraceCheckUtils]: 39: Hoare triple {25128#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25129#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:23,902 INFO L273 TraceCheckUtils]: 40: Hoare triple {25129#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25129#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:23,903 INFO L273 TraceCheckUtils]: 41: Hoare triple {25129#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25130#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:23,903 INFO L273 TraceCheckUtils]: 42: Hoare triple {25130#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25130#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:23,904 INFO L273 TraceCheckUtils]: 43: Hoare triple {25130#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25131#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:23,905 INFO L273 TraceCheckUtils]: 44: Hoare triple {25131#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25131#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:23,905 INFO L273 TraceCheckUtils]: 45: Hoare triple {25131#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25132#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:23,906 INFO L273 TraceCheckUtils]: 46: Hoare triple {25132#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25132#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:23,907 INFO L273 TraceCheckUtils]: 47: Hoare triple {25132#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25133#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:23,907 INFO L273 TraceCheckUtils]: 48: Hoare triple {25133#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25133#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:23,908 INFO L273 TraceCheckUtils]: 49: Hoare triple {25133#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25134#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:23,909 INFO L273 TraceCheckUtils]: 50: Hoare triple {25134#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25134#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:23,909 INFO L273 TraceCheckUtils]: 51: Hoare triple {25134#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25135#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:23,910 INFO L273 TraceCheckUtils]: 52: Hoare triple {25135#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25135#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:23,911 INFO L273 TraceCheckUtils]: 53: Hoare triple {25135#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25136#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:23,911 INFO L273 TraceCheckUtils]: 54: Hoare triple {25136#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25136#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:23,912 INFO L273 TraceCheckUtils]: 55: Hoare triple {25136#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25137#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:23,912 INFO L273 TraceCheckUtils]: 56: Hoare triple {25137#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25137#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:23,913 INFO L273 TraceCheckUtils]: 57: Hoare triple {25137#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25138#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:23,914 INFO L273 TraceCheckUtils]: 58: Hoare triple {25138#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25138#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:23,914 INFO L273 TraceCheckUtils]: 59: Hoare triple {25138#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25139#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:23,915 INFO L273 TraceCheckUtils]: 60: Hoare triple {25139#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25139#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:23,915 INFO L273 TraceCheckUtils]: 61: Hoare triple {25139#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25140#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:23,916 INFO L273 TraceCheckUtils]: 62: Hoare triple {25140#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25140#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:23,917 INFO L273 TraceCheckUtils]: 63: Hoare triple {25140#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25141#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:23,917 INFO L273 TraceCheckUtils]: 64: Hoare triple {25141#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25141#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:23,918 INFO L273 TraceCheckUtils]: 65: Hoare triple {25141#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25142#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:23,919 INFO L273 TraceCheckUtils]: 66: Hoare triple {25142#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25142#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:23,919 INFO L273 TraceCheckUtils]: 67: Hoare triple {25142#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25143#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:23,920 INFO L273 TraceCheckUtils]: 68: Hoare triple {25143#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25143#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:23,921 INFO L273 TraceCheckUtils]: 69: Hoare triple {25143#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25144#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:23,921 INFO L273 TraceCheckUtils]: 70: Hoare triple {25144#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25144#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:23,922 INFO L273 TraceCheckUtils]: 71: Hoare triple {25144#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25145#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:23,922 INFO L273 TraceCheckUtils]: 72: Hoare triple {25145#(<= main_~i~1 33)} assume !(~i~1 < 1000); {25111#false} is VALID [2018-11-23 12:28:23,923 INFO L256 TraceCheckUtils]: 73: Hoare triple {25111#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {25110#true} is VALID [2018-11-23 12:28:23,923 INFO L273 TraceCheckUtils]: 74: Hoare triple {25110#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {25110#true} is VALID [2018-11-23 12:28:23,923 INFO L273 TraceCheckUtils]: 75: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,923 INFO L273 TraceCheckUtils]: 76: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,923 INFO L273 TraceCheckUtils]: 77: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,924 INFO L273 TraceCheckUtils]: 78: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,924 INFO L273 TraceCheckUtils]: 79: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,924 INFO L273 TraceCheckUtils]: 80: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,924 INFO L273 TraceCheckUtils]: 81: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,924 INFO L273 TraceCheckUtils]: 82: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,924 INFO L273 TraceCheckUtils]: 83: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,925 INFO L273 TraceCheckUtils]: 84: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,925 INFO L273 TraceCheckUtils]: 85: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,925 INFO L273 TraceCheckUtils]: 86: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,925 INFO L273 TraceCheckUtils]: 87: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,925 INFO L273 TraceCheckUtils]: 88: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,925 INFO L273 TraceCheckUtils]: 89: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,926 INFO L273 TraceCheckUtils]: 90: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,926 INFO L273 TraceCheckUtils]: 91: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,926 INFO L273 TraceCheckUtils]: 92: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,926 INFO L273 TraceCheckUtils]: 93: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,926 INFO L273 TraceCheckUtils]: 94: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,927 INFO L273 TraceCheckUtils]: 95: Hoare triple {25110#true} assume !(~i~0 < 1000); {25110#true} is VALID [2018-11-23 12:28:23,927 INFO L273 TraceCheckUtils]: 96: Hoare triple {25110#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {25110#true} is VALID [2018-11-23 12:28:23,927 INFO L273 TraceCheckUtils]: 97: Hoare triple {25110#true} assume true; {25110#true} is VALID [2018-11-23 12:28:23,927 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {25110#true} {25111#false} #70#return; {25111#false} is VALID [2018-11-23 12:28:23,927 INFO L273 TraceCheckUtils]: 99: Hoare triple {25111#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {25111#false} is VALID [2018-11-23 12:28:23,927 INFO L256 TraceCheckUtils]: 100: Hoare triple {25111#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {25110#true} is VALID [2018-11-23 12:28:23,927 INFO L273 TraceCheckUtils]: 101: Hoare triple {25110#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {25110#true} is VALID [2018-11-23 12:28:23,927 INFO L273 TraceCheckUtils]: 102: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,928 INFO L273 TraceCheckUtils]: 103: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,928 INFO L273 TraceCheckUtils]: 104: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,928 INFO L273 TraceCheckUtils]: 105: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,928 INFO L273 TraceCheckUtils]: 106: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,928 INFO L273 TraceCheckUtils]: 107: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,928 INFO L273 TraceCheckUtils]: 108: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,928 INFO L273 TraceCheckUtils]: 109: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,928 INFO L273 TraceCheckUtils]: 110: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,928 INFO L273 TraceCheckUtils]: 111: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,928 INFO L273 TraceCheckUtils]: 112: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,929 INFO L273 TraceCheckUtils]: 113: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,929 INFO L273 TraceCheckUtils]: 114: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,929 INFO L273 TraceCheckUtils]: 115: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,929 INFO L273 TraceCheckUtils]: 116: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,929 INFO L273 TraceCheckUtils]: 117: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,929 INFO L273 TraceCheckUtils]: 118: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,929 INFO L273 TraceCheckUtils]: 119: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,929 INFO L273 TraceCheckUtils]: 120: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,929 INFO L273 TraceCheckUtils]: 121: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,929 INFO L273 TraceCheckUtils]: 122: Hoare triple {25110#true} assume !(~i~0 < 1000); {25110#true} is VALID [2018-11-23 12:28:23,930 INFO L273 TraceCheckUtils]: 123: Hoare triple {25110#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {25110#true} is VALID [2018-11-23 12:28:23,930 INFO L273 TraceCheckUtils]: 124: Hoare triple {25110#true} assume true; {25110#true} is VALID [2018-11-23 12:28:23,930 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {25110#true} {25111#false} #72#return; {25111#false} is VALID [2018-11-23 12:28:23,930 INFO L273 TraceCheckUtils]: 126: Hoare triple {25111#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {25111#false} is VALID [2018-11-23 12:28:23,930 INFO L273 TraceCheckUtils]: 127: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:23,930 INFO L273 TraceCheckUtils]: 128: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:23,930 INFO L273 TraceCheckUtils]: 129: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:23,930 INFO L273 TraceCheckUtils]: 130: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:23,930 INFO L273 TraceCheckUtils]: 131: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:23,930 INFO L273 TraceCheckUtils]: 132: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:23,931 INFO L273 TraceCheckUtils]: 133: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:23,931 INFO L273 TraceCheckUtils]: 134: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:23,931 INFO L273 TraceCheckUtils]: 135: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:23,931 INFO L273 TraceCheckUtils]: 136: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:23,931 INFO L273 TraceCheckUtils]: 137: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:23,931 INFO L273 TraceCheckUtils]: 138: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:23,931 INFO L273 TraceCheckUtils]: 139: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:23,931 INFO L273 TraceCheckUtils]: 140: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:23,931 INFO L273 TraceCheckUtils]: 141: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:23,931 INFO L273 TraceCheckUtils]: 142: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:23,932 INFO L273 TraceCheckUtils]: 143: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:23,932 INFO L273 TraceCheckUtils]: 144: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:23,932 INFO L273 TraceCheckUtils]: 145: Hoare triple {25111#false} assume !(~i~2 < 999); {25111#false} is VALID [2018-11-23 12:28:23,932 INFO L273 TraceCheckUtils]: 146: Hoare triple {25111#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {25111#false} is VALID [2018-11-23 12:28:23,932 INFO L256 TraceCheckUtils]: 147: Hoare triple {25111#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {25110#true} is VALID [2018-11-23 12:28:23,932 INFO L273 TraceCheckUtils]: 148: Hoare triple {25110#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {25110#true} is VALID [2018-11-23 12:28:23,932 INFO L273 TraceCheckUtils]: 149: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,932 INFO L273 TraceCheckUtils]: 150: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,932 INFO L273 TraceCheckUtils]: 151: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,932 INFO L273 TraceCheckUtils]: 152: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,933 INFO L273 TraceCheckUtils]: 153: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,933 INFO L273 TraceCheckUtils]: 154: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,933 INFO L273 TraceCheckUtils]: 155: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,933 INFO L273 TraceCheckUtils]: 156: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,933 INFO L273 TraceCheckUtils]: 157: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,933 INFO L273 TraceCheckUtils]: 158: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,933 INFO L273 TraceCheckUtils]: 159: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,933 INFO L273 TraceCheckUtils]: 160: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,933 INFO L273 TraceCheckUtils]: 161: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,934 INFO L273 TraceCheckUtils]: 162: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,934 INFO L273 TraceCheckUtils]: 163: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,934 INFO L273 TraceCheckUtils]: 164: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,934 INFO L273 TraceCheckUtils]: 165: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,934 INFO L273 TraceCheckUtils]: 166: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,934 INFO L273 TraceCheckUtils]: 167: Hoare triple {25110#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25110#true} is VALID [2018-11-23 12:28:23,934 INFO L273 TraceCheckUtils]: 168: Hoare triple {25110#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25110#true} is VALID [2018-11-23 12:28:23,934 INFO L273 TraceCheckUtils]: 169: Hoare triple {25110#true} assume !(~i~0 < 1000); {25110#true} is VALID [2018-11-23 12:28:23,934 INFO L273 TraceCheckUtils]: 170: Hoare triple {25110#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {25110#true} is VALID [2018-11-23 12:28:23,934 INFO L273 TraceCheckUtils]: 171: Hoare triple {25110#true} assume true; {25110#true} is VALID [2018-11-23 12:28:23,935 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {25110#true} {25111#false} #74#return; {25111#false} is VALID [2018-11-23 12:28:23,935 INFO L273 TraceCheckUtils]: 173: Hoare triple {25111#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {25111#false} is VALID [2018-11-23 12:28:23,935 INFO L273 TraceCheckUtils]: 174: Hoare triple {25111#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {25111#false} is VALID [2018-11-23 12:28:23,935 INFO L273 TraceCheckUtils]: 175: Hoare triple {25111#false} assume !false; {25111#false} is VALID [2018-11-23 12:28:23,949 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:28:23,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:23,949 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:28:23,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:24,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:24,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:24,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:24,529 INFO L256 TraceCheckUtils]: 0: Hoare triple {25110#true} call ULTIMATE.init(); {25110#true} is VALID [2018-11-23 12:28:24,530 INFO L273 TraceCheckUtils]: 1: Hoare triple {25110#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25110#true} is VALID [2018-11-23 12:28:24,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {25110#true} assume true; {25110#true} is VALID [2018-11-23 12:28:24,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25110#true} {25110#true} #66#return; {25110#true} is VALID [2018-11-23 12:28:24,530 INFO L256 TraceCheckUtils]: 4: Hoare triple {25110#true} call #t~ret12 := main(); {25110#true} is VALID [2018-11-23 12:28:24,531 INFO L273 TraceCheckUtils]: 5: Hoare triple {25110#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {25164#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:24,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {25164#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25164#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:24,531 INFO L273 TraceCheckUtils]: 7: Hoare triple {25164#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25113#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:24,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {25113#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25113#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:24,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {25113#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25114#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:24,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {25114#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25114#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:24,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {25114#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25115#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:24,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {25115#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25115#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:24,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {25115#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25116#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:24,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {25116#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25116#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:24,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {25116#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25117#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:24,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {25117#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25117#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:24,536 INFO L273 TraceCheckUtils]: 17: Hoare triple {25117#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25118#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:24,536 INFO L273 TraceCheckUtils]: 18: Hoare triple {25118#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25118#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:24,537 INFO L273 TraceCheckUtils]: 19: Hoare triple {25118#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25119#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:24,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {25119#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25119#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:24,538 INFO L273 TraceCheckUtils]: 21: Hoare triple {25119#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25120#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:24,539 INFO L273 TraceCheckUtils]: 22: Hoare triple {25120#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25120#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:24,539 INFO L273 TraceCheckUtils]: 23: Hoare triple {25120#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25121#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:24,540 INFO L273 TraceCheckUtils]: 24: Hoare triple {25121#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25121#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:24,541 INFO L273 TraceCheckUtils]: 25: Hoare triple {25121#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25122#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:24,541 INFO L273 TraceCheckUtils]: 26: Hoare triple {25122#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25122#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:24,542 INFO L273 TraceCheckUtils]: 27: Hoare triple {25122#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25123#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:24,542 INFO L273 TraceCheckUtils]: 28: Hoare triple {25123#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25123#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:24,543 INFO L273 TraceCheckUtils]: 29: Hoare triple {25123#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25124#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:24,544 INFO L273 TraceCheckUtils]: 30: Hoare triple {25124#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25124#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:24,544 INFO L273 TraceCheckUtils]: 31: Hoare triple {25124#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25125#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:24,545 INFO L273 TraceCheckUtils]: 32: Hoare triple {25125#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25125#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:24,546 INFO L273 TraceCheckUtils]: 33: Hoare triple {25125#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25126#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:24,546 INFO L273 TraceCheckUtils]: 34: Hoare triple {25126#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25126#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:24,547 INFO L273 TraceCheckUtils]: 35: Hoare triple {25126#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25127#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:24,547 INFO L273 TraceCheckUtils]: 36: Hoare triple {25127#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25127#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:24,548 INFO L273 TraceCheckUtils]: 37: Hoare triple {25127#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25128#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:24,549 INFO L273 TraceCheckUtils]: 38: Hoare triple {25128#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25128#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:24,549 INFO L273 TraceCheckUtils]: 39: Hoare triple {25128#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25129#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:24,550 INFO L273 TraceCheckUtils]: 40: Hoare triple {25129#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25129#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:24,550 INFO L273 TraceCheckUtils]: 41: Hoare triple {25129#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25130#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:24,551 INFO L273 TraceCheckUtils]: 42: Hoare triple {25130#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25130#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:24,552 INFO L273 TraceCheckUtils]: 43: Hoare triple {25130#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25131#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:24,552 INFO L273 TraceCheckUtils]: 44: Hoare triple {25131#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25131#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:24,553 INFO L273 TraceCheckUtils]: 45: Hoare triple {25131#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25132#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:24,553 INFO L273 TraceCheckUtils]: 46: Hoare triple {25132#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25132#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:24,554 INFO L273 TraceCheckUtils]: 47: Hoare triple {25132#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25133#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:24,555 INFO L273 TraceCheckUtils]: 48: Hoare triple {25133#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25133#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:24,555 INFO L273 TraceCheckUtils]: 49: Hoare triple {25133#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25134#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:24,556 INFO L273 TraceCheckUtils]: 50: Hoare triple {25134#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25134#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:24,556 INFO L273 TraceCheckUtils]: 51: Hoare triple {25134#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25135#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:24,557 INFO L273 TraceCheckUtils]: 52: Hoare triple {25135#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25135#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:24,557 INFO L273 TraceCheckUtils]: 53: Hoare triple {25135#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25136#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:24,558 INFO L273 TraceCheckUtils]: 54: Hoare triple {25136#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25136#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:24,559 INFO L273 TraceCheckUtils]: 55: Hoare triple {25136#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25137#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:24,559 INFO L273 TraceCheckUtils]: 56: Hoare triple {25137#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25137#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:24,560 INFO L273 TraceCheckUtils]: 57: Hoare triple {25137#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25138#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:24,560 INFO L273 TraceCheckUtils]: 58: Hoare triple {25138#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25138#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:24,561 INFO L273 TraceCheckUtils]: 59: Hoare triple {25138#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25139#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:24,562 INFO L273 TraceCheckUtils]: 60: Hoare triple {25139#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25139#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:24,562 INFO L273 TraceCheckUtils]: 61: Hoare triple {25139#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25140#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:24,563 INFO L273 TraceCheckUtils]: 62: Hoare triple {25140#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25140#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:24,564 INFO L273 TraceCheckUtils]: 63: Hoare triple {25140#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25141#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:24,564 INFO L273 TraceCheckUtils]: 64: Hoare triple {25141#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25141#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:24,565 INFO L273 TraceCheckUtils]: 65: Hoare triple {25141#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25142#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:24,565 INFO L273 TraceCheckUtils]: 66: Hoare triple {25142#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25142#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:24,566 INFO L273 TraceCheckUtils]: 67: Hoare triple {25142#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25143#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:24,566 INFO L273 TraceCheckUtils]: 68: Hoare triple {25143#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25143#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:24,567 INFO L273 TraceCheckUtils]: 69: Hoare triple {25143#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25144#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:24,568 INFO L273 TraceCheckUtils]: 70: Hoare triple {25144#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25144#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:24,568 INFO L273 TraceCheckUtils]: 71: Hoare triple {25144#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25145#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:24,569 INFO L273 TraceCheckUtils]: 72: Hoare triple {25145#(<= main_~i~1 33)} assume !(~i~1 < 1000); {25111#false} is VALID [2018-11-23 12:28:24,569 INFO L256 TraceCheckUtils]: 73: Hoare triple {25111#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {25111#false} is VALID [2018-11-23 12:28:24,569 INFO L273 TraceCheckUtils]: 74: Hoare triple {25111#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {25111#false} is VALID [2018-11-23 12:28:24,569 INFO L273 TraceCheckUtils]: 75: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,570 INFO L273 TraceCheckUtils]: 76: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,570 INFO L273 TraceCheckUtils]: 77: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,570 INFO L273 TraceCheckUtils]: 78: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,570 INFO L273 TraceCheckUtils]: 79: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,570 INFO L273 TraceCheckUtils]: 80: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,571 INFO L273 TraceCheckUtils]: 81: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,571 INFO L273 TraceCheckUtils]: 82: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,571 INFO L273 TraceCheckUtils]: 83: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,571 INFO L273 TraceCheckUtils]: 84: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,571 INFO L273 TraceCheckUtils]: 85: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,571 INFO L273 TraceCheckUtils]: 86: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,572 INFO L273 TraceCheckUtils]: 87: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,572 INFO L273 TraceCheckUtils]: 88: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,572 INFO L273 TraceCheckUtils]: 89: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,572 INFO L273 TraceCheckUtils]: 90: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,572 INFO L273 TraceCheckUtils]: 91: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,572 INFO L273 TraceCheckUtils]: 92: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,573 INFO L273 TraceCheckUtils]: 93: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,573 INFO L273 TraceCheckUtils]: 94: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,573 INFO L273 TraceCheckUtils]: 95: Hoare triple {25111#false} assume !(~i~0 < 1000); {25111#false} is VALID [2018-11-23 12:28:24,573 INFO L273 TraceCheckUtils]: 96: Hoare triple {25111#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {25111#false} is VALID [2018-11-23 12:28:24,573 INFO L273 TraceCheckUtils]: 97: Hoare triple {25111#false} assume true; {25111#false} is VALID [2018-11-23 12:28:24,574 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {25111#false} {25111#false} #70#return; {25111#false} is VALID [2018-11-23 12:28:24,574 INFO L273 TraceCheckUtils]: 99: Hoare triple {25111#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {25111#false} is VALID [2018-11-23 12:28:24,574 INFO L256 TraceCheckUtils]: 100: Hoare triple {25111#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {25111#false} is VALID [2018-11-23 12:28:24,574 INFO L273 TraceCheckUtils]: 101: Hoare triple {25111#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {25111#false} is VALID [2018-11-23 12:28:24,574 INFO L273 TraceCheckUtils]: 102: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,574 INFO L273 TraceCheckUtils]: 103: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,574 INFO L273 TraceCheckUtils]: 104: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,574 INFO L273 TraceCheckUtils]: 105: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,575 INFO L273 TraceCheckUtils]: 106: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,575 INFO L273 TraceCheckUtils]: 107: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,575 INFO L273 TraceCheckUtils]: 108: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,575 INFO L273 TraceCheckUtils]: 109: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,575 INFO L273 TraceCheckUtils]: 110: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,575 INFO L273 TraceCheckUtils]: 111: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,575 INFO L273 TraceCheckUtils]: 112: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,575 INFO L273 TraceCheckUtils]: 113: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,575 INFO L273 TraceCheckUtils]: 114: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,575 INFO L273 TraceCheckUtils]: 115: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,576 INFO L273 TraceCheckUtils]: 116: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,576 INFO L273 TraceCheckUtils]: 117: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,576 INFO L273 TraceCheckUtils]: 118: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,576 INFO L273 TraceCheckUtils]: 119: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,576 INFO L273 TraceCheckUtils]: 120: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,576 INFO L273 TraceCheckUtils]: 121: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,576 INFO L273 TraceCheckUtils]: 122: Hoare triple {25111#false} assume !(~i~0 < 1000); {25111#false} is VALID [2018-11-23 12:28:24,576 INFO L273 TraceCheckUtils]: 123: Hoare triple {25111#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {25111#false} is VALID [2018-11-23 12:28:24,576 INFO L273 TraceCheckUtils]: 124: Hoare triple {25111#false} assume true; {25111#false} is VALID [2018-11-23 12:28:24,576 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {25111#false} {25111#false} #72#return; {25111#false} is VALID [2018-11-23 12:28:24,577 INFO L273 TraceCheckUtils]: 126: Hoare triple {25111#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {25111#false} is VALID [2018-11-23 12:28:24,577 INFO L273 TraceCheckUtils]: 127: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:24,577 INFO L273 TraceCheckUtils]: 128: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:24,577 INFO L273 TraceCheckUtils]: 129: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:24,577 INFO L273 TraceCheckUtils]: 130: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:24,577 INFO L273 TraceCheckUtils]: 131: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:24,577 INFO L273 TraceCheckUtils]: 132: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:24,577 INFO L273 TraceCheckUtils]: 133: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:24,577 INFO L273 TraceCheckUtils]: 134: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:24,577 INFO L273 TraceCheckUtils]: 135: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:24,578 INFO L273 TraceCheckUtils]: 136: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:24,578 INFO L273 TraceCheckUtils]: 137: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:24,578 INFO L273 TraceCheckUtils]: 138: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:24,578 INFO L273 TraceCheckUtils]: 139: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:24,578 INFO L273 TraceCheckUtils]: 140: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:24,578 INFO L273 TraceCheckUtils]: 141: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:24,578 INFO L273 TraceCheckUtils]: 142: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:24,578 INFO L273 TraceCheckUtils]: 143: Hoare triple {25111#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {25111#false} is VALID [2018-11-23 12:28:24,578 INFO L273 TraceCheckUtils]: 144: Hoare triple {25111#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {25111#false} is VALID [2018-11-23 12:28:24,579 INFO L273 TraceCheckUtils]: 145: Hoare triple {25111#false} assume !(~i~2 < 999); {25111#false} is VALID [2018-11-23 12:28:24,579 INFO L273 TraceCheckUtils]: 146: Hoare triple {25111#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {25111#false} is VALID [2018-11-23 12:28:24,579 INFO L256 TraceCheckUtils]: 147: Hoare triple {25111#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {25111#false} is VALID [2018-11-23 12:28:24,579 INFO L273 TraceCheckUtils]: 148: Hoare triple {25111#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {25111#false} is VALID [2018-11-23 12:28:24,579 INFO L273 TraceCheckUtils]: 149: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,579 INFO L273 TraceCheckUtils]: 150: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,579 INFO L273 TraceCheckUtils]: 151: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,579 INFO L273 TraceCheckUtils]: 152: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,579 INFO L273 TraceCheckUtils]: 153: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,579 INFO L273 TraceCheckUtils]: 154: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,580 INFO L273 TraceCheckUtils]: 155: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,580 INFO L273 TraceCheckUtils]: 156: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,580 INFO L273 TraceCheckUtils]: 157: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,580 INFO L273 TraceCheckUtils]: 158: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,580 INFO L273 TraceCheckUtils]: 159: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,580 INFO L273 TraceCheckUtils]: 160: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,580 INFO L273 TraceCheckUtils]: 161: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,580 INFO L273 TraceCheckUtils]: 162: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,580 INFO L273 TraceCheckUtils]: 163: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,580 INFO L273 TraceCheckUtils]: 164: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,581 INFO L273 TraceCheckUtils]: 165: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,581 INFO L273 TraceCheckUtils]: 166: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,581 INFO L273 TraceCheckUtils]: 167: Hoare triple {25111#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {25111#false} is VALID [2018-11-23 12:28:24,581 INFO L273 TraceCheckUtils]: 168: Hoare triple {25111#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25111#false} is VALID [2018-11-23 12:28:24,581 INFO L273 TraceCheckUtils]: 169: Hoare triple {25111#false} assume !(~i~0 < 1000); {25111#false} is VALID [2018-11-23 12:28:24,581 INFO L273 TraceCheckUtils]: 170: Hoare triple {25111#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {25111#false} is VALID [2018-11-23 12:28:24,581 INFO L273 TraceCheckUtils]: 171: Hoare triple {25111#false} assume true; {25111#false} is VALID [2018-11-23 12:28:24,581 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {25111#false} {25111#false} #74#return; {25111#false} is VALID [2018-11-23 12:28:24,581 INFO L273 TraceCheckUtils]: 173: Hoare triple {25111#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {25111#false} is VALID [2018-11-23 12:28:24,581 INFO L273 TraceCheckUtils]: 174: Hoare triple {25111#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {25111#false} is VALID [2018-11-23 12:28:24,582 INFO L273 TraceCheckUtils]: 175: Hoare triple {25111#false} assume !false; {25111#false} is VALID [2018-11-23 12:28:24,596 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:28:24,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:24,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 12:28:24,615 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 176 [2018-11-23 12:28:24,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:24,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:28:24,716 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:28:24,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:28:24,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:28:24,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:28:24,718 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 37 states. [2018-11-23 12:28:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:25,803 INFO L93 Difference]: Finished difference Result 184 states and 192 transitions. [2018-11-23 12:28:25,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:28:25,803 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 176 [2018-11-23 12:28:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:28:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2018-11-23 12:28:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:28:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2018-11-23 12:28:25,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 120 transitions. [2018-11-23 12:28:25,919 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:28:25,922 INFO L225 Difference]: With dead ends: 184 [2018-11-23 12:28:25,922 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 12:28:25,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:28:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 12:28:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-11-23 12:28:26,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:26,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 129 states. [2018-11-23 12:28:26,084 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 129 states. [2018-11-23 12:28:26,084 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 129 states. [2018-11-23 12:28:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:26,085 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-11-23 12:28:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2018-11-23 12:28:26,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:26,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:26,086 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 130 states. [2018-11-23 12:28:26,086 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 130 states. [2018-11-23 12:28:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:26,088 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-11-23 12:28:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2018-11-23 12:28:26,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:26,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:26,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:26,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:26,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 12:28:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2018-11-23 12:28:26,090 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 176 [2018-11-23 12:28:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:26,090 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2018-11-23 12:28:26,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:28:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2018-11-23 12:28:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-23 12:28:26,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:26,091 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 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:28:26,091 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:26,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:26,092 INFO L82 PathProgramCache]: Analyzing trace with hash 910601689, now seen corresponding path program 33 times [2018-11-23 12:28:26,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:26,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:26,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:26,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:26,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:26,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {26400#true} call ULTIMATE.init(); {26400#true} is VALID [2018-11-23 12:28:26,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {26400#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26400#true} is VALID [2018-11-23 12:28:26,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {26400#true} assume true; {26400#true} is VALID [2018-11-23 12:28:26,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26400#true} {26400#true} #66#return; {26400#true} is VALID [2018-11-23 12:28:26,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {26400#true} call #t~ret12 := main(); {26400#true} is VALID [2018-11-23 12:28:26,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {26400#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26402#(= main_~i~1 0)} is VALID [2018-11-23 12:28:26,942 INFO L273 TraceCheckUtils]: 6: Hoare triple {26402#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26402#(= main_~i~1 0)} is VALID [2018-11-23 12:28:26,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {26402#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26403#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:26,943 INFO L273 TraceCheckUtils]: 8: Hoare triple {26403#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26403#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:26,943 INFO L273 TraceCheckUtils]: 9: Hoare triple {26403#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26404#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:26,943 INFO L273 TraceCheckUtils]: 10: Hoare triple {26404#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26404#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:26,944 INFO L273 TraceCheckUtils]: 11: Hoare triple {26404#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26405#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:26,944 INFO L273 TraceCheckUtils]: 12: Hoare triple {26405#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26405#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:26,945 INFO L273 TraceCheckUtils]: 13: Hoare triple {26405#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26406#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:26,945 INFO L273 TraceCheckUtils]: 14: Hoare triple {26406#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26406#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:26,946 INFO L273 TraceCheckUtils]: 15: Hoare triple {26406#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26407#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:26,946 INFO L273 TraceCheckUtils]: 16: Hoare triple {26407#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26407#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:26,947 INFO L273 TraceCheckUtils]: 17: Hoare triple {26407#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26408#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:26,948 INFO L273 TraceCheckUtils]: 18: Hoare triple {26408#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26408#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:26,948 INFO L273 TraceCheckUtils]: 19: Hoare triple {26408#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26409#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:26,949 INFO L273 TraceCheckUtils]: 20: Hoare triple {26409#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26409#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:26,949 INFO L273 TraceCheckUtils]: 21: Hoare triple {26409#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26410#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:26,950 INFO L273 TraceCheckUtils]: 22: Hoare triple {26410#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26410#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:26,951 INFO L273 TraceCheckUtils]: 23: Hoare triple {26410#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26411#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:26,951 INFO L273 TraceCheckUtils]: 24: Hoare triple {26411#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26411#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:26,952 INFO L273 TraceCheckUtils]: 25: Hoare triple {26411#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26412#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:26,952 INFO L273 TraceCheckUtils]: 26: Hoare triple {26412#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26412#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:26,953 INFO L273 TraceCheckUtils]: 27: Hoare triple {26412#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26413#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:26,954 INFO L273 TraceCheckUtils]: 28: Hoare triple {26413#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26413#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:26,954 INFO L273 TraceCheckUtils]: 29: Hoare triple {26413#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26414#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:26,955 INFO L273 TraceCheckUtils]: 30: Hoare triple {26414#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26414#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:26,955 INFO L273 TraceCheckUtils]: 31: Hoare triple {26414#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26415#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:26,956 INFO L273 TraceCheckUtils]: 32: Hoare triple {26415#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26415#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:26,957 INFO L273 TraceCheckUtils]: 33: Hoare triple {26415#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26416#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:26,957 INFO L273 TraceCheckUtils]: 34: Hoare triple {26416#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26416#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:26,958 INFO L273 TraceCheckUtils]: 35: Hoare triple {26416#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26417#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:26,958 INFO L273 TraceCheckUtils]: 36: Hoare triple {26417#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26417#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:26,959 INFO L273 TraceCheckUtils]: 37: Hoare triple {26417#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26418#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:26,959 INFO L273 TraceCheckUtils]: 38: Hoare triple {26418#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26418#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:26,960 INFO L273 TraceCheckUtils]: 39: Hoare triple {26418#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26419#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:26,961 INFO L273 TraceCheckUtils]: 40: Hoare triple {26419#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26419#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:26,961 INFO L273 TraceCheckUtils]: 41: Hoare triple {26419#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26420#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:26,962 INFO L273 TraceCheckUtils]: 42: Hoare triple {26420#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26420#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:26,963 INFO L273 TraceCheckUtils]: 43: Hoare triple {26420#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26421#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:26,963 INFO L273 TraceCheckUtils]: 44: Hoare triple {26421#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26421#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:26,964 INFO L273 TraceCheckUtils]: 45: Hoare triple {26421#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26422#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:26,964 INFO L273 TraceCheckUtils]: 46: Hoare triple {26422#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26422#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:26,965 INFO L273 TraceCheckUtils]: 47: Hoare triple {26422#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26423#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:26,966 INFO L273 TraceCheckUtils]: 48: Hoare triple {26423#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26423#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:26,966 INFO L273 TraceCheckUtils]: 49: Hoare triple {26423#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26424#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:26,967 INFO L273 TraceCheckUtils]: 50: Hoare triple {26424#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26424#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:26,967 INFO L273 TraceCheckUtils]: 51: Hoare triple {26424#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26425#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:26,968 INFO L273 TraceCheckUtils]: 52: Hoare triple {26425#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26425#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:26,969 INFO L273 TraceCheckUtils]: 53: Hoare triple {26425#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26426#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:26,969 INFO L273 TraceCheckUtils]: 54: Hoare triple {26426#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26426#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:26,970 INFO L273 TraceCheckUtils]: 55: Hoare triple {26426#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26427#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:26,970 INFO L273 TraceCheckUtils]: 56: Hoare triple {26427#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26427#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:26,971 INFO L273 TraceCheckUtils]: 57: Hoare triple {26427#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26428#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:26,971 INFO L273 TraceCheckUtils]: 58: Hoare triple {26428#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26428#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:26,972 INFO L273 TraceCheckUtils]: 59: Hoare triple {26428#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26429#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:26,973 INFO L273 TraceCheckUtils]: 60: Hoare triple {26429#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26429#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:26,973 INFO L273 TraceCheckUtils]: 61: Hoare triple {26429#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26430#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:26,974 INFO L273 TraceCheckUtils]: 62: Hoare triple {26430#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26430#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:26,975 INFO L273 TraceCheckUtils]: 63: Hoare triple {26430#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26431#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:26,975 INFO L273 TraceCheckUtils]: 64: Hoare triple {26431#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26431#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:26,976 INFO L273 TraceCheckUtils]: 65: Hoare triple {26431#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26432#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:26,977 INFO L273 TraceCheckUtils]: 66: Hoare triple {26432#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26432#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:26,978 INFO L273 TraceCheckUtils]: 67: Hoare triple {26432#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26433#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:26,978 INFO L273 TraceCheckUtils]: 68: Hoare triple {26433#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26433#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:26,979 INFO L273 TraceCheckUtils]: 69: Hoare triple {26433#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26434#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:26,980 INFO L273 TraceCheckUtils]: 70: Hoare triple {26434#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26434#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:26,980 INFO L273 TraceCheckUtils]: 71: Hoare triple {26434#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26435#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:26,981 INFO L273 TraceCheckUtils]: 72: Hoare triple {26435#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26435#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:26,982 INFO L273 TraceCheckUtils]: 73: Hoare triple {26435#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26436#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:26,983 INFO L273 TraceCheckUtils]: 74: Hoare triple {26436#(<= main_~i~1 34)} assume !(~i~1 < 1000); {26401#false} is VALID [2018-11-23 12:28:26,983 INFO L256 TraceCheckUtils]: 75: Hoare triple {26401#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {26400#true} is VALID [2018-11-23 12:28:26,983 INFO L273 TraceCheckUtils]: 76: Hoare triple {26400#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26400#true} is VALID [2018-11-23 12:28:26,983 INFO L273 TraceCheckUtils]: 77: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,983 INFO L273 TraceCheckUtils]: 78: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,984 INFO L273 TraceCheckUtils]: 79: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,984 INFO L273 TraceCheckUtils]: 80: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,984 INFO L273 TraceCheckUtils]: 81: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,984 INFO L273 TraceCheckUtils]: 82: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,985 INFO L273 TraceCheckUtils]: 83: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,985 INFO L273 TraceCheckUtils]: 84: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,985 INFO L273 TraceCheckUtils]: 85: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,985 INFO L273 TraceCheckUtils]: 86: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,985 INFO L273 TraceCheckUtils]: 87: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,986 INFO L273 TraceCheckUtils]: 88: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,986 INFO L273 TraceCheckUtils]: 89: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,986 INFO L273 TraceCheckUtils]: 90: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,986 INFO L273 TraceCheckUtils]: 91: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,987 INFO L273 TraceCheckUtils]: 92: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,987 INFO L273 TraceCheckUtils]: 93: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,987 INFO L273 TraceCheckUtils]: 94: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,987 INFO L273 TraceCheckUtils]: 95: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,987 INFO L273 TraceCheckUtils]: 96: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,987 INFO L273 TraceCheckUtils]: 97: Hoare triple {26400#true} assume !(~i~0 < 1000); {26400#true} is VALID [2018-11-23 12:28:26,987 INFO L273 TraceCheckUtils]: 98: Hoare triple {26400#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {26400#true} is VALID [2018-11-23 12:28:26,988 INFO L273 TraceCheckUtils]: 99: Hoare triple {26400#true} assume true; {26400#true} is VALID [2018-11-23 12:28:26,988 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {26400#true} {26401#false} #70#return; {26401#false} is VALID [2018-11-23 12:28:26,988 INFO L273 TraceCheckUtils]: 101: Hoare triple {26401#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {26401#false} is VALID [2018-11-23 12:28:26,988 INFO L256 TraceCheckUtils]: 102: Hoare triple {26401#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {26400#true} is VALID [2018-11-23 12:28:26,988 INFO L273 TraceCheckUtils]: 103: Hoare triple {26400#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26400#true} is VALID [2018-11-23 12:28:26,988 INFO L273 TraceCheckUtils]: 104: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,988 INFO L273 TraceCheckUtils]: 105: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,989 INFO L273 TraceCheckUtils]: 106: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,989 INFO L273 TraceCheckUtils]: 107: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,989 INFO L273 TraceCheckUtils]: 108: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,989 INFO L273 TraceCheckUtils]: 109: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,989 INFO L273 TraceCheckUtils]: 110: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,989 INFO L273 TraceCheckUtils]: 111: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,989 INFO L273 TraceCheckUtils]: 112: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,990 INFO L273 TraceCheckUtils]: 113: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,990 INFO L273 TraceCheckUtils]: 114: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,990 INFO L273 TraceCheckUtils]: 115: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,990 INFO L273 TraceCheckUtils]: 116: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,990 INFO L273 TraceCheckUtils]: 117: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,990 INFO L273 TraceCheckUtils]: 118: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,990 INFO L273 TraceCheckUtils]: 119: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,991 INFO L273 TraceCheckUtils]: 120: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,991 INFO L273 TraceCheckUtils]: 121: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,991 INFO L273 TraceCheckUtils]: 122: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,991 INFO L273 TraceCheckUtils]: 123: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,991 INFO L273 TraceCheckUtils]: 124: Hoare triple {26400#true} assume !(~i~0 < 1000); {26400#true} is VALID [2018-11-23 12:28:26,991 INFO L273 TraceCheckUtils]: 125: Hoare triple {26400#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {26400#true} is VALID [2018-11-23 12:28:26,991 INFO L273 TraceCheckUtils]: 126: Hoare triple {26400#true} assume true; {26400#true} is VALID [2018-11-23 12:28:26,992 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {26400#true} {26401#false} #72#return; {26401#false} is VALID [2018-11-23 12:28:26,992 INFO L273 TraceCheckUtils]: 128: Hoare triple {26401#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {26401#false} is VALID [2018-11-23 12:28:26,992 INFO L273 TraceCheckUtils]: 129: Hoare triple {26401#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26401#false} is VALID [2018-11-23 12:28:26,992 INFO L273 TraceCheckUtils]: 130: Hoare triple {26401#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26401#false} is VALID [2018-11-23 12:28:26,992 INFO L273 TraceCheckUtils]: 131: Hoare triple {26401#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26401#false} is VALID [2018-11-23 12:28:26,992 INFO L273 TraceCheckUtils]: 132: Hoare triple {26401#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26401#false} is VALID [2018-11-23 12:28:26,992 INFO L273 TraceCheckUtils]: 133: Hoare triple {26401#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26401#false} is VALID [2018-11-23 12:28:26,993 INFO L273 TraceCheckUtils]: 134: Hoare triple {26401#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26401#false} is VALID [2018-11-23 12:28:26,993 INFO L273 TraceCheckUtils]: 135: Hoare triple {26401#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26401#false} is VALID [2018-11-23 12:28:26,993 INFO L273 TraceCheckUtils]: 136: Hoare triple {26401#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26401#false} is VALID [2018-11-23 12:28:26,993 INFO L273 TraceCheckUtils]: 137: Hoare triple {26401#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26401#false} is VALID [2018-11-23 12:28:26,993 INFO L273 TraceCheckUtils]: 138: Hoare triple {26401#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26401#false} is VALID [2018-11-23 12:28:26,993 INFO L273 TraceCheckUtils]: 139: Hoare triple {26401#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26401#false} is VALID [2018-11-23 12:28:26,993 INFO L273 TraceCheckUtils]: 140: Hoare triple {26401#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26401#false} is VALID [2018-11-23 12:28:26,993 INFO L273 TraceCheckUtils]: 141: Hoare triple {26401#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26401#false} is VALID [2018-11-23 12:28:26,994 INFO L273 TraceCheckUtils]: 142: Hoare triple {26401#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26401#false} is VALID [2018-11-23 12:28:26,994 INFO L273 TraceCheckUtils]: 143: Hoare triple {26401#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26401#false} is VALID [2018-11-23 12:28:26,994 INFO L273 TraceCheckUtils]: 144: Hoare triple {26401#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26401#false} is VALID [2018-11-23 12:28:26,994 INFO L273 TraceCheckUtils]: 145: Hoare triple {26401#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26401#false} is VALID [2018-11-23 12:28:26,994 INFO L273 TraceCheckUtils]: 146: Hoare triple {26401#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26401#false} is VALID [2018-11-23 12:28:26,994 INFO L273 TraceCheckUtils]: 147: Hoare triple {26401#false} assume !(~i~2 < 999); {26401#false} is VALID [2018-11-23 12:28:26,994 INFO L273 TraceCheckUtils]: 148: Hoare triple {26401#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {26401#false} is VALID [2018-11-23 12:28:26,995 INFO L256 TraceCheckUtils]: 149: Hoare triple {26401#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {26400#true} is VALID [2018-11-23 12:28:26,995 INFO L273 TraceCheckUtils]: 150: Hoare triple {26400#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26400#true} is VALID [2018-11-23 12:28:26,995 INFO L273 TraceCheckUtils]: 151: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,995 INFO L273 TraceCheckUtils]: 152: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,995 INFO L273 TraceCheckUtils]: 153: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,995 INFO L273 TraceCheckUtils]: 154: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,995 INFO L273 TraceCheckUtils]: 155: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,996 INFO L273 TraceCheckUtils]: 156: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,996 INFO L273 TraceCheckUtils]: 157: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,996 INFO L273 TraceCheckUtils]: 158: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,996 INFO L273 TraceCheckUtils]: 159: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,996 INFO L273 TraceCheckUtils]: 160: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,996 INFO L273 TraceCheckUtils]: 161: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,996 INFO L273 TraceCheckUtils]: 162: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,997 INFO L273 TraceCheckUtils]: 163: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,997 INFO L273 TraceCheckUtils]: 164: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,997 INFO L273 TraceCheckUtils]: 165: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,997 INFO L273 TraceCheckUtils]: 166: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,997 INFO L273 TraceCheckUtils]: 167: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,997 INFO L273 TraceCheckUtils]: 168: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,997 INFO L273 TraceCheckUtils]: 169: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:26,997 INFO L273 TraceCheckUtils]: 170: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:26,998 INFO L273 TraceCheckUtils]: 171: Hoare triple {26400#true} assume !(~i~0 < 1000); {26400#true} is VALID [2018-11-23 12:28:26,998 INFO L273 TraceCheckUtils]: 172: Hoare triple {26400#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {26400#true} is VALID [2018-11-23 12:28:26,998 INFO L273 TraceCheckUtils]: 173: Hoare triple {26400#true} assume true; {26400#true} is VALID [2018-11-23 12:28:26,998 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {26400#true} {26401#false} #74#return; {26401#false} is VALID [2018-11-23 12:28:26,998 INFO L273 TraceCheckUtils]: 175: Hoare triple {26401#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {26401#false} is VALID [2018-11-23 12:28:26,998 INFO L273 TraceCheckUtils]: 176: Hoare triple {26401#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {26401#false} is VALID [2018-11-23 12:28:26,998 INFO L273 TraceCheckUtils]: 177: Hoare triple {26401#false} assume !false; {26401#false} is VALID [2018-11-23 12:28:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:28:27,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:27,047 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:28:27,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:27,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 12:28:27,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:27,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:27,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {26400#true} call ULTIMATE.init(); {26400#true} is VALID [2018-11-23 12:28:27,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {26400#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26400#true} is VALID [2018-11-23 12:28:27,872 INFO L273 TraceCheckUtils]: 2: Hoare triple {26400#true} assume true; {26400#true} is VALID [2018-11-23 12:28:27,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26400#true} {26400#true} #66#return; {26400#true} is VALID [2018-11-23 12:28:27,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {26400#true} call #t~ret12 := main(); {26400#true} is VALID [2018-11-23 12:28:27,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {26400#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26400#true} is VALID [2018-11-23 12:28:27,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,874 INFO L273 TraceCheckUtils]: 14: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,874 INFO L273 TraceCheckUtils]: 15: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,874 INFO L273 TraceCheckUtils]: 16: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,874 INFO L273 TraceCheckUtils]: 17: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,874 INFO L273 TraceCheckUtils]: 22: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,875 INFO L273 TraceCheckUtils]: 24: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,875 INFO L273 TraceCheckUtils]: 26: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,875 INFO L273 TraceCheckUtils]: 27: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,875 INFO L273 TraceCheckUtils]: 28: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,875 INFO L273 TraceCheckUtils]: 29: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,875 INFO L273 TraceCheckUtils]: 30: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,875 INFO L273 TraceCheckUtils]: 31: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,875 INFO L273 TraceCheckUtils]: 32: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,875 INFO L273 TraceCheckUtils]: 33: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,876 INFO L273 TraceCheckUtils]: 35: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,876 INFO L273 TraceCheckUtils]: 37: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,876 INFO L273 TraceCheckUtils]: 38: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,876 INFO L273 TraceCheckUtils]: 39: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,876 INFO L273 TraceCheckUtils]: 40: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,876 INFO L273 TraceCheckUtils]: 41: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,876 INFO L273 TraceCheckUtils]: 42: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 43: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 44: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 45: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 46: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 47: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 48: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 49: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 50: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 51: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 52: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,878 INFO L273 TraceCheckUtils]: 53: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,878 INFO L273 TraceCheckUtils]: 54: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,878 INFO L273 TraceCheckUtils]: 55: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,878 INFO L273 TraceCheckUtils]: 56: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,878 INFO L273 TraceCheckUtils]: 57: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,878 INFO L273 TraceCheckUtils]: 58: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,878 INFO L273 TraceCheckUtils]: 59: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,878 INFO L273 TraceCheckUtils]: 60: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,878 INFO L273 TraceCheckUtils]: 61: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,878 INFO L273 TraceCheckUtils]: 62: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,879 INFO L273 TraceCheckUtils]: 63: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,879 INFO L273 TraceCheckUtils]: 64: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,879 INFO L273 TraceCheckUtils]: 65: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,879 INFO L273 TraceCheckUtils]: 66: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,879 INFO L273 TraceCheckUtils]: 67: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,879 INFO L273 TraceCheckUtils]: 68: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,879 INFO L273 TraceCheckUtils]: 69: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,879 INFO L273 TraceCheckUtils]: 70: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,879 INFO L273 TraceCheckUtils]: 71: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,879 INFO L273 TraceCheckUtils]: 72: Hoare triple {26400#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26400#true} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 73: Hoare triple {26400#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26400#true} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 74: Hoare triple {26400#true} assume !(~i~1 < 1000); {26400#true} is VALID [2018-11-23 12:28:27,880 INFO L256 TraceCheckUtils]: 75: Hoare triple {26400#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {26400#true} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 76: Hoare triple {26400#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26400#true} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 77: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 78: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 79: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 80: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 81: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 82: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 83: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 84: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 85: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 86: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 87: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 88: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 89: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 90: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 91: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 92: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 93: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 94: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 95: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 96: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 97: Hoare triple {26400#true} assume !(~i~0 < 1000); {26400#true} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 98: Hoare triple {26400#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {26400#true} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 99: Hoare triple {26400#true} assume true; {26400#true} is VALID [2018-11-23 12:28:27,882 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {26400#true} {26400#true} #70#return; {26400#true} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 101: Hoare triple {26400#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {26400#true} is VALID [2018-11-23 12:28:27,883 INFO L256 TraceCheckUtils]: 102: Hoare triple {26400#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {26400#true} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 103: Hoare triple {26400#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26400#true} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 104: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 105: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 106: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 107: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 108: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 109: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 110: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 111: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 112: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 113: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 114: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 115: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 116: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 117: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 118: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 119: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 120: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 121: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 122: Hoare triple {26400#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26400#true} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 123: Hoare triple {26400#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26400#true} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 124: Hoare triple {26400#true} assume !(~i~0 < 1000); {26400#true} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 125: Hoare triple {26400#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {26400#true} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 126: Hoare triple {26400#true} assume true; {26400#true} is VALID [2018-11-23 12:28:27,885 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {26400#true} {26400#true} #72#return; {26400#true} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 128: Hoare triple {26400#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {26400#true} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 129: Hoare triple {26400#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26400#true} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 130: Hoare triple {26400#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26400#true} is VALID [2018-11-23 12:28:27,886 INFO L273 TraceCheckUtils]: 131: Hoare triple {26400#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26400#true} is VALID [2018-11-23 12:28:27,886 INFO L273 TraceCheckUtils]: 132: Hoare triple {26400#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26400#true} is VALID [2018-11-23 12:28:27,886 INFO L273 TraceCheckUtils]: 133: Hoare triple {26400#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26400#true} is VALID [2018-11-23 12:28:27,886 INFO L273 TraceCheckUtils]: 134: Hoare triple {26400#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26400#true} is VALID [2018-11-23 12:28:27,886 INFO L273 TraceCheckUtils]: 135: Hoare triple {26400#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26400#true} is VALID [2018-11-23 12:28:27,886 INFO L273 TraceCheckUtils]: 136: Hoare triple {26400#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26400#true} is VALID [2018-11-23 12:28:27,886 INFO L273 TraceCheckUtils]: 137: Hoare triple {26400#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26400#true} is VALID [2018-11-23 12:28:27,886 INFO L273 TraceCheckUtils]: 138: Hoare triple {26400#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26400#true} is VALID [2018-11-23 12:28:27,886 INFO L273 TraceCheckUtils]: 139: Hoare triple {26400#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26400#true} is VALID [2018-11-23 12:28:27,886 INFO L273 TraceCheckUtils]: 140: Hoare triple {26400#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26400#true} is VALID [2018-11-23 12:28:27,887 INFO L273 TraceCheckUtils]: 141: Hoare triple {26400#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26400#true} is VALID [2018-11-23 12:28:27,887 INFO L273 TraceCheckUtils]: 142: Hoare triple {26400#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26400#true} is VALID [2018-11-23 12:28:27,887 INFO L273 TraceCheckUtils]: 143: Hoare triple {26400#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26400#true} is VALID [2018-11-23 12:28:27,887 INFO L273 TraceCheckUtils]: 144: Hoare triple {26400#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26400#true} is VALID [2018-11-23 12:28:27,887 INFO L273 TraceCheckUtils]: 145: Hoare triple {26400#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26400#true} is VALID [2018-11-23 12:28:27,887 INFO L273 TraceCheckUtils]: 146: Hoare triple {26400#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26400#true} is VALID [2018-11-23 12:28:27,887 INFO L273 TraceCheckUtils]: 147: Hoare triple {26400#true} assume !(~i~2 < 999); {26400#true} is VALID [2018-11-23 12:28:27,887 INFO L273 TraceCheckUtils]: 148: Hoare triple {26400#true} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {26400#true} is VALID [2018-11-23 12:28:27,887 INFO L256 TraceCheckUtils]: 149: Hoare triple {26400#true} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {26400#true} is VALID [2018-11-23 12:28:27,888 INFO L273 TraceCheckUtils]: 150: Hoare triple {26400#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26890#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:27,888 INFO L273 TraceCheckUtils]: 151: Hoare triple {26890#(<= mapavg_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26890#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:27,889 INFO L273 TraceCheckUtils]: 152: Hoare triple {26890#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26897#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:27,889 INFO L273 TraceCheckUtils]: 153: Hoare triple {26897#(<= mapavg_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26897#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:27,889 INFO L273 TraceCheckUtils]: 154: Hoare triple {26897#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26904#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:27,890 INFO L273 TraceCheckUtils]: 155: Hoare triple {26904#(<= mapavg_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26904#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:27,890 INFO L273 TraceCheckUtils]: 156: Hoare triple {26904#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26911#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:27,890 INFO L273 TraceCheckUtils]: 157: Hoare triple {26911#(<= mapavg_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26911#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:27,891 INFO L273 TraceCheckUtils]: 158: Hoare triple {26911#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26918#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:27,892 INFO L273 TraceCheckUtils]: 159: Hoare triple {26918#(<= mapavg_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26918#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:27,892 INFO L273 TraceCheckUtils]: 160: Hoare triple {26918#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26925#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:27,893 INFO L273 TraceCheckUtils]: 161: Hoare triple {26925#(<= mapavg_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26925#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:27,894 INFO L273 TraceCheckUtils]: 162: Hoare triple {26925#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26932#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:27,894 INFO L273 TraceCheckUtils]: 163: Hoare triple {26932#(<= mapavg_~i~0 6)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26932#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:27,895 INFO L273 TraceCheckUtils]: 164: Hoare triple {26932#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26939#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:27,895 INFO L273 TraceCheckUtils]: 165: Hoare triple {26939#(<= mapavg_~i~0 7)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26939#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:27,896 INFO L273 TraceCheckUtils]: 166: Hoare triple {26939#(<= mapavg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26946#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:28:27,897 INFO L273 TraceCheckUtils]: 167: Hoare triple {26946#(<= mapavg_~i~0 8)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26946#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:28:27,897 INFO L273 TraceCheckUtils]: 168: Hoare triple {26946#(<= mapavg_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26953#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:28:27,898 INFO L273 TraceCheckUtils]: 169: Hoare triple {26953#(<= mapavg_~i~0 9)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26953#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:28:27,898 INFO L273 TraceCheckUtils]: 170: Hoare triple {26953#(<= mapavg_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26960#(<= mapavg_~i~0 10)} is VALID [2018-11-23 12:28:27,899 INFO L273 TraceCheckUtils]: 171: Hoare triple {26960#(<= mapavg_~i~0 10)} assume !(~i~0 < 1000); {26401#false} is VALID [2018-11-23 12:28:27,899 INFO L273 TraceCheckUtils]: 172: Hoare triple {26401#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {26401#false} is VALID [2018-11-23 12:28:27,899 INFO L273 TraceCheckUtils]: 173: Hoare triple {26401#false} assume true; {26401#false} is VALID [2018-11-23 12:28:27,900 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {26401#false} {26400#true} #74#return; {26401#false} is VALID [2018-11-23 12:28:27,900 INFO L273 TraceCheckUtils]: 175: Hoare triple {26401#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {26401#false} is VALID [2018-11-23 12:28:27,900 INFO L273 TraceCheckUtils]: 176: Hoare triple {26401#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {26401#false} is VALID [2018-11-23 12:28:27,900 INFO L273 TraceCheckUtils]: 177: Hoare triple {26401#false} assume !false; {26401#false} is VALID [2018-11-23 12:28:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 448 proven. 100 refuted. 0 times theorem prover too weak. 1664 trivial. 0 not checked. [2018-11-23 12:28:27,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:27,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2018-11-23 12:28:27,934 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 178 [2018-11-23 12:28:27,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:27,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:28:28,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:28,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:28:28,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:28:28,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:28:28,071 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 48 states. [2018-11-23 12:28:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:28,594 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2018-11-23 12:28:28,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:28:28,594 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 178 [2018-11-23 12:28:28,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:28:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 148 transitions. [2018-11-23 12:28:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:28:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 148 transitions. [2018-11-23 12:28:28,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 148 transitions. [2018-11-23 12:28:28,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:28,746 INFO L225 Difference]: With dead ends: 189 [2018-11-23 12:28:28,746 INFO L226 Difference]: Without dead ends: 135 [2018-11-23 12:28:28,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:28:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-23 12:28:29,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-11-23 12:28:29,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:29,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 133 states. [2018-11-23 12:28:29,087 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 133 states. [2018-11-23 12:28:29,087 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 133 states. [2018-11-23 12:28:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:29,089 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-23 12:28:29,089 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-23 12:28:29,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:29,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:29,090 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 135 states. [2018-11-23 12:28:29,090 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 135 states. [2018-11-23 12:28:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:29,092 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-23 12:28:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-23 12:28:29,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:29,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:29,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:29,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 12:28:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2018-11-23 12:28:29,095 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 178 [2018-11-23 12:28:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:29,095 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2018-11-23 12:28:29,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:28:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:28:29,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-23 12:28:29,096 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:29,096 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 33, 33, 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:28:29,096 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:29,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:29,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1957396505, now seen corresponding path program 34 times [2018-11-23 12:28:29,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:29,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:29,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:29,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:29,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:30,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {27730#true} call ULTIMATE.init(); {27730#true} is VALID [2018-11-23 12:28:30,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {27730#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27730#true} is VALID [2018-11-23 12:28:30,008 INFO L273 TraceCheckUtils]: 2: Hoare triple {27730#true} assume true; {27730#true} is VALID [2018-11-23 12:28:30,008 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27730#true} {27730#true} #66#return; {27730#true} is VALID [2018-11-23 12:28:30,008 INFO L256 TraceCheckUtils]: 4: Hoare triple {27730#true} call #t~ret12 := main(); {27730#true} is VALID [2018-11-23 12:28:30,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {27730#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27732#(= main_~i~1 0)} is VALID [2018-11-23 12:28:30,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {27732#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27732#(= main_~i~1 0)} is VALID [2018-11-23 12:28:30,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {27732#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27733#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:30,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {27733#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27733#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:30,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {27733#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27734#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:30,012 INFO L273 TraceCheckUtils]: 10: Hoare triple {27734#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27734#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:30,012 INFO L273 TraceCheckUtils]: 11: Hoare triple {27734#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27735#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:30,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {27735#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27735#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:30,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {27735#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27736#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:30,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {27736#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27736#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:30,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {27736#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27737#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:30,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {27737#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27737#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:30,016 INFO L273 TraceCheckUtils]: 17: Hoare triple {27737#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27738#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:30,017 INFO L273 TraceCheckUtils]: 18: Hoare triple {27738#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27738#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:30,017 INFO L273 TraceCheckUtils]: 19: Hoare triple {27738#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27739#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:30,018 INFO L273 TraceCheckUtils]: 20: Hoare triple {27739#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27739#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:30,019 INFO L273 TraceCheckUtils]: 21: Hoare triple {27739#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27740#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:30,019 INFO L273 TraceCheckUtils]: 22: Hoare triple {27740#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27740#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:30,020 INFO L273 TraceCheckUtils]: 23: Hoare triple {27740#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27741#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:30,020 INFO L273 TraceCheckUtils]: 24: Hoare triple {27741#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27741#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:30,021 INFO L273 TraceCheckUtils]: 25: Hoare triple {27741#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27742#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:30,022 INFO L273 TraceCheckUtils]: 26: Hoare triple {27742#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27742#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:30,022 INFO L273 TraceCheckUtils]: 27: Hoare triple {27742#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27743#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:30,023 INFO L273 TraceCheckUtils]: 28: Hoare triple {27743#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27743#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:30,024 INFO L273 TraceCheckUtils]: 29: Hoare triple {27743#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27744#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:30,024 INFO L273 TraceCheckUtils]: 30: Hoare triple {27744#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27744#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:30,025 INFO L273 TraceCheckUtils]: 31: Hoare triple {27744#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27745#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:30,025 INFO L273 TraceCheckUtils]: 32: Hoare triple {27745#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27745#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:30,026 INFO L273 TraceCheckUtils]: 33: Hoare triple {27745#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27746#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:30,026 INFO L273 TraceCheckUtils]: 34: Hoare triple {27746#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27746#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:30,027 INFO L273 TraceCheckUtils]: 35: Hoare triple {27746#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27747#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:30,028 INFO L273 TraceCheckUtils]: 36: Hoare triple {27747#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27747#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:30,028 INFO L273 TraceCheckUtils]: 37: Hoare triple {27747#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27748#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:30,029 INFO L273 TraceCheckUtils]: 38: Hoare triple {27748#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27748#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:30,030 INFO L273 TraceCheckUtils]: 39: Hoare triple {27748#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27749#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:30,030 INFO L273 TraceCheckUtils]: 40: Hoare triple {27749#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27749#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:30,031 INFO L273 TraceCheckUtils]: 41: Hoare triple {27749#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27750#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:30,031 INFO L273 TraceCheckUtils]: 42: Hoare triple {27750#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27750#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:30,032 INFO L273 TraceCheckUtils]: 43: Hoare triple {27750#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27751#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:30,033 INFO L273 TraceCheckUtils]: 44: Hoare triple {27751#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27751#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:30,033 INFO L273 TraceCheckUtils]: 45: Hoare triple {27751#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27752#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:30,034 INFO L273 TraceCheckUtils]: 46: Hoare triple {27752#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27752#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:30,035 INFO L273 TraceCheckUtils]: 47: Hoare triple {27752#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27753#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:30,035 INFO L273 TraceCheckUtils]: 48: Hoare triple {27753#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27753#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:30,036 INFO L273 TraceCheckUtils]: 49: Hoare triple {27753#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27754#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:30,036 INFO L273 TraceCheckUtils]: 50: Hoare triple {27754#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27754#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:30,037 INFO L273 TraceCheckUtils]: 51: Hoare triple {27754#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27755#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:30,038 INFO L273 TraceCheckUtils]: 52: Hoare triple {27755#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27755#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:30,038 INFO L273 TraceCheckUtils]: 53: Hoare triple {27755#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27756#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:30,039 INFO L273 TraceCheckUtils]: 54: Hoare triple {27756#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27756#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:30,040 INFO L273 TraceCheckUtils]: 55: Hoare triple {27756#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27757#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:30,040 INFO L273 TraceCheckUtils]: 56: Hoare triple {27757#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27757#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:30,041 INFO L273 TraceCheckUtils]: 57: Hoare triple {27757#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27758#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:30,041 INFO L273 TraceCheckUtils]: 58: Hoare triple {27758#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27758#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:30,042 INFO L273 TraceCheckUtils]: 59: Hoare triple {27758#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27759#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:30,043 INFO L273 TraceCheckUtils]: 60: Hoare triple {27759#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27759#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:30,043 INFO L273 TraceCheckUtils]: 61: Hoare triple {27759#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27760#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:30,044 INFO L273 TraceCheckUtils]: 62: Hoare triple {27760#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27760#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:30,045 INFO L273 TraceCheckUtils]: 63: Hoare triple {27760#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27761#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:30,045 INFO L273 TraceCheckUtils]: 64: Hoare triple {27761#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27761#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:30,046 INFO L273 TraceCheckUtils]: 65: Hoare triple {27761#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27762#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:30,046 INFO L273 TraceCheckUtils]: 66: Hoare triple {27762#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27762#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:30,047 INFO L273 TraceCheckUtils]: 67: Hoare triple {27762#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27763#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:30,047 INFO L273 TraceCheckUtils]: 68: Hoare triple {27763#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27763#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:30,048 INFO L273 TraceCheckUtils]: 69: Hoare triple {27763#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27764#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:30,049 INFO L273 TraceCheckUtils]: 70: Hoare triple {27764#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27764#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:30,049 INFO L273 TraceCheckUtils]: 71: Hoare triple {27764#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27765#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:30,050 INFO L273 TraceCheckUtils]: 72: Hoare triple {27765#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27765#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:30,051 INFO L273 TraceCheckUtils]: 73: Hoare triple {27765#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27766#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:30,051 INFO L273 TraceCheckUtils]: 74: Hoare triple {27766#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27766#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:30,052 INFO L273 TraceCheckUtils]: 75: Hoare triple {27766#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27767#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:30,053 INFO L273 TraceCheckUtils]: 76: Hoare triple {27767#(<= main_~i~1 35)} assume !(~i~1 < 1000); {27731#false} is VALID [2018-11-23 12:28:30,053 INFO L256 TraceCheckUtils]: 77: Hoare triple {27731#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {27730#true} is VALID [2018-11-23 12:28:30,053 INFO L273 TraceCheckUtils]: 78: Hoare triple {27730#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27730#true} is VALID [2018-11-23 12:28:30,053 INFO L273 TraceCheckUtils]: 79: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,053 INFO L273 TraceCheckUtils]: 80: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,053 INFO L273 TraceCheckUtils]: 81: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,054 INFO L273 TraceCheckUtils]: 82: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,054 INFO L273 TraceCheckUtils]: 83: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,054 INFO L273 TraceCheckUtils]: 84: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,054 INFO L273 TraceCheckUtils]: 85: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,054 INFO L273 TraceCheckUtils]: 86: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,055 INFO L273 TraceCheckUtils]: 87: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,055 INFO L273 TraceCheckUtils]: 88: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,055 INFO L273 TraceCheckUtils]: 89: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,055 INFO L273 TraceCheckUtils]: 90: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,055 INFO L273 TraceCheckUtils]: 91: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,055 INFO L273 TraceCheckUtils]: 92: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,056 INFO L273 TraceCheckUtils]: 93: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,056 INFO L273 TraceCheckUtils]: 94: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,056 INFO L273 TraceCheckUtils]: 95: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,056 INFO L273 TraceCheckUtils]: 96: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,056 INFO L273 TraceCheckUtils]: 97: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,057 INFO L273 TraceCheckUtils]: 98: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,057 INFO L273 TraceCheckUtils]: 99: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,057 INFO L273 TraceCheckUtils]: 100: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,057 INFO L273 TraceCheckUtils]: 101: Hoare triple {27730#true} assume !(~i~0 < 1000); {27730#true} is VALID [2018-11-23 12:28:30,057 INFO L273 TraceCheckUtils]: 102: Hoare triple {27730#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {27730#true} is VALID [2018-11-23 12:28:30,057 INFO L273 TraceCheckUtils]: 103: Hoare triple {27730#true} assume true; {27730#true} is VALID [2018-11-23 12:28:30,058 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {27730#true} {27731#false} #70#return; {27731#false} is VALID [2018-11-23 12:28:30,058 INFO L273 TraceCheckUtils]: 105: Hoare triple {27731#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {27731#false} is VALID [2018-11-23 12:28:30,058 INFO L256 TraceCheckUtils]: 106: Hoare triple {27731#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {27730#true} is VALID [2018-11-23 12:28:30,058 INFO L273 TraceCheckUtils]: 107: Hoare triple {27730#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27730#true} is VALID [2018-11-23 12:28:30,058 INFO L273 TraceCheckUtils]: 108: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,058 INFO L273 TraceCheckUtils]: 109: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,058 INFO L273 TraceCheckUtils]: 110: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,058 INFO L273 TraceCheckUtils]: 111: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,058 INFO L273 TraceCheckUtils]: 112: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,058 INFO L273 TraceCheckUtils]: 113: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,059 INFO L273 TraceCheckUtils]: 114: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,059 INFO L273 TraceCheckUtils]: 115: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,059 INFO L273 TraceCheckUtils]: 116: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,059 INFO L273 TraceCheckUtils]: 117: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,059 INFO L273 TraceCheckUtils]: 118: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,059 INFO L273 TraceCheckUtils]: 119: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,059 INFO L273 TraceCheckUtils]: 120: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,059 INFO L273 TraceCheckUtils]: 121: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,059 INFO L273 TraceCheckUtils]: 122: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,059 INFO L273 TraceCheckUtils]: 123: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,060 INFO L273 TraceCheckUtils]: 124: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,060 INFO L273 TraceCheckUtils]: 125: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,060 INFO L273 TraceCheckUtils]: 126: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,060 INFO L273 TraceCheckUtils]: 127: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,060 INFO L273 TraceCheckUtils]: 128: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,060 INFO L273 TraceCheckUtils]: 129: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,060 INFO L273 TraceCheckUtils]: 130: Hoare triple {27730#true} assume !(~i~0 < 1000); {27730#true} is VALID [2018-11-23 12:28:30,060 INFO L273 TraceCheckUtils]: 131: Hoare triple {27730#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {27730#true} is VALID [2018-11-23 12:28:30,060 INFO L273 TraceCheckUtils]: 132: Hoare triple {27730#true} assume true; {27730#true} is VALID [2018-11-23 12:28:30,060 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {27730#true} {27731#false} #72#return; {27731#false} is VALID [2018-11-23 12:28:30,061 INFO L273 TraceCheckUtils]: 134: Hoare triple {27731#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {27731#false} is VALID [2018-11-23 12:28:30,061 INFO L273 TraceCheckUtils]: 135: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,061 INFO L273 TraceCheckUtils]: 136: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,061 INFO L273 TraceCheckUtils]: 137: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,061 INFO L273 TraceCheckUtils]: 138: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,061 INFO L273 TraceCheckUtils]: 139: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,061 INFO L273 TraceCheckUtils]: 140: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,061 INFO L273 TraceCheckUtils]: 141: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,061 INFO L273 TraceCheckUtils]: 142: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,062 INFO L273 TraceCheckUtils]: 143: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,062 INFO L273 TraceCheckUtils]: 144: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,062 INFO L273 TraceCheckUtils]: 145: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,062 INFO L273 TraceCheckUtils]: 146: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,062 INFO L273 TraceCheckUtils]: 147: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,062 INFO L273 TraceCheckUtils]: 148: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,062 INFO L273 TraceCheckUtils]: 149: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,062 INFO L273 TraceCheckUtils]: 150: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,062 INFO L273 TraceCheckUtils]: 151: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,062 INFO L273 TraceCheckUtils]: 152: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,063 INFO L273 TraceCheckUtils]: 153: Hoare triple {27731#false} assume !(~i~2 < 999); {27731#false} is VALID [2018-11-23 12:28:30,063 INFO L273 TraceCheckUtils]: 154: Hoare triple {27731#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {27731#false} is VALID [2018-11-23 12:28:30,063 INFO L256 TraceCheckUtils]: 155: Hoare triple {27731#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {27730#true} is VALID [2018-11-23 12:28:30,063 INFO L273 TraceCheckUtils]: 156: Hoare triple {27730#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27730#true} is VALID [2018-11-23 12:28:30,063 INFO L273 TraceCheckUtils]: 157: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,063 INFO L273 TraceCheckUtils]: 158: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,063 INFO L273 TraceCheckUtils]: 159: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,063 INFO L273 TraceCheckUtils]: 160: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,063 INFO L273 TraceCheckUtils]: 161: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,063 INFO L273 TraceCheckUtils]: 162: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,064 INFO L273 TraceCheckUtils]: 163: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,064 INFO L273 TraceCheckUtils]: 164: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,064 INFO L273 TraceCheckUtils]: 165: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,064 INFO L273 TraceCheckUtils]: 166: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,064 INFO L273 TraceCheckUtils]: 167: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,064 INFO L273 TraceCheckUtils]: 168: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,064 INFO L273 TraceCheckUtils]: 169: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,064 INFO L273 TraceCheckUtils]: 170: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,064 INFO L273 TraceCheckUtils]: 171: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,064 INFO L273 TraceCheckUtils]: 172: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,065 INFO L273 TraceCheckUtils]: 173: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,065 INFO L273 TraceCheckUtils]: 174: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,065 INFO L273 TraceCheckUtils]: 175: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,065 INFO L273 TraceCheckUtils]: 176: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,065 INFO L273 TraceCheckUtils]: 177: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,065 INFO L273 TraceCheckUtils]: 178: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,065 INFO L273 TraceCheckUtils]: 179: Hoare triple {27730#true} assume !(~i~0 < 1000); {27730#true} is VALID [2018-11-23 12:28:30,065 INFO L273 TraceCheckUtils]: 180: Hoare triple {27730#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {27730#true} is VALID [2018-11-23 12:28:30,065 INFO L273 TraceCheckUtils]: 181: Hoare triple {27730#true} assume true; {27730#true} is VALID [2018-11-23 12:28:30,066 INFO L268 TraceCheckUtils]: 182: Hoare quadruple {27730#true} {27731#false} #74#return; {27731#false} is VALID [2018-11-23 12:28:30,066 INFO L273 TraceCheckUtils]: 183: Hoare triple {27731#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {27731#false} is VALID [2018-11-23 12:28:30,066 INFO L273 TraceCheckUtils]: 184: Hoare triple {27731#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {27731#false} is VALID [2018-11-23 12:28:30,066 INFO L273 TraceCheckUtils]: 185: Hoare triple {27731#false} assume !false; {27731#false} is VALID [2018-11-23 12:28:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2018-11-23 12:28:30,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:30,082 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:28:30,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:30,186 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:30,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:30,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:30,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {27730#true} call ULTIMATE.init(); {27730#true} is VALID [2018-11-23 12:28:30,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {27730#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27730#true} is VALID [2018-11-23 12:28:30,647 INFO L273 TraceCheckUtils]: 2: Hoare triple {27730#true} assume true; {27730#true} is VALID [2018-11-23 12:28:30,647 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27730#true} {27730#true} #66#return; {27730#true} is VALID [2018-11-23 12:28:30,648 INFO L256 TraceCheckUtils]: 4: Hoare triple {27730#true} call #t~ret12 := main(); {27730#true} is VALID [2018-11-23 12:28:30,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {27730#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27730#true} is VALID [2018-11-23 12:28:30,648 INFO L273 TraceCheckUtils]: 6: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,648 INFO L273 TraceCheckUtils]: 8: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,649 INFO L273 TraceCheckUtils]: 10: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,649 INFO L273 TraceCheckUtils]: 13: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,649 INFO L273 TraceCheckUtils]: 14: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,649 INFO L273 TraceCheckUtils]: 15: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,649 INFO L273 TraceCheckUtils]: 16: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,649 INFO L273 TraceCheckUtils]: 17: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,649 INFO L273 TraceCheckUtils]: 18: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,650 INFO L273 TraceCheckUtils]: 19: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,650 INFO L273 TraceCheckUtils]: 20: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,650 INFO L273 TraceCheckUtils]: 21: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,650 INFO L273 TraceCheckUtils]: 24: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,650 INFO L273 TraceCheckUtils]: 25: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,650 INFO L273 TraceCheckUtils]: 26: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,650 INFO L273 TraceCheckUtils]: 27: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,650 INFO L273 TraceCheckUtils]: 28: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,651 INFO L273 TraceCheckUtils]: 29: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,651 INFO L273 TraceCheckUtils]: 30: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,651 INFO L273 TraceCheckUtils]: 31: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,651 INFO L273 TraceCheckUtils]: 32: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,651 INFO L273 TraceCheckUtils]: 33: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,651 INFO L273 TraceCheckUtils]: 34: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,651 INFO L273 TraceCheckUtils]: 35: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,651 INFO L273 TraceCheckUtils]: 36: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,651 INFO L273 TraceCheckUtils]: 37: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,651 INFO L273 TraceCheckUtils]: 38: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,652 INFO L273 TraceCheckUtils]: 39: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,652 INFO L273 TraceCheckUtils]: 40: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,652 INFO L273 TraceCheckUtils]: 41: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,652 INFO L273 TraceCheckUtils]: 42: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,652 INFO L273 TraceCheckUtils]: 43: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,652 INFO L273 TraceCheckUtils]: 44: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,652 INFO L273 TraceCheckUtils]: 45: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,652 INFO L273 TraceCheckUtils]: 46: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,652 INFO L273 TraceCheckUtils]: 47: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,652 INFO L273 TraceCheckUtils]: 48: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,653 INFO L273 TraceCheckUtils]: 49: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,653 INFO L273 TraceCheckUtils]: 50: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,653 INFO L273 TraceCheckUtils]: 51: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,653 INFO L273 TraceCheckUtils]: 52: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,653 INFO L273 TraceCheckUtils]: 53: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,653 INFO L273 TraceCheckUtils]: 54: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,653 INFO L273 TraceCheckUtils]: 55: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,653 INFO L273 TraceCheckUtils]: 56: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,653 INFO L273 TraceCheckUtils]: 57: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,653 INFO L273 TraceCheckUtils]: 58: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,654 INFO L273 TraceCheckUtils]: 59: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,654 INFO L273 TraceCheckUtils]: 60: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,654 INFO L273 TraceCheckUtils]: 61: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,654 INFO L273 TraceCheckUtils]: 62: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,654 INFO L273 TraceCheckUtils]: 63: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,654 INFO L273 TraceCheckUtils]: 64: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,654 INFO L273 TraceCheckUtils]: 65: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,654 INFO L273 TraceCheckUtils]: 66: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,654 INFO L273 TraceCheckUtils]: 67: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,655 INFO L273 TraceCheckUtils]: 68: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,655 INFO L273 TraceCheckUtils]: 69: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,655 INFO L273 TraceCheckUtils]: 70: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,655 INFO L273 TraceCheckUtils]: 71: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,655 INFO L273 TraceCheckUtils]: 72: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,655 INFO L273 TraceCheckUtils]: 73: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,655 INFO L273 TraceCheckUtils]: 74: Hoare triple {27730#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27730#true} is VALID [2018-11-23 12:28:30,655 INFO L273 TraceCheckUtils]: 75: Hoare triple {27730#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27730#true} is VALID [2018-11-23 12:28:30,655 INFO L273 TraceCheckUtils]: 76: Hoare triple {27730#true} assume !(~i~1 < 1000); {27730#true} is VALID [2018-11-23 12:28:30,655 INFO L256 TraceCheckUtils]: 77: Hoare triple {27730#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {27730#true} is VALID [2018-11-23 12:28:30,656 INFO L273 TraceCheckUtils]: 78: Hoare triple {27730#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27730#true} is VALID [2018-11-23 12:28:30,656 INFO L273 TraceCheckUtils]: 79: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,656 INFO L273 TraceCheckUtils]: 80: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,656 INFO L273 TraceCheckUtils]: 81: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,656 INFO L273 TraceCheckUtils]: 82: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,656 INFO L273 TraceCheckUtils]: 83: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,656 INFO L273 TraceCheckUtils]: 84: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,656 INFO L273 TraceCheckUtils]: 85: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,656 INFO L273 TraceCheckUtils]: 86: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,656 INFO L273 TraceCheckUtils]: 87: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,657 INFO L273 TraceCheckUtils]: 88: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,657 INFO L273 TraceCheckUtils]: 89: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,657 INFO L273 TraceCheckUtils]: 90: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,657 INFO L273 TraceCheckUtils]: 91: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,657 INFO L273 TraceCheckUtils]: 92: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,657 INFO L273 TraceCheckUtils]: 93: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,657 INFO L273 TraceCheckUtils]: 94: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,657 INFO L273 TraceCheckUtils]: 95: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,657 INFO L273 TraceCheckUtils]: 96: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,657 INFO L273 TraceCheckUtils]: 97: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,658 INFO L273 TraceCheckUtils]: 98: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,658 INFO L273 TraceCheckUtils]: 99: Hoare triple {27730#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27730#true} is VALID [2018-11-23 12:28:30,658 INFO L273 TraceCheckUtils]: 100: Hoare triple {27730#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27730#true} is VALID [2018-11-23 12:28:30,658 INFO L273 TraceCheckUtils]: 101: Hoare triple {27730#true} assume !(~i~0 < 1000); {27730#true} is VALID [2018-11-23 12:28:30,658 INFO L273 TraceCheckUtils]: 102: Hoare triple {27730#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {27730#true} is VALID [2018-11-23 12:28:30,658 INFO L273 TraceCheckUtils]: 103: Hoare triple {27730#true} assume true; {27730#true} is VALID [2018-11-23 12:28:30,658 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {27730#true} {27730#true} #70#return; {27730#true} is VALID [2018-11-23 12:28:30,658 INFO L273 TraceCheckUtils]: 105: Hoare triple {27730#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {27730#true} is VALID [2018-11-23 12:28:30,658 INFO L256 TraceCheckUtils]: 106: Hoare triple {27730#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {27730#true} is VALID [2018-11-23 12:28:30,659 INFO L273 TraceCheckUtils]: 107: Hoare triple {27730#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28092#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:30,659 INFO L273 TraceCheckUtils]: 108: Hoare triple {28092#(<= mapavg_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28092#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:30,660 INFO L273 TraceCheckUtils]: 109: Hoare triple {28092#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28099#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:30,660 INFO L273 TraceCheckUtils]: 110: Hoare triple {28099#(<= mapavg_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28099#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:30,660 INFO L273 TraceCheckUtils]: 111: Hoare triple {28099#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28106#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:30,661 INFO L273 TraceCheckUtils]: 112: Hoare triple {28106#(<= mapavg_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28106#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:30,661 INFO L273 TraceCheckUtils]: 113: Hoare triple {28106#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28113#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:30,661 INFO L273 TraceCheckUtils]: 114: Hoare triple {28113#(<= mapavg_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28113#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:30,662 INFO L273 TraceCheckUtils]: 115: Hoare triple {28113#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28120#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:30,662 INFO L273 TraceCheckUtils]: 116: Hoare triple {28120#(<= mapavg_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28120#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:30,663 INFO L273 TraceCheckUtils]: 117: Hoare triple {28120#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28127#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:30,663 INFO L273 TraceCheckUtils]: 118: Hoare triple {28127#(<= mapavg_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28127#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:30,664 INFO L273 TraceCheckUtils]: 119: Hoare triple {28127#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28134#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:30,664 INFO L273 TraceCheckUtils]: 120: Hoare triple {28134#(<= mapavg_~i~0 6)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28134#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:30,665 INFO L273 TraceCheckUtils]: 121: Hoare triple {28134#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28141#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:30,666 INFO L273 TraceCheckUtils]: 122: Hoare triple {28141#(<= mapavg_~i~0 7)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28141#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:30,666 INFO L273 TraceCheckUtils]: 123: Hoare triple {28141#(<= mapavg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28148#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:28:30,667 INFO L273 TraceCheckUtils]: 124: Hoare triple {28148#(<= mapavg_~i~0 8)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28148#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:28:30,668 INFO L273 TraceCheckUtils]: 125: Hoare triple {28148#(<= mapavg_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28155#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:28:30,668 INFO L273 TraceCheckUtils]: 126: Hoare triple {28155#(<= mapavg_~i~0 9)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28155#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:28:30,669 INFO L273 TraceCheckUtils]: 127: Hoare triple {28155#(<= mapavg_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28162#(<= mapavg_~i~0 10)} is VALID [2018-11-23 12:28:30,669 INFO L273 TraceCheckUtils]: 128: Hoare triple {28162#(<= mapavg_~i~0 10)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28162#(<= mapavg_~i~0 10)} is VALID [2018-11-23 12:28:30,670 INFO L273 TraceCheckUtils]: 129: Hoare triple {28162#(<= mapavg_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28169#(<= mapavg_~i~0 11)} is VALID [2018-11-23 12:28:30,671 INFO L273 TraceCheckUtils]: 130: Hoare triple {28169#(<= mapavg_~i~0 11)} assume !(~i~0 < 1000); {27731#false} is VALID [2018-11-23 12:28:30,671 INFO L273 TraceCheckUtils]: 131: Hoare triple {27731#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {27731#false} is VALID [2018-11-23 12:28:30,671 INFO L273 TraceCheckUtils]: 132: Hoare triple {27731#false} assume true; {27731#false} is VALID [2018-11-23 12:28:30,671 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {27731#false} {27730#true} #72#return; {27731#false} is VALID [2018-11-23 12:28:30,671 INFO L273 TraceCheckUtils]: 134: Hoare triple {27731#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {27731#false} is VALID [2018-11-23 12:28:30,672 INFO L273 TraceCheckUtils]: 135: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,672 INFO L273 TraceCheckUtils]: 136: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,672 INFO L273 TraceCheckUtils]: 137: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,672 INFO L273 TraceCheckUtils]: 138: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,672 INFO L273 TraceCheckUtils]: 139: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,673 INFO L273 TraceCheckUtils]: 140: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,673 INFO L273 TraceCheckUtils]: 141: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,673 INFO L273 TraceCheckUtils]: 142: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,673 INFO L273 TraceCheckUtils]: 143: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,673 INFO L273 TraceCheckUtils]: 144: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,673 INFO L273 TraceCheckUtils]: 145: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,674 INFO L273 TraceCheckUtils]: 146: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,674 INFO L273 TraceCheckUtils]: 147: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,674 INFO L273 TraceCheckUtils]: 148: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,674 INFO L273 TraceCheckUtils]: 149: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,674 INFO L273 TraceCheckUtils]: 150: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,674 INFO L273 TraceCheckUtils]: 151: Hoare triple {27731#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27731#false} is VALID [2018-11-23 12:28:30,675 INFO L273 TraceCheckUtils]: 152: Hoare triple {27731#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27731#false} is VALID [2018-11-23 12:28:30,675 INFO L273 TraceCheckUtils]: 153: Hoare triple {27731#false} assume !(~i~2 < 999); {27731#false} is VALID [2018-11-23 12:28:30,675 INFO L273 TraceCheckUtils]: 154: Hoare triple {27731#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {27731#false} is VALID [2018-11-23 12:28:30,675 INFO L256 TraceCheckUtils]: 155: Hoare triple {27731#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {27731#false} is VALID [2018-11-23 12:28:30,675 INFO L273 TraceCheckUtils]: 156: Hoare triple {27731#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27731#false} is VALID [2018-11-23 12:28:30,676 INFO L273 TraceCheckUtils]: 157: Hoare triple {27731#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27731#false} is VALID [2018-11-23 12:28:30,676 INFO L273 TraceCheckUtils]: 158: Hoare triple {27731#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27731#false} is VALID [2018-11-23 12:28:30,676 INFO L273 TraceCheckUtils]: 159: Hoare triple {27731#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27731#false} is VALID [2018-11-23 12:28:30,676 INFO L273 TraceCheckUtils]: 160: Hoare triple {27731#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27731#false} is VALID [2018-11-23 12:28:30,676 INFO L273 TraceCheckUtils]: 161: Hoare triple {27731#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27731#false} is VALID [2018-11-23 12:28:30,676 INFO L273 TraceCheckUtils]: 162: Hoare triple {27731#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27731#false} is VALID [2018-11-23 12:28:30,676 INFO L273 TraceCheckUtils]: 163: Hoare triple {27731#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27731#false} is VALID [2018-11-23 12:28:30,676 INFO L273 TraceCheckUtils]: 164: Hoare triple {27731#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27731#false} is VALID [2018-11-23 12:28:30,676 INFO L273 TraceCheckUtils]: 165: Hoare triple {27731#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27731#false} is VALID [2018-11-23 12:28:30,676 INFO L273 TraceCheckUtils]: 166: Hoare triple {27731#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27731#false} is VALID [2018-11-23 12:28:30,677 INFO L273 TraceCheckUtils]: 167: Hoare triple {27731#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27731#false} is VALID [2018-11-23 12:28:30,677 INFO L273 TraceCheckUtils]: 168: Hoare triple {27731#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27731#false} is VALID [2018-11-23 12:28:30,677 INFO L273 TraceCheckUtils]: 169: Hoare triple {27731#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27731#false} is VALID [2018-11-23 12:28:30,677 INFO L273 TraceCheckUtils]: 170: Hoare triple {27731#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27731#false} is VALID [2018-11-23 12:28:30,677 INFO L273 TraceCheckUtils]: 171: Hoare triple {27731#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27731#false} is VALID [2018-11-23 12:28:30,677 INFO L273 TraceCheckUtils]: 172: Hoare triple {27731#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27731#false} is VALID [2018-11-23 12:28:30,677 INFO L273 TraceCheckUtils]: 173: Hoare triple {27731#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27731#false} is VALID [2018-11-23 12:28:30,677 INFO L273 TraceCheckUtils]: 174: Hoare triple {27731#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27731#false} is VALID [2018-11-23 12:28:30,677 INFO L273 TraceCheckUtils]: 175: Hoare triple {27731#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27731#false} is VALID [2018-11-23 12:28:30,677 INFO L273 TraceCheckUtils]: 176: Hoare triple {27731#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27731#false} is VALID [2018-11-23 12:28:30,678 INFO L273 TraceCheckUtils]: 177: Hoare triple {27731#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27731#false} is VALID [2018-11-23 12:28:30,678 INFO L273 TraceCheckUtils]: 178: Hoare triple {27731#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27731#false} is VALID [2018-11-23 12:28:30,678 INFO L273 TraceCheckUtils]: 179: Hoare triple {27731#false} assume !(~i~0 < 1000); {27731#false} is VALID [2018-11-23 12:28:30,678 INFO L273 TraceCheckUtils]: 180: Hoare triple {27731#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {27731#false} is VALID [2018-11-23 12:28:30,678 INFO L273 TraceCheckUtils]: 181: Hoare triple {27731#false} assume true; {27731#false} is VALID [2018-11-23 12:28:30,678 INFO L268 TraceCheckUtils]: 182: Hoare quadruple {27731#false} {27731#false} #74#return; {27731#false} is VALID [2018-11-23 12:28:30,678 INFO L273 TraceCheckUtils]: 183: Hoare triple {27731#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {27731#false} is VALID [2018-11-23 12:28:30,678 INFO L273 TraceCheckUtils]: 184: Hoare triple {27731#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {27731#false} is VALID [2018-11-23 12:28:30,678 INFO L273 TraceCheckUtils]: 185: Hoare triple {27731#false} assume !false; {27731#false} is VALID [2018-11-23 12:28:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 803 proven. 121 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2018-11-23 12:28:30,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:30,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 14] total 50 [2018-11-23 12:28:30,711 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 186 [2018-11-23 12:28:30,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:30,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 12:28:30,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:30,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 12:28:30,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 12:28:30,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:28:30,852 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 50 states. [2018-11-23 12:28:32,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:32,479 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2018-11-23 12:28:32,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 12:28:32,479 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 186 [2018-11-23 12:28:32,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:28:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 152 transitions. [2018-11-23 12:28:32,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:28:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 152 transitions. [2018-11-23 12:28:32,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 152 transitions. [2018-11-23 12:28:32,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:32,624 INFO L225 Difference]: With dead ends: 195 [2018-11-23 12:28:32,624 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 12:28:32,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:28:32,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 12:28:32,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-11-23 12:28:32,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:32,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 137 states. [2018-11-23 12:28:32,692 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 137 states. [2018-11-23 12:28:32,692 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 137 states. [2018-11-23 12:28:32,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:32,695 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-11-23 12:28:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:28:32,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:32,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:32,696 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 139 states. [2018-11-23 12:28:32,696 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 139 states. [2018-11-23 12:28:32,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:32,698 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-11-23 12:28:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:28:32,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:32,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:32,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:32,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-23 12:28:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-11-23 12:28:32,702 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 186 [2018-11-23 12:28:32,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:32,702 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-11-23 12:28:32,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 12:28:32,702 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:28:32,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-23 12:28:32,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:32,703 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 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:28:32,703 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:32,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:32,704 INFO L82 PathProgramCache]: Analyzing trace with hash -357998503, now seen corresponding path program 35 times [2018-11-23 12:28:32,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:32,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:32,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:33,595 INFO L256 TraceCheckUtils]: 0: Hoare triple {29109#true} call ULTIMATE.init(); {29109#true} is VALID [2018-11-23 12:28:33,595 INFO L273 TraceCheckUtils]: 1: Hoare triple {29109#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29109#true} is VALID [2018-11-23 12:28:33,596 INFO L273 TraceCheckUtils]: 2: Hoare triple {29109#true} assume true; {29109#true} is VALID [2018-11-23 12:28:33,596 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29109#true} {29109#true} #66#return; {29109#true} is VALID [2018-11-23 12:28:33,596 INFO L256 TraceCheckUtils]: 4: Hoare triple {29109#true} call #t~ret12 := main(); {29109#true} is VALID [2018-11-23 12:28:33,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {29109#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {29111#(= main_~i~1 0)} is VALID [2018-11-23 12:28:33,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {29111#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29111#(= main_~i~1 0)} is VALID [2018-11-23 12:28:33,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {29111#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29112#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:33,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {29112#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29112#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:33,599 INFO L273 TraceCheckUtils]: 9: Hoare triple {29112#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29113#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:33,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {29113#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29113#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:33,600 INFO L273 TraceCheckUtils]: 11: Hoare triple {29113#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29114#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:33,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {29114#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29114#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:33,601 INFO L273 TraceCheckUtils]: 13: Hoare triple {29114#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29115#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:33,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {29115#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29115#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:33,602 INFO L273 TraceCheckUtils]: 15: Hoare triple {29115#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29116#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:33,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {29116#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29116#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:33,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {29116#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29117#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:33,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {29117#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29117#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:33,605 INFO L273 TraceCheckUtils]: 19: Hoare triple {29117#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29118#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:33,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {29118#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29118#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:33,606 INFO L273 TraceCheckUtils]: 21: Hoare triple {29118#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29119#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:33,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {29119#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29119#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:33,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {29119#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29120#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:33,608 INFO L273 TraceCheckUtils]: 24: Hoare triple {29120#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29120#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:33,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {29120#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29121#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:33,609 INFO L273 TraceCheckUtils]: 26: Hoare triple {29121#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29121#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:33,610 INFO L273 TraceCheckUtils]: 27: Hoare triple {29121#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29122#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:33,610 INFO L273 TraceCheckUtils]: 28: Hoare triple {29122#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29122#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:33,611 INFO L273 TraceCheckUtils]: 29: Hoare triple {29122#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29123#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:33,611 INFO L273 TraceCheckUtils]: 30: Hoare triple {29123#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29123#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:33,612 INFO L273 TraceCheckUtils]: 31: Hoare triple {29123#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29124#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:33,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {29124#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29124#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:33,613 INFO L273 TraceCheckUtils]: 33: Hoare triple {29124#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29125#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:33,614 INFO L273 TraceCheckUtils]: 34: Hoare triple {29125#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29125#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:33,615 INFO L273 TraceCheckUtils]: 35: Hoare triple {29125#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29126#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:33,615 INFO L273 TraceCheckUtils]: 36: Hoare triple {29126#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29126#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:33,616 INFO L273 TraceCheckUtils]: 37: Hoare triple {29126#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29127#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:33,616 INFO L273 TraceCheckUtils]: 38: Hoare triple {29127#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29127#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:33,617 INFO L273 TraceCheckUtils]: 39: Hoare triple {29127#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29128#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:33,617 INFO L273 TraceCheckUtils]: 40: Hoare triple {29128#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29128#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:33,618 INFO L273 TraceCheckUtils]: 41: Hoare triple {29128#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29129#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:33,619 INFO L273 TraceCheckUtils]: 42: Hoare triple {29129#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29129#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:33,619 INFO L273 TraceCheckUtils]: 43: Hoare triple {29129#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29130#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:33,620 INFO L273 TraceCheckUtils]: 44: Hoare triple {29130#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29130#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:33,621 INFO L273 TraceCheckUtils]: 45: Hoare triple {29130#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29131#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:33,621 INFO L273 TraceCheckUtils]: 46: Hoare triple {29131#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29131#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:33,622 INFO L273 TraceCheckUtils]: 47: Hoare triple {29131#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29132#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:33,622 INFO L273 TraceCheckUtils]: 48: Hoare triple {29132#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29132#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:33,623 INFO L273 TraceCheckUtils]: 49: Hoare triple {29132#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29133#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:33,623 INFO L273 TraceCheckUtils]: 50: Hoare triple {29133#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29133#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:33,624 INFO L273 TraceCheckUtils]: 51: Hoare triple {29133#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29134#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:33,625 INFO L273 TraceCheckUtils]: 52: Hoare triple {29134#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29134#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:33,625 INFO L273 TraceCheckUtils]: 53: Hoare triple {29134#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29135#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:33,626 INFO L273 TraceCheckUtils]: 54: Hoare triple {29135#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29135#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:33,627 INFO L273 TraceCheckUtils]: 55: Hoare triple {29135#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29136#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:33,627 INFO L273 TraceCheckUtils]: 56: Hoare triple {29136#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29136#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:33,628 INFO L273 TraceCheckUtils]: 57: Hoare triple {29136#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29137#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:33,628 INFO L273 TraceCheckUtils]: 58: Hoare triple {29137#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29137#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:33,629 INFO L273 TraceCheckUtils]: 59: Hoare triple {29137#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29138#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:33,630 INFO L273 TraceCheckUtils]: 60: Hoare triple {29138#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29138#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:33,630 INFO L273 TraceCheckUtils]: 61: Hoare triple {29138#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29139#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:33,631 INFO L273 TraceCheckUtils]: 62: Hoare triple {29139#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29139#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:33,631 INFO L273 TraceCheckUtils]: 63: Hoare triple {29139#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29140#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:33,632 INFO L273 TraceCheckUtils]: 64: Hoare triple {29140#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29140#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:33,633 INFO L273 TraceCheckUtils]: 65: Hoare triple {29140#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29141#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:33,633 INFO L273 TraceCheckUtils]: 66: Hoare triple {29141#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29141#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:33,634 INFO L273 TraceCheckUtils]: 67: Hoare triple {29141#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29142#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:33,634 INFO L273 TraceCheckUtils]: 68: Hoare triple {29142#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29142#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:33,635 INFO L273 TraceCheckUtils]: 69: Hoare triple {29142#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29143#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:33,635 INFO L273 TraceCheckUtils]: 70: Hoare triple {29143#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29143#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:33,636 INFO L273 TraceCheckUtils]: 71: Hoare triple {29143#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29144#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:33,637 INFO L273 TraceCheckUtils]: 72: Hoare triple {29144#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29144#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:33,637 INFO L273 TraceCheckUtils]: 73: Hoare triple {29144#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29145#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:33,638 INFO L273 TraceCheckUtils]: 74: Hoare triple {29145#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29145#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:33,639 INFO L273 TraceCheckUtils]: 75: Hoare triple {29145#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29146#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:33,639 INFO L273 TraceCheckUtils]: 76: Hoare triple {29146#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29146#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:33,640 INFO L273 TraceCheckUtils]: 77: Hoare triple {29146#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29147#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:33,640 INFO L273 TraceCheckUtils]: 78: Hoare triple {29147#(<= main_~i~1 36)} assume !(~i~1 < 1000); {29110#false} is VALID [2018-11-23 12:28:33,641 INFO L256 TraceCheckUtils]: 79: Hoare triple {29110#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {29109#true} is VALID [2018-11-23 12:28:33,641 INFO L273 TraceCheckUtils]: 80: Hoare triple {29109#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {29109#true} is VALID [2018-11-23 12:28:33,641 INFO L273 TraceCheckUtils]: 81: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,641 INFO L273 TraceCheckUtils]: 82: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,641 INFO L273 TraceCheckUtils]: 83: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,642 INFO L273 TraceCheckUtils]: 84: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,642 INFO L273 TraceCheckUtils]: 85: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,642 INFO L273 TraceCheckUtils]: 86: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,642 INFO L273 TraceCheckUtils]: 87: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,642 INFO L273 TraceCheckUtils]: 88: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,642 INFO L273 TraceCheckUtils]: 89: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,643 INFO L273 TraceCheckUtils]: 90: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,643 INFO L273 TraceCheckUtils]: 91: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,643 INFO L273 TraceCheckUtils]: 92: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,643 INFO L273 TraceCheckUtils]: 93: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,643 INFO L273 TraceCheckUtils]: 94: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,643 INFO L273 TraceCheckUtils]: 95: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,644 INFO L273 TraceCheckUtils]: 96: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,644 INFO L273 TraceCheckUtils]: 97: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,644 INFO L273 TraceCheckUtils]: 98: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,644 INFO L273 TraceCheckUtils]: 99: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,644 INFO L273 TraceCheckUtils]: 100: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,644 INFO L273 TraceCheckUtils]: 101: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,645 INFO L273 TraceCheckUtils]: 102: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,645 INFO L273 TraceCheckUtils]: 103: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,645 INFO L273 TraceCheckUtils]: 104: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,645 INFO L273 TraceCheckUtils]: 105: Hoare triple {29109#true} assume !(~i~0 < 1000); {29109#true} is VALID [2018-11-23 12:28:33,645 INFO L273 TraceCheckUtils]: 106: Hoare triple {29109#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {29109#true} is VALID [2018-11-23 12:28:33,645 INFO L273 TraceCheckUtils]: 107: Hoare triple {29109#true} assume true; {29109#true} is VALID [2018-11-23 12:28:33,645 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {29109#true} {29110#false} #70#return; {29110#false} is VALID [2018-11-23 12:28:33,646 INFO L273 TraceCheckUtils]: 109: Hoare triple {29110#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {29110#false} is VALID [2018-11-23 12:28:33,646 INFO L256 TraceCheckUtils]: 110: Hoare triple {29110#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {29109#true} is VALID [2018-11-23 12:28:33,646 INFO L273 TraceCheckUtils]: 111: Hoare triple {29109#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {29109#true} is VALID [2018-11-23 12:28:33,646 INFO L273 TraceCheckUtils]: 112: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,646 INFO L273 TraceCheckUtils]: 113: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,646 INFO L273 TraceCheckUtils]: 114: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,646 INFO L273 TraceCheckUtils]: 115: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,646 INFO L273 TraceCheckUtils]: 116: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,646 INFO L273 TraceCheckUtils]: 117: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,646 INFO L273 TraceCheckUtils]: 118: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,647 INFO L273 TraceCheckUtils]: 119: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,647 INFO L273 TraceCheckUtils]: 120: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,647 INFO L273 TraceCheckUtils]: 121: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,647 INFO L273 TraceCheckUtils]: 122: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,647 INFO L273 TraceCheckUtils]: 123: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,647 INFO L273 TraceCheckUtils]: 124: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,647 INFO L273 TraceCheckUtils]: 125: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,647 INFO L273 TraceCheckUtils]: 126: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,647 INFO L273 TraceCheckUtils]: 127: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,647 INFO L273 TraceCheckUtils]: 128: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,648 INFO L273 TraceCheckUtils]: 129: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,648 INFO L273 TraceCheckUtils]: 130: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,648 INFO L273 TraceCheckUtils]: 131: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,648 INFO L273 TraceCheckUtils]: 132: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,648 INFO L273 TraceCheckUtils]: 133: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,648 INFO L273 TraceCheckUtils]: 134: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,648 INFO L273 TraceCheckUtils]: 135: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,648 INFO L273 TraceCheckUtils]: 136: Hoare triple {29109#true} assume !(~i~0 < 1000); {29109#true} is VALID [2018-11-23 12:28:33,648 INFO L273 TraceCheckUtils]: 137: Hoare triple {29109#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {29109#true} is VALID [2018-11-23 12:28:33,648 INFO L273 TraceCheckUtils]: 138: Hoare triple {29109#true} assume true; {29109#true} is VALID [2018-11-23 12:28:33,649 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {29109#true} {29110#false} #72#return; {29110#false} is VALID [2018-11-23 12:28:33,649 INFO L273 TraceCheckUtils]: 140: Hoare triple {29110#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {29110#false} is VALID [2018-11-23 12:28:33,649 INFO L273 TraceCheckUtils]: 141: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:33,649 INFO L273 TraceCheckUtils]: 142: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:33,649 INFO L273 TraceCheckUtils]: 143: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:33,649 INFO L273 TraceCheckUtils]: 144: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:33,649 INFO L273 TraceCheckUtils]: 145: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:33,649 INFO L273 TraceCheckUtils]: 146: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:33,649 INFO L273 TraceCheckUtils]: 147: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:33,650 INFO L273 TraceCheckUtils]: 148: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:33,650 INFO L273 TraceCheckUtils]: 149: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:33,650 INFO L273 TraceCheckUtils]: 150: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:33,650 INFO L273 TraceCheckUtils]: 151: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:33,650 INFO L273 TraceCheckUtils]: 152: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:33,650 INFO L273 TraceCheckUtils]: 153: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:33,650 INFO L273 TraceCheckUtils]: 154: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:33,650 INFO L273 TraceCheckUtils]: 155: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:33,650 INFO L273 TraceCheckUtils]: 156: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:33,650 INFO L273 TraceCheckUtils]: 157: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:33,651 INFO L273 TraceCheckUtils]: 158: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:33,651 INFO L273 TraceCheckUtils]: 159: Hoare triple {29110#false} assume !(~i~2 < 999); {29110#false} is VALID [2018-11-23 12:28:33,651 INFO L273 TraceCheckUtils]: 160: Hoare triple {29110#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {29110#false} is VALID [2018-11-23 12:28:33,651 INFO L256 TraceCheckUtils]: 161: Hoare triple {29110#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {29109#true} is VALID [2018-11-23 12:28:33,651 INFO L273 TraceCheckUtils]: 162: Hoare triple {29109#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {29109#true} is VALID [2018-11-23 12:28:33,651 INFO L273 TraceCheckUtils]: 163: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,651 INFO L273 TraceCheckUtils]: 164: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,651 INFO L273 TraceCheckUtils]: 165: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,651 INFO L273 TraceCheckUtils]: 166: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,652 INFO L273 TraceCheckUtils]: 167: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,652 INFO L273 TraceCheckUtils]: 168: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,652 INFO L273 TraceCheckUtils]: 169: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,652 INFO L273 TraceCheckUtils]: 170: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,652 INFO L273 TraceCheckUtils]: 171: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,652 INFO L273 TraceCheckUtils]: 172: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,652 INFO L273 TraceCheckUtils]: 173: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,652 INFO L273 TraceCheckUtils]: 174: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,652 INFO L273 TraceCheckUtils]: 175: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,652 INFO L273 TraceCheckUtils]: 176: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,653 INFO L273 TraceCheckUtils]: 177: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,653 INFO L273 TraceCheckUtils]: 178: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,653 INFO L273 TraceCheckUtils]: 179: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,653 INFO L273 TraceCheckUtils]: 180: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,653 INFO L273 TraceCheckUtils]: 181: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,653 INFO L273 TraceCheckUtils]: 182: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,653 INFO L273 TraceCheckUtils]: 183: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,653 INFO L273 TraceCheckUtils]: 184: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,653 INFO L273 TraceCheckUtils]: 185: Hoare triple {29109#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29109#true} is VALID [2018-11-23 12:28:33,653 INFO L273 TraceCheckUtils]: 186: Hoare triple {29109#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29109#true} is VALID [2018-11-23 12:28:33,654 INFO L273 TraceCheckUtils]: 187: Hoare triple {29109#true} assume !(~i~0 < 1000); {29109#true} is VALID [2018-11-23 12:28:33,654 INFO L273 TraceCheckUtils]: 188: Hoare triple {29109#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {29109#true} is VALID [2018-11-23 12:28:33,654 INFO L273 TraceCheckUtils]: 189: Hoare triple {29109#true} assume true; {29109#true} is VALID [2018-11-23 12:28:33,654 INFO L268 TraceCheckUtils]: 190: Hoare quadruple {29109#true} {29110#false} #74#return; {29110#false} is VALID [2018-11-23 12:28:33,654 INFO L273 TraceCheckUtils]: 191: Hoare triple {29110#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {29110#false} is VALID [2018-11-23 12:28:33,654 INFO L273 TraceCheckUtils]: 192: Hoare triple {29110#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {29110#false} is VALID [2018-11-23 12:28:33,654 INFO L273 TraceCheckUtils]: 193: Hoare triple {29110#false} assume !false; {29110#false} is VALID [2018-11-23 12:28:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2018-11-23 12:28:33,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:33,670 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:28:33,680 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:28:43,438 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 12:28:43,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:43,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:43,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {29109#true} call ULTIMATE.init(); {29109#true} is VALID [2018-11-23 12:28:43,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {29109#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29109#true} is VALID [2018-11-23 12:28:43,966 INFO L273 TraceCheckUtils]: 2: Hoare triple {29109#true} assume true; {29109#true} is VALID [2018-11-23 12:28:43,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29109#true} {29109#true} #66#return; {29109#true} is VALID [2018-11-23 12:28:43,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {29109#true} call #t~ret12 := main(); {29109#true} is VALID [2018-11-23 12:28:43,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {29109#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {29109#true} is VALID [2018-11-23 12:28:43,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,967 INFO L273 TraceCheckUtils]: 10: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,967 INFO L273 TraceCheckUtils]: 11: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,967 INFO L273 TraceCheckUtils]: 12: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,968 INFO L273 TraceCheckUtils]: 13: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,968 INFO L273 TraceCheckUtils]: 14: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,968 INFO L273 TraceCheckUtils]: 15: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,968 INFO L273 TraceCheckUtils]: 16: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,968 INFO L273 TraceCheckUtils]: 17: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,968 INFO L273 TraceCheckUtils]: 18: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,968 INFO L273 TraceCheckUtils]: 19: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,968 INFO L273 TraceCheckUtils]: 20: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,968 INFO L273 TraceCheckUtils]: 21: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,969 INFO L273 TraceCheckUtils]: 22: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,969 INFO L273 TraceCheckUtils]: 23: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,969 INFO L273 TraceCheckUtils]: 26: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,969 INFO L273 TraceCheckUtils]: 27: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,969 INFO L273 TraceCheckUtils]: 28: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,969 INFO L273 TraceCheckUtils]: 29: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,969 INFO L273 TraceCheckUtils]: 30: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,969 INFO L273 TraceCheckUtils]: 31: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,970 INFO L273 TraceCheckUtils]: 32: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,970 INFO L273 TraceCheckUtils]: 33: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,970 INFO L273 TraceCheckUtils]: 34: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,970 INFO L273 TraceCheckUtils]: 35: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,970 INFO L273 TraceCheckUtils]: 36: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,970 INFO L273 TraceCheckUtils]: 37: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,970 INFO L273 TraceCheckUtils]: 38: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,970 INFO L273 TraceCheckUtils]: 39: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,970 INFO L273 TraceCheckUtils]: 40: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,970 INFO L273 TraceCheckUtils]: 41: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,971 INFO L273 TraceCheckUtils]: 42: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,971 INFO L273 TraceCheckUtils]: 43: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,971 INFO L273 TraceCheckUtils]: 44: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,971 INFO L273 TraceCheckUtils]: 45: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,971 INFO L273 TraceCheckUtils]: 46: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,971 INFO L273 TraceCheckUtils]: 47: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,971 INFO L273 TraceCheckUtils]: 48: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,971 INFO L273 TraceCheckUtils]: 49: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,971 INFO L273 TraceCheckUtils]: 50: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,971 INFO L273 TraceCheckUtils]: 51: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,972 INFO L273 TraceCheckUtils]: 52: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,972 INFO L273 TraceCheckUtils]: 53: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,972 INFO L273 TraceCheckUtils]: 54: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,972 INFO L273 TraceCheckUtils]: 55: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,972 INFO L273 TraceCheckUtils]: 56: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,972 INFO L273 TraceCheckUtils]: 57: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,972 INFO L273 TraceCheckUtils]: 58: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,972 INFO L273 TraceCheckUtils]: 59: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,972 INFO L273 TraceCheckUtils]: 60: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,972 INFO L273 TraceCheckUtils]: 61: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,973 INFO L273 TraceCheckUtils]: 62: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,973 INFO L273 TraceCheckUtils]: 63: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,973 INFO L273 TraceCheckUtils]: 64: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,973 INFO L273 TraceCheckUtils]: 65: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,973 INFO L273 TraceCheckUtils]: 66: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,973 INFO L273 TraceCheckUtils]: 67: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,973 INFO L273 TraceCheckUtils]: 68: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,973 INFO L273 TraceCheckUtils]: 69: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,973 INFO L273 TraceCheckUtils]: 70: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,974 INFO L273 TraceCheckUtils]: 71: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,974 INFO L273 TraceCheckUtils]: 72: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,974 INFO L273 TraceCheckUtils]: 73: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,974 INFO L273 TraceCheckUtils]: 74: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,974 INFO L273 TraceCheckUtils]: 75: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,974 INFO L273 TraceCheckUtils]: 76: Hoare triple {29109#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {29109#true} is VALID [2018-11-23 12:28:43,974 INFO L273 TraceCheckUtils]: 77: Hoare triple {29109#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {29109#true} is VALID [2018-11-23 12:28:43,974 INFO L273 TraceCheckUtils]: 78: Hoare triple {29109#true} assume !(~i~1 < 1000); {29109#true} is VALID [2018-11-23 12:28:43,974 INFO L256 TraceCheckUtils]: 79: Hoare triple {29109#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {29109#true} is VALID [2018-11-23 12:28:43,975 INFO L273 TraceCheckUtils]: 80: Hoare triple {29109#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {29391#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:43,975 INFO L273 TraceCheckUtils]: 81: Hoare triple {29391#(<= mapavg_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29391#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:43,976 INFO L273 TraceCheckUtils]: 82: Hoare triple {29391#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29398#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:43,976 INFO L273 TraceCheckUtils]: 83: Hoare triple {29398#(<= mapavg_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29398#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:43,976 INFO L273 TraceCheckUtils]: 84: Hoare triple {29398#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29405#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:43,977 INFO L273 TraceCheckUtils]: 85: Hoare triple {29405#(<= mapavg_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29405#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:43,977 INFO L273 TraceCheckUtils]: 86: Hoare triple {29405#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29412#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:43,977 INFO L273 TraceCheckUtils]: 87: Hoare triple {29412#(<= mapavg_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29412#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:43,978 INFO L273 TraceCheckUtils]: 88: Hoare triple {29412#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29419#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:43,978 INFO L273 TraceCheckUtils]: 89: Hoare triple {29419#(<= mapavg_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29419#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:43,978 INFO L273 TraceCheckUtils]: 90: Hoare triple {29419#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29426#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:43,979 INFO L273 TraceCheckUtils]: 91: Hoare triple {29426#(<= mapavg_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29426#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:43,979 INFO L273 TraceCheckUtils]: 92: Hoare triple {29426#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29433#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:43,980 INFO L273 TraceCheckUtils]: 93: Hoare triple {29433#(<= mapavg_~i~0 6)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29433#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:43,981 INFO L273 TraceCheckUtils]: 94: Hoare triple {29433#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29440#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:43,981 INFO L273 TraceCheckUtils]: 95: Hoare triple {29440#(<= mapavg_~i~0 7)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29440#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:43,982 INFO L273 TraceCheckUtils]: 96: Hoare triple {29440#(<= mapavg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29447#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:28:43,982 INFO L273 TraceCheckUtils]: 97: Hoare triple {29447#(<= mapavg_~i~0 8)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29447#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:28:43,983 INFO L273 TraceCheckUtils]: 98: Hoare triple {29447#(<= mapavg_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29454#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:28:43,983 INFO L273 TraceCheckUtils]: 99: Hoare triple {29454#(<= mapavg_~i~0 9)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29454#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:28:43,984 INFO L273 TraceCheckUtils]: 100: Hoare triple {29454#(<= mapavg_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29461#(<= mapavg_~i~0 10)} is VALID [2018-11-23 12:28:43,985 INFO L273 TraceCheckUtils]: 101: Hoare triple {29461#(<= mapavg_~i~0 10)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29461#(<= mapavg_~i~0 10)} is VALID [2018-11-23 12:28:43,985 INFO L273 TraceCheckUtils]: 102: Hoare triple {29461#(<= mapavg_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29468#(<= mapavg_~i~0 11)} is VALID [2018-11-23 12:28:43,986 INFO L273 TraceCheckUtils]: 103: Hoare triple {29468#(<= mapavg_~i~0 11)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29468#(<= mapavg_~i~0 11)} is VALID [2018-11-23 12:28:43,986 INFO L273 TraceCheckUtils]: 104: Hoare triple {29468#(<= mapavg_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29475#(<= mapavg_~i~0 12)} is VALID [2018-11-23 12:28:43,987 INFO L273 TraceCheckUtils]: 105: Hoare triple {29475#(<= mapavg_~i~0 12)} assume !(~i~0 < 1000); {29110#false} is VALID [2018-11-23 12:28:43,987 INFO L273 TraceCheckUtils]: 106: Hoare triple {29110#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {29110#false} is VALID [2018-11-23 12:28:43,988 INFO L273 TraceCheckUtils]: 107: Hoare triple {29110#false} assume true; {29110#false} is VALID [2018-11-23 12:28:43,988 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {29110#false} {29109#true} #70#return; {29110#false} is VALID [2018-11-23 12:28:43,988 INFO L273 TraceCheckUtils]: 109: Hoare triple {29110#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {29110#false} is VALID [2018-11-23 12:28:43,988 INFO L256 TraceCheckUtils]: 110: Hoare triple {29110#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {29110#false} is VALID [2018-11-23 12:28:43,988 INFO L273 TraceCheckUtils]: 111: Hoare triple {29110#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {29110#false} is VALID [2018-11-23 12:28:43,988 INFO L273 TraceCheckUtils]: 112: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,989 INFO L273 TraceCheckUtils]: 113: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,989 INFO L273 TraceCheckUtils]: 114: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,989 INFO L273 TraceCheckUtils]: 115: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,989 INFO L273 TraceCheckUtils]: 116: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,989 INFO L273 TraceCheckUtils]: 117: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,989 INFO L273 TraceCheckUtils]: 118: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,990 INFO L273 TraceCheckUtils]: 119: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,990 INFO L273 TraceCheckUtils]: 120: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,990 INFO L273 TraceCheckUtils]: 121: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,990 INFO L273 TraceCheckUtils]: 122: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,990 INFO L273 TraceCheckUtils]: 123: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,991 INFO L273 TraceCheckUtils]: 124: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,991 INFO L273 TraceCheckUtils]: 125: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,991 INFO L273 TraceCheckUtils]: 126: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,991 INFO L273 TraceCheckUtils]: 127: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,991 INFO L273 TraceCheckUtils]: 128: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,991 INFO L273 TraceCheckUtils]: 129: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,992 INFO L273 TraceCheckUtils]: 130: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,992 INFO L273 TraceCheckUtils]: 131: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,992 INFO L273 TraceCheckUtils]: 132: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,992 INFO L273 TraceCheckUtils]: 133: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,992 INFO L273 TraceCheckUtils]: 134: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,992 INFO L273 TraceCheckUtils]: 135: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,992 INFO L273 TraceCheckUtils]: 136: Hoare triple {29110#false} assume !(~i~0 < 1000); {29110#false} is VALID [2018-11-23 12:28:43,992 INFO L273 TraceCheckUtils]: 137: Hoare triple {29110#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {29110#false} is VALID [2018-11-23 12:28:43,992 INFO L273 TraceCheckUtils]: 138: Hoare triple {29110#false} assume true; {29110#false} is VALID [2018-11-23 12:28:43,993 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {29110#false} {29110#false} #72#return; {29110#false} is VALID [2018-11-23 12:28:43,993 INFO L273 TraceCheckUtils]: 140: Hoare triple {29110#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {29110#false} is VALID [2018-11-23 12:28:43,993 INFO L273 TraceCheckUtils]: 141: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:43,993 INFO L273 TraceCheckUtils]: 142: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:43,993 INFO L273 TraceCheckUtils]: 143: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:43,993 INFO L273 TraceCheckUtils]: 144: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:43,993 INFO L273 TraceCheckUtils]: 145: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:43,993 INFO L273 TraceCheckUtils]: 146: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:43,993 INFO L273 TraceCheckUtils]: 147: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:43,993 INFO L273 TraceCheckUtils]: 148: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:43,994 INFO L273 TraceCheckUtils]: 149: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:43,994 INFO L273 TraceCheckUtils]: 150: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:43,994 INFO L273 TraceCheckUtils]: 151: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:43,994 INFO L273 TraceCheckUtils]: 152: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:43,994 INFO L273 TraceCheckUtils]: 153: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:43,994 INFO L273 TraceCheckUtils]: 154: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:43,994 INFO L273 TraceCheckUtils]: 155: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:43,994 INFO L273 TraceCheckUtils]: 156: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:43,994 INFO L273 TraceCheckUtils]: 157: Hoare triple {29110#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {29110#false} is VALID [2018-11-23 12:28:43,994 INFO L273 TraceCheckUtils]: 158: Hoare triple {29110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {29110#false} is VALID [2018-11-23 12:28:43,995 INFO L273 TraceCheckUtils]: 159: Hoare triple {29110#false} assume !(~i~2 < 999); {29110#false} is VALID [2018-11-23 12:28:43,995 INFO L273 TraceCheckUtils]: 160: Hoare triple {29110#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {29110#false} is VALID [2018-11-23 12:28:43,995 INFO L256 TraceCheckUtils]: 161: Hoare triple {29110#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {29110#false} is VALID [2018-11-23 12:28:43,995 INFO L273 TraceCheckUtils]: 162: Hoare triple {29110#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {29110#false} is VALID [2018-11-23 12:28:43,995 INFO L273 TraceCheckUtils]: 163: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,995 INFO L273 TraceCheckUtils]: 164: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,995 INFO L273 TraceCheckUtils]: 165: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,995 INFO L273 TraceCheckUtils]: 166: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,995 INFO L273 TraceCheckUtils]: 167: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,995 INFO L273 TraceCheckUtils]: 168: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,996 INFO L273 TraceCheckUtils]: 169: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,996 INFO L273 TraceCheckUtils]: 170: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,996 INFO L273 TraceCheckUtils]: 171: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,996 INFO L273 TraceCheckUtils]: 172: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,996 INFO L273 TraceCheckUtils]: 173: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,996 INFO L273 TraceCheckUtils]: 174: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,996 INFO L273 TraceCheckUtils]: 175: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,996 INFO L273 TraceCheckUtils]: 176: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,996 INFO L273 TraceCheckUtils]: 177: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,996 INFO L273 TraceCheckUtils]: 178: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,997 INFO L273 TraceCheckUtils]: 179: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,997 INFO L273 TraceCheckUtils]: 180: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,997 INFO L273 TraceCheckUtils]: 181: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,997 INFO L273 TraceCheckUtils]: 182: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,997 INFO L273 TraceCheckUtils]: 183: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,997 INFO L273 TraceCheckUtils]: 184: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,997 INFO L273 TraceCheckUtils]: 185: Hoare triple {29110#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29110#false} is VALID [2018-11-23 12:28:43,997 INFO L273 TraceCheckUtils]: 186: Hoare triple {29110#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29110#false} is VALID [2018-11-23 12:28:43,997 INFO L273 TraceCheckUtils]: 187: Hoare triple {29110#false} assume !(~i~0 < 1000); {29110#false} is VALID [2018-11-23 12:28:43,997 INFO L273 TraceCheckUtils]: 188: Hoare triple {29110#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {29110#false} is VALID [2018-11-23 12:28:43,998 INFO L273 TraceCheckUtils]: 189: Hoare triple {29110#false} assume true; {29110#false} is VALID [2018-11-23 12:28:43,998 INFO L268 TraceCheckUtils]: 190: Hoare quadruple {29110#false} {29110#false} #74#return; {29110#false} is VALID [2018-11-23 12:28:43,998 INFO L273 TraceCheckUtils]: 191: Hoare triple {29110#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {29110#false} is VALID [2018-11-23 12:28:43,998 INFO L273 TraceCheckUtils]: 192: Hoare triple {29110#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {29110#false} is VALID [2018-11-23 12:28:43,998 INFO L273 TraceCheckUtils]: 193: Hoare triple {29110#false} assume !false; {29110#false} is VALID [2018-11-23 12:28:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 628 proven. 144 refuted. 0 times theorem prover too weak. 1988 trivial. 0 not checked. [2018-11-23 12:28:44,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:44,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15] total 52 [2018-11-23 12:28:44,039 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 194 [2018-11-23 12:28:44,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:44,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 12:28:44,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:44,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 12:28:44,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 12:28:44,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:28:44,178 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 52 states. [2018-11-23 12:28:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:45,601 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2018-11-23 12:28:45,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 12:28:45,602 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 194 [2018-11-23 12:28:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:28:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 156 transitions. [2018-11-23 12:28:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:28:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 156 transitions. [2018-11-23 12:28:45,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 156 transitions. [2018-11-23 12:28:45,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:45,805 INFO L225 Difference]: With dead ends: 201 [2018-11-23 12:28:45,805 INFO L226 Difference]: Without dead ends: 143 [2018-11-23 12:28:45,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:28:45,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-23 12:28:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-11-23 12:28:45,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:45,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 141 states. [2018-11-23 12:28:45,874 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 141 states. [2018-11-23 12:28:45,874 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 141 states. [2018-11-23 12:28:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:45,876 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-11-23 12:28:45,876 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:28:45,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:45,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:45,877 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 143 states. [2018-11-23 12:28:45,877 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 143 states. [2018-11-23 12:28:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:45,879 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-11-23 12:28:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:28:45,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:45,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:45,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:45,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 12:28:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2018-11-23 12:28:45,883 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 194 [2018-11-23 12:28:45,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:45,883 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2018-11-23 12:28:45,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 12:28:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:28:45,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-23 12:28:45,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:45,885 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 37, 37, 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:28:45,885 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:45,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:45,885 INFO L82 PathProgramCache]: Analyzing trace with hash 622808729, now seen corresponding path program 36 times [2018-11-23 12:28:45,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:45,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:45,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:45,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:45,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:47,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {30537#true} call ULTIMATE.init(); {30537#true} is VALID [2018-11-23 12:28:47,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {30537#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30537#true} is VALID [2018-11-23 12:28:47,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {30537#true} assume true; {30537#true} is VALID [2018-11-23 12:28:47,364 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30537#true} {30537#true} #66#return; {30537#true} is VALID [2018-11-23 12:28:47,364 INFO L256 TraceCheckUtils]: 4: Hoare triple {30537#true} call #t~ret12 := main(); {30537#true} is VALID [2018-11-23 12:28:47,364 INFO L273 TraceCheckUtils]: 5: Hoare triple {30537#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30539#(= main_~i~1 0)} is VALID [2018-11-23 12:28:47,365 INFO L273 TraceCheckUtils]: 6: Hoare triple {30539#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30539#(= main_~i~1 0)} is VALID [2018-11-23 12:28:47,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {30539#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30540#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:47,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {30540#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30540#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:47,366 INFO L273 TraceCheckUtils]: 9: Hoare triple {30540#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30541#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:47,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {30541#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30541#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:47,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {30541#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30542#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:47,367 INFO L273 TraceCheckUtils]: 12: Hoare triple {30542#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30542#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:47,368 INFO L273 TraceCheckUtils]: 13: Hoare triple {30542#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30543#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:47,369 INFO L273 TraceCheckUtils]: 14: Hoare triple {30543#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30543#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:47,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {30543#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30544#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:47,370 INFO L273 TraceCheckUtils]: 16: Hoare triple {30544#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30544#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:47,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {30544#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30545#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:47,371 INFO L273 TraceCheckUtils]: 18: Hoare triple {30545#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30545#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:47,372 INFO L273 TraceCheckUtils]: 19: Hoare triple {30545#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30546#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:47,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {30546#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30546#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:47,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {30546#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30547#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:47,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {30547#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30547#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:47,374 INFO L273 TraceCheckUtils]: 23: Hoare triple {30547#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30548#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:47,375 INFO L273 TraceCheckUtils]: 24: Hoare triple {30548#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30548#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:47,375 INFO L273 TraceCheckUtils]: 25: Hoare triple {30548#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30549#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:47,376 INFO L273 TraceCheckUtils]: 26: Hoare triple {30549#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30549#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:47,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {30549#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30550#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:47,377 INFO L273 TraceCheckUtils]: 28: Hoare triple {30550#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30550#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:47,378 INFO L273 TraceCheckUtils]: 29: Hoare triple {30550#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30551#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:47,378 INFO L273 TraceCheckUtils]: 30: Hoare triple {30551#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30551#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:47,379 INFO L273 TraceCheckUtils]: 31: Hoare triple {30551#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30552#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:47,380 INFO L273 TraceCheckUtils]: 32: Hoare triple {30552#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30552#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:47,380 INFO L273 TraceCheckUtils]: 33: Hoare triple {30552#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30553#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:47,381 INFO L273 TraceCheckUtils]: 34: Hoare triple {30553#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30553#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:47,382 INFO L273 TraceCheckUtils]: 35: Hoare triple {30553#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30554#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:47,382 INFO L273 TraceCheckUtils]: 36: Hoare triple {30554#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30554#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:47,383 INFO L273 TraceCheckUtils]: 37: Hoare triple {30554#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30555#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:47,383 INFO L273 TraceCheckUtils]: 38: Hoare triple {30555#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30555#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:47,384 INFO L273 TraceCheckUtils]: 39: Hoare triple {30555#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30556#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:47,384 INFO L273 TraceCheckUtils]: 40: Hoare triple {30556#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30556#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:47,385 INFO L273 TraceCheckUtils]: 41: Hoare triple {30556#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30557#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:47,386 INFO L273 TraceCheckUtils]: 42: Hoare triple {30557#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30557#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:47,386 INFO L273 TraceCheckUtils]: 43: Hoare triple {30557#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30558#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:47,387 INFO L273 TraceCheckUtils]: 44: Hoare triple {30558#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30558#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:47,388 INFO L273 TraceCheckUtils]: 45: Hoare triple {30558#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30559#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:47,388 INFO L273 TraceCheckUtils]: 46: Hoare triple {30559#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30559#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:47,389 INFO L273 TraceCheckUtils]: 47: Hoare triple {30559#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30560#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:47,389 INFO L273 TraceCheckUtils]: 48: Hoare triple {30560#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30560#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:47,390 INFO L273 TraceCheckUtils]: 49: Hoare triple {30560#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30561#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:47,390 INFO L273 TraceCheckUtils]: 50: Hoare triple {30561#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30561#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:47,391 INFO L273 TraceCheckUtils]: 51: Hoare triple {30561#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30562#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:47,392 INFO L273 TraceCheckUtils]: 52: Hoare triple {30562#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30562#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:47,392 INFO L273 TraceCheckUtils]: 53: Hoare triple {30562#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30563#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:47,393 INFO L273 TraceCheckUtils]: 54: Hoare triple {30563#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30563#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:47,394 INFO L273 TraceCheckUtils]: 55: Hoare triple {30563#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30564#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:47,394 INFO L273 TraceCheckUtils]: 56: Hoare triple {30564#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30564#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:47,395 INFO L273 TraceCheckUtils]: 57: Hoare triple {30564#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30565#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:47,395 INFO L273 TraceCheckUtils]: 58: Hoare triple {30565#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30565#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:47,396 INFO L273 TraceCheckUtils]: 59: Hoare triple {30565#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30566#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:47,397 INFO L273 TraceCheckUtils]: 60: Hoare triple {30566#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30566#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:47,397 INFO L273 TraceCheckUtils]: 61: Hoare triple {30566#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30567#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:47,398 INFO L273 TraceCheckUtils]: 62: Hoare triple {30567#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30567#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:47,399 INFO L273 TraceCheckUtils]: 63: Hoare triple {30567#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30568#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:47,399 INFO L273 TraceCheckUtils]: 64: Hoare triple {30568#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30568#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:47,400 INFO L273 TraceCheckUtils]: 65: Hoare triple {30568#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30569#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:47,400 INFO L273 TraceCheckUtils]: 66: Hoare triple {30569#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30569#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:47,401 INFO L273 TraceCheckUtils]: 67: Hoare triple {30569#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30570#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:47,401 INFO L273 TraceCheckUtils]: 68: Hoare triple {30570#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30570#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:47,402 INFO L273 TraceCheckUtils]: 69: Hoare triple {30570#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30571#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:47,403 INFO L273 TraceCheckUtils]: 70: Hoare triple {30571#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30571#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:47,403 INFO L273 TraceCheckUtils]: 71: Hoare triple {30571#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30572#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:47,404 INFO L273 TraceCheckUtils]: 72: Hoare triple {30572#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30572#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:47,405 INFO L273 TraceCheckUtils]: 73: Hoare triple {30572#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30573#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:47,405 INFO L273 TraceCheckUtils]: 74: Hoare triple {30573#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30573#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:47,406 INFO L273 TraceCheckUtils]: 75: Hoare triple {30573#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30574#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:47,406 INFO L273 TraceCheckUtils]: 76: Hoare triple {30574#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30574#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:47,407 INFO L273 TraceCheckUtils]: 77: Hoare triple {30574#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30575#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:47,407 INFO L273 TraceCheckUtils]: 78: Hoare triple {30575#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30575#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:47,408 INFO L273 TraceCheckUtils]: 79: Hoare triple {30575#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30576#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:47,409 INFO L273 TraceCheckUtils]: 80: Hoare triple {30576#(<= main_~i~1 37)} assume !(~i~1 < 1000); {30538#false} is VALID [2018-11-23 12:28:47,409 INFO L256 TraceCheckUtils]: 81: Hoare triple {30538#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {30537#true} is VALID [2018-11-23 12:28:47,409 INFO L273 TraceCheckUtils]: 82: Hoare triple {30537#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30537#true} is VALID [2018-11-23 12:28:47,409 INFO L273 TraceCheckUtils]: 83: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,409 INFO L273 TraceCheckUtils]: 84: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,410 INFO L273 TraceCheckUtils]: 85: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,410 INFO L273 TraceCheckUtils]: 86: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,410 INFO L273 TraceCheckUtils]: 87: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,410 INFO L273 TraceCheckUtils]: 88: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,410 INFO L273 TraceCheckUtils]: 89: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,411 INFO L273 TraceCheckUtils]: 90: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,411 INFO L273 TraceCheckUtils]: 91: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,411 INFO L273 TraceCheckUtils]: 92: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,411 INFO L273 TraceCheckUtils]: 93: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,411 INFO L273 TraceCheckUtils]: 94: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,411 INFO L273 TraceCheckUtils]: 95: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,412 INFO L273 TraceCheckUtils]: 96: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,412 INFO L273 TraceCheckUtils]: 97: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,412 INFO L273 TraceCheckUtils]: 98: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,412 INFO L273 TraceCheckUtils]: 99: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,412 INFO L273 TraceCheckUtils]: 100: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,412 INFO L273 TraceCheckUtils]: 101: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,413 INFO L273 TraceCheckUtils]: 102: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,413 INFO L273 TraceCheckUtils]: 103: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,413 INFO L273 TraceCheckUtils]: 104: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,413 INFO L273 TraceCheckUtils]: 105: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,413 INFO L273 TraceCheckUtils]: 106: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,413 INFO L273 TraceCheckUtils]: 107: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,414 INFO L273 TraceCheckUtils]: 108: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,414 INFO L273 TraceCheckUtils]: 109: Hoare triple {30537#true} assume !(~i~0 < 1000); {30537#true} is VALID [2018-11-23 12:28:47,414 INFO L273 TraceCheckUtils]: 110: Hoare triple {30537#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {30537#true} is VALID [2018-11-23 12:28:47,414 INFO L273 TraceCheckUtils]: 111: Hoare triple {30537#true} assume true; {30537#true} is VALID [2018-11-23 12:28:47,414 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {30537#true} {30538#false} #70#return; {30538#false} is VALID [2018-11-23 12:28:47,414 INFO L273 TraceCheckUtils]: 113: Hoare triple {30538#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {30538#false} is VALID [2018-11-23 12:28:47,414 INFO L256 TraceCheckUtils]: 114: Hoare triple {30538#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {30537#true} is VALID [2018-11-23 12:28:47,415 INFO L273 TraceCheckUtils]: 115: Hoare triple {30537#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30537#true} is VALID [2018-11-23 12:28:47,415 INFO L273 TraceCheckUtils]: 116: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,415 INFO L273 TraceCheckUtils]: 117: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,415 INFO L273 TraceCheckUtils]: 118: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,415 INFO L273 TraceCheckUtils]: 119: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,415 INFO L273 TraceCheckUtils]: 120: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,415 INFO L273 TraceCheckUtils]: 121: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,415 INFO L273 TraceCheckUtils]: 122: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,415 INFO L273 TraceCheckUtils]: 123: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,415 INFO L273 TraceCheckUtils]: 124: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,416 INFO L273 TraceCheckUtils]: 125: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,416 INFO L273 TraceCheckUtils]: 126: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,416 INFO L273 TraceCheckUtils]: 127: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,416 INFO L273 TraceCheckUtils]: 128: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,416 INFO L273 TraceCheckUtils]: 129: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,416 INFO L273 TraceCheckUtils]: 130: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,416 INFO L273 TraceCheckUtils]: 131: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,416 INFO L273 TraceCheckUtils]: 132: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,416 INFO L273 TraceCheckUtils]: 133: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,416 INFO L273 TraceCheckUtils]: 134: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,417 INFO L273 TraceCheckUtils]: 135: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,417 INFO L273 TraceCheckUtils]: 136: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,417 INFO L273 TraceCheckUtils]: 137: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,417 INFO L273 TraceCheckUtils]: 138: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,417 INFO L273 TraceCheckUtils]: 139: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,417 INFO L273 TraceCheckUtils]: 140: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,417 INFO L273 TraceCheckUtils]: 141: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,417 INFO L273 TraceCheckUtils]: 142: Hoare triple {30537#true} assume !(~i~0 < 1000); {30537#true} is VALID [2018-11-23 12:28:47,417 INFO L273 TraceCheckUtils]: 143: Hoare triple {30537#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {30537#true} is VALID [2018-11-23 12:28:47,418 INFO L273 TraceCheckUtils]: 144: Hoare triple {30537#true} assume true; {30537#true} is VALID [2018-11-23 12:28:47,418 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {30537#true} {30538#false} #72#return; {30538#false} is VALID [2018-11-23 12:28:47,418 INFO L273 TraceCheckUtils]: 146: Hoare triple {30538#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {30538#false} is VALID [2018-11-23 12:28:47,418 INFO L273 TraceCheckUtils]: 147: Hoare triple {30538#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30538#false} is VALID [2018-11-23 12:28:47,418 INFO L273 TraceCheckUtils]: 148: Hoare triple {30538#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30538#false} is VALID [2018-11-23 12:28:47,418 INFO L273 TraceCheckUtils]: 149: Hoare triple {30538#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30538#false} is VALID [2018-11-23 12:28:47,418 INFO L273 TraceCheckUtils]: 150: Hoare triple {30538#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30538#false} is VALID [2018-11-23 12:28:47,418 INFO L273 TraceCheckUtils]: 151: Hoare triple {30538#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30538#false} is VALID [2018-11-23 12:28:47,418 INFO L273 TraceCheckUtils]: 152: Hoare triple {30538#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30538#false} is VALID [2018-11-23 12:28:47,418 INFO L273 TraceCheckUtils]: 153: Hoare triple {30538#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30538#false} is VALID [2018-11-23 12:28:47,419 INFO L273 TraceCheckUtils]: 154: Hoare triple {30538#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30538#false} is VALID [2018-11-23 12:28:47,419 INFO L273 TraceCheckUtils]: 155: Hoare triple {30538#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30538#false} is VALID [2018-11-23 12:28:47,419 INFO L273 TraceCheckUtils]: 156: Hoare triple {30538#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30538#false} is VALID [2018-11-23 12:28:47,419 INFO L273 TraceCheckUtils]: 157: Hoare triple {30538#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30538#false} is VALID [2018-11-23 12:28:47,419 INFO L273 TraceCheckUtils]: 158: Hoare triple {30538#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30538#false} is VALID [2018-11-23 12:28:47,419 INFO L273 TraceCheckUtils]: 159: Hoare triple {30538#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30538#false} is VALID [2018-11-23 12:28:47,419 INFO L273 TraceCheckUtils]: 160: Hoare triple {30538#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30538#false} is VALID [2018-11-23 12:28:47,419 INFO L273 TraceCheckUtils]: 161: Hoare triple {30538#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30538#false} is VALID [2018-11-23 12:28:47,419 INFO L273 TraceCheckUtils]: 162: Hoare triple {30538#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30538#false} is VALID [2018-11-23 12:28:47,419 INFO L273 TraceCheckUtils]: 163: Hoare triple {30538#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30538#false} is VALID [2018-11-23 12:28:47,420 INFO L273 TraceCheckUtils]: 164: Hoare triple {30538#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30538#false} is VALID [2018-11-23 12:28:47,420 INFO L273 TraceCheckUtils]: 165: Hoare triple {30538#false} assume !(~i~2 < 999); {30538#false} is VALID [2018-11-23 12:28:47,420 INFO L273 TraceCheckUtils]: 166: Hoare triple {30538#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {30538#false} is VALID [2018-11-23 12:28:47,420 INFO L256 TraceCheckUtils]: 167: Hoare triple {30538#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {30537#true} is VALID [2018-11-23 12:28:47,420 INFO L273 TraceCheckUtils]: 168: Hoare triple {30537#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30537#true} is VALID [2018-11-23 12:28:47,420 INFO L273 TraceCheckUtils]: 169: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,420 INFO L273 TraceCheckUtils]: 170: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,420 INFO L273 TraceCheckUtils]: 171: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,420 INFO L273 TraceCheckUtils]: 172: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,420 INFO L273 TraceCheckUtils]: 173: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,421 INFO L273 TraceCheckUtils]: 174: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,421 INFO L273 TraceCheckUtils]: 175: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,421 INFO L273 TraceCheckUtils]: 176: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,421 INFO L273 TraceCheckUtils]: 177: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,421 INFO L273 TraceCheckUtils]: 178: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,421 INFO L273 TraceCheckUtils]: 179: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,421 INFO L273 TraceCheckUtils]: 180: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,421 INFO L273 TraceCheckUtils]: 181: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,421 INFO L273 TraceCheckUtils]: 182: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,422 INFO L273 TraceCheckUtils]: 183: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,422 INFO L273 TraceCheckUtils]: 184: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,422 INFO L273 TraceCheckUtils]: 185: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,422 INFO L273 TraceCheckUtils]: 186: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,422 INFO L273 TraceCheckUtils]: 187: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,422 INFO L273 TraceCheckUtils]: 188: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,422 INFO L273 TraceCheckUtils]: 189: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,422 INFO L273 TraceCheckUtils]: 190: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,422 INFO L273 TraceCheckUtils]: 191: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,422 INFO L273 TraceCheckUtils]: 192: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,423 INFO L273 TraceCheckUtils]: 193: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:47,423 INFO L273 TraceCheckUtils]: 194: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:47,423 INFO L273 TraceCheckUtils]: 195: Hoare triple {30537#true} assume !(~i~0 < 1000); {30537#true} is VALID [2018-11-23 12:28:47,423 INFO L273 TraceCheckUtils]: 196: Hoare triple {30537#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {30537#true} is VALID [2018-11-23 12:28:47,423 INFO L273 TraceCheckUtils]: 197: Hoare triple {30537#true} assume true; {30537#true} is VALID [2018-11-23 12:28:47,423 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {30537#true} {30538#false} #74#return; {30538#false} is VALID [2018-11-23 12:28:47,423 INFO L273 TraceCheckUtils]: 199: Hoare triple {30538#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {30538#false} is VALID [2018-11-23 12:28:47,423 INFO L273 TraceCheckUtils]: 200: Hoare triple {30538#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {30538#false} is VALID [2018-11-23 12:28:47,423 INFO L273 TraceCheckUtils]: 201: Hoare triple {30538#false} assume !false; {30538#false} is VALID [2018-11-23 12:28:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1695 trivial. 0 not checked. [2018-11-23 12:28:47,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:47,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:47,450 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:49,104 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-11-23 12:28:49,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:49,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:49,751 INFO L256 TraceCheckUtils]: 0: Hoare triple {30537#true} call ULTIMATE.init(); {30537#true} is VALID [2018-11-23 12:28:49,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {30537#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30537#true} is VALID [2018-11-23 12:28:49,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {30537#true} assume true; {30537#true} is VALID [2018-11-23 12:28:49,751 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30537#true} {30537#true} #66#return; {30537#true} is VALID [2018-11-23 12:28:49,751 INFO L256 TraceCheckUtils]: 4: Hoare triple {30537#true} call #t~ret12 := main(); {30537#true} is VALID [2018-11-23 12:28:49,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {30537#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30537#true} is VALID [2018-11-23 12:28:49,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,752 INFO L273 TraceCheckUtils]: 7: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,752 INFO L273 TraceCheckUtils]: 11: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,752 INFO L273 TraceCheckUtils]: 12: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,753 INFO L273 TraceCheckUtils]: 16: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,753 INFO L273 TraceCheckUtils]: 17: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,753 INFO L273 TraceCheckUtils]: 18: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,753 INFO L273 TraceCheckUtils]: 19: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,753 INFO L273 TraceCheckUtils]: 20: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,754 INFO L273 TraceCheckUtils]: 21: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,754 INFO L273 TraceCheckUtils]: 22: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,754 INFO L273 TraceCheckUtils]: 23: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,754 INFO L273 TraceCheckUtils]: 24: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,754 INFO L273 TraceCheckUtils]: 25: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,755 INFO L273 TraceCheckUtils]: 26: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,755 INFO L273 TraceCheckUtils]: 27: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,755 INFO L273 TraceCheckUtils]: 28: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,755 INFO L273 TraceCheckUtils]: 29: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,755 INFO L273 TraceCheckUtils]: 30: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,755 INFO L273 TraceCheckUtils]: 31: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,755 INFO L273 TraceCheckUtils]: 32: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,755 INFO L273 TraceCheckUtils]: 33: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,755 INFO L273 TraceCheckUtils]: 34: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,756 INFO L273 TraceCheckUtils]: 35: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,756 INFO L273 TraceCheckUtils]: 36: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,756 INFO L273 TraceCheckUtils]: 37: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,756 INFO L273 TraceCheckUtils]: 38: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,756 INFO L273 TraceCheckUtils]: 39: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,756 INFO L273 TraceCheckUtils]: 40: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,756 INFO L273 TraceCheckUtils]: 41: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,756 INFO L273 TraceCheckUtils]: 42: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,756 INFO L273 TraceCheckUtils]: 43: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,756 INFO L273 TraceCheckUtils]: 44: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,757 INFO L273 TraceCheckUtils]: 45: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,757 INFO L273 TraceCheckUtils]: 46: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,757 INFO L273 TraceCheckUtils]: 47: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,757 INFO L273 TraceCheckUtils]: 48: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,757 INFO L273 TraceCheckUtils]: 49: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,757 INFO L273 TraceCheckUtils]: 50: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,757 INFO L273 TraceCheckUtils]: 51: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,757 INFO L273 TraceCheckUtils]: 52: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,757 INFO L273 TraceCheckUtils]: 53: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,757 INFO L273 TraceCheckUtils]: 54: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,758 INFO L273 TraceCheckUtils]: 55: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,758 INFO L273 TraceCheckUtils]: 56: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,758 INFO L273 TraceCheckUtils]: 57: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,758 INFO L273 TraceCheckUtils]: 58: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,758 INFO L273 TraceCheckUtils]: 59: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,758 INFO L273 TraceCheckUtils]: 60: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,758 INFO L273 TraceCheckUtils]: 61: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,758 INFO L273 TraceCheckUtils]: 62: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,758 INFO L273 TraceCheckUtils]: 63: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,758 INFO L273 TraceCheckUtils]: 64: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,759 INFO L273 TraceCheckUtils]: 65: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,759 INFO L273 TraceCheckUtils]: 66: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,759 INFO L273 TraceCheckUtils]: 67: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,759 INFO L273 TraceCheckUtils]: 68: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,759 INFO L273 TraceCheckUtils]: 69: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,759 INFO L273 TraceCheckUtils]: 70: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,759 INFO L273 TraceCheckUtils]: 71: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,759 INFO L273 TraceCheckUtils]: 72: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,759 INFO L273 TraceCheckUtils]: 73: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,759 INFO L273 TraceCheckUtils]: 74: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,760 INFO L273 TraceCheckUtils]: 75: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,760 INFO L273 TraceCheckUtils]: 76: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,760 INFO L273 TraceCheckUtils]: 77: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,760 INFO L273 TraceCheckUtils]: 78: Hoare triple {30537#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30537#true} is VALID [2018-11-23 12:28:49,760 INFO L273 TraceCheckUtils]: 79: Hoare triple {30537#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30537#true} is VALID [2018-11-23 12:28:49,760 INFO L273 TraceCheckUtils]: 80: Hoare triple {30537#true} assume !(~i~1 < 1000); {30537#true} is VALID [2018-11-23 12:28:49,760 INFO L256 TraceCheckUtils]: 81: Hoare triple {30537#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {30537#true} is VALID [2018-11-23 12:28:49,760 INFO L273 TraceCheckUtils]: 82: Hoare triple {30537#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30537#true} is VALID [2018-11-23 12:28:49,760 INFO L273 TraceCheckUtils]: 83: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,760 INFO L273 TraceCheckUtils]: 84: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,761 INFO L273 TraceCheckUtils]: 85: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,761 INFO L273 TraceCheckUtils]: 86: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,761 INFO L273 TraceCheckUtils]: 87: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,761 INFO L273 TraceCheckUtils]: 88: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,761 INFO L273 TraceCheckUtils]: 89: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,761 INFO L273 TraceCheckUtils]: 90: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,761 INFO L273 TraceCheckUtils]: 91: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,761 INFO L273 TraceCheckUtils]: 92: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,761 INFO L273 TraceCheckUtils]: 93: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,762 INFO L273 TraceCheckUtils]: 94: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,762 INFO L273 TraceCheckUtils]: 95: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,762 INFO L273 TraceCheckUtils]: 96: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,762 INFO L273 TraceCheckUtils]: 97: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,762 INFO L273 TraceCheckUtils]: 98: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,762 INFO L273 TraceCheckUtils]: 99: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,762 INFO L273 TraceCheckUtils]: 100: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,762 INFO L273 TraceCheckUtils]: 101: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,762 INFO L273 TraceCheckUtils]: 102: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,762 INFO L273 TraceCheckUtils]: 103: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,763 INFO L273 TraceCheckUtils]: 104: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,763 INFO L273 TraceCheckUtils]: 105: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,763 INFO L273 TraceCheckUtils]: 106: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,763 INFO L273 TraceCheckUtils]: 107: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,763 INFO L273 TraceCheckUtils]: 108: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,763 INFO L273 TraceCheckUtils]: 109: Hoare triple {30537#true} assume !(~i~0 < 1000); {30537#true} is VALID [2018-11-23 12:28:49,763 INFO L273 TraceCheckUtils]: 110: Hoare triple {30537#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {30537#true} is VALID [2018-11-23 12:28:49,763 INFO L273 TraceCheckUtils]: 111: Hoare triple {30537#true} assume true; {30537#true} is VALID [2018-11-23 12:28:49,763 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {30537#true} {30537#true} #70#return; {30537#true} is VALID [2018-11-23 12:28:49,763 INFO L273 TraceCheckUtils]: 113: Hoare triple {30537#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {30537#true} is VALID [2018-11-23 12:28:49,764 INFO L256 TraceCheckUtils]: 114: Hoare triple {30537#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {30537#true} is VALID [2018-11-23 12:28:49,764 INFO L273 TraceCheckUtils]: 115: Hoare triple {30537#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30537#true} is VALID [2018-11-23 12:28:49,764 INFO L273 TraceCheckUtils]: 116: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,764 INFO L273 TraceCheckUtils]: 117: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,764 INFO L273 TraceCheckUtils]: 118: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,764 INFO L273 TraceCheckUtils]: 119: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,764 INFO L273 TraceCheckUtils]: 120: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,764 INFO L273 TraceCheckUtils]: 121: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,764 INFO L273 TraceCheckUtils]: 122: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,764 INFO L273 TraceCheckUtils]: 123: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,765 INFO L273 TraceCheckUtils]: 124: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,765 INFO L273 TraceCheckUtils]: 125: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,765 INFO L273 TraceCheckUtils]: 126: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,765 INFO L273 TraceCheckUtils]: 127: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,765 INFO L273 TraceCheckUtils]: 128: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,765 INFO L273 TraceCheckUtils]: 129: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,765 INFO L273 TraceCheckUtils]: 130: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,765 INFO L273 TraceCheckUtils]: 131: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,765 INFO L273 TraceCheckUtils]: 132: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,766 INFO L273 TraceCheckUtils]: 133: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,766 INFO L273 TraceCheckUtils]: 134: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,766 INFO L273 TraceCheckUtils]: 135: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,766 INFO L273 TraceCheckUtils]: 136: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,766 INFO L273 TraceCheckUtils]: 137: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,766 INFO L273 TraceCheckUtils]: 138: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,766 INFO L273 TraceCheckUtils]: 139: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,766 INFO L273 TraceCheckUtils]: 140: Hoare triple {30537#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30537#true} is VALID [2018-11-23 12:28:49,766 INFO L273 TraceCheckUtils]: 141: Hoare triple {30537#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30537#true} is VALID [2018-11-23 12:28:49,766 INFO L273 TraceCheckUtils]: 142: Hoare triple {30537#true} assume !(~i~0 < 1000); {30537#true} is VALID [2018-11-23 12:28:49,767 INFO L273 TraceCheckUtils]: 143: Hoare triple {30537#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {30537#true} is VALID [2018-11-23 12:28:49,767 INFO L273 TraceCheckUtils]: 144: Hoare triple {30537#true} assume true; {30537#true} is VALID [2018-11-23 12:28:49,767 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {30537#true} {30537#true} #72#return; {30537#true} is VALID [2018-11-23 12:28:49,767 INFO L273 TraceCheckUtils]: 146: Hoare triple {30537#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {31018#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:49,768 INFO L273 TraceCheckUtils]: 147: Hoare triple {31018#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31018#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:49,771 INFO L273 TraceCheckUtils]: 148: Hoare triple {31018#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31025#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:49,771 INFO L273 TraceCheckUtils]: 149: Hoare triple {31025#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31025#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:49,773 INFO L273 TraceCheckUtils]: 150: Hoare triple {31025#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31032#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:49,775 INFO L273 TraceCheckUtils]: 151: Hoare triple {31032#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31032#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:49,777 INFO L273 TraceCheckUtils]: 152: Hoare triple {31032#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31039#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:49,779 INFO L273 TraceCheckUtils]: 153: Hoare triple {31039#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31039#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:49,779 INFO L273 TraceCheckUtils]: 154: Hoare triple {31039#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31046#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:49,782 INFO L273 TraceCheckUtils]: 155: Hoare triple {31046#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31046#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:49,782 INFO L273 TraceCheckUtils]: 156: Hoare triple {31046#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31053#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:49,784 INFO L273 TraceCheckUtils]: 157: Hoare triple {31053#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31053#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:49,784 INFO L273 TraceCheckUtils]: 158: Hoare triple {31053#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31060#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:49,786 INFO L273 TraceCheckUtils]: 159: Hoare triple {31060#(<= main_~i~2 6)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31060#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:49,786 INFO L273 TraceCheckUtils]: 160: Hoare triple {31060#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31067#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:49,788 INFO L273 TraceCheckUtils]: 161: Hoare triple {31067#(<= main_~i~2 7)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31067#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:49,788 INFO L273 TraceCheckUtils]: 162: Hoare triple {31067#(<= main_~i~2 7)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31074#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:49,790 INFO L273 TraceCheckUtils]: 163: Hoare triple {31074#(<= main_~i~2 8)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31074#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:49,790 INFO L273 TraceCheckUtils]: 164: Hoare triple {31074#(<= main_~i~2 8)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31081#(<= main_~i~2 9)} is VALID [2018-11-23 12:28:49,793 INFO L273 TraceCheckUtils]: 165: Hoare triple {31081#(<= main_~i~2 9)} assume !(~i~2 < 999); {30538#false} is VALID [2018-11-23 12:28:49,793 INFO L273 TraceCheckUtils]: 166: Hoare triple {30538#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {30538#false} is VALID [2018-11-23 12:28:49,793 INFO L256 TraceCheckUtils]: 167: Hoare triple {30538#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {30538#false} is VALID [2018-11-23 12:28:49,793 INFO L273 TraceCheckUtils]: 168: Hoare triple {30538#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30538#false} is VALID [2018-11-23 12:28:49,793 INFO L273 TraceCheckUtils]: 169: Hoare triple {30538#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30538#false} is VALID [2018-11-23 12:28:49,793 INFO L273 TraceCheckUtils]: 170: Hoare triple {30538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30538#false} is VALID [2018-11-23 12:28:49,793 INFO L273 TraceCheckUtils]: 171: Hoare triple {30538#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30538#false} is VALID [2018-11-23 12:28:49,793 INFO L273 TraceCheckUtils]: 172: Hoare triple {30538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30538#false} is VALID [2018-11-23 12:28:49,794 INFO L273 TraceCheckUtils]: 173: Hoare triple {30538#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30538#false} is VALID [2018-11-23 12:28:49,794 INFO L273 TraceCheckUtils]: 174: Hoare triple {30538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30538#false} is VALID [2018-11-23 12:28:49,794 INFO L273 TraceCheckUtils]: 175: Hoare triple {30538#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30538#false} is VALID [2018-11-23 12:28:49,794 INFO L273 TraceCheckUtils]: 176: Hoare triple {30538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30538#false} is VALID [2018-11-23 12:28:49,794 INFO L273 TraceCheckUtils]: 177: Hoare triple {30538#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30538#false} is VALID [2018-11-23 12:28:49,794 INFO L273 TraceCheckUtils]: 178: Hoare triple {30538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30538#false} is VALID [2018-11-23 12:28:49,794 INFO L273 TraceCheckUtils]: 179: Hoare triple {30538#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30538#false} is VALID [2018-11-23 12:28:49,794 INFO L273 TraceCheckUtils]: 180: Hoare triple {30538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30538#false} is VALID [2018-11-23 12:28:49,794 INFO L273 TraceCheckUtils]: 181: Hoare triple {30538#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30538#false} is VALID [2018-11-23 12:28:49,794 INFO L273 TraceCheckUtils]: 182: Hoare triple {30538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30538#false} is VALID [2018-11-23 12:28:49,795 INFO L273 TraceCheckUtils]: 183: Hoare triple {30538#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30538#false} is VALID [2018-11-23 12:28:49,795 INFO L273 TraceCheckUtils]: 184: Hoare triple {30538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30538#false} is VALID [2018-11-23 12:28:49,795 INFO L273 TraceCheckUtils]: 185: Hoare triple {30538#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30538#false} is VALID [2018-11-23 12:28:49,795 INFO L273 TraceCheckUtils]: 186: Hoare triple {30538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30538#false} is VALID [2018-11-23 12:28:49,795 INFO L273 TraceCheckUtils]: 187: Hoare triple {30538#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30538#false} is VALID [2018-11-23 12:28:49,795 INFO L273 TraceCheckUtils]: 188: Hoare triple {30538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30538#false} is VALID [2018-11-23 12:28:49,795 INFO L273 TraceCheckUtils]: 189: Hoare triple {30538#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30538#false} is VALID [2018-11-23 12:28:49,795 INFO L273 TraceCheckUtils]: 190: Hoare triple {30538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30538#false} is VALID [2018-11-23 12:28:49,795 INFO L273 TraceCheckUtils]: 191: Hoare triple {30538#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30538#false} is VALID [2018-11-23 12:28:49,795 INFO L273 TraceCheckUtils]: 192: Hoare triple {30538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30538#false} is VALID [2018-11-23 12:28:49,796 INFO L273 TraceCheckUtils]: 193: Hoare triple {30538#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30538#false} is VALID [2018-11-23 12:28:49,796 INFO L273 TraceCheckUtils]: 194: Hoare triple {30538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30538#false} is VALID [2018-11-23 12:28:49,796 INFO L273 TraceCheckUtils]: 195: Hoare triple {30538#false} assume !(~i~0 < 1000); {30538#false} is VALID [2018-11-23 12:28:49,796 INFO L273 TraceCheckUtils]: 196: Hoare triple {30538#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {30538#false} is VALID [2018-11-23 12:28:49,796 INFO L273 TraceCheckUtils]: 197: Hoare triple {30538#false} assume true; {30538#false} is VALID [2018-11-23 12:28:49,796 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {30538#false} {30538#false} #74#return; {30538#false} is VALID [2018-11-23 12:28:49,796 INFO L273 TraceCheckUtils]: 199: Hoare triple {30538#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {30538#false} is VALID [2018-11-23 12:28:49,796 INFO L273 TraceCheckUtils]: 200: Hoare triple {30538#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {30538#false} is VALID [2018-11-23 12:28:49,796 INFO L273 TraceCheckUtils]: 201: Hoare triple {30538#false} assume !false; {30538#false} is VALID [2018-11-23 12:28:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 738 proven. 81 refuted. 0 times theorem prover too weak. 2245 trivial. 0 not checked. [2018-11-23 12:28:49,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:49,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 12] total 50 [2018-11-23 12:28:49,832 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 202 [2018-11-23 12:28:49,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:49,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 12:28:50,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:50,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 12:28:50,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 12:28:50,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1605, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:28:50,036 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand 50 states. [2018-11-23 12:28:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:51,454 INFO L93 Difference]: Finished difference Result 207 states and 216 transitions. [2018-11-23 12:28:51,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 12:28:51,454 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 202 [2018-11-23 12:28:51,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:28:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 149 transitions. [2018-11-23 12:28:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:28:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 149 transitions. [2018-11-23 12:28:51,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 149 transitions. [2018-11-23 12:28:51,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:51,609 INFO L225 Difference]: With dead ends: 207 [2018-11-23 12:28:51,609 INFO L226 Difference]: Without dead ends: 147 [2018-11-23 12:28:51,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=845, Invalid=1605, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:28:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-23 12:28:51,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-23 12:28:51,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:51,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 145 states. [2018-11-23 12:28:51,717 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 145 states. [2018-11-23 12:28:51,717 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 145 states. [2018-11-23 12:28:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:51,720 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-11-23 12:28:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-11-23 12:28:51,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:51,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:51,720 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 147 states. [2018-11-23 12:28:51,720 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 147 states. [2018-11-23 12:28:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:51,722 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-11-23 12:28:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-11-23 12:28:51,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:51,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:51,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:51,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:51,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 12:28:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2018-11-23 12:28:51,725 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 202 [2018-11-23 12:28:51,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:51,725 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-11-23 12:28:51,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 12:28:51,725 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:28:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-23 12:28:51,726 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:51,726 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 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:28:51,726 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:51,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:51,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1268079623, now seen corresponding path program 37 times [2018-11-23 12:28:51,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:51,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:51,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:51,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:51,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:52,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {32010#true} call ULTIMATE.init(); {32010#true} is VALID [2018-11-23 12:28:52,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {32010#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32010#true} is VALID [2018-11-23 12:28:52,596 INFO L273 TraceCheckUtils]: 2: Hoare triple {32010#true} assume true; {32010#true} is VALID [2018-11-23 12:28:52,596 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32010#true} {32010#true} #66#return; {32010#true} is VALID [2018-11-23 12:28:52,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {32010#true} call #t~ret12 := main(); {32010#true} is VALID [2018-11-23 12:28:52,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {32010#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {32012#(= main_~i~1 0)} is VALID [2018-11-23 12:28:52,598 INFO L273 TraceCheckUtils]: 6: Hoare triple {32012#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32012#(= main_~i~1 0)} is VALID [2018-11-23 12:28:52,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {32012#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32013#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:52,599 INFO L273 TraceCheckUtils]: 8: Hoare triple {32013#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32013#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:52,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {32013#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32014#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:52,600 INFO L273 TraceCheckUtils]: 10: Hoare triple {32014#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32014#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:52,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {32014#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32015#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:52,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {32015#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32015#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:52,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {32015#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32016#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:52,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {32016#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32016#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:52,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {32016#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32017#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:52,604 INFO L273 TraceCheckUtils]: 16: Hoare triple {32017#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32017#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:52,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {32017#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32018#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:52,605 INFO L273 TraceCheckUtils]: 18: Hoare triple {32018#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32018#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:52,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {32018#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32019#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:52,606 INFO L273 TraceCheckUtils]: 20: Hoare triple {32019#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32019#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:52,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {32019#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32020#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:52,608 INFO L273 TraceCheckUtils]: 22: Hoare triple {32020#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32020#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:52,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {32020#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32021#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:52,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {32021#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32021#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:52,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {32021#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32022#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:52,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {32022#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32022#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:52,611 INFO L273 TraceCheckUtils]: 27: Hoare triple {32022#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32023#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:52,611 INFO L273 TraceCheckUtils]: 28: Hoare triple {32023#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32023#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:52,612 INFO L273 TraceCheckUtils]: 29: Hoare triple {32023#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32024#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:52,612 INFO L273 TraceCheckUtils]: 30: Hoare triple {32024#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32024#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:52,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {32024#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32025#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:52,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {32025#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32025#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:52,614 INFO L273 TraceCheckUtils]: 33: Hoare triple {32025#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32026#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:52,615 INFO L273 TraceCheckUtils]: 34: Hoare triple {32026#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32026#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:52,616 INFO L273 TraceCheckUtils]: 35: Hoare triple {32026#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32027#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:52,616 INFO L273 TraceCheckUtils]: 36: Hoare triple {32027#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32027#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:52,617 INFO L273 TraceCheckUtils]: 37: Hoare triple {32027#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32028#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:52,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {32028#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32028#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:52,618 INFO L273 TraceCheckUtils]: 39: Hoare triple {32028#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32029#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:52,619 INFO L273 TraceCheckUtils]: 40: Hoare triple {32029#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32029#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:52,619 INFO L273 TraceCheckUtils]: 41: Hoare triple {32029#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32030#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:52,620 INFO L273 TraceCheckUtils]: 42: Hoare triple {32030#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32030#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:52,621 INFO L273 TraceCheckUtils]: 43: Hoare triple {32030#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32031#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:52,621 INFO L273 TraceCheckUtils]: 44: Hoare triple {32031#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32031#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:52,622 INFO L273 TraceCheckUtils]: 45: Hoare triple {32031#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32032#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:52,622 INFO L273 TraceCheckUtils]: 46: Hoare triple {32032#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32032#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:52,623 INFO L273 TraceCheckUtils]: 47: Hoare triple {32032#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32033#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:52,624 INFO L273 TraceCheckUtils]: 48: Hoare triple {32033#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32033#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:52,624 INFO L273 TraceCheckUtils]: 49: Hoare triple {32033#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32034#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:52,625 INFO L273 TraceCheckUtils]: 50: Hoare triple {32034#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32034#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:52,625 INFO L273 TraceCheckUtils]: 51: Hoare triple {32034#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32035#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:52,626 INFO L273 TraceCheckUtils]: 52: Hoare triple {32035#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32035#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:52,627 INFO L273 TraceCheckUtils]: 53: Hoare triple {32035#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32036#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:52,627 INFO L273 TraceCheckUtils]: 54: Hoare triple {32036#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32036#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:52,628 INFO L273 TraceCheckUtils]: 55: Hoare triple {32036#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32037#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:52,628 INFO L273 TraceCheckUtils]: 56: Hoare triple {32037#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32037#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:52,629 INFO L273 TraceCheckUtils]: 57: Hoare triple {32037#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32038#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:52,630 INFO L273 TraceCheckUtils]: 58: Hoare triple {32038#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32038#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:52,630 INFO L273 TraceCheckUtils]: 59: Hoare triple {32038#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32039#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:52,631 INFO L273 TraceCheckUtils]: 60: Hoare triple {32039#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32039#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:52,632 INFO L273 TraceCheckUtils]: 61: Hoare triple {32039#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32040#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:52,632 INFO L273 TraceCheckUtils]: 62: Hoare triple {32040#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32040#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:52,633 INFO L273 TraceCheckUtils]: 63: Hoare triple {32040#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32041#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:52,633 INFO L273 TraceCheckUtils]: 64: Hoare triple {32041#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32041#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:52,634 INFO L273 TraceCheckUtils]: 65: Hoare triple {32041#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32042#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:52,635 INFO L273 TraceCheckUtils]: 66: Hoare triple {32042#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32042#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:52,635 INFO L273 TraceCheckUtils]: 67: Hoare triple {32042#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32043#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:52,636 INFO L273 TraceCheckUtils]: 68: Hoare triple {32043#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32043#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:52,637 INFO L273 TraceCheckUtils]: 69: Hoare triple {32043#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32044#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:52,637 INFO L273 TraceCheckUtils]: 70: Hoare triple {32044#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32044#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:52,638 INFO L273 TraceCheckUtils]: 71: Hoare triple {32044#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32045#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:52,638 INFO L273 TraceCheckUtils]: 72: Hoare triple {32045#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32045#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:52,639 INFO L273 TraceCheckUtils]: 73: Hoare triple {32045#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32046#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:52,640 INFO L273 TraceCheckUtils]: 74: Hoare triple {32046#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32046#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:52,640 INFO L273 TraceCheckUtils]: 75: Hoare triple {32046#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32047#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:52,641 INFO L273 TraceCheckUtils]: 76: Hoare triple {32047#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32047#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:52,641 INFO L273 TraceCheckUtils]: 77: Hoare triple {32047#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32048#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:52,642 INFO L273 TraceCheckUtils]: 78: Hoare triple {32048#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32048#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:52,643 INFO L273 TraceCheckUtils]: 79: Hoare triple {32048#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32049#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:52,643 INFO L273 TraceCheckUtils]: 80: Hoare triple {32049#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32049#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:52,644 INFO L273 TraceCheckUtils]: 81: Hoare triple {32049#(<= main_~i~1 37)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32050#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:52,645 INFO L273 TraceCheckUtils]: 82: Hoare triple {32050#(<= main_~i~1 38)} assume !(~i~1 < 1000); {32011#false} is VALID [2018-11-23 12:28:52,645 INFO L256 TraceCheckUtils]: 83: Hoare triple {32011#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {32010#true} is VALID [2018-11-23 12:28:52,645 INFO L273 TraceCheckUtils]: 84: Hoare triple {32010#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {32010#true} is VALID [2018-11-23 12:28:52,645 INFO L273 TraceCheckUtils]: 85: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,645 INFO L273 TraceCheckUtils]: 86: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,646 INFO L273 TraceCheckUtils]: 87: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,646 INFO L273 TraceCheckUtils]: 88: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,646 INFO L273 TraceCheckUtils]: 89: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,646 INFO L273 TraceCheckUtils]: 90: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,646 INFO L273 TraceCheckUtils]: 91: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,646 INFO L273 TraceCheckUtils]: 92: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,647 INFO L273 TraceCheckUtils]: 93: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,647 INFO L273 TraceCheckUtils]: 94: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,647 INFO L273 TraceCheckUtils]: 95: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,647 INFO L273 TraceCheckUtils]: 96: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,647 INFO L273 TraceCheckUtils]: 97: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,648 INFO L273 TraceCheckUtils]: 98: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,648 INFO L273 TraceCheckUtils]: 99: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,648 INFO L273 TraceCheckUtils]: 100: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,648 INFO L273 TraceCheckUtils]: 101: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,648 INFO L273 TraceCheckUtils]: 102: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,648 INFO L273 TraceCheckUtils]: 103: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,649 INFO L273 TraceCheckUtils]: 104: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,649 INFO L273 TraceCheckUtils]: 105: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,649 INFO L273 TraceCheckUtils]: 106: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,649 INFO L273 TraceCheckUtils]: 107: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,649 INFO L273 TraceCheckUtils]: 108: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,649 INFO L273 TraceCheckUtils]: 109: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,650 INFO L273 TraceCheckUtils]: 110: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,650 INFO L273 TraceCheckUtils]: 111: Hoare triple {32010#true} assume !(~i~0 < 1000); {32010#true} is VALID [2018-11-23 12:28:52,650 INFO L273 TraceCheckUtils]: 112: Hoare triple {32010#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {32010#true} is VALID [2018-11-23 12:28:52,650 INFO L273 TraceCheckUtils]: 113: Hoare triple {32010#true} assume true; {32010#true} is VALID [2018-11-23 12:28:52,650 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {32010#true} {32011#false} #70#return; {32011#false} is VALID [2018-11-23 12:28:52,650 INFO L273 TraceCheckUtils]: 115: Hoare triple {32011#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {32011#false} is VALID [2018-11-23 12:28:52,650 INFO L256 TraceCheckUtils]: 116: Hoare triple {32011#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {32010#true} is VALID [2018-11-23 12:28:52,651 INFO L273 TraceCheckUtils]: 117: Hoare triple {32010#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {32010#true} is VALID [2018-11-23 12:28:52,651 INFO L273 TraceCheckUtils]: 118: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,651 INFO L273 TraceCheckUtils]: 119: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,651 INFO L273 TraceCheckUtils]: 120: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,651 INFO L273 TraceCheckUtils]: 121: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,651 INFO L273 TraceCheckUtils]: 122: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,651 INFO L273 TraceCheckUtils]: 123: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,651 INFO L273 TraceCheckUtils]: 124: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,651 INFO L273 TraceCheckUtils]: 125: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,651 INFO L273 TraceCheckUtils]: 126: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,652 INFO L273 TraceCheckUtils]: 127: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,652 INFO L273 TraceCheckUtils]: 128: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,652 INFO L273 TraceCheckUtils]: 129: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,652 INFO L273 TraceCheckUtils]: 130: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,652 INFO L273 TraceCheckUtils]: 131: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,652 INFO L273 TraceCheckUtils]: 132: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,652 INFO L273 TraceCheckUtils]: 133: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,652 INFO L273 TraceCheckUtils]: 134: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,652 INFO L273 TraceCheckUtils]: 135: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,652 INFO L273 TraceCheckUtils]: 136: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,653 INFO L273 TraceCheckUtils]: 137: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,653 INFO L273 TraceCheckUtils]: 138: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,653 INFO L273 TraceCheckUtils]: 139: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,653 INFO L273 TraceCheckUtils]: 140: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,653 INFO L273 TraceCheckUtils]: 141: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,653 INFO L273 TraceCheckUtils]: 142: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,653 INFO L273 TraceCheckUtils]: 143: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,653 INFO L273 TraceCheckUtils]: 144: Hoare triple {32010#true} assume !(~i~0 < 1000); {32010#true} is VALID [2018-11-23 12:28:52,653 INFO L273 TraceCheckUtils]: 145: Hoare triple {32010#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {32010#true} is VALID [2018-11-23 12:28:52,653 INFO L273 TraceCheckUtils]: 146: Hoare triple {32010#true} assume true; {32010#true} is VALID [2018-11-23 12:28:52,654 INFO L268 TraceCheckUtils]: 147: Hoare quadruple {32010#true} {32011#false} #72#return; {32011#false} is VALID [2018-11-23 12:28:52,654 INFO L273 TraceCheckUtils]: 148: Hoare triple {32011#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {32011#false} is VALID [2018-11-23 12:28:52,654 INFO L273 TraceCheckUtils]: 149: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:52,654 INFO L273 TraceCheckUtils]: 150: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:52,654 INFO L273 TraceCheckUtils]: 151: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:52,654 INFO L273 TraceCheckUtils]: 152: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:52,654 INFO L273 TraceCheckUtils]: 153: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:52,654 INFO L273 TraceCheckUtils]: 154: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:52,654 INFO L273 TraceCheckUtils]: 155: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:52,655 INFO L273 TraceCheckUtils]: 156: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:52,655 INFO L273 TraceCheckUtils]: 157: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:52,655 INFO L273 TraceCheckUtils]: 158: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:52,655 INFO L273 TraceCheckUtils]: 159: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:52,655 INFO L273 TraceCheckUtils]: 160: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:52,655 INFO L273 TraceCheckUtils]: 161: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:52,655 INFO L273 TraceCheckUtils]: 162: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:52,655 INFO L273 TraceCheckUtils]: 163: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:52,655 INFO L273 TraceCheckUtils]: 164: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:52,655 INFO L273 TraceCheckUtils]: 165: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:52,656 INFO L273 TraceCheckUtils]: 166: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:52,656 INFO L273 TraceCheckUtils]: 167: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:52,656 INFO L273 TraceCheckUtils]: 168: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:52,656 INFO L273 TraceCheckUtils]: 169: Hoare triple {32011#false} assume !(~i~2 < 999); {32011#false} is VALID [2018-11-23 12:28:52,656 INFO L273 TraceCheckUtils]: 170: Hoare triple {32011#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {32011#false} is VALID [2018-11-23 12:28:52,656 INFO L256 TraceCheckUtils]: 171: Hoare triple {32011#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {32010#true} is VALID [2018-11-23 12:28:52,656 INFO L273 TraceCheckUtils]: 172: Hoare triple {32010#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {32010#true} is VALID [2018-11-23 12:28:52,656 INFO L273 TraceCheckUtils]: 173: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,656 INFO L273 TraceCheckUtils]: 174: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,656 INFO L273 TraceCheckUtils]: 175: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,657 INFO L273 TraceCheckUtils]: 176: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,657 INFO L273 TraceCheckUtils]: 177: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,657 INFO L273 TraceCheckUtils]: 178: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,657 INFO L273 TraceCheckUtils]: 179: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,657 INFO L273 TraceCheckUtils]: 180: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,657 INFO L273 TraceCheckUtils]: 181: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,657 INFO L273 TraceCheckUtils]: 182: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,657 INFO L273 TraceCheckUtils]: 183: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,657 INFO L273 TraceCheckUtils]: 184: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,658 INFO L273 TraceCheckUtils]: 185: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,658 INFO L273 TraceCheckUtils]: 186: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,658 INFO L273 TraceCheckUtils]: 187: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,658 INFO L273 TraceCheckUtils]: 188: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,658 INFO L273 TraceCheckUtils]: 189: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,658 INFO L273 TraceCheckUtils]: 190: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,658 INFO L273 TraceCheckUtils]: 191: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,658 INFO L273 TraceCheckUtils]: 192: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,658 INFO L273 TraceCheckUtils]: 193: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,658 INFO L273 TraceCheckUtils]: 194: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,659 INFO L273 TraceCheckUtils]: 195: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,659 INFO L273 TraceCheckUtils]: 196: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,659 INFO L273 TraceCheckUtils]: 197: Hoare triple {32010#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32010#true} is VALID [2018-11-23 12:28:52,659 INFO L273 TraceCheckUtils]: 198: Hoare triple {32010#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32010#true} is VALID [2018-11-23 12:28:52,659 INFO L273 TraceCheckUtils]: 199: Hoare triple {32010#true} assume !(~i~0 < 1000); {32010#true} is VALID [2018-11-23 12:28:52,659 INFO L273 TraceCheckUtils]: 200: Hoare triple {32010#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {32010#true} is VALID [2018-11-23 12:28:52,659 INFO L273 TraceCheckUtils]: 201: Hoare triple {32010#true} assume true; {32010#true} is VALID [2018-11-23 12:28:52,659 INFO L268 TraceCheckUtils]: 202: Hoare quadruple {32010#true} {32011#false} #74#return; {32011#false} is VALID [2018-11-23 12:28:52,659 INFO L273 TraceCheckUtils]: 203: Hoare triple {32011#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {32011#false} is VALID [2018-11-23 12:28:52,659 INFO L273 TraceCheckUtils]: 204: Hoare triple {32011#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {32011#false} is VALID [2018-11-23 12:28:52,660 INFO L273 TraceCheckUtils]: 205: Hoare triple {32011#false} assume !false; {32011#false} is VALID [2018-11-23 12:28:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3158 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-11-23 12:28:52,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:52,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:52,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:52,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:53,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {32010#true} call ULTIMATE.init(); {32010#true} is VALID [2018-11-23 12:28:53,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {32010#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32010#true} is VALID [2018-11-23 12:28:53,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {32010#true} assume true; {32010#true} is VALID [2018-11-23 12:28:53,168 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32010#true} {32010#true} #66#return; {32010#true} is VALID [2018-11-23 12:28:53,168 INFO L256 TraceCheckUtils]: 4: Hoare triple {32010#true} call #t~ret12 := main(); {32010#true} is VALID [2018-11-23 12:28:53,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {32010#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {32069#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:53,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {32069#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32069#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:53,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {32069#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32013#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:53,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {32013#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32013#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:53,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {32013#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32014#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:53,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {32014#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32014#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:53,173 INFO L273 TraceCheckUtils]: 11: Hoare triple {32014#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32015#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:53,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {32015#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32015#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:53,174 INFO L273 TraceCheckUtils]: 13: Hoare triple {32015#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32016#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:53,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {32016#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32016#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:53,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {32016#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32017#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:53,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {32017#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32017#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:53,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {32017#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32018#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:53,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {32018#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32018#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:53,177 INFO L273 TraceCheckUtils]: 19: Hoare triple {32018#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32019#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:53,178 INFO L273 TraceCheckUtils]: 20: Hoare triple {32019#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32019#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:53,179 INFO L273 TraceCheckUtils]: 21: Hoare triple {32019#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32020#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:53,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {32020#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32020#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:53,180 INFO L273 TraceCheckUtils]: 23: Hoare triple {32020#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32021#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:53,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {32021#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32021#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:53,181 INFO L273 TraceCheckUtils]: 25: Hoare triple {32021#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32022#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:53,182 INFO L273 TraceCheckUtils]: 26: Hoare triple {32022#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32022#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:53,182 INFO L273 TraceCheckUtils]: 27: Hoare triple {32022#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32023#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:53,183 INFO L273 TraceCheckUtils]: 28: Hoare triple {32023#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32023#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:53,184 INFO L273 TraceCheckUtils]: 29: Hoare triple {32023#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32024#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:53,184 INFO L273 TraceCheckUtils]: 30: Hoare triple {32024#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32024#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:53,185 INFO L273 TraceCheckUtils]: 31: Hoare triple {32024#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32025#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:53,185 INFO L273 TraceCheckUtils]: 32: Hoare triple {32025#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32025#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:53,186 INFO L273 TraceCheckUtils]: 33: Hoare triple {32025#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32026#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:53,187 INFO L273 TraceCheckUtils]: 34: Hoare triple {32026#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32026#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:53,187 INFO L273 TraceCheckUtils]: 35: Hoare triple {32026#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32027#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:53,188 INFO L273 TraceCheckUtils]: 36: Hoare triple {32027#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32027#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:53,188 INFO L273 TraceCheckUtils]: 37: Hoare triple {32027#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32028#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:53,189 INFO L273 TraceCheckUtils]: 38: Hoare triple {32028#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32028#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:53,190 INFO L273 TraceCheckUtils]: 39: Hoare triple {32028#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32029#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:53,190 INFO L273 TraceCheckUtils]: 40: Hoare triple {32029#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32029#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:53,191 INFO L273 TraceCheckUtils]: 41: Hoare triple {32029#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32030#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:53,191 INFO L273 TraceCheckUtils]: 42: Hoare triple {32030#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32030#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:53,192 INFO L273 TraceCheckUtils]: 43: Hoare triple {32030#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32031#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:53,193 INFO L273 TraceCheckUtils]: 44: Hoare triple {32031#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32031#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:53,193 INFO L273 TraceCheckUtils]: 45: Hoare triple {32031#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32032#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:53,194 INFO L273 TraceCheckUtils]: 46: Hoare triple {32032#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32032#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:53,195 INFO L273 TraceCheckUtils]: 47: Hoare triple {32032#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32033#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:53,195 INFO L273 TraceCheckUtils]: 48: Hoare triple {32033#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32033#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:53,196 INFO L273 TraceCheckUtils]: 49: Hoare triple {32033#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32034#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:53,196 INFO L273 TraceCheckUtils]: 50: Hoare triple {32034#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32034#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:53,197 INFO L273 TraceCheckUtils]: 51: Hoare triple {32034#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32035#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:53,198 INFO L273 TraceCheckUtils]: 52: Hoare triple {32035#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32035#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:53,198 INFO L273 TraceCheckUtils]: 53: Hoare triple {32035#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32036#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:53,199 INFO L273 TraceCheckUtils]: 54: Hoare triple {32036#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32036#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:53,200 INFO L273 TraceCheckUtils]: 55: Hoare triple {32036#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32037#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:53,200 INFO L273 TraceCheckUtils]: 56: Hoare triple {32037#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32037#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:53,201 INFO L273 TraceCheckUtils]: 57: Hoare triple {32037#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32038#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:53,201 INFO L273 TraceCheckUtils]: 58: Hoare triple {32038#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32038#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:53,202 INFO L273 TraceCheckUtils]: 59: Hoare triple {32038#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32039#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:53,203 INFO L273 TraceCheckUtils]: 60: Hoare triple {32039#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32039#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:53,203 INFO L273 TraceCheckUtils]: 61: Hoare triple {32039#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32040#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:53,204 INFO L273 TraceCheckUtils]: 62: Hoare triple {32040#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32040#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:53,204 INFO L273 TraceCheckUtils]: 63: Hoare triple {32040#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32041#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:53,205 INFO L273 TraceCheckUtils]: 64: Hoare triple {32041#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32041#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:53,206 INFO L273 TraceCheckUtils]: 65: Hoare triple {32041#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32042#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:53,206 INFO L273 TraceCheckUtils]: 66: Hoare triple {32042#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32042#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:53,207 INFO L273 TraceCheckUtils]: 67: Hoare triple {32042#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32043#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:53,207 INFO L273 TraceCheckUtils]: 68: Hoare triple {32043#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32043#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:53,208 INFO L273 TraceCheckUtils]: 69: Hoare triple {32043#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32044#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:53,209 INFO L273 TraceCheckUtils]: 70: Hoare triple {32044#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32044#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:53,209 INFO L273 TraceCheckUtils]: 71: Hoare triple {32044#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32045#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:53,210 INFO L273 TraceCheckUtils]: 72: Hoare triple {32045#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32045#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:53,211 INFO L273 TraceCheckUtils]: 73: Hoare triple {32045#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32046#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:53,211 INFO L273 TraceCheckUtils]: 74: Hoare triple {32046#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32046#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:53,212 INFO L273 TraceCheckUtils]: 75: Hoare triple {32046#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32047#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:53,212 INFO L273 TraceCheckUtils]: 76: Hoare triple {32047#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32047#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:53,213 INFO L273 TraceCheckUtils]: 77: Hoare triple {32047#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32048#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:53,214 INFO L273 TraceCheckUtils]: 78: Hoare triple {32048#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32048#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:53,214 INFO L273 TraceCheckUtils]: 79: Hoare triple {32048#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32049#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:53,215 INFO L273 TraceCheckUtils]: 80: Hoare triple {32049#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {32049#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:53,215 INFO L273 TraceCheckUtils]: 81: Hoare triple {32049#(<= main_~i~1 37)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {32050#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:53,216 INFO L273 TraceCheckUtils]: 82: Hoare triple {32050#(<= main_~i~1 38)} assume !(~i~1 < 1000); {32011#false} is VALID [2018-11-23 12:28:53,216 INFO L256 TraceCheckUtils]: 83: Hoare triple {32011#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {32011#false} is VALID [2018-11-23 12:28:53,217 INFO L273 TraceCheckUtils]: 84: Hoare triple {32011#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {32011#false} is VALID [2018-11-23 12:28:53,217 INFO L273 TraceCheckUtils]: 85: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,217 INFO L273 TraceCheckUtils]: 86: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,217 INFO L273 TraceCheckUtils]: 87: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,217 INFO L273 TraceCheckUtils]: 88: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,217 INFO L273 TraceCheckUtils]: 89: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,218 INFO L273 TraceCheckUtils]: 90: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,218 INFO L273 TraceCheckUtils]: 91: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,218 INFO L273 TraceCheckUtils]: 92: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,218 INFO L273 TraceCheckUtils]: 93: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,218 INFO L273 TraceCheckUtils]: 94: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,219 INFO L273 TraceCheckUtils]: 95: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,219 INFO L273 TraceCheckUtils]: 96: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,219 INFO L273 TraceCheckUtils]: 97: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,219 INFO L273 TraceCheckUtils]: 98: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,219 INFO L273 TraceCheckUtils]: 99: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,219 INFO L273 TraceCheckUtils]: 100: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,220 INFO L273 TraceCheckUtils]: 101: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,220 INFO L273 TraceCheckUtils]: 102: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,220 INFO L273 TraceCheckUtils]: 103: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,220 INFO L273 TraceCheckUtils]: 104: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,220 INFO L273 TraceCheckUtils]: 105: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,220 INFO L273 TraceCheckUtils]: 106: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,221 INFO L273 TraceCheckUtils]: 107: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,221 INFO L273 TraceCheckUtils]: 108: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,221 INFO L273 TraceCheckUtils]: 109: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,221 INFO L273 TraceCheckUtils]: 110: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,221 INFO L273 TraceCheckUtils]: 111: Hoare triple {32011#false} assume !(~i~0 < 1000); {32011#false} is VALID [2018-11-23 12:28:53,221 INFO L273 TraceCheckUtils]: 112: Hoare triple {32011#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {32011#false} is VALID [2018-11-23 12:28:53,221 INFO L273 TraceCheckUtils]: 113: Hoare triple {32011#false} assume true; {32011#false} is VALID [2018-11-23 12:28:53,222 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {32011#false} {32011#false} #70#return; {32011#false} is VALID [2018-11-23 12:28:53,222 INFO L273 TraceCheckUtils]: 115: Hoare triple {32011#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {32011#false} is VALID [2018-11-23 12:28:53,222 INFO L256 TraceCheckUtils]: 116: Hoare triple {32011#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {32011#false} is VALID [2018-11-23 12:28:53,222 INFO L273 TraceCheckUtils]: 117: Hoare triple {32011#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {32011#false} is VALID [2018-11-23 12:28:53,222 INFO L273 TraceCheckUtils]: 118: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,222 INFO L273 TraceCheckUtils]: 119: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,222 INFO L273 TraceCheckUtils]: 120: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,222 INFO L273 TraceCheckUtils]: 121: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,222 INFO L273 TraceCheckUtils]: 122: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,223 INFO L273 TraceCheckUtils]: 123: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,223 INFO L273 TraceCheckUtils]: 124: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,223 INFO L273 TraceCheckUtils]: 125: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,223 INFO L273 TraceCheckUtils]: 126: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,223 INFO L273 TraceCheckUtils]: 127: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,223 INFO L273 TraceCheckUtils]: 128: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,223 INFO L273 TraceCheckUtils]: 129: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,223 INFO L273 TraceCheckUtils]: 130: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,223 INFO L273 TraceCheckUtils]: 131: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,223 INFO L273 TraceCheckUtils]: 132: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,224 INFO L273 TraceCheckUtils]: 133: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,224 INFO L273 TraceCheckUtils]: 134: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,224 INFO L273 TraceCheckUtils]: 135: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,224 INFO L273 TraceCheckUtils]: 136: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,224 INFO L273 TraceCheckUtils]: 137: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,224 INFO L273 TraceCheckUtils]: 138: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,224 INFO L273 TraceCheckUtils]: 139: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,224 INFO L273 TraceCheckUtils]: 140: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,224 INFO L273 TraceCheckUtils]: 141: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,224 INFO L273 TraceCheckUtils]: 142: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,225 INFO L273 TraceCheckUtils]: 143: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,225 INFO L273 TraceCheckUtils]: 144: Hoare triple {32011#false} assume !(~i~0 < 1000); {32011#false} is VALID [2018-11-23 12:28:53,225 INFO L273 TraceCheckUtils]: 145: Hoare triple {32011#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {32011#false} is VALID [2018-11-23 12:28:53,225 INFO L273 TraceCheckUtils]: 146: Hoare triple {32011#false} assume true; {32011#false} is VALID [2018-11-23 12:28:53,225 INFO L268 TraceCheckUtils]: 147: Hoare quadruple {32011#false} {32011#false} #72#return; {32011#false} is VALID [2018-11-23 12:28:53,225 INFO L273 TraceCheckUtils]: 148: Hoare triple {32011#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {32011#false} is VALID [2018-11-23 12:28:53,225 INFO L273 TraceCheckUtils]: 149: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:53,225 INFO L273 TraceCheckUtils]: 150: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:53,225 INFO L273 TraceCheckUtils]: 151: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:53,225 INFO L273 TraceCheckUtils]: 152: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:53,226 INFO L273 TraceCheckUtils]: 153: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:53,226 INFO L273 TraceCheckUtils]: 154: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:53,226 INFO L273 TraceCheckUtils]: 155: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:53,226 INFO L273 TraceCheckUtils]: 156: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:53,226 INFO L273 TraceCheckUtils]: 157: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:53,226 INFO L273 TraceCheckUtils]: 158: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:53,226 INFO L273 TraceCheckUtils]: 159: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:53,226 INFO L273 TraceCheckUtils]: 160: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:53,226 INFO L273 TraceCheckUtils]: 161: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:53,226 INFO L273 TraceCheckUtils]: 162: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:53,227 INFO L273 TraceCheckUtils]: 163: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:53,227 INFO L273 TraceCheckUtils]: 164: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:53,227 INFO L273 TraceCheckUtils]: 165: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:53,227 INFO L273 TraceCheckUtils]: 166: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:53,227 INFO L273 TraceCheckUtils]: 167: Hoare triple {32011#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {32011#false} is VALID [2018-11-23 12:28:53,227 INFO L273 TraceCheckUtils]: 168: Hoare triple {32011#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {32011#false} is VALID [2018-11-23 12:28:53,227 INFO L273 TraceCheckUtils]: 169: Hoare triple {32011#false} assume !(~i~2 < 999); {32011#false} is VALID [2018-11-23 12:28:53,227 INFO L273 TraceCheckUtils]: 170: Hoare triple {32011#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {32011#false} is VALID [2018-11-23 12:28:53,227 INFO L256 TraceCheckUtils]: 171: Hoare triple {32011#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {32011#false} is VALID [2018-11-23 12:28:53,227 INFO L273 TraceCheckUtils]: 172: Hoare triple {32011#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {32011#false} is VALID [2018-11-23 12:28:53,228 INFO L273 TraceCheckUtils]: 173: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,228 INFO L273 TraceCheckUtils]: 174: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,228 INFO L273 TraceCheckUtils]: 175: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,228 INFO L273 TraceCheckUtils]: 176: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,228 INFO L273 TraceCheckUtils]: 177: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,228 INFO L273 TraceCheckUtils]: 178: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,228 INFO L273 TraceCheckUtils]: 179: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,228 INFO L273 TraceCheckUtils]: 180: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,228 INFO L273 TraceCheckUtils]: 181: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,228 INFO L273 TraceCheckUtils]: 182: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,229 INFO L273 TraceCheckUtils]: 183: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,229 INFO L273 TraceCheckUtils]: 184: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,229 INFO L273 TraceCheckUtils]: 185: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,229 INFO L273 TraceCheckUtils]: 186: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,229 INFO L273 TraceCheckUtils]: 187: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,229 INFO L273 TraceCheckUtils]: 188: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,229 INFO L273 TraceCheckUtils]: 189: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,229 INFO L273 TraceCheckUtils]: 190: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,229 INFO L273 TraceCheckUtils]: 191: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,229 INFO L273 TraceCheckUtils]: 192: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,230 INFO L273 TraceCheckUtils]: 193: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,230 INFO L273 TraceCheckUtils]: 194: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,230 INFO L273 TraceCheckUtils]: 195: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,230 INFO L273 TraceCheckUtils]: 196: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,230 INFO L273 TraceCheckUtils]: 197: Hoare triple {32011#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {32011#false} is VALID [2018-11-23 12:28:53,230 INFO L273 TraceCheckUtils]: 198: Hoare triple {32011#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32011#false} is VALID [2018-11-23 12:28:53,230 INFO L273 TraceCheckUtils]: 199: Hoare triple {32011#false} assume !(~i~0 < 1000); {32011#false} is VALID [2018-11-23 12:28:53,230 INFO L273 TraceCheckUtils]: 200: Hoare triple {32011#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {32011#false} is VALID [2018-11-23 12:28:53,230 INFO L273 TraceCheckUtils]: 201: Hoare triple {32011#false} assume true; {32011#false} is VALID [2018-11-23 12:28:53,231 INFO L268 TraceCheckUtils]: 202: Hoare quadruple {32011#false} {32011#false} #74#return; {32011#false} is VALID [2018-11-23 12:28:53,231 INFO L273 TraceCheckUtils]: 203: Hoare triple {32011#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {32011#false} is VALID [2018-11-23 12:28:53,231 INFO L273 TraceCheckUtils]: 204: Hoare triple {32011#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {32011#false} is VALID [2018-11-23 12:28:53,231 INFO L273 TraceCheckUtils]: 205: Hoare triple {32011#false} assume !false; {32011#false} is VALID [2018-11-23 12:28:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3158 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-11-23 12:28:53,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:53,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:28:53,268 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 206 [2018-11-23 12:28:53,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:53,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:28:53,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:53,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:28:53,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:28:53,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:53,425 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2018-11-23 12:28:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:54,568 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2018-11-23 12:28:54,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:28:54,568 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 206 [2018-11-23 12:28:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:28:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:28:54,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 130 transitions. [2018-11-23 12:28:54,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:54,712 INFO L225 Difference]: With dead ends: 210 [2018-11-23 12:28:54,712 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 12:28:54,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 12:28:54,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-11-23 12:28:54,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:54,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 147 states. [2018-11-23 12:28:54,821 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 147 states. [2018-11-23 12:28:54,821 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 147 states. [2018-11-23 12:28:54,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:54,823 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:28:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:28:54,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:54,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:54,824 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 148 states. [2018-11-23 12:28:54,824 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 148 states. [2018-11-23 12:28:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:54,826 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:28:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:28:54,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:54,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:54,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:54,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:54,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 12:28:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2018-11-23 12:28:54,828 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 206 [2018-11-23 12:28:54,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:54,828 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2018-11-23 12:28:54,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:28:54,829 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-11-23 12:28:54,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-23 12:28:54,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:54,829 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 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:28:54,830 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:54,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:54,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1107556645, now seen corresponding path program 38 times [2018-11-23 12:28:54,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:54,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:54,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:54,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:54,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:55,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {33497#true} call ULTIMATE.init(); {33497#true} is VALID [2018-11-23 12:28:55,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {33497#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33497#true} is VALID [2018-11-23 12:28:55,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {33497#true} assume true; {33497#true} is VALID [2018-11-23 12:28:55,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33497#true} {33497#true} #66#return; {33497#true} is VALID [2018-11-23 12:28:55,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {33497#true} call #t~ret12 := main(); {33497#true} is VALID [2018-11-23 12:28:55,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {33497#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {33499#(= main_~i~1 0)} is VALID [2018-11-23 12:28:55,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {33499#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33499#(= main_~i~1 0)} is VALID [2018-11-23 12:28:55,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {33499#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33500#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:55,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {33500#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33500#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:55,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {33500#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33501#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:55,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {33501#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33501#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:55,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {33501#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33502#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:55,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {33502#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33502#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:55,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {33502#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33503#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:55,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {33503#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33503#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:55,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {33503#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33504#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:55,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {33504#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33504#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:55,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {33504#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33505#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:55,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {33505#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33505#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:55,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {33505#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33506#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:55,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {33506#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33506#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:55,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {33506#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33507#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:55,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {33507#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33507#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:55,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {33507#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33508#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:55,913 INFO L273 TraceCheckUtils]: 24: Hoare triple {33508#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33508#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:55,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {33508#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33509#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:55,914 INFO L273 TraceCheckUtils]: 26: Hoare triple {33509#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33509#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:55,915 INFO L273 TraceCheckUtils]: 27: Hoare triple {33509#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33510#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:55,916 INFO L273 TraceCheckUtils]: 28: Hoare triple {33510#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33510#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:55,916 INFO L273 TraceCheckUtils]: 29: Hoare triple {33510#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33511#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:55,917 INFO L273 TraceCheckUtils]: 30: Hoare triple {33511#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33511#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:55,918 INFO L273 TraceCheckUtils]: 31: Hoare triple {33511#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33512#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:55,918 INFO L273 TraceCheckUtils]: 32: Hoare triple {33512#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33512#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:55,919 INFO L273 TraceCheckUtils]: 33: Hoare triple {33512#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33513#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:55,919 INFO L273 TraceCheckUtils]: 34: Hoare triple {33513#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33513#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:55,920 INFO L273 TraceCheckUtils]: 35: Hoare triple {33513#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33514#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:55,921 INFO L273 TraceCheckUtils]: 36: Hoare triple {33514#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33514#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:55,921 INFO L273 TraceCheckUtils]: 37: Hoare triple {33514#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33515#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:55,922 INFO L273 TraceCheckUtils]: 38: Hoare triple {33515#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33515#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:55,922 INFO L273 TraceCheckUtils]: 39: Hoare triple {33515#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33516#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:55,923 INFO L273 TraceCheckUtils]: 40: Hoare triple {33516#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33516#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:55,924 INFO L273 TraceCheckUtils]: 41: Hoare triple {33516#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33517#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:55,924 INFO L273 TraceCheckUtils]: 42: Hoare triple {33517#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33517#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:55,925 INFO L273 TraceCheckUtils]: 43: Hoare triple {33517#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33518#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:55,925 INFO L273 TraceCheckUtils]: 44: Hoare triple {33518#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33518#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:55,926 INFO L273 TraceCheckUtils]: 45: Hoare triple {33518#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33519#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:55,927 INFO L273 TraceCheckUtils]: 46: Hoare triple {33519#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33519#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:55,927 INFO L273 TraceCheckUtils]: 47: Hoare triple {33519#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33520#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:55,928 INFO L273 TraceCheckUtils]: 48: Hoare triple {33520#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33520#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:55,929 INFO L273 TraceCheckUtils]: 49: Hoare triple {33520#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33521#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:55,929 INFO L273 TraceCheckUtils]: 50: Hoare triple {33521#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33521#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:55,930 INFO L273 TraceCheckUtils]: 51: Hoare triple {33521#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33522#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:55,930 INFO L273 TraceCheckUtils]: 52: Hoare triple {33522#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33522#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:55,931 INFO L273 TraceCheckUtils]: 53: Hoare triple {33522#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33523#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:55,932 INFO L273 TraceCheckUtils]: 54: Hoare triple {33523#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33523#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:55,932 INFO L273 TraceCheckUtils]: 55: Hoare triple {33523#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33524#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:55,933 INFO L273 TraceCheckUtils]: 56: Hoare triple {33524#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33524#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:55,934 INFO L273 TraceCheckUtils]: 57: Hoare triple {33524#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33525#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:55,934 INFO L273 TraceCheckUtils]: 58: Hoare triple {33525#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33525#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:55,935 INFO L273 TraceCheckUtils]: 59: Hoare triple {33525#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33526#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:55,935 INFO L273 TraceCheckUtils]: 60: Hoare triple {33526#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33526#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:55,936 INFO L273 TraceCheckUtils]: 61: Hoare triple {33526#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33527#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:55,937 INFO L273 TraceCheckUtils]: 62: Hoare triple {33527#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33527#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:55,937 INFO L273 TraceCheckUtils]: 63: Hoare triple {33527#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33528#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:55,938 INFO L273 TraceCheckUtils]: 64: Hoare triple {33528#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33528#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:55,939 INFO L273 TraceCheckUtils]: 65: Hoare triple {33528#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33529#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:55,939 INFO L273 TraceCheckUtils]: 66: Hoare triple {33529#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33529#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:55,940 INFO L273 TraceCheckUtils]: 67: Hoare triple {33529#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33530#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:55,940 INFO L273 TraceCheckUtils]: 68: Hoare triple {33530#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33530#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:55,941 INFO L273 TraceCheckUtils]: 69: Hoare triple {33530#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33531#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:55,942 INFO L273 TraceCheckUtils]: 70: Hoare triple {33531#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33531#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:55,942 INFO L273 TraceCheckUtils]: 71: Hoare triple {33531#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33532#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:55,943 INFO L273 TraceCheckUtils]: 72: Hoare triple {33532#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33532#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:55,943 INFO L273 TraceCheckUtils]: 73: Hoare triple {33532#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33533#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:55,944 INFO L273 TraceCheckUtils]: 74: Hoare triple {33533#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33533#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:55,945 INFO L273 TraceCheckUtils]: 75: Hoare triple {33533#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33534#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:55,945 INFO L273 TraceCheckUtils]: 76: Hoare triple {33534#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33534#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:55,946 INFO L273 TraceCheckUtils]: 77: Hoare triple {33534#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33535#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:55,946 INFO L273 TraceCheckUtils]: 78: Hoare triple {33535#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33535#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:55,947 INFO L273 TraceCheckUtils]: 79: Hoare triple {33535#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33536#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:55,948 INFO L273 TraceCheckUtils]: 80: Hoare triple {33536#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33536#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:55,948 INFO L273 TraceCheckUtils]: 81: Hoare triple {33536#(<= main_~i~1 37)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33537#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:55,949 INFO L273 TraceCheckUtils]: 82: Hoare triple {33537#(<= main_~i~1 38)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33537#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:55,950 INFO L273 TraceCheckUtils]: 83: Hoare triple {33537#(<= main_~i~1 38)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33538#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:55,950 INFO L273 TraceCheckUtils]: 84: Hoare triple {33538#(<= main_~i~1 39)} assume !(~i~1 < 1000); {33498#false} is VALID [2018-11-23 12:28:55,951 INFO L256 TraceCheckUtils]: 85: Hoare triple {33498#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {33497#true} is VALID [2018-11-23 12:28:55,951 INFO L273 TraceCheckUtils]: 86: Hoare triple {33497#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33497#true} is VALID [2018-11-23 12:28:55,951 INFO L273 TraceCheckUtils]: 87: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,951 INFO L273 TraceCheckUtils]: 88: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,951 INFO L273 TraceCheckUtils]: 89: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,951 INFO L273 TraceCheckUtils]: 90: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,952 INFO L273 TraceCheckUtils]: 91: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,952 INFO L273 TraceCheckUtils]: 92: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,952 INFO L273 TraceCheckUtils]: 93: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,952 INFO L273 TraceCheckUtils]: 94: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,952 INFO L273 TraceCheckUtils]: 95: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,952 INFO L273 TraceCheckUtils]: 96: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,953 INFO L273 TraceCheckUtils]: 97: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,953 INFO L273 TraceCheckUtils]: 98: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,953 INFO L273 TraceCheckUtils]: 99: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,953 INFO L273 TraceCheckUtils]: 100: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,953 INFO L273 TraceCheckUtils]: 101: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,953 INFO L273 TraceCheckUtils]: 102: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,953 INFO L273 TraceCheckUtils]: 103: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,953 INFO L273 TraceCheckUtils]: 104: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,953 INFO L273 TraceCheckUtils]: 105: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,953 INFO L273 TraceCheckUtils]: 106: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,954 INFO L273 TraceCheckUtils]: 107: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,954 INFO L273 TraceCheckUtils]: 108: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,954 INFO L273 TraceCheckUtils]: 109: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,954 INFO L273 TraceCheckUtils]: 110: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,954 INFO L273 TraceCheckUtils]: 111: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,954 INFO L273 TraceCheckUtils]: 112: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,954 INFO L273 TraceCheckUtils]: 113: Hoare triple {33497#true} assume !(~i~0 < 1000); {33497#true} is VALID [2018-11-23 12:28:55,954 INFO L273 TraceCheckUtils]: 114: Hoare triple {33497#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {33497#true} is VALID [2018-11-23 12:28:55,954 INFO L273 TraceCheckUtils]: 115: Hoare triple {33497#true} assume true; {33497#true} is VALID [2018-11-23 12:28:55,954 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {33497#true} {33498#false} #70#return; {33498#false} is VALID [2018-11-23 12:28:55,955 INFO L273 TraceCheckUtils]: 117: Hoare triple {33498#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {33498#false} is VALID [2018-11-23 12:28:55,955 INFO L256 TraceCheckUtils]: 118: Hoare triple {33498#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {33497#true} is VALID [2018-11-23 12:28:55,955 INFO L273 TraceCheckUtils]: 119: Hoare triple {33497#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33497#true} is VALID [2018-11-23 12:28:55,955 INFO L273 TraceCheckUtils]: 120: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,955 INFO L273 TraceCheckUtils]: 121: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,955 INFO L273 TraceCheckUtils]: 122: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,955 INFO L273 TraceCheckUtils]: 123: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,955 INFO L273 TraceCheckUtils]: 124: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,955 INFO L273 TraceCheckUtils]: 125: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,955 INFO L273 TraceCheckUtils]: 126: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,956 INFO L273 TraceCheckUtils]: 127: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,956 INFO L273 TraceCheckUtils]: 128: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,956 INFO L273 TraceCheckUtils]: 129: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,956 INFO L273 TraceCheckUtils]: 130: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,956 INFO L273 TraceCheckUtils]: 131: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,956 INFO L273 TraceCheckUtils]: 132: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,956 INFO L273 TraceCheckUtils]: 133: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,956 INFO L273 TraceCheckUtils]: 134: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,956 INFO L273 TraceCheckUtils]: 135: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,957 INFO L273 TraceCheckUtils]: 136: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,957 INFO L273 TraceCheckUtils]: 137: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,957 INFO L273 TraceCheckUtils]: 138: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,957 INFO L273 TraceCheckUtils]: 139: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,957 INFO L273 TraceCheckUtils]: 140: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,957 INFO L273 TraceCheckUtils]: 141: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,957 INFO L273 TraceCheckUtils]: 142: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,957 INFO L273 TraceCheckUtils]: 143: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,957 INFO L273 TraceCheckUtils]: 144: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,957 INFO L273 TraceCheckUtils]: 145: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,958 INFO L273 TraceCheckUtils]: 146: Hoare triple {33497#true} assume !(~i~0 < 1000); {33497#true} is VALID [2018-11-23 12:28:55,958 INFO L273 TraceCheckUtils]: 147: Hoare triple {33497#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {33497#true} is VALID [2018-11-23 12:28:55,958 INFO L273 TraceCheckUtils]: 148: Hoare triple {33497#true} assume true; {33497#true} is VALID [2018-11-23 12:28:55,958 INFO L268 TraceCheckUtils]: 149: Hoare quadruple {33497#true} {33498#false} #72#return; {33498#false} is VALID [2018-11-23 12:28:55,958 INFO L273 TraceCheckUtils]: 150: Hoare triple {33498#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {33498#false} is VALID [2018-11-23 12:28:55,958 INFO L273 TraceCheckUtils]: 151: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:55,958 INFO L273 TraceCheckUtils]: 152: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:55,958 INFO L273 TraceCheckUtils]: 153: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:55,958 INFO L273 TraceCheckUtils]: 154: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:55,958 INFO L273 TraceCheckUtils]: 155: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:55,959 INFO L273 TraceCheckUtils]: 156: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:55,959 INFO L273 TraceCheckUtils]: 157: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:55,959 INFO L273 TraceCheckUtils]: 158: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:55,959 INFO L273 TraceCheckUtils]: 159: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:55,959 INFO L273 TraceCheckUtils]: 160: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:55,959 INFO L273 TraceCheckUtils]: 161: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:55,959 INFO L273 TraceCheckUtils]: 162: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:55,959 INFO L273 TraceCheckUtils]: 163: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:55,959 INFO L273 TraceCheckUtils]: 164: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:55,959 INFO L273 TraceCheckUtils]: 165: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:55,960 INFO L273 TraceCheckUtils]: 166: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:55,960 INFO L273 TraceCheckUtils]: 167: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:55,960 INFO L273 TraceCheckUtils]: 168: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:55,960 INFO L273 TraceCheckUtils]: 169: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:55,960 INFO L273 TraceCheckUtils]: 170: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:55,960 INFO L273 TraceCheckUtils]: 171: Hoare triple {33498#false} assume !(~i~2 < 999); {33498#false} is VALID [2018-11-23 12:28:55,960 INFO L273 TraceCheckUtils]: 172: Hoare triple {33498#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {33498#false} is VALID [2018-11-23 12:28:55,960 INFO L256 TraceCheckUtils]: 173: Hoare triple {33498#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {33497#true} is VALID [2018-11-23 12:28:55,960 INFO L273 TraceCheckUtils]: 174: Hoare triple {33497#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33497#true} is VALID [2018-11-23 12:28:55,960 INFO L273 TraceCheckUtils]: 175: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,961 INFO L273 TraceCheckUtils]: 176: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,961 INFO L273 TraceCheckUtils]: 177: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,961 INFO L273 TraceCheckUtils]: 178: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,961 INFO L273 TraceCheckUtils]: 179: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,961 INFO L273 TraceCheckUtils]: 180: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,961 INFO L273 TraceCheckUtils]: 181: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,961 INFO L273 TraceCheckUtils]: 182: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,961 INFO L273 TraceCheckUtils]: 183: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,961 INFO L273 TraceCheckUtils]: 184: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,962 INFO L273 TraceCheckUtils]: 185: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,962 INFO L273 TraceCheckUtils]: 186: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,962 INFO L273 TraceCheckUtils]: 187: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,962 INFO L273 TraceCheckUtils]: 188: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,962 INFO L273 TraceCheckUtils]: 189: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,962 INFO L273 TraceCheckUtils]: 190: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,962 INFO L273 TraceCheckUtils]: 191: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,962 INFO L273 TraceCheckUtils]: 192: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,962 INFO L273 TraceCheckUtils]: 193: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,962 INFO L273 TraceCheckUtils]: 194: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,963 INFO L273 TraceCheckUtils]: 195: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,963 INFO L273 TraceCheckUtils]: 196: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,963 INFO L273 TraceCheckUtils]: 197: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,963 INFO L273 TraceCheckUtils]: 198: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,963 INFO L273 TraceCheckUtils]: 199: Hoare triple {33497#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33497#true} is VALID [2018-11-23 12:28:55,963 INFO L273 TraceCheckUtils]: 200: Hoare triple {33497#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33497#true} is VALID [2018-11-23 12:28:55,963 INFO L273 TraceCheckUtils]: 201: Hoare triple {33497#true} assume !(~i~0 < 1000); {33497#true} is VALID [2018-11-23 12:28:55,963 INFO L273 TraceCheckUtils]: 202: Hoare triple {33497#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {33497#true} is VALID [2018-11-23 12:28:55,963 INFO L273 TraceCheckUtils]: 203: Hoare triple {33497#true} assume true; {33497#true} is VALID [2018-11-23 12:28:55,963 INFO L268 TraceCheckUtils]: 204: Hoare quadruple {33497#true} {33498#false} #74#return; {33498#false} is VALID [2018-11-23 12:28:55,964 INFO L273 TraceCheckUtils]: 205: Hoare triple {33498#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {33498#false} is VALID [2018-11-23 12:28:55,964 INFO L273 TraceCheckUtils]: 206: Hoare triple {33498#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {33498#false} is VALID [2018-11-23 12:28:55,964 INFO L273 TraceCheckUtils]: 207: Hoare triple {33498#false} assume !false; {33498#false} is VALID [2018-11-23 12:28:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3235 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-11-23 12:28:56,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:56,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:56,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:56,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:56,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:56,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:57,449 INFO L256 TraceCheckUtils]: 0: Hoare triple {33497#true} call ULTIMATE.init(); {33497#true} is VALID [2018-11-23 12:28:57,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {33497#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33497#true} is VALID [2018-11-23 12:28:57,450 INFO L273 TraceCheckUtils]: 2: Hoare triple {33497#true} assume true; {33497#true} is VALID [2018-11-23 12:28:57,450 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33497#true} {33497#true} #66#return; {33497#true} is VALID [2018-11-23 12:28:57,450 INFO L256 TraceCheckUtils]: 4: Hoare triple {33497#true} call #t~ret12 := main(); {33497#true} is VALID [2018-11-23 12:28:57,451 INFO L273 TraceCheckUtils]: 5: Hoare triple {33497#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {33557#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:57,451 INFO L273 TraceCheckUtils]: 6: Hoare triple {33557#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33557#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:57,452 INFO L273 TraceCheckUtils]: 7: Hoare triple {33557#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33500#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:57,452 INFO L273 TraceCheckUtils]: 8: Hoare triple {33500#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33500#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:57,453 INFO L273 TraceCheckUtils]: 9: Hoare triple {33500#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33501#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:57,453 INFO L273 TraceCheckUtils]: 10: Hoare triple {33501#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33501#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:57,453 INFO L273 TraceCheckUtils]: 11: Hoare triple {33501#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33502#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:57,454 INFO L273 TraceCheckUtils]: 12: Hoare triple {33502#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33502#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:57,454 INFO L273 TraceCheckUtils]: 13: Hoare triple {33502#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33503#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:57,455 INFO L273 TraceCheckUtils]: 14: Hoare triple {33503#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33503#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:57,456 INFO L273 TraceCheckUtils]: 15: Hoare triple {33503#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33504#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:57,456 INFO L273 TraceCheckUtils]: 16: Hoare triple {33504#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33504#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:57,457 INFO L273 TraceCheckUtils]: 17: Hoare triple {33504#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33505#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:57,457 INFO L273 TraceCheckUtils]: 18: Hoare triple {33505#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33505#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:57,458 INFO L273 TraceCheckUtils]: 19: Hoare triple {33505#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33506#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:57,458 INFO L273 TraceCheckUtils]: 20: Hoare triple {33506#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33506#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:57,459 INFO L273 TraceCheckUtils]: 21: Hoare triple {33506#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33507#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:57,460 INFO L273 TraceCheckUtils]: 22: Hoare triple {33507#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33507#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:57,460 INFO L273 TraceCheckUtils]: 23: Hoare triple {33507#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33508#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:57,461 INFO L273 TraceCheckUtils]: 24: Hoare triple {33508#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33508#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:57,462 INFO L273 TraceCheckUtils]: 25: Hoare triple {33508#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33509#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:57,462 INFO L273 TraceCheckUtils]: 26: Hoare triple {33509#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33509#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:57,463 INFO L273 TraceCheckUtils]: 27: Hoare triple {33509#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33510#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:57,463 INFO L273 TraceCheckUtils]: 28: Hoare triple {33510#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33510#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:57,464 INFO L273 TraceCheckUtils]: 29: Hoare triple {33510#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33511#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:57,465 INFO L273 TraceCheckUtils]: 30: Hoare triple {33511#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33511#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:57,465 INFO L273 TraceCheckUtils]: 31: Hoare triple {33511#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33512#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:57,466 INFO L273 TraceCheckUtils]: 32: Hoare triple {33512#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33512#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:57,467 INFO L273 TraceCheckUtils]: 33: Hoare triple {33512#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33513#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:57,467 INFO L273 TraceCheckUtils]: 34: Hoare triple {33513#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33513#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:57,468 INFO L273 TraceCheckUtils]: 35: Hoare triple {33513#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33514#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:57,468 INFO L273 TraceCheckUtils]: 36: Hoare triple {33514#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33514#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:57,469 INFO L273 TraceCheckUtils]: 37: Hoare triple {33514#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33515#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:57,470 INFO L273 TraceCheckUtils]: 38: Hoare triple {33515#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33515#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:57,470 INFO L273 TraceCheckUtils]: 39: Hoare triple {33515#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33516#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:57,471 INFO L273 TraceCheckUtils]: 40: Hoare triple {33516#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33516#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:57,472 INFO L273 TraceCheckUtils]: 41: Hoare triple {33516#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33517#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:57,472 INFO L273 TraceCheckUtils]: 42: Hoare triple {33517#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33517#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:57,473 INFO L273 TraceCheckUtils]: 43: Hoare triple {33517#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33518#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:57,473 INFO L273 TraceCheckUtils]: 44: Hoare triple {33518#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33518#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:57,474 INFO L273 TraceCheckUtils]: 45: Hoare triple {33518#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33519#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:57,475 INFO L273 TraceCheckUtils]: 46: Hoare triple {33519#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33519#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:57,475 INFO L273 TraceCheckUtils]: 47: Hoare triple {33519#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33520#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:57,476 INFO L273 TraceCheckUtils]: 48: Hoare triple {33520#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33520#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:57,476 INFO L273 TraceCheckUtils]: 49: Hoare triple {33520#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33521#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:57,477 INFO L273 TraceCheckUtils]: 50: Hoare triple {33521#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33521#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:57,478 INFO L273 TraceCheckUtils]: 51: Hoare triple {33521#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33522#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:57,478 INFO L273 TraceCheckUtils]: 52: Hoare triple {33522#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33522#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:57,479 INFO L273 TraceCheckUtils]: 53: Hoare triple {33522#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33523#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:57,479 INFO L273 TraceCheckUtils]: 54: Hoare triple {33523#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33523#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:57,480 INFO L273 TraceCheckUtils]: 55: Hoare triple {33523#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33524#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:57,481 INFO L273 TraceCheckUtils]: 56: Hoare triple {33524#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33524#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:57,481 INFO L273 TraceCheckUtils]: 57: Hoare triple {33524#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33525#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:57,482 INFO L273 TraceCheckUtils]: 58: Hoare triple {33525#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33525#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:57,483 INFO L273 TraceCheckUtils]: 59: Hoare triple {33525#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33526#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:57,483 INFO L273 TraceCheckUtils]: 60: Hoare triple {33526#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33526#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:57,484 INFO L273 TraceCheckUtils]: 61: Hoare triple {33526#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33527#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:57,484 INFO L273 TraceCheckUtils]: 62: Hoare triple {33527#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33527#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:57,485 INFO L273 TraceCheckUtils]: 63: Hoare triple {33527#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33528#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:57,486 INFO L273 TraceCheckUtils]: 64: Hoare triple {33528#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33528#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:57,486 INFO L273 TraceCheckUtils]: 65: Hoare triple {33528#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33529#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:57,487 INFO L273 TraceCheckUtils]: 66: Hoare triple {33529#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33529#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:57,488 INFO L273 TraceCheckUtils]: 67: Hoare triple {33529#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33530#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:57,488 INFO L273 TraceCheckUtils]: 68: Hoare triple {33530#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33530#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:57,489 INFO L273 TraceCheckUtils]: 69: Hoare triple {33530#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33531#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:57,489 INFO L273 TraceCheckUtils]: 70: Hoare triple {33531#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33531#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:57,490 INFO L273 TraceCheckUtils]: 71: Hoare triple {33531#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33532#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:57,491 INFO L273 TraceCheckUtils]: 72: Hoare triple {33532#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33532#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:57,491 INFO L273 TraceCheckUtils]: 73: Hoare triple {33532#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33533#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:57,492 INFO L273 TraceCheckUtils]: 74: Hoare triple {33533#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33533#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:57,492 INFO L273 TraceCheckUtils]: 75: Hoare triple {33533#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33534#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:57,493 INFO L273 TraceCheckUtils]: 76: Hoare triple {33534#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33534#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:57,494 INFO L273 TraceCheckUtils]: 77: Hoare triple {33534#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33535#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:57,494 INFO L273 TraceCheckUtils]: 78: Hoare triple {33535#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33535#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:57,495 INFO L273 TraceCheckUtils]: 79: Hoare triple {33535#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33536#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:57,495 INFO L273 TraceCheckUtils]: 80: Hoare triple {33536#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33536#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:57,496 INFO L273 TraceCheckUtils]: 81: Hoare triple {33536#(<= main_~i~1 37)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33537#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:57,497 INFO L273 TraceCheckUtils]: 82: Hoare triple {33537#(<= main_~i~1 38)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33537#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:57,497 INFO L273 TraceCheckUtils]: 83: Hoare triple {33537#(<= main_~i~1 38)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33538#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:57,498 INFO L273 TraceCheckUtils]: 84: Hoare triple {33538#(<= main_~i~1 39)} assume !(~i~1 < 1000); {33498#false} is VALID [2018-11-23 12:28:57,498 INFO L256 TraceCheckUtils]: 85: Hoare triple {33498#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {33498#false} is VALID [2018-11-23 12:28:57,498 INFO L273 TraceCheckUtils]: 86: Hoare triple {33498#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33498#false} is VALID [2018-11-23 12:28:57,499 INFO L273 TraceCheckUtils]: 87: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,499 INFO L273 TraceCheckUtils]: 88: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,499 INFO L273 TraceCheckUtils]: 89: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,499 INFO L273 TraceCheckUtils]: 90: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,499 INFO L273 TraceCheckUtils]: 91: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,499 INFO L273 TraceCheckUtils]: 92: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,500 INFO L273 TraceCheckUtils]: 93: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,500 INFO L273 TraceCheckUtils]: 94: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,500 INFO L273 TraceCheckUtils]: 95: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,500 INFO L273 TraceCheckUtils]: 96: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,500 INFO L273 TraceCheckUtils]: 97: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,501 INFO L273 TraceCheckUtils]: 98: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,501 INFO L273 TraceCheckUtils]: 99: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,501 INFO L273 TraceCheckUtils]: 100: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,501 INFO L273 TraceCheckUtils]: 101: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,501 INFO L273 TraceCheckUtils]: 102: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,501 INFO L273 TraceCheckUtils]: 103: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,501 INFO L273 TraceCheckUtils]: 104: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,502 INFO L273 TraceCheckUtils]: 105: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,502 INFO L273 TraceCheckUtils]: 106: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,502 INFO L273 TraceCheckUtils]: 107: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,502 INFO L273 TraceCheckUtils]: 108: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,502 INFO L273 TraceCheckUtils]: 109: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,502 INFO L273 TraceCheckUtils]: 110: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,502 INFO L273 TraceCheckUtils]: 111: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,502 INFO L273 TraceCheckUtils]: 112: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,502 INFO L273 TraceCheckUtils]: 113: Hoare triple {33498#false} assume !(~i~0 < 1000); {33498#false} is VALID [2018-11-23 12:28:57,502 INFO L273 TraceCheckUtils]: 114: Hoare triple {33498#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {33498#false} is VALID [2018-11-23 12:28:57,503 INFO L273 TraceCheckUtils]: 115: Hoare triple {33498#false} assume true; {33498#false} is VALID [2018-11-23 12:28:57,503 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {33498#false} {33498#false} #70#return; {33498#false} is VALID [2018-11-23 12:28:57,503 INFO L273 TraceCheckUtils]: 117: Hoare triple {33498#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {33498#false} is VALID [2018-11-23 12:28:57,503 INFO L256 TraceCheckUtils]: 118: Hoare triple {33498#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {33498#false} is VALID [2018-11-23 12:28:57,503 INFO L273 TraceCheckUtils]: 119: Hoare triple {33498#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33498#false} is VALID [2018-11-23 12:28:57,503 INFO L273 TraceCheckUtils]: 120: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,503 INFO L273 TraceCheckUtils]: 121: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,503 INFO L273 TraceCheckUtils]: 122: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,503 INFO L273 TraceCheckUtils]: 123: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,503 INFO L273 TraceCheckUtils]: 124: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,504 INFO L273 TraceCheckUtils]: 125: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,504 INFO L273 TraceCheckUtils]: 126: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,504 INFO L273 TraceCheckUtils]: 127: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,504 INFO L273 TraceCheckUtils]: 128: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,504 INFO L273 TraceCheckUtils]: 129: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,504 INFO L273 TraceCheckUtils]: 130: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,504 INFO L273 TraceCheckUtils]: 131: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,504 INFO L273 TraceCheckUtils]: 132: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,504 INFO L273 TraceCheckUtils]: 133: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,504 INFO L273 TraceCheckUtils]: 134: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,505 INFO L273 TraceCheckUtils]: 135: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,505 INFO L273 TraceCheckUtils]: 136: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,505 INFO L273 TraceCheckUtils]: 137: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,505 INFO L273 TraceCheckUtils]: 138: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,505 INFO L273 TraceCheckUtils]: 139: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,505 INFO L273 TraceCheckUtils]: 140: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,505 INFO L273 TraceCheckUtils]: 141: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,505 INFO L273 TraceCheckUtils]: 142: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,505 INFO L273 TraceCheckUtils]: 143: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,505 INFO L273 TraceCheckUtils]: 144: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,506 INFO L273 TraceCheckUtils]: 145: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,506 INFO L273 TraceCheckUtils]: 146: Hoare triple {33498#false} assume !(~i~0 < 1000); {33498#false} is VALID [2018-11-23 12:28:57,506 INFO L273 TraceCheckUtils]: 147: Hoare triple {33498#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {33498#false} is VALID [2018-11-23 12:28:57,506 INFO L273 TraceCheckUtils]: 148: Hoare triple {33498#false} assume true; {33498#false} is VALID [2018-11-23 12:28:57,506 INFO L268 TraceCheckUtils]: 149: Hoare quadruple {33498#false} {33498#false} #72#return; {33498#false} is VALID [2018-11-23 12:28:57,506 INFO L273 TraceCheckUtils]: 150: Hoare triple {33498#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {33498#false} is VALID [2018-11-23 12:28:57,506 INFO L273 TraceCheckUtils]: 151: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:57,506 INFO L273 TraceCheckUtils]: 152: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:57,506 INFO L273 TraceCheckUtils]: 153: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:57,506 INFO L273 TraceCheckUtils]: 154: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:57,507 INFO L273 TraceCheckUtils]: 155: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:57,507 INFO L273 TraceCheckUtils]: 156: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:57,507 INFO L273 TraceCheckUtils]: 157: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:57,507 INFO L273 TraceCheckUtils]: 158: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:57,507 INFO L273 TraceCheckUtils]: 159: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:57,507 INFO L273 TraceCheckUtils]: 160: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:57,507 INFO L273 TraceCheckUtils]: 161: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:57,507 INFO L273 TraceCheckUtils]: 162: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:57,507 INFO L273 TraceCheckUtils]: 163: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:57,508 INFO L273 TraceCheckUtils]: 164: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:57,508 INFO L273 TraceCheckUtils]: 165: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:57,508 INFO L273 TraceCheckUtils]: 166: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:57,508 INFO L273 TraceCheckUtils]: 167: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:57,508 INFO L273 TraceCheckUtils]: 168: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:57,508 INFO L273 TraceCheckUtils]: 169: Hoare triple {33498#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33498#false} is VALID [2018-11-23 12:28:57,508 INFO L273 TraceCheckUtils]: 170: Hoare triple {33498#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33498#false} is VALID [2018-11-23 12:28:57,508 INFO L273 TraceCheckUtils]: 171: Hoare triple {33498#false} assume !(~i~2 < 999); {33498#false} is VALID [2018-11-23 12:28:57,508 INFO L273 TraceCheckUtils]: 172: Hoare triple {33498#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {33498#false} is VALID [2018-11-23 12:28:57,508 INFO L256 TraceCheckUtils]: 173: Hoare triple {33498#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {33498#false} is VALID [2018-11-23 12:28:57,509 INFO L273 TraceCheckUtils]: 174: Hoare triple {33498#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33498#false} is VALID [2018-11-23 12:28:57,509 INFO L273 TraceCheckUtils]: 175: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,509 INFO L273 TraceCheckUtils]: 176: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,509 INFO L273 TraceCheckUtils]: 177: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,509 INFO L273 TraceCheckUtils]: 178: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,509 INFO L273 TraceCheckUtils]: 179: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,509 INFO L273 TraceCheckUtils]: 180: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,509 INFO L273 TraceCheckUtils]: 181: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,509 INFO L273 TraceCheckUtils]: 182: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,509 INFO L273 TraceCheckUtils]: 183: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,510 INFO L273 TraceCheckUtils]: 184: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,510 INFO L273 TraceCheckUtils]: 185: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,510 INFO L273 TraceCheckUtils]: 186: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,510 INFO L273 TraceCheckUtils]: 187: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,510 INFO L273 TraceCheckUtils]: 188: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,510 INFO L273 TraceCheckUtils]: 189: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,510 INFO L273 TraceCheckUtils]: 190: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,510 INFO L273 TraceCheckUtils]: 191: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,510 INFO L273 TraceCheckUtils]: 192: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,510 INFO L273 TraceCheckUtils]: 193: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,511 INFO L273 TraceCheckUtils]: 194: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,511 INFO L273 TraceCheckUtils]: 195: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,511 INFO L273 TraceCheckUtils]: 196: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,511 INFO L273 TraceCheckUtils]: 197: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,511 INFO L273 TraceCheckUtils]: 198: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,511 INFO L273 TraceCheckUtils]: 199: Hoare triple {33498#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33498#false} is VALID [2018-11-23 12:28:57,511 INFO L273 TraceCheckUtils]: 200: Hoare triple {33498#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33498#false} is VALID [2018-11-23 12:28:57,511 INFO L273 TraceCheckUtils]: 201: Hoare triple {33498#false} assume !(~i~0 < 1000); {33498#false} is VALID [2018-11-23 12:28:57,511 INFO L273 TraceCheckUtils]: 202: Hoare triple {33498#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {33498#false} is VALID [2018-11-23 12:28:57,511 INFO L273 TraceCheckUtils]: 203: Hoare triple {33498#false} assume true; {33498#false} is VALID [2018-11-23 12:28:57,512 INFO L268 TraceCheckUtils]: 204: Hoare quadruple {33498#false} {33498#false} #74#return; {33498#false} is VALID [2018-11-23 12:28:57,512 INFO L273 TraceCheckUtils]: 205: Hoare triple {33498#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {33498#false} is VALID [2018-11-23 12:28:57,512 INFO L273 TraceCheckUtils]: 206: Hoare triple {33498#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {33498#false} is VALID [2018-11-23 12:28:57,512 INFO L273 TraceCheckUtils]: 207: Hoare triple {33498#false} assume !false; {33498#false} is VALID [2018-11-23 12:28:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3235 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-11-23 12:28:57,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:57,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-23 12:28:57,551 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 208 [2018-11-23 12:28:57,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:57,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:28:57,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:57,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:28:57,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:28:57,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:28:57,671 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 43 states. [2018-11-23 12:28:58,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:58,050 INFO L93 Difference]: Finished difference Result 212 states and 220 transitions. [2018-11-23 12:28:58,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:28:58,050 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 208 [2018-11-23 12:28:58,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:28:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 132 transitions. [2018-11-23 12:28:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:28:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 132 transitions. [2018-11-23 12:28:58,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 132 transitions. [2018-11-23 12:28:58,289 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:28:58,292 INFO L225 Difference]: With dead ends: 212 [2018-11-23 12:28:58,292 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 12:28:58,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:28:58,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 12:28:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-11-23 12:28:58,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:58,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 149 states. [2018-11-23 12:28:58,393 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 149 states. [2018-11-23 12:28:58,393 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 149 states. [2018-11-23 12:28:58,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:58,396 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-11-23 12:28:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-11-23 12:28:58,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:58,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:58,396 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 150 states. [2018-11-23 12:28:58,396 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 150 states. [2018-11-23 12:28:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:58,398 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-11-23 12:28:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-11-23 12:28:58,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:58,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:58,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:58,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-23 12:28:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2018-11-23 12:28:58,401 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 208 [2018-11-23 12:28:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:58,401 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2018-11-23 12:28:58,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:28:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2018-11-23 12:28:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-23 12:28:58,402 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:58,402 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 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:28:58,402 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:58,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:58,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1463797443, now seen corresponding path program 39 times [2018-11-23 12:28:58,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:58,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:58,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:58,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:58,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:59,437 INFO L256 TraceCheckUtils]: 0: Hoare triple {35001#true} call ULTIMATE.init(); {35001#true} is VALID [2018-11-23 12:28:59,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {35001#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35001#true} is VALID [2018-11-23 12:28:59,438 INFO L273 TraceCheckUtils]: 2: Hoare triple {35001#true} assume true; {35001#true} is VALID [2018-11-23 12:28:59,438 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35001#true} {35001#true} #66#return; {35001#true} is VALID [2018-11-23 12:28:59,438 INFO L256 TraceCheckUtils]: 4: Hoare triple {35001#true} call #t~ret12 := main(); {35001#true} is VALID [2018-11-23 12:28:59,439 INFO L273 TraceCheckUtils]: 5: Hoare triple {35001#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {35003#(= main_~i~1 0)} is VALID [2018-11-23 12:28:59,439 INFO L273 TraceCheckUtils]: 6: Hoare triple {35003#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35003#(= main_~i~1 0)} is VALID [2018-11-23 12:28:59,440 INFO L273 TraceCheckUtils]: 7: Hoare triple {35003#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35004#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:59,441 INFO L273 TraceCheckUtils]: 8: Hoare triple {35004#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35004#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:59,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {35004#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35005#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:59,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {35005#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35005#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:59,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {35005#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35006#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:59,443 INFO L273 TraceCheckUtils]: 12: Hoare triple {35006#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35006#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:59,444 INFO L273 TraceCheckUtils]: 13: Hoare triple {35006#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35007#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:59,444 INFO L273 TraceCheckUtils]: 14: Hoare triple {35007#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35007#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:59,445 INFO L273 TraceCheckUtils]: 15: Hoare triple {35007#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35008#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:59,446 INFO L273 TraceCheckUtils]: 16: Hoare triple {35008#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35008#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:59,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {35008#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35009#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:59,447 INFO L273 TraceCheckUtils]: 18: Hoare triple {35009#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35009#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:59,448 INFO L273 TraceCheckUtils]: 19: Hoare triple {35009#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35010#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:59,448 INFO L273 TraceCheckUtils]: 20: Hoare triple {35010#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35010#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:59,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {35010#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35011#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:59,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {35011#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35011#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:59,450 INFO L273 TraceCheckUtils]: 23: Hoare triple {35011#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35012#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:59,451 INFO L273 TraceCheckUtils]: 24: Hoare triple {35012#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35012#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:59,451 INFO L273 TraceCheckUtils]: 25: Hoare triple {35012#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35013#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:59,452 INFO L273 TraceCheckUtils]: 26: Hoare triple {35013#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35013#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:59,453 INFO L273 TraceCheckUtils]: 27: Hoare triple {35013#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35014#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:59,453 INFO L273 TraceCheckUtils]: 28: Hoare triple {35014#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35014#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:59,454 INFO L273 TraceCheckUtils]: 29: Hoare triple {35014#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35015#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:59,454 INFO L273 TraceCheckUtils]: 30: Hoare triple {35015#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35015#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:59,455 INFO L273 TraceCheckUtils]: 31: Hoare triple {35015#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35016#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:59,456 INFO L273 TraceCheckUtils]: 32: Hoare triple {35016#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35016#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:59,456 INFO L273 TraceCheckUtils]: 33: Hoare triple {35016#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35017#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:59,457 INFO L273 TraceCheckUtils]: 34: Hoare triple {35017#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35017#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:59,457 INFO L273 TraceCheckUtils]: 35: Hoare triple {35017#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35018#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:59,458 INFO L273 TraceCheckUtils]: 36: Hoare triple {35018#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35018#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:59,459 INFO L273 TraceCheckUtils]: 37: Hoare triple {35018#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35019#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:59,459 INFO L273 TraceCheckUtils]: 38: Hoare triple {35019#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35019#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:59,460 INFO L273 TraceCheckUtils]: 39: Hoare triple {35019#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35020#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:59,460 INFO L273 TraceCheckUtils]: 40: Hoare triple {35020#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35020#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:59,461 INFO L273 TraceCheckUtils]: 41: Hoare triple {35020#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35021#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:59,462 INFO L273 TraceCheckUtils]: 42: Hoare triple {35021#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35021#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:59,462 INFO L273 TraceCheckUtils]: 43: Hoare triple {35021#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35022#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:59,463 INFO L273 TraceCheckUtils]: 44: Hoare triple {35022#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35022#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:59,464 INFO L273 TraceCheckUtils]: 45: Hoare triple {35022#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35023#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:59,464 INFO L273 TraceCheckUtils]: 46: Hoare triple {35023#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35023#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:59,465 INFO L273 TraceCheckUtils]: 47: Hoare triple {35023#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35024#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:59,465 INFO L273 TraceCheckUtils]: 48: Hoare triple {35024#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35024#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:59,466 INFO L273 TraceCheckUtils]: 49: Hoare triple {35024#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35025#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:59,467 INFO L273 TraceCheckUtils]: 50: Hoare triple {35025#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35025#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:59,467 INFO L273 TraceCheckUtils]: 51: Hoare triple {35025#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35026#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:59,468 INFO L273 TraceCheckUtils]: 52: Hoare triple {35026#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35026#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:59,469 INFO L273 TraceCheckUtils]: 53: Hoare triple {35026#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35027#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:59,469 INFO L273 TraceCheckUtils]: 54: Hoare triple {35027#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35027#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:59,470 INFO L273 TraceCheckUtils]: 55: Hoare triple {35027#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35028#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:59,470 INFO L273 TraceCheckUtils]: 56: Hoare triple {35028#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35028#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:59,471 INFO L273 TraceCheckUtils]: 57: Hoare triple {35028#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35029#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:59,472 INFO L273 TraceCheckUtils]: 58: Hoare triple {35029#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35029#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:59,472 INFO L273 TraceCheckUtils]: 59: Hoare triple {35029#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35030#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:59,473 INFO L273 TraceCheckUtils]: 60: Hoare triple {35030#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35030#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:59,474 INFO L273 TraceCheckUtils]: 61: Hoare triple {35030#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35031#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:59,474 INFO L273 TraceCheckUtils]: 62: Hoare triple {35031#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35031#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:59,475 INFO L273 TraceCheckUtils]: 63: Hoare triple {35031#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35032#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:59,475 INFO L273 TraceCheckUtils]: 64: Hoare triple {35032#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35032#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:59,476 INFO L273 TraceCheckUtils]: 65: Hoare triple {35032#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35033#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:59,477 INFO L273 TraceCheckUtils]: 66: Hoare triple {35033#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35033#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:59,477 INFO L273 TraceCheckUtils]: 67: Hoare triple {35033#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35034#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:59,478 INFO L273 TraceCheckUtils]: 68: Hoare triple {35034#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35034#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:59,478 INFO L273 TraceCheckUtils]: 69: Hoare triple {35034#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35035#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:59,479 INFO L273 TraceCheckUtils]: 70: Hoare triple {35035#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35035#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:59,480 INFO L273 TraceCheckUtils]: 71: Hoare triple {35035#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35036#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:59,480 INFO L273 TraceCheckUtils]: 72: Hoare triple {35036#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35036#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:59,481 INFO L273 TraceCheckUtils]: 73: Hoare triple {35036#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35037#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:59,481 INFO L273 TraceCheckUtils]: 74: Hoare triple {35037#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35037#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:59,482 INFO L273 TraceCheckUtils]: 75: Hoare triple {35037#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35038#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:59,483 INFO L273 TraceCheckUtils]: 76: Hoare triple {35038#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35038#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:59,483 INFO L273 TraceCheckUtils]: 77: Hoare triple {35038#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35039#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:59,484 INFO L273 TraceCheckUtils]: 78: Hoare triple {35039#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35039#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:59,485 INFO L273 TraceCheckUtils]: 79: Hoare triple {35039#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35040#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:59,485 INFO L273 TraceCheckUtils]: 80: Hoare triple {35040#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35040#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:59,486 INFO L273 TraceCheckUtils]: 81: Hoare triple {35040#(<= main_~i~1 37)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35041#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:59,486 INFO L273 TraceCheckUtils]: 82: Hoare triple {35041#(<= main_~i~1 38)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35041#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:59,487 INFO L273 TraceCheckUtils]: 83: Hoare triple {35041#(<= main_~i~1 38)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35042#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:59,488 INFO L273 TraceCheckUtils]: 84: Hoare triple {35042#(<= main_~i~1 39)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35042#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:59,488 INFO L273 TraceCheckUtils]: 85: Hoare triple {35042#(<= main_~i~1 39)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35043#(<= main_~i~1 40)} is VALID [2018-11-23 12:28:59,489 INFO L273 TraceCheckUtils]: 86: Hoare triple {35043#(<= main_~i~1 40)} assume !(~i~1 < 1000); {35002#false} is VALID [2018-11-23 12:28:59,489 INFO L256 TraceCheckUtils]: 87: Hoare triple {35002#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {35001#true} is VALID [2018-11-23 12:28:59,489 INFO L273 TraceCheckUtils]: 88: Hoare triple {35001#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {35001#true} is VALID [2018-11-23 12:28:59,490 INFO L273 TraceCheckUtils]: 89: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,490 INFO L273 TraceCheckUtils]: 90: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,490 INFO L273 TraceCheckUtils]: 91: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,490 INFO L273 TraceCheckUtils]: 92: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,490 INFO L273 TraceCheckUtils]: 93: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,490 INFO L273 TraceCheckUtils]: 94: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,491 INFO L273 TraceCheckUtils]: 95: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,491 INFO L273 TraceCheckUtils]: 96: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,491 INFO L273 TraceCheckUtils]: 97: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,491 INFO L273 TraceCheckUtils]: 98: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,491 INFO L273 TraceCheckUtils]: 99: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,492 INFO L273 TraceCheckUtils]: 100: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,492 INFO L273 TraceCheckUtils]: 101: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,492 INFO L273 TraceCheckUtils]: 102: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,492 INFO L273 TraceCheckUtils]: 103: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,492 INFO L273 TraceCheckUtils]: 104: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,492 INFO L273 TraceCheckUtils]: 105: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,493 INFO L273 TraceCheckUtils]: 106: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,493 INFO L273 TraceCheckUtils]: 107: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,493 INFO L273 TraceCheckUtils]: 108: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,493 INFO L273 TraceCheckUtils]: 109: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,493 INFO L273 TraceCheckUtils]: 110: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,493 INFO L273 TraceCheckUtils]: 111: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,493 INFO L273 TraceCheckUtils]: 112: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,494 INFO L273 TraceCheckUtils]: 113: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,494 INFO L273 TraceCheckUtils]: 114: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,494 INFO L273 TraceCheckUtils]: 115: Hoare triple {35001#true} assume !(~i~0 < 1000); {35001#true} is VALID [2018-11-23 12:28:59,494 INFO L273 TraceCheckUtils]: 116: Hoare triple {35001#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {35001#true} is VALID [2018-11-23 12:28:59,494 INFO L273 TraceCheckUtils]: 117: Hoare triple {35001#true} assume true; {35001#true} is VALID [2018-11-23 12:28:59,494 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {35001#true} {35002#false} #70#return; {35002#false} is VALID [2018-11-23 12:28:59,494 INFO L273 TraceCheckUtils]: 119: Hoare triple {35002#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35002#false} is VALID [2018-11-23 12:28:59,494 INFO L256 TraceCheckUtils]: 120: Hoare triple {35002#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {35001#true} is VALID [2018-11-23 12:28:59,494 INFO L273 TraceCheckUtils]: 121: Hoare triple {35001#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {35001#true} is VALID [2018-11-23 12:28:59,494 INFO L273 TraceCheckUtils]: 122: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,495 INFO L273 TraceCheckUtils]: 123: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,495 INFO L273 TraceCheckUtils]: 124: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,495 INFO L273 TraceCheckUtils]: 125: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,495 INFO L273 TraceCheckUtils]: 126: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,495 INFO L273 TraceCheckUtils]: 127: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,495 INFO L273 TraceCheckUtils]: 128: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,495 INFO L273 TraceCheckUtils]: 129: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,495 INFO L273 TraceCheckUtils]: 130: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,495 INFO L273 TraceCheckUtils]: 131: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,495 INFO L273 TraceCheckUtils]: 132: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,496 INFO L273 TraceCheckUtils]: 133: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,496 INFO L273 TraceCheckUtils]: 134: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,496 INFO L273 TraceCheckUtils]: 135: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,496 INFO L273 TraceCheckUtils]: 136: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,496 INFO L273 TraceCheckUtils]: 137: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,496 INFO L273 TraceCheckUtils]: 138: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,496 INFO L273 TraceCheckUtils]: 139: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,496 INFO L273 TraceCheckUtils]: 140: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,496 INFO L273 TraceCheckUtils]: 141: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,496 INFO L273 TraceCheckUtils]: 142: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,497 INFO L273 TraceCheckUtils]: 143: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,497 INFO L273 TraceCheckUtils]: 144: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,497 INFO L273 TraceCheckUtils]: 145: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,497 INFO L273 TraceCheckUtils]: 146: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,497 INFO L273 TraceCheckUtils]: 147: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,497 INFO L273 TraceCheckUtils]: 148: Hoare triple {35001#true} assume !(~i~0 < 1000); {35001#true} is VALID [2018-11-23 12:28:59,497 INFO L273 TraceCheckUtils]: 149: Hoare triple {35001#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {35001#true} is VALID [2018-11-23 12:28:59,497 INFO L273 TraceCheckUtils]: 150: Hoare triple {35001#true} assume true; {35001#true} is VALID [2018-11-23 12:28:59,497 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {35001#true} {35002#false} #72#return; {35002#false} is VALID [2018-11-23 12:28:59,498 INFO L273 TraceCheckUtils]: 152: Hoare triple {35002#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {35002#false} is VALID [2018-11-23 12:28:59,498 INFO L273 TraceCheckUtils]: 153: Hoare triple {35002#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35002#false} is VALID [2018-11-23 12:28:59,498 INFO L273 TraceCheckUtils]: 154: Hoare triple {35002#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35002#false} is VALID [2018-11-23 12:28:59,498 INFO L273 TraceCheckUtils]: 155: Hoare triple {35002#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35002#false} is VALID [2018-11-23 12:28:59,498 INFO L273 TraceCheckUtils]: 156: Hoare triple {35002#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35002#false} is VALID [2018-11-23 12:28:59,498 INFO L273 TraceCheckUtils]: 157: Hoare triple {35002#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35002#false} is VALID [2018-11-23 12:28:59,498 INFO L273 TraceCheckUtils]: 158: Hoare triple {35002#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35002#false} is VALID [2018-11-23 12:28:59,498 INFO L273 TraceCheckUtils]: 159: Hoare triple {35002#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35002#false} is VALID [2018-11-23 12:28:59,498 INFO L273 TraceCheckUtils]: 160: Hoare triple {35002#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35002#false} is VALID [2018-11-23 12:28:59,499 INFO L273 TraceCheckUtils]: 161: Hoare triple {35002#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35002#false} is VALID [2018-11-23 12:28:59,499 INFO L273 TraceCheckUtils]: 162: Hoare triple {35002#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35002#false} is VALID [2018-11-23 12:28:59,499 INFO L273 TraceCheckUtils]: 163: Hoare triple {35002#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35002#false} is VALID [2018-11-23 12:28:59,499 INFO L273 TraceCheckUtils]: 164: Hoare triple {35002#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35002#false} is VALID [2018-11-23 12:28:59,499 INFO L273 TraceCheckUtils]: 165: Hoare triple {35002#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35002#false} is VALID [2018-11-23 12:28:59,499 INFO L273 TraceCheckUtils]: 166: Hoare triple {35002#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35002#false} is VALID [2018-11-23 12:28:59,499 INFO L273 TraceCheckUtils]: 167: Hoare triple {35002#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35002#false} is VALID [2018-11-23 12:28:59,499 INFO L273 TraceCheckUtils]: 168: Hoare triple {35002#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35002#false} is VALID [2018-11-23 12:28:59,499 INFO L273 TraceCheckUtils]: 169: Hoare triple {35002#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35002#false} is VALID [2018-11-23 12:28:59,499 INFO L273 TraceCheckUtils]: 170: Hoare triple {35002#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35002#false} is VALID [2018-11-23 12:28:59,500 INFO L273 TraceCheckUtils]: 171: Hoare triple {35002#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35002#false} is VALID [2018-11-23 12:28:59,500 INFO L273 TraceCheckUtils]: 172: Hoare triple {35002#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35002#false} is VALID [2018-11-23 12:28:59,500 INFO L273 TraceCheckUtils]: 173: Hoare triple {35002#false} assume !(~i~2 < 999); {35002#false} is VALID [2018-11-23 12:28:59,500 INFO L273 TraceCheckUtils]: 174: Hoare triple {35002#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {35002#false} is VALID [2018-11-23 12:28:59,500 INFO L256 TraceCheckUtils]: 175: Hoare triple {35002#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {35001#true} is VALID [2018-11-23 12:28:59,500 INFO L273 TraceCheckUtils]: 176: Hoare triple {35001#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {35001#true} is VALID [2018-11-23 12:28:59,500 INFO L273 TraceCheckUtils]: 177: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,500 INFO L273 TraceCheckUtils]: 178: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,500 INFO L273 TraceCheckUtils]: 179: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,500 INFO L273 TraceCheckUtils]: 180: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,501 INFO L273 TraceCheckUtils]: 181: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,501 INFO L273 TraceCheckUtils]: 182: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,501 INFO L273 TraceCheckUtils]: 183: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,501 INFO L273 TraceCheckUtils]: 184: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,501 INFO L273 TraceCheckUtils]: 185: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,501 INFO L273 TraceCheckUtils]: 186: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,501 INFO L273 TraceCheckUtils]: 187: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,501 INFO L273 TraceCheckUtils]: 188: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,501 INFO L273 TraceCheckUtils]: 189: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,501 INFO L273 TraceCheckUtils]: 190: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,502 INFO L273 TraceCheckUtils]: 191: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,502 INFO L273 TraceCheckUtils]: 192: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,502 INFO L273 TraceCheckUtils]: 193: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,502 INFO L273 TraceCheckUtils]: 194: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,502 INFO L273 TraceCheckUtils]: 195: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,502 INFO L273 TraceCheckUtils]: 196: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,502 INFO L273 TraceCheckUtils]: 197: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,502 INFO L273 TraceCheckUtils]: 198: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,502 INFO L273 TraceCheckUtils]: 199: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,502 INFO L273 TraceCheckUtils]: 200: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,503 INFO L273 TraceCheckUtils]: 201: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:28:59,503 INFO L273 TraceCheckUtils]: 202: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:28:59,503 INFO L273 TraceCheckUtils]: 203: Hoare triple {35001#true} assume !(~i~0 < 1000); {35001#true} is VALID [2018-11-23 12:28:59,503 INFO L273 TraceCheckUtils]: 204: Hoare triple {35001#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {35001#true} is VALID [2018-11-23 12:28:59,503 INFO L273 TraceCheckUtils]: 205: Hoare triple {35001#true} assume true; {35001#true} is VALID [2018-11-23 12:28:59,503 INFO L268 TraceCheckUtils]: 206: Hoare quadruple {35001#true} {35002#false} #74#return; {35002#false} is VALID [2018-11-23 12:28:59,503 INFO L273 TraceCheckUtils]: 207: Hoare triple {35002#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {35002#false} is VALID [2018-11-23 12:28:59,503 INFO L273 TraceCheckUtils]: 208: Hoare triple {35002#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {35002#false} is VALID [2018-11-23 12:28:59,503 INFO L273 TraceCheckUtils]: 209: Hoare triple {35002#false} assume !false; {35002#false} is VALID [2018-11-23 12:28:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-11-23 12:28:59,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:59,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:59,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:59,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 12:28:59,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:59,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:00,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {35001#true} call ULTIMATE.init(); {35001#true} is VALID [2018-11-23 12:29:00,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {35001#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35001#true} is VALID [2018-11-23 12:29:00,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {35001#true} assume true; {35001#true} is VALID [2018-11-23 12:29:00,622 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35001#true} {35001#true} #66#return; {35001#true} is VALID [2018-11-23 12:29:00,622 INFO L256 TraceCheckUtils]: 4: Hoare triple {35001#true} call #t~ret12 := main(); {35001#true} is VALID [2018-11-23 12:29:00,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {35001#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {35001#true} is VALID [2018-11-23 12:29:00,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,623 INFO L273 TraceCheckUtils]: 8: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,623 INFO L273 TraceCheckUtils]: 9: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,624 INFO L273 TraceCheckUtils]: 13: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,624 INFO L273 TraceCheckUtils]: 17: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,625 INFO L273 TraceCheckUtils]: 19: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,625 INFO L273 TraceCheckUtils]: 20: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,625 INFO L273 TraceCheckUtils]: 21: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,625 INFO L273 TraceCheckUtils]: 22: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,625 INFO L273 TraceCheckUtils]: 23: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,625 INFO L273 TraceCheckUtils]: 24: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,625 INFO L273 TraceCheckUtils]: 25: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,625 INFO L273 TraceCheckUtils]: 26: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,625 INFO L273 TraceCheckUtils]: 27: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,625 INFO L273 TraceCheckUtils]: 28: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,626 INFO L273 TraceCheckUtils]: 29: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,626 INFO L273 TraceCheckUtils]: 30: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,626 INFO L273 TraceCheckUtils]: 31: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,626 INFO L273 TraceCheckUtils]: 32: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,626 INFO L273 TraceCheckUtils]: 33: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,626 INFO L273 TraceCheckUtils]: 34: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,626 INFO L273 TraceCheckUtils]: 35: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,626 INFO L273 TraceCheckUtils]: 36: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,626 INFO L273 TraceCheckUtils]: 37: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,627 INFO L273 TraceCheckUtils]: 38: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,627 INFO L273 TraceCheckUtils]: 39: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,627 INFO L273 TraceCheckUtils]: 40: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,627 INFO L273 TraceCheckUtils]: 41: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,627 INFO L273 TraceCheckUtils]: 42: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,627 INFO L273 TraceCheckUtils]: 43: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,627 INFO L273 TraceCheckUtils]: 44: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,627 INFO L273 TraceCheckUtils]: 45: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,627 INFO L273 TraceCheckUtils]: 46: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,627 INFO L273 TraceCheckUtils]: 47: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,628 INFO L273 TraceCheckUtils]: 48: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,628 INFO L273 TraceCheckUtils]: 49: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,628 INFO L273 TraceCheckUtils]: 50: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,628 INFO L273 TraceCheckUtils]: 51: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,628 INFO L273 TraceCheckUtils]: 52: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,628 INFO L273 TraceCheckUtils]: 53: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,628 INFO L273 TraceCheckUtils]: 54: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,628 INFO L273 TraceCheckUtils]: 55: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,628 INFO L273 TraceCheckUtils]: 56: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,628 INFO L273 TraceCheckUtils]: 57: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,629 INFO L273 TraceCheckUtils]: 58: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,629 INFO L273 TraceCheckUtils]: 59: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,629 INFO L273 TraceCheckUtils]: 60: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,629 INFO L273 TraceCheckUtils]: 61: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,629 INFO L273 TraceCheckUtils]: 62: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,629 INFO L273 TraceCheckUtils]: 63: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,629 INFO L273 TraceCheckUtils]: 64: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,629 INFO L273 TraceCheckUtils]: 65: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,629 INFO L273 TraceCheckUtils]: 66: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,629 INFO L273 TraceCheckUtils]: 67: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,630 INFO L273 TraceCheckUtils]: 68: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,630 INFO L273 TraceCheckUtils]: 69: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,630 INFO L273 TraceCheckUtils]: 70: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,630 INFO L273 TraceCheckUtils]: 71: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,630 INFO L273 TraceCheckUtils]: 72: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,630 INFO L273 TraceCheckUtils]: 73: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,630 INFO L273 TraceCheckUtils]: 74: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,630 INFO L273 TraceCheckUtils]: 75: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,630 INFO L273 TraceCheckUtils]: 76: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,630 INFO L273 TraceCheckUtils]: 77: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,631 INFO L273 TraceCheckUtils]: 78: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,631 INFO L273 TraceCheckUtils]: 79: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,631 INFO L273 TraceCheckUtils]: 80: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,631 INFO L273 TraceCheckUtils]: 81: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,631 INFO L273 TraceCheckUtils]: 82: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,631 INFO L273 TraceCheckUtils]: 83: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,631 INFO L273 TraceCheckUtils]: 84: Hoare triple {35001#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {35001#true} is VALID [2018-11-23 12:29:00,631 INFO L273 TraceCheckUtils]: 85: Hoare triple {35001#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {35001#true} is VALID [2018-11-23 12:29:00,631 INFO L273 TraceCheckUtils]: 86: Hoare triple {35001#true} assume !(~i~1 < 1000); {35001#true} is VALID [2018-11-23 12:29:00,632 INFO L256 TraceCheckUtils]: 87: Hoare triple {35001#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {35001#true} is VALID [2018-11-23 12:29:00,632 INFO L273 TraceCheckUtils]: 88: Hoare triple {35001#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {35001#true} is VALID [2018-11-23 12:29:00,632 INFO L273 TraceCheckUtils]: 89: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,632 INFO L273 TraceCheckUtils]: 90: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,632 INFO L273 TraceCheckUtils]: 91: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,632 INFO L273 TraceCheckUtils]: 92: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,632 INFO L273 TraceCheckUtils]: 93: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,632 INFO L273 TraceCheckUtils]: 94: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,632 INFO L273 TraceCheckUtils]: 95: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,632 INFO L273 TraceCheckUtils]: 96: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,633 INFO L273 TraceCheckUtils]: 97: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,633 INFO L273 TraceCheckUtils]: 98: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,633 INFO L273 TraceCheckUtils]: 99: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,633 INFO L273 TraceCheckUtils]: 100: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,633 INFO L273 TraceCheckUtils]: 101: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,633 INFO L273 TraceCheckUtils]: 102: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,633 INFO L273 TraceCheckUtils]: 103: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,633 INFO L273 TraceCheckUtils]: 104: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,633 INFO L273 TraceCheckUtils]: 105: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,633 INFO L273 TraceCheckUtils]: 106: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,634 INFO L273 TraceCheckUtils]: 107: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,634 INFO L273 TraceCheckUtils]: 108: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,634 INFO L273 TraceCheckUtils]: 109: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,634 INFO L273 TraceCheckUtils]: 110: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,634 INFO L273 TraceCheckUtils]: 111: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,634 INFO L273 TraceCheckUtils]: 112: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,634 INFO L273 TraceCheckUtils]: 113: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,634 INFO L273 TraceCheckUtils]: 114: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,634 INFO L273 TraceCheckUtils]: 115: Hoare triple {35001#true} assume !(~i~0 < 1000); {35001#true} is VALID [2018-11-23 12:29:00,634 INFO L273 TraceCheckUtils]: 116: Hoare triple {35001#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {35001#true} is VALID [2018-11-23 12:29:00,635 INFO L273 TraceCheckUtils]: 117: Hoare triple {35001#true} assume true; {35001#true} is VALID [2018-11-23 12:29:00,635 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {35001#true} {35001#true} #70#return; {35001#true} is VALID [2018-11-23 12:29:00,635 INFO L273 TraceCheckUtils]: 119: Hoare triple {35001#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35001#true} is VALID [2018-11-23 12:29:00,635 INFO L256 TraceCheckUtils]: 120: Hoare triple {35001#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {35001#true} is VALID [2018-11-23 12:29:00,635 INFO L273 TraceCheckUtils]: 121: Hoare triple {35001#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {35001#true} is VALID [2018-11-23 12:29:00,635 INFO L273 TraceCheckUtils]: 122: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,635 INFO L273 TraceCheckUtils]: 123: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,635 INFO L273 TraceCheckUtils]: 124: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,635 INFO L273 TraceCheckUtils]: 125: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,636 INFO L273 TraceCheckUtils]: 126: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,636 INFO L273 TraceCheckUtils]: 127: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,636 INFO L273 TraceCheckUtils]: 128: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,636 INFO L273 TraceCheckUtils]: 129: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,636 INFO L273 TraceCheckUtils]: 130: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,636 INFO L273 TraceCheckUtils]: 131: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,636 INFO L273 TraceCheckUtils]: 132: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,636 INFO L273 TraceCheckUtils]: 133: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,636 INFO L273 TraceCheckUtils]: 134: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,636 INFO L273 TraceCheckUtils]: 135: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,637 INFO L273 TraceCheckUtils]: 136: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,637 INFO L273 TraceCheckUtils]: 137: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,637 INFO L273 TraceCheckUtils]: 138: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,637 INFO L273 TraceCheckUtils]: 139: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,637 INFO L273 TraceCheckUtils]: 140: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,637 INFO L273 TraceCheckUtils]: 141: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,637 INFO L273 TraceCheckUtils]: 142: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,637 INFO L273 TraceCheckUtils]: 143: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,637 INFO L273 TraceCheckUtils]: 144: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,637 INFO L273 TraceCheckUtils]: 145: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,638 INFO L273 TraceCheckUtils]: 146: Hoare triple {35001#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35001#true} is VALID [2018-11-23 12:29:00,638 INFO L273 TraceCheckUtils]: 147: Hoare triple {35001#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35001#true} is VALID [2018-11-23 12:29:00,638 INFO L273 TraceCheckUtils]: 148: Hoare triple {35001#true} assume !(~i~0 < 1000); {35001#true} is VALID [2018-11-23 12:29:00,638 INFO L273 TraceCheckUtils]: 149: Hoare triple {35001#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {35001#true} is VALID [2018-11-23 12:29:00,638 INFO L273 TraceCheckUtils]: 150: Hoare triple {35001#true} assume true; {35001#true} is VALID [2018-11-23 12:29:00,638 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {35001#true} {35001#true} #72#return; {35001#true} is VALID [2018-11-23 12:29:00,639 INFO L273 TraceCheckUtils]: 152: Hoare triple {35001#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {35503#(<= main_~i~2 0)} is VALID [2018-11-23 12:29:00,639 INFO L273 TraceCheckUtils]: 153: Hoare triple {35503#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35503#(<= main_~i~2 0)} is VALID [2018-11-23 12:29:00,639 INFO L273 TraceCheckUtils]: 154: Hoare triple {35503#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35510#(<= main_~i~2 1)} is VALID [2018-11-23 12:29:00,640 INFO L273 TraceCheckUtils]: 155: Hoare triple {35510#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35510#(<= main_~i~2 1)} is VALID [2018-11-23 12:29:00,640 INFO L273 TraceCheckUtils]: 156: Hoare triple {35510#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35517#(<= main_~i~2 2)} is VALID [2018-11-23 12:29:00,641 INFO L273 TraceCheckUtils]: 157: Hoare triple {35517#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35517#(<= main_~i~2 2)} is VALID [2018-11-23 12:29:00,641 INFO L273 TraceCheckUtils]: 158: Hoare triple {35517#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35524#(<= main_~i~2 3)} is VALID [2018-11-23 12:29:00,641 INFO L273 TraceCheckUtils]: 159: Hoare triple {35524#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35524#(<= main_~i~2 3)} is VALID [2018-11-23 12:29:00,642 INFO L273 TraceCheckUtils]: 160: Hoare triple {35524#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35531#(<= main_~i~2 4)} is VALID [2018-11-23 12:29:00,642 INFO L273 TraceCheckUtils]: 161: Hoare triple {35531#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35531#(<= main_~i~2 4)} is VALID [2018-11-23 12:29:00,643 INFO L273 TraceCheckUtils]: 162: Hoare triple {35531#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35538#(<= main_~i~2 5)} is VALID [2018-11-23 12:29:00,643 INFO L273 TraceCheckUtils]: 163: Hoare triple {35538#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35538#(<= main_~i~2 5)} is VALID [2018-11-23 12:29:00,644 INFO L273 TraceCheckUtils]: 164: Hoare triple {35538#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35545#(<= main_~i~2 6)} is VALID [2018-11-23 12:29:00,644 INFO L273 TraceCheckUtils]: 165: Hoare triple {35545#(<= main_~i~2 6)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35545#(<= main_~i~2 6)} is VALID [2018-11-23 12:29:00,645 INFO L273 TraceCheckUtils]: 166: Hoare triple {35545#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35552#(<= main_~i~2 7)} is VALID [2018-11-23 12:29:00,645 INFO L273 TraceCheckUtils]: 167: Hoare triple {35552#(<= main_~i~2 7)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35552#(<= main_~i~2 7)} is VALID [2018-11-23 12:29:00,646 INFO L273 TraceCheckUtils]: 168: Hoare triple {35552#(<= main_~i~2 7)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35559#(<= main_~i~2 8)} is VALID [2018-11-23 12:29:00,647 INFO L273 TraceCheckUtils]: 169: Hoare triple {35559#(<= main_~i~2 8)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35559#(<= main_~i~2 8)} is VALID [2018-11-23 12:29:00,647 INFO L273 TraceCheckUtils]: 170: Hoare triple {35559#(<= main_~i~2 8)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35566#(<= main_~i~2 9)} is VALID [2018-11-23 12:29:00,648 INFO L273 TraceCheckUtils]: 171: Hoare triple {35566#(<= main_~i~2 9)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {35566#(<= main_~i~2 9)} is VALID [2018-11-23 12:29:00,649 INFO L273 TraceCheckUtils]: 172: Hoare triple {35566#(<= main_~i~2 9)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {35573#(<= main_~i~2 10)} is VALID [2018-11-23 12:29:00,649 INFO L273 TraceCheckUtils]: 173: Hoare triple {35573#(<= main_~i~2 10)} assume !(~i~2 < 999); {35002#false} is VALID [2018-11-23 12:29:00,650 INFO L273 TraceCheckUtils]: 174: Hoare triple {35002#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {35002#false} is VALID [2018-11-23 12:29:00,650 INFO L256 TraceCheckUtils]: 175: Hoare triple {35002#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {35002#false} is VALID [2018-11-23 12:29:00,650 INFO L273 TraceCheckUtils]: 176: Hoare triple {35002#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {35002#false} is VALID [2018-11-23 12:29:00,650 INFO L273 TraceCheckUtils]: 177: Hoare triple {35002#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35002#false} is VALID [2018-11-23 12:29:00,650 INFO L273 TraceCheckUtils]: 178: Hoare triple {35002#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35002#false} is VALID [2018-11-23 12:29:00,650 INFO L273 TraceCheckUtils]: 179: Hoare triple {35002#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35002#false} is VALID [2018-11-23 12:29:00,651 INFO L273 TraceCheckUtils]: 180: Hoare triple {35002#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35002#false} is VALID [2018-11-23 12:29:00,651 INFO L273 TraceCheckUtils]: 181: Hoare triple {35002#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35002#false} is VALID [2018-11-23 12:29:00,651 INFO L273 TraceCheckUtils]: 182: Hoare triple {35002#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35002#false} is VALID [2018-11-23 12:29:00,651 INFO L273 TraceCheckUtils]: 183: Hoare triple {35002#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35002#false} is VALID [2018-11-23 12:29:00,651 INFO L273 TraceCheckUtils]: 184: Hoare triple {35002#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35002#false} is VALID [2018-11-23 12:29:00,651 INFO L273 TraceCheckUtils]: 185: Hoare triple {35002#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35002#false} is VALID [2018-11-23 12:29:00,652 INFO L273 TraceCheckUtils]: 186: Hoare triple {35002#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35002#false} is VALID [2018-11-23 12:29:00,652 INFO L273 TraceCheckUtils]: 187: Hoare triple {35002#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35002#false} is VALID [2018-11-23 12:29:00,652 INFO L273 TraceCheckUtils]: 188: Hoare triple {35002#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35002#false} is VALID [2018-11-23 12:29:00,652 INFO L273 TraceCheckUtils]: 189: Hoare triple {35002#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35002#false} is VALID [2018-11-23 12:29:00,652 INFO L273 TraceCheckUtils]: 190: Hoare triple {35002#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35002#false} is VALID [2018-11-23 12:29:00,652 INFO L273 TraceCheckUtils]: 191: Hoare triple {35002#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35002#false} is VALID [2018-11-23 12:29:00,653 INFO L273 TraceCheckUtils]: 192: Hoare triple {35002#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35002#false} is VALID [2018-11-23 12:29:00,653 INFO L273 TraceCheckUtils]: 193: Hoare triple {35002#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35002#false} is VALID [2018-11-23 12:29:00,653 INFO L273 TraceCheckUtils]: 194: Hoare triple {35002#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35002#false} is VALID [2018-11-23 12:29:00,653 INFO L273 TraceCheckUtils]: 195: Hoare triple {35002#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35002#false} is VALID [2018-11-23 12:29:00,653 INFO L273 TraceCheckUtils]: 196: Hoare triple {35002#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35002#false} is VALID [2018-11-23 12:29:00,653 INFO L273 TraceCheckUtils]: 197: Hoare triple {35002#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35002#false} is VALID [2018-11-23 12:29:00,653 INFO L273 TraceCheckUtils]: 198: Hoare triple {35002#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35002#false} is VALID [2018-11-23 12:29:00,653 INFO L273 TraceCheckUtils]: 199: Hoare triple {35002#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35002#false} is VALID [2018-11-23 12:29:00,653 INFO L273 TraceCheckUtils]: 200: Hoare triple {35002#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35002#false} is VALID [2018-11-23 12:29:00,653 INFO L273 TraceCheckUtils]: 201: Hoare triple {35002#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35002#false} is VALID [2018-11-23 12:29:00,654 INFO L273 TraceCheckUtils]: 202: Hoare triple {35002#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35002#false} is VALID [2018-11-23 12:29:00,654 INFO L273 TraceCheckUtils]: 203: Hoare triple {35002#false} assume !(~i~0 < 1000); {35002#false} is VALID [2018-11-23 12:29:00,654 INFO L273 TraceCheckUtils]: 204: Hoare triple {35002#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {35002#false} is VALID [2018-11-23 12:29:00,654 INFO L273 TraceCheckUtils]: 205: Hoare triple {35002#false} assume true; {35002#false} is VALID [2018-11-23 12:29:00,654 INFO L268 TraceCheckUtils]: 206: Hoare quadruple {35002#false} {35002#false} #74#return; {35002#false} is VALID [2018-11-23 12:29:00,654 INFO L273 TraceCheckUtils]: 207: Hoare triple {35002#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {35002#false} is VALID [2018-11-23 12:29:00,654 INFO L273 TraceCheckUtils]: 208: Hoare triple {35002#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {35002#false} is VALID [2018-11-23 12:29:00,654 INFO L273 TraceCheckUtils]: 209: Hoare triple {35002#false} assume !false; {35002#false} is VALID [2018-11-23 12:29:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 738 proven. 100 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2018-11-23 12:29:00,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:00,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 13] total 54 [2018-11-23 12:29:00,702 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 210 [2018-11-23 12:29:00,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:00,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 12:29:00,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:00,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 12:29:00,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 12:29:00,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=980, Invalid=1882, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:29:00,924 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 54 states. [2018-11-23 12:29:02,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:02,526 INFO L93 Difference]: Finished difference Result 217 states and 226 transitions. [2018-11-23 12:29:02,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 12:29:02,527 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 210 [2018-11-23 12:29:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:02,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:29:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 157 transitions. [2018-11-23 12:29:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:29:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 157 transitions. [2018-11-23 12:29:02,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 157 transitions. [2018-11-23 12:29:02,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:02,697 INFO L225 Difference]: With dead ends: 217 [2018-11-23 12:29:02,697 INFO L226 Difference]: Without dead ends: 155 [2018-11-23 12:29:02,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=980, Invalid=1882, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:29:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-23 12:29:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-11-23 12:29:02,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:02,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 153 states. [2018-11-23 12:29:02,799 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 153 states. [2018-11-23 12:29:02,800 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 153 states. [2018-11-23 12:29:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:02,804 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-11-23 12:29:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2018-11-23 12:29:02,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:02,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:02,805 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 155 states. [2018-11-23 12:29:02,805 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 155 states. [2018-11-23 12:29:02,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:02,808 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-11-23 12:29:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2018-11-23 12:29:02,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:02,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:02,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:02,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 12:29:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2018-11-23 12:29:02,810 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 210 [2018-11-23 12:29:02,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:02,810 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2018-11-23 12:29:02,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-23 12:29:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:29:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-23 12:29:02,811 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:02,812 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:29:02,812 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:02,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:02,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2135618461, now seen corresponding path program 40 times [2018-11-23 12:29:02,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:02,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:02,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:02,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:02,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:03,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {36545#true} call ULTIMATE.init(); {36545#true} is VALID [2018-11-23 12:29:03,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {36545#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36545#true} is VALID [2018-11-23 12:29:03,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {36545#true} assume true; {36545#true} is VALID [2018-11-23 12:29:03,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36545#true} {36545#true} #66#return; {36545#true} is VALID [2018-11-23 12:29:03,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {36545#true} call #t~ret12 := main(); {36545#true} is VALID [2018-11-23 12:29:03,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {36545#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {36547#(= main_~i~1 0)} is VALID [2018-11-23 12:29:03,871 INFO L273 TraceCheckUtils]: 6: Hoare triple {36547#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36547#(= main_~i~1 0)} is VALID [2018-11-23 12:29:03,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {36547#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36548#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:03,872 INFO L273 TraceCheckUtils]: 8: Hoare triple {36548#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36548#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:03,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {36548#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36549#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:03,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {36549#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36549#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:03,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {36549#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36550#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:03,874 INFO L273 TraceCheckUtils]: 12: Hoare triple {36550#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36550#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:03,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {36550#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36551#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:03,874 INFO L273 TraceCheckUtils]: 14: Hoare triple {36551#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36551#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:03,875 INFO L273 TraceCheckUtils]: 15: Hoare triple {36551#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36552#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:03,875 INFO L273 TraceCheckUtils]: 16: Hoare triple {36552#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36552#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:03,876 INFO L273 TraceCheckUtils]: 17: Hoare triple {36552#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36553#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:03,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {36553#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36553#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:03,877 INFO L273 TraceCheckUtils]: 19: Hoare triple {36553#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36554#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:03,878 INFO L273 TraceCheckUtils]: 20: Hoare triple {36554#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36554#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:03,879 INFO L273 TraceCheckUtils]: 21: Hoare triple {36554#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36555#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:03,879 INFO L273 TraceCheckUtils]: 22: Hoare triple {36555#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36555#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:03,880 INFO L273 TraceCheckUtils]: 23: Hoare triple {36555#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36556#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:03,880 INFO L273 TraceCheckUtils]: 24: Hoare triple {36556#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36556#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:03,881 INFO L273 TraceCheckUtils]: 25: Hoare triple {36556#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36557#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:03,882 INFO L273 TraceCheckUtils]: 26: Hoare triple {36557#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36557#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:03,882 INFO L273 TraceCheckUtils]: 27: Hoare triple {36557#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36558#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:03,883 INFO L273 TraceCheckUtils]: 28: Hoare triple {36558#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36558#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:03,884 INFO L273 TraceCheckUtils]: 29: Hoare triple {36558#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36559#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:03,884 INFO L273 TraceCheckUtils]: 30: Hoare triple {36559#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36559#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:03,885 INFO L273 TraceCheckUtils]: 31: Hoare triple {36559#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36560#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:03,885 INFO L273 TraceCheckUtils]: 32: Hoare triple {36560#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36560#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:03,886 INFO L273 TraceCheckUtils]: 33: Hoare triple {36560#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36561#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:03,887 INFO L273 TraceCheckUtils]: 34: Hoare triple {36561#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36561#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:03,887 INFO L273 TraceCheckUtils]: 35: Hoare triple {36561#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36562#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:03,888 INFO L273 TraceCheckUtils]: 36: Hoare triple {36562#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36562#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:03,888 INFO L273 TraceCheckUtils]: 37: Hoare triple {36562#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36563#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:03,889 INFO L273 TraceCheckUtils]: 38: Hoare triple {36563#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36563#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:03,890 INFO L273 TraceCheckUtils]: 39: Hoare triple {36563#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36564#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:03,890 INFO L273 TraceCheckUtils]: 40: Hoare triple {36564#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36564#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:03,891 INFO L273 TraceCheckUtils]: 41: Hoare triple {36564#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36565#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:03,891 INFO L273 TraceCheckUtils]: 42: Hoare triple {36565#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36565#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:03,892 INFO L273 TraceCheckUtils]: 43: Hoare triple {36565#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36566#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:03,893 INFO L273 TraceCheckUtils]: 44: Hoare triple {36566#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36566#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:03,893 INFO L273 TraceCheckUtils]: 45: Hoare triple {36566#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36567#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:03,894 INFO L273 TraceCheckUtils]: 46: Hoare triple {36567#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36567#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:03,895 INFO L273 TraceCheckUtils]: 47: Hoare triple {36567#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36568#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:03,895 INFO L273 TraceCheckUtils]: 48: Hoare triple {36568#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36568#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:03,896 INFO L273 TraceCheckUtils]: 49: Hoare triple {36568#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36569#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:03,896 INFO L273 TraceCheckUtils]: 50: Hoare triple {36569#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36569#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:03,897 INFO L273 TraceCheckUtils]: 51: Hoare triple {36569#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36570#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:03,898 INFO L273 TraceCheckUtils]: 52: Hoare triple {36570#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36570#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:03,898 INFO L273 TraceCheckUtils]: 53: Hoare triple {36570#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36571#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:03,899 INFO L273 TraceCheckUtils]: 54: Hoare triple {36571#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36571#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:03,900 INFO L273 TraceCheckUtils]: 55: Hoare triple {36571#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36572#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:03,900 INFO L273 TraceCheckUtils]: 56: Hoare triple {36572#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36572#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:03,901 INFO L273 TraceCheckUtils]: 57: Hoare triple {36572#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36573#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:03,901 INFO L273 TraceCheckUtils]: 58: Hoare triple {36573#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36573#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:03,902 INFO L273 TraceCheckUtils]: 59: Hoare triple {36573#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36574#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:03,903 INFO L273 TraceCheckUtils]: 60: Hoare triple {36574#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36574#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:03,903 INFO L273 TraceCheckUtils]: 61: Hoare triple {36574#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36575#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:03,904 INFO L273 TraceCheckUtils]: 62: Hoare triple {36575#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36575#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:03,905 INFO L273 TraceCheckUtils]: 63: Hoare triple {36575#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36576#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:03,905 INFO L273 TraceCheckUtils]: 64: Hoare triple {36576#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36576#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:03,906 INFO L273 TraceCheckUtils]: 65: Hoare triple {36576#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36577#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:03,906 INFO L273 TraceCheckUtils]: 66: Hoare triple {36577#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36577#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:03,907 INFO L273 TraceCheckUtils]: 67: Hoare triple {36577#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36578#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:03,908 INFO L273 TraceCheckUtils]: 68: Hoare triple {36578#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36578#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:03,908 INFO L273 TraceCheckUtils]: 69: Hoare triple {36578#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36579#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:03,909 INFO L273 TraceCheckUtils]: 70: Hoare triple {36579#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36579#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:03,909 INFO L273 TraceCheckUtils]: 71: Hoare triple {36579#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36580#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:03,910 INFO L273 TraceCheckUtils]: 72: Hoare triple {36580#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36580#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:03,911 INFO L273 TraceCheckUtils]: 73: Hoare triple {36580#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36581#(<= main_~i~1 34)} is VALID [2018-11-23 12:29:03,911 INFO L273 TraceCheckUtils]: 74: Hoare triple {36581#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36581#(<= main_~i~1 34)} is VALID [2018-11-23 12:29:03,912 INFO L273 TraceCheckUtils]: 75: Hoare triple {36581#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36582#(<= main_~i~1 35)} is VALID [2018-11-23 12:29:03,912 INFO L273 TraceCheckUtils]: 76: Hoare triple {36582#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36582#(<= main_~i~1 35)} is VALID [2018-11-23 12:29:03,913 INFO L273 TraceCheckUtils]: 77: Hoare triple {36582#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36583#(<= main_~i~1 36)} is VALID [2018-11-23 12:29:03,914 INFO L273 TraceCheckUtils]: 78: Hoare triple {36583#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36583#(<= main_~i~1 36)} is VALID [2018-11-23 12:29:03,914 INFO L273 TraceCheckUtils]: 79: Hoare triple {36583#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36584#(<= main_~i~1 37)} is VALID [2018-11-23 12:29:03,915 INFO L273 TraceCheckUtils]: 80: Hoare triple {36584#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36584#(<= main_~i~1 37)} is VALID [2018-11-23 12:29:03,916 INFO L273 TraceCheckUtils]: 81: Hoare triple {36584#(<= main_~i~1 37)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36585#(<= main_~i~1 38)} is VALID [2018-11-23 12:29:03,916 INFO L273 TraceCheckUtils]: 82: Hoare triple {36585#(<= main_~i~1 38)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36585#(<= main_~i~1 38)} is VALID [2018-11-23 12:29:03,917 INFO L273 TraceCheckUtils]: 83: Hoare triple {36585#(<= main_~i~1 38)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36586#(<= main_~i~1 39)} is VALID [2018-11-23 12:29:03,917 INFO L273 TraceCheckUtils]: 84: Hoare triple {36586#(<= main_~i~1 39)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36586#(<= main_~i~1 39)} is VALID [2018-11-23 12:29:03,918 INFO L273 TraceCheckUtils]: 85: Hoare triple {36586#(<= main_~i~1 39)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36587#(<= main_~i~1 40)} is VALID [2018-11-23 12:29:03,919 INFO L273 TraceCheckUtils]: 86: Hoare triple {36587#(<= main_~i~1 40)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36587#(<= main_~i~1 40)} is VALID [2018-11-23 12:29:03,919 INFO L273 TraceCheckUtils]: 87: Hoare triple {36587#(<= main_~i~1 40)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36588#(<= main_~i~1 41)} is VALID [2018-11-23 12:29:03,920 INFO L273 TraceCheckUtils]: 88: Hoare triple {36588#(<= main_~i~1 41)} assume !(~i~1 < 1000); {36546#false} is VALID [2018-11-23 12:29:03,920 INFO L256 TraceCheckUtils]: 89: Hoare triple {36546#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {36545#true} is VALID [2018-11-23 12:29:03,920 INFO L273 TraceCheckUtils]: 90: Hoare triple {36545#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {36545#true} is VALID [2018-11-23 12:29:03,921 INFO L273 TraceCheckUtils]: 91: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,921 INFO L273 TraceCheckUtils]: 92: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,921 INFO L273 TraceCheckUtils]: 93: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,921 INFO L273 TraceCheckUtils]: 94: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,921 INFO L273 TraceCheckUtils]: 95: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,921 INFO L273 TraceCheckUtils]: 96: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,922 INFO L273 TraceCheckUtils]: 97: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,922 INFO L273 TraceCheckUtils]: 98: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,922 INFO L273 TraceCheckUtils]: 99: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,922 INFO L273 TraceCheckUtils]: 100: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,922 INFO L273 TraceCheckUtils]: 101: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,922 INFO L273 TraceCheckUtils]: 102: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,923 INFO L273 TraceCheckUtils]: 103: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,923 INFO L273 TraceCheckUtils]: 104: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,923 INFO L273 TraceCheckUtils]: 105: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,923 INFO L273 TraceCheckUtils]: 106: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,923 INFO L273 TraceCheckUtils]: 107: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,923 INFO L273 TraceCheckUtils]: 108: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,923 INFO L273 TraceCheckUtils]: 109: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,923 INFO L273 TraceCheckUtils]: 110: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,923 INFO L273 TraceCheckUtils]: 111: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,923 INFO L273 TraceCheckUtils]: 112: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,924 INFO L273 TraceCheckUtils]: 113: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,924 INFO L273 TraceCheckUtils]: 114: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,924 INFO L273 TraceCheckUtils]: 115: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,924 INFO L273 TraceCheckUtils]: 116: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,924 INFO L273 TraceCheckUtils]: 117: Hoare triple {36545#true} assume !(~i~0 < 1000); {36545#true} is VALID [2018-11-23 12:29:03,924 INFO L273 TraceCheckUtils]: 118: Hoare triple {36545#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {36545#true} is VALID [2018-11-23 12:29:03,924 INFO L273 TraceCheckUtils]: 119: Hoare triple {36545#true} assume true; {36545#true} is VALID [2018-11-23 12:29:03,924 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {36545#true} {36546#false} #70#return; {36546#false} is VALID [2018-11-23 12:29:03,924 INFO L273 TraceCheckUtils]: 121: Hoare triple {36546#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {36546#false} is VALID [2018-11-23 12:29:03,925 INFO L256 TraceCheckUtils]: 122: Hoare triple {36546#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {36545#true} is VALID [2018-11-23 12:29:03,925 INFO L273 TraceCheckUtils]: 123: Hoare triple {36545#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {36545#true} is VALID [2018-11-23 12:29:03,925 INFO L273 TraceCheckUtils]: 124: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,925 INFO L273 TraceCheckUtils]: 125: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,925 INFO L273 TraceCheckUtils]: 126: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,925 INFO L273 TraceCheckUtils]: 127: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,925 INFO L273 TraceCheckUtils]: 128: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,925 INFO L273 TraceCheckUtils]: 129: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,925 INFO L273 TraceCheckUtils]: 130: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,925 INFO L273 TraceCheckUtils]: 131: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,926 INFO L273 TraceCheckUtils]: 132: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,926 INFO L273 TraceCheckUtils]: 133: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,926 INFO L273 TraceCheckUtils]: 134: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,926 INFO L273 TraceCheckUtils]: 135: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,926 INFO L273 TraceCheckUtils]: 136: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,926 INFO L273 TraceCheckUtils]: 137: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,926 INFO L273 TraceCheckUtils]: 138: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,926 INFO L273 TraceCheckUtils]: 139: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,926 INFO L273 TraceCheckUtils]: 140: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,927 INFO L273 TraceCheckUtils]: 141: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,927 INFO L273 TraceCheckUtils]: 142: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,927 INFO L273 TraceCheckUtils]: 143: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,927 INFO L273 TraceCheckUtils]: 144: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,927 INFO L273 TraceCheckUtils]: 145: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,927 INFO L273 TraceCheckUtils]: 146: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,927 INFO L273 TraceCheckUtils]: 147: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,927 INFO L273 TraceCheckUtils]: 148: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,927 INFO L273 TraceCheckUtils]: 149: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,927 INFO L273 TraceCheckUtils]: 150: Hoare triple {36545#true} assume !(~i~0 < 1000); {36545#true} is VALID [2018-11-23 12:29:03,928 INFO L273 TraceCheckUtils]: 151: Hoare triple {36545#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {36545#true} is VALID [2018-11-23 12:29:03,928 INFO L273 TraceCheckUtils]: 152: Hoare triple {36545#true} assume true; {36545#true} is VALID [2018-11-23 12:29:03,928 INFO L268 TraceCheckUtils]: 153: Hoare quadruple {36545#true} {36546#false} #72#return; {36546#false} is VALID [2018-11-23 12:29:03,928 INFO L273 TraceCheckUtils]: 154: Hoare triple {36546#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {36546#false} is VALID [2018-11-23 12:29:03,928 INFO L273 TraceCheckUtils]: 155: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:03,928 INFO L273 TraceCheckUtils]: 156: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:03,928 INFO L273 TraceCheckUtils]: 157: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:03,928 INFO L273 TraceCheckUtils]: 158: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:03,928 INFO L273 TraceCheckUtils]: 159: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:03,928 INFO L273 TraceCheckUtils]: 160: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:03,929 INFO L273 TraceCheckUtils]: 161: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:03,929 INFO L273 TraceCheckUtils]: 162: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:03,929 INFO L273 TraceCheckUtils]: 163: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:03,929 INFO L273 TraceCheckUtils]: 164: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:03,929 INFO L273 TraceCheckUtils]: 165: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:03,929 INFO L273 TraceCheckUtils]: 166: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:03,929 INFO L273 TraceCheckUtils]: 167: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:03,929 INFO L273 TraceCheckUtils]: 168: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:03,929 INFO L273 TraceCheckUtils]: 169: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:03,929 INFO L273 TraceCheckUtils]: 170: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:03,930 INFO L273 TraceCheckUtils]: 171: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:03,930 INFO L273 TraceCheckUtils]: 172: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:03,930 INFO L273 TraceCheckUtils]: 173: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:03,930 INFO L273 TraceCheckUtils]: 174: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:03,930 INFO L273 TraceCheckUtils]: 175: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:03,930 INFO L273 TraceCheckUtils]: 176: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:03,930 INFO L273 TraceCheckUtils]: 177: Hoare triple {36546#false} assume !(~i~2 < 999); {36546#false} is VALID [2018-11-23 12:29:03,930 INFO L273 TraceCheckUtils]: 178: Hoare triple {36546#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {36546#false} is VALID [2018-11-23 12:29:03,930 INFO L256 TraceCheckUtils]: 179: Hoare triple {36546#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {36545#true} is VALID [2018-11-23 12:29:03,931 INFO L273 TraceCheckUtils]: 180: Hoare triple {36545#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {36545#true} is VALID [2018-11-23 12:29:03,931 INFO L273 TraceCheckUtils]: 181: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,931 INFO L273 TraceCheckUtils]: 182: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,931 INFO L273 TraceCheckUtils]: 183: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,931 INFO L273 TraceCheckUtils]: 184: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,931 INFO L273 TraceCheckUtils]: 185: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,931 INFO L273 TraceCheckUtils]: 186: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,931 INFO L273 TraceCheckUtils]: 187: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,931 INFO L273 TraceCheckUtils]: 188: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,931 INFO L273 TraceCheckUtils]: 189: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,932 INFO L273 TraceCheckUtils]: 190: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,932 INFO L273 TraceCheckUtils]: 191: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,932 INFO L273 TraceCheckUtils]: 192: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,932 INFO L273 TraceCheckUtils]: 193: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,932 INFO L273 TraceCheckUtils]: 194: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,932 INFO L273 TraceCheckUtils]: 195: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,932 INFO L273 TraceCheckUtils]: 196: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,932 INFO L273 TraceCheckUtils]: 197: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,932 INFO L273 TraceCheckUtils]: 198: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,932 INFO L273 TraceCheckUtils]: 199: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,933 INFO L273 TraceCheckUtils]: 200: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,933 INFO L273 TraceCheckUtils]: 201: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,933 INFO L273 TraceCheckUtils]: 202: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,933 INFO L273 TraceCheckUtils]: 203: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,933 INFO L273 TraceCheckUtils]: 204: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,933 INFO L273 TraceCheckUtils]: 205: Hoare triple {36545#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36545#true} is VALID [2018-11-23 12:29:03,933 INFO L273 TraceCheckUtils]: 206: Hoare triple {36545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36545#true} is VALID [2018-11-23 12:29:03,933 INFO L273 TraceCheckUtils]: 207: Hoare triple {36545#true} assume !(~i~0 < 1000); {36545#true} is VALID [2018-11-23 12:29:03,933 INFO L273 TraceCheckUtils]: 208: Hoare triple {36545#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {36545#true} is VALID [2018-11-23 12:29:03,933 INFO L273 TraceCheckUtils]: 209: Hoare triple {36545#true} assume true; {36545#true} is VALID [2018-11-23 12:29:03,934 INFO L268 TraceCheckUtils]: 210: Hoare quadruple {36545#true} {36546#false} #74#return; {36546#false} is VALID [2018-11-23 12:29:03,934 INFO L273 TraceCheckUtils]: 211: Hoare triple {36546#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {36546#false} is VALID [2018-11-23 12:29:03,934 INFO L273 TraceCheckUtils]: 212: Hoare triple {36546#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {36546#false} is VALID [2018-11-23 12:29:03,934 INFO L273 TraceCheckUtils]: 213: Hoare triple {36546#false} assume !false; {36546#false} is VALID [2018-11-23 12:29:03,954 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:29:03,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:03,954 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:29:03,962 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:29:04,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:29:04,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:04,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:05,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {36545#true} call ULTIMATE.init(); {36545#true} is VALID [2018-11-23 12:29:05,114 INFO L273 TraceCheckUtils]: 1: Hoare triple {36545#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36545#true} is VALID [2018-11-23 12:29:05,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {36545#true} assume true; {36545#true} is VALID [2018-11-23 12:29:05,115 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36545#true} {36545#true} #66#return; {36545#true} is VALID [2018-11-23 12:29:05,115 INFO L256 TraceCheckUtils]: 4: Hoare triple {36545#true} call #t~ret12 := main(); {36545#true} is VALID [2018-11-23 12:29:05,116 INFO L273 TraceCheckUtils]: 5: Hoare triple {36545#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {36607#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:05,116 INFO L273 TraceCheckUtils]: 6: Hoare triple {36607#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36607#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:05,117 INFO L273 TraceCheckUtils]: 7: Hoare triple {36607#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36548#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:05,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {36548#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36548#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:05,118 INFO L273 TraceCheckUtils]: 9: Hoare triple {36548#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36549#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:05,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {36549#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36549#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:05,118 INFO L273 TraceCheckUtils]: 11: Hoare triple {36549#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36550#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:05,119 INFO L273 TraceCheckUtils]: 12: Hoare triple {36550#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36550#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:05,119 INFO L273 TraceCheckUtils]: 13: Hoare triple {36550#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36551#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:05,120 INFO L273 TraceCheckUtils]: 14: Hoare triple {36551#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36551#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:05,121 INFO L273 TraceCheckUtils]: 15: Hoare triple {36551#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36552#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:05,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {36552#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36552#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:05,122 INFO L273 TraceCheckUtils]: 17: Hoare triple {36552#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36553#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:05,122 INFO L273 TraceCheckUtils]: 18: Hoare triple {36553#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36553#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:05,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {36553#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36554#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:05,124 INFO L273 TraceCheckUtils]: 20: Hoare triple {36554#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36554#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:05,124 INFO L273 TraceCheckUtils]: 21: Hoare triple {36554#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36555#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:05,128 INFO L273 TraceCheckUtils]: 22: Hoare triple {36555#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36555#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:05,128 INFO L273 TraceCheckUtils]: 23: Hoare triple {36555#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36556#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:05,130 INFO L273 TraceCheckUtils]: 24: Hoare triple {36556#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36556#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:05,130 INFO L273 TraceCheckUtils]: 25: Hoare triple {36556#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36557#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:05,130 INFO L273 TraceCheckUtils]: 26: Hoare triple {36557#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36557#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:05,131 INFO L273 TraceCheckUtils]: 27: Hoare triple {36557#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36558#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:05,132 INFO L273 TraceCheckUtils]: 28: Hoare triple {36558#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36558#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:05,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {36558#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36559#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:05,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {36559#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36559#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:05,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {36559#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36560#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:05,134 INFO L273 TraceCheckUtils]: 32: Hoare triple {36560#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36560#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:05,134 INFO L273 TraceCheckUtils]: 33: Hoare triple {36560#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36561#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:05,135 INFO L273 TraceCheckUtils]: 34: Hoare triple {36561#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36561#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:05,136 INFO L273 TraceCheckUtils]: 35: Hoare triple {36561#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36562#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:05,136 INFO L273 TraceCheckUtils]: 36: Hoare triple {36562#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36562#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:05,137 INFO L273 TraceCheckUtils]: 37: Hoare triple {36562#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36563#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:05,137 INFO L273 TraceCheckUtils]: 38: Hoare triple {36563#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36563#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:05,138 INFO L273 TraceCheckUtils]: 39: Hoare triple {36563#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36564#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:05,143 INFO L273 TraceCheckUtils]: 40: Hoare triple {36564#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36564#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:05,146 INFO L273 TraceCheckUtils]: 41: Hoare triple {36564#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36565#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:05,146 INFO L273 TraceCheckUtils]: 42: Hoare triple {36565#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36565#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:05,146 INFO L273 TraceCheckUtils]: 43: Hoare triple {36565#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36566#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:05,147 INFO L273 TraceCheckUtils]: 44: Hoare triple {36566#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36566#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:05,147 INFO L273 TraceCheckUtils]: 45: Hoare triple {36566#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36567#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:05,147 INFO L273 TraceCheckUtils]: 46: Hoare triple {36567#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36567#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:05,148 INFO L273 TraceCheckUtils]: 47: Hoare triple {36567#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36568#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:05,148 INFO L273 TraceCheckUtils]: 48: Hoare triple {36568#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36568#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:05,149 INFO L273 TraceCheckUtils]: 49: Hoare triple {36568#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36569#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:05,149 INFO L273 TraceCheckUtils]: 50: Hoare triple {36569#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36569#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:05,150 INFO L273 TraceCheckUtils]: 51: Hoare triple {36569#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36570#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:05,150 INFO L273 TraceCheckUtils]: 52: Hoare triple {36570#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36570#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:05,151 INFO L273 TraceCheckUtils]: 53: Hoare triple {36570#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36571#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:05,152 INFO L273 TraceCheckUtils]: 54: Hoare triple {36571#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36571#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:05,152 INFO L273 TraceCheckUtils]: 55: Hoare triple {36571#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36572#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:05,153 INFO L273 TraceCheckUtils]: 56: Hoare triple {36572#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36572#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:05,156 INFO L273 TraceCheckUtils]: 57: Hoare triple {36572#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36573#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:05,156 INFO L273 TraceCheckUtils]: 58: Hoare triple {36573#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36573#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:05,159 INFO L273 TraceCheckUtils]: 59: Hoare triple {36573#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36574#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:05,159 INFO L273 TraceCheckUtils]: 60: Hoare triple {36574#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36574#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:05,159 INFO L273 TraceCheckUtils]: 61: Hoare triple {36574#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36575#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:05,160 INFO L273 TraceCheckUtils]: 62: Hoare triple {36575#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36575#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:05,161 INFO L273 TraceCheckUtils]: 63: Hoare triple {36575#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36576#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:05,161 INFO L273 TraceCheckUtils]: 64: Hoare triple {36576#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36576#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:05,163 INFO L273 TraceCheckUtils]: 65: Hoare triple {36576#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36577#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:05,163 INFO L273 TraceCheckUtils]: 66: Hoare triple {36577#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36577#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:05,165 INFO L273 TraceCheckUtils]: 67: Hoare triple {36577#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36578#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:05,165 INFO L273 TraceCheckUtils]: 68: Hoare triple {36578#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36578#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:05,168 INFO L273 TraceCheckUtils]: 69: Hoare triple {36578#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36579#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:05,168 INFO L273 TraceCheckUtils]: 70: Hoare triple {36579#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36579#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:05,168 INFO L273 TraceCheckUtils]: 71: Hoare triple {36579#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36580#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:05,169 INFO L273 TraceCheckUtils]: 72: Hoare triple {36580#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36580#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:05,169 INFO L273 TraceCheckUtils]: 73: Hoare triple {36580#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36581#(<= main_~i~1 34)} is VALID [2018-11-23 12:29:05,169 INFO L273 TraceCheckUtils]: 74: Hoare triple {36581#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36581#(<= main_~i~1 34)} is VALID [2018-11-23 12:29:05,170 INFO L273 TraceCheckUtils]: 75: Hoare triple {36581#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36582#(<= main_~i~1 35)} is VALID [2018-11-23 12:29:05,171 INFO L273 TraceCheckUtils]: 76: Hoare triple {36582#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36582#(<= main_~i~1 35)} is VALID [2018-11-23 12:29:05,171 INFO L273 TraceCheckUtils]: 77: Hoare triple {36582#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36583#(<= main_~i~1 36)} is VALID [2018-11-23 12:29:05,173 INFO L273 TraceCheckUtils]: 78: Hoare triple {36583#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36583#(<= main_~i~1 36)} is VALID [2018-11-23 12:29:05,173 INFO L273 TraceCheckUtils]: 79: Hoare triple {36583#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36584#(<= main_~i~1 37)} is VALID [2018-11-23 12:29:05,174 INFO L273 TraceCheckUtils]: 80: Hoare triple {36584#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36584#(<= main_~i~1 37)} is VALID [2018-11-23 12:29:05,175 INFO L273 TraceCheckUtils]: 81: Hoare triple {36584#(<= main_~i~1 37)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36585#(<= main_~i~1 38)} is VALID [2018-11-23 12:29:05,175 INFO L273 TraceCheckUtils]: 82: Hoare triple {36585#(<= main_~i~1 38)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36585#(<= main_~i~1 38)} is VALID [2018-11-23 12:29:05,176 INFO L273 TraceCheckUtils]: 83: Hoare triple {36585#(<= main_~i~1 38)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36586#(<= main_~i~1 39)} is VALID [2018-11-23 12:29:05,176 INFO L273 TraceCheckUtils]: 84: Hoare triple {36586#(<= main_~i~1 39)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36586#(<= main_~i~1 39)} is VALID [2018-11-23 12:29:05,177 INFO L273 TraceCheckUtils]: 85: Hoare triple {36586#(<= main_~i~1 39)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36587#(<= main_~i~1 40)} is VALID [2018-11-23 12:29:05,178 INFO L273 TraceCheckUtils]: 86: Hoare triple {36587#(<= main_~i~1 40)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {36587#(<= main_~i~1 40)} is VALID [2018-11-23 12:29:05,178 INFO L273 TraceCheckUtils]: 87: Hoare triple {36587#(<= main_~i~1 40)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {36588#(<= main_~i~1 41)} is VALID [2018-11-23 12:29:05,179 INFO L273 TraceCheckUtils]: 88: Hoare triple {36588#(<= main_~i~1 41)} assume !(~i~1 < 1000); {36546#false} is VALID [2018-11-23 12:29:05,179 INFO L256 TraceCheckUtils]: 89: Hoare triple {36546#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {36546#false} is VALID [2018-11-23 12:29:05,179 INFO L273 TraceCheckUtils]: 90: Hoare triple {36546#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {36546#false} is VALID [2018-11-23 12:29:05,180 INFO L273 TraceCheckUtils]: 91: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,180 INFO L273 TraceCheckUtils]: 92: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,180 INFO L273 TraceCheckUtils]: 93: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,180 INFO L273 TraceCheckUtils]: 94: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,180 INFO L273 TraceCheckUtils]: 95: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,181 INFO L273 TraceCheckUtils]: 96: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,181 INFO L273 TraceCheckUtils]: 97: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,181 INFO L273 TraceCheckUtils]: 98: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,181 INFO L273 TraceCheckUtils]: 99: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,181 INFO L273 TraceCheckUtils]: 100: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,181 INFO L273 TraceCheckUtils]: 101: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,182 INFO L273 TraceCheckUtils]: 102: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,182 INFO L273 TraceCheckUtils]: 103: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,182 INFO L273 TraceCheckUtils]: 104: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,182 INFO L273 TraceCheckUtils]: 105: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,182 INFO L273 TraceCheckUtils]: 106: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,182 INFO L273 TraceCheckUtils]: 107: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,183 INFO L273 TraceCheckUtils]: 108: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,183 INFO L273 TraceCheckUtils]: 109: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,183 INFO L273 TraceCheckUtils]: 110: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,183 INFO L273 TraceCheckUtils]: 111: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,183 INFO L273 TraceCheckUtils]: 112: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,183 INFO L273 TraceCheckUtils]: 113: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,184 INFO L273 TraceCheckUtils]: 114: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,184 INFO L273 TraceCheckUtils]: 115: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,184 INFO L273 TraceCheckUtils]: 116: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,184 INFO L273 TraceCheckUtils]: 117: Hoare triple {36546#false} assume !(~i~0 < 1000); {36546#false} is VALID [2018-11-23 12:29:05,184 INFO L273 TraceCheckUtils]: 118: Hoare triple {36546#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {36546#false} is VALID [2018-11-23 12:29:05,184 INFO L273 TraceCheckUtils]: 119: Hoare triple {36546#false} assume true; {36546#false} is VALID [2018-11-23 12:29:05,184 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {36546#false} {36546#false} #70#return; {36546#false} is VALID [2018-11-23 12:29:05,184 INFO L273 TraceCheckUtils]: 121: Hoare triple {36546#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {36546#false} is VALID [2018-11-23 12:29:05,185 INFO L256 TraceCheckUtils]: 122: Hoare triple {36546#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {36546#false} is VALID [2018-11-23 12:29:05,185 INFO L273 TraceCheckUtils]: 123: Hoare triple {36546#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {36546#false} is VALID [2018-11-23 12:29:05,185 INFO L273 TraceCheckUtils]: 124: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,185 INFO L273 TraceCheckUtils]: 125: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,185 INFO L273 TraceCheckUtils]: 126: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,185 INFO L273 TraceCheckUtils]: 127: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,185 INFO L273 TraceCheckUtils]: 128: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,185 INFO L273 TraceCheckUtils]: 129: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,185 INFO L273 TraceCheckUtils]: 130: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,185 INFO L273 TraceCheckUtils]: 131: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,186 INFO L273 TraceCheckUtils]: 132: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,186 INFO L273 TraceCheckUtils]: 133: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,186 INFO L273 TraceCheckUtils]: 134: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,186 INFO L273 TraceCheckUtils]: 135: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,186 INFO L273 TraceCheckUtils]: 136: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,186 INFO L273 TraceCheckUtils]: 137: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,186 INFO L273 TraceCheckUtils]: 138: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,186 INFO L273 TraceCheckUtils]: 139: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,186 INFO L273 TraceCheckUtils]: 140: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,186 INFO L273 TraceCheckUtils]: 141: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,187 INFO L273 TraceCheckUtils]: 142: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,187 INFO L273 TraceCheckUtils]: 143: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,187 INFO L273 TraceCheckUtils]: 144: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,187 INFO L273 TraceCheckUtils]: 145: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,187 INFO L273 TraceCheckUtils]: 146: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,187 INFO L273 TraceCheckUtils]: 147: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,187 INFO L273 TraceCheckUtils]: 148: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,187 INFO L273 TraceCheckUtils]: 149: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,187 INFO L273 TraceCheckUtils]: 150: Hoare triple {36546#false} assume !(~i~0 < 1000); {36546#false} is VALID [2018-11-23 12:29:05,187 INFO L273 TraceCheckUtils]: 151: Hoare triple {36546#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {36546#false} is VALID [2018-11-23 12:29:05,188 INFO L273 TraceCheckUtils]: 152: Hoare triple {36546#false} assume true; {36546#false} is VALID [2018-11-23 12:29:05,188 INFO L268 TraceCheckUtils]: 153: Hoare quadruple {36546#false} {36546#false} #72#return; {36546#false} is VALID [2018-11-23 12:29:05,188 INFO L273 TraceCheckUtils]: 154: Hoare triple {36546#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {36546#false} is VALID [2018-11-23 12:29:05,188 INFO L273 TraceCheckUtils]: 155: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:05,188 INFO L273 TraceCheckUtils]: 156: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:05,188 INFO L273 TraceCheckUtils]: 157: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:05,188 INFO L273 TraceCheckUtils]: 158: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:05,188 INFO L273 TraceCheckUtils]: 159: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:05,188 INFO L273 TraceCheckUtils]: 160: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:05,189 INFO L273 TraceCheckUtils]: 161: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:05,189 INFO L273 TraceCheckUtils]: 162: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:05,189 INFO L273 TraceCheckUtils]: 163: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:05,189 INFO L273 TraceCheckUtils]: 164: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:05,189 INFO L273 TraceCheckUtils]: 165: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:05,189 INFO L273 TraceCheckUtils]: 166: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:05,189 INFO L273 TraceCheckUtils]: 167: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:05,189 INFO L273 TraceCheckUtils]: 168: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:05,189 INFO L273 TraceCheckUtils]: 169: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:05,189 INFO L273 TraceCheckUtils]: 170: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:05,190 INFO L273 TraceCheckUtils]: 171: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:05,190 INFO L273 TraceCheckUtils]: 172: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:05,190 INFO L273 TraceCheckUtils]: 173: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:05,190 INFO L273 TraceCheckUtils]: 174: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:05,190 INFO L273 TraceCheckUtils]: 175: Hoare triple {36546#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {36546#false} is VALID [2018-11-23 12:29:05,190 INFO L273 TraceCheckUtils]: 176: Hoare triple {36546#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {36546#false} is VALID [2018-11-23 12:29:05,190 INFO L273 TraceCheckUtils]: 177: Hoare triple {36546#false} assume !(~i~2 < 999); {36546#false} is VALID [2018-11-23 12:29:05,190 INFO L273 TraceCheckUtils]: 178: Hoare triple {36546#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {36546#false} is VALID [2018-11-23 12:29:05,190 INFO L256 TraceCheckUtils]: 179: Hoare triple {36546#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {36546#false} is VALID [2018-11-23 12:29:05,190 INFO L273 TraceCheckUtils]: 180: Hoare triple {36546#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {36546#false} is VALID [2018-11-23 12:29:05,191 INFO L273 TraceCheckUtils]: 181: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,191 INFO L273 TraceCheckUtils]: 182: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,191 INFO L273 TraceCheckUtils]: 183: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,191 INFO L273 TraceCheckUtils]: 184: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,191 INFO L273 TraceCheckUtils]: 185: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,191 INFO L273 TraceCheckUtils]: 186: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,191 INFO L273 TraceCheckUtils]: 187: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,191 INFO L273 TraceCheckUtils]: 188: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,191 INFO L273 TraceCheckUtils]: 189: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,192 INFO L273 TraceCheckUtils]: 190: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,192 INFO L273 TraceCheckUtils]: 191: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,192 INFO L273 TraceCheckUtils]: 192: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,192 INFO L273 TraceCheckUtils]: 193: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,192 INFO L273 TraceCheckUtils]: 194: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,192 INFO L273 TraceCheckUtils]: 195: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,192 INFO L273 TraceCheckUtils]: 196: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,192 INFO L273 TraceCheckUtils]: 197: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,192 INFO L273 TraceCheckUtils]: 198: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,192 INFO L273 TraceCheckUtils]: 199: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,193 INFO L273 TraceCheckUtils]: 200: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,193 INFO L273 TraceCheckUtils]: 201: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,193 INFO L273 TraceCheckUtils]: 202: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,193 INFO L273 TraceCheckUtils]: 203: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,193 INFO L273 TraceCheckUtils]: 204: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,193 INFO L273 TraceCheckUtils]: 205: Hoare triple {36546#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {36546#false} is VALID [2018-11-23 12:29:05,193 INFO L273 TraceCheckUtils]: 206: Hoare triple {36546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36546#false} is VALID [2018-11-23 12:29:05,193 INFO L273 TraceCheckUtils]: 207: Hoare triple {36546#false} assume !(~i~0 < 1000); {36546#false} is VALID [2018-11-23 12:29:05,193 INFO L273 TraceCheckUtils]: 208: Hoare triple {36546#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {36546#false} is VALID [2018-11-23 12:29:05,193 INFO L273 TraceCheckUtils]: 209: Hoare triple {36546#false} assume true; {36546#false} is VALID [2018-11-23 12:29:05,194 INFO L268 TraceCheckUtils]: 210: Hoare quadruple {36546#false} {36546#false} #74#return; {36546#false} is VALID [2018-11-23 12:29:05,194 INFO L273 TraceCheckUtils]: 211: Hoare triple {36546#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {36546#false} is VALID [2018-11-23 12:29:05,194 INFO L273 TraceCheckUtils]: 212: Hoare triple {36546#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {36546#false} is VALID [2018-11-23 12:29:05,194 INFO L273 TraceCheckUtils]: 213: Hoare triple {36546#false} assume !false; {36546#false} is VALID [2018-11-23 12:29:05,214 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:29:05,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:05,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-11-23 12:29:05,244 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 214 [2018-11-23 12:29:05,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:05,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 12:29:05,463 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:29:05,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 12:29:05,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 12:29:05,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:29:05,465 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 45 states. [2018-11-23 12:29:06,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:06,697 INFO L93 Difference]: Finished difference Result 220 states and 228 transitions. [2018-11-23 12:29:06,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 12:29:06,697 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 214 [2018-11-23 12:29:06,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:29:06,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 136 transitions. [2018-11-23 12:29:06,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:29:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 136 transitions. [2018-11-23 12:29:06,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 136 transitions. [2018-11-23 12:29:06,850 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:29:06,854 INFO L225 Difference]: With dead ends: 220 [2018-11-23 12:29:06,854 INFO L226 Difference]: Without dead ends: 156 [2018-11-23 12:29:06,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:29:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-23 12:29:06,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-11-23 12:29:06,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:06,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 155 states. [2018-11-23 12:29:06,962 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 155 states. [2018-11-23 12:29:06,963 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 155 states. [2018-11-23 12:29:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:06,965 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2018-11-23 12:29:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2018-11-23 12:29:06,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:06,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:06,966 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 156 states. [2018-11-23 12:29:06,966 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 156 states. [2018-11-23 12:29:06,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:06,969 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2018-11-23 12:29:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2018-11-23 12:29:06,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:06,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:06,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:06,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-23 12:29:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2018-11-23 12:29:06,972 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 214 [2018-11-23 12:29:06,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:06,973 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2018-11-23 12:29:06,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 12:29:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2018-11-23 12:29:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-23 12:29:06,974 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:06,974 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 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:29:06,974 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:06,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:06,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2126795903, now seen corresponding path program 41 times [2018-11-23 12:29:06,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:06,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:06,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:06,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:06,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:08,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {38102#true} call ULTIMATE.init(); {38102#true} is VALID [2018-11-23 12:29:08,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {38102#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {38102#true} is VALID [2018-11-23 12:29:08,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {38102#true} assume true; {38102#true} is VALID [2018-11-23 12:29:08,805 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38102#true} {38102#true} #66#return; {38102#true} is VALID [2018-11-23 12:29:08,805 INFO L256 TraceCheckUtils]: 4: Hoare triple {38102#true} call #t~ret12 := main(); {38102#true} is VALID [2018-11-23 12:29:08,806 INFO L273 TraceCheckUtils]: 5: Hoare triple {38102#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {38104#(= main_~i~1 0)} is VALID [2018-11-23 12:29:08,806 INFO L273 TraceCheckUtils]: 6: Hoare triple {38104#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38104#(= main_~i~1 0)} is VALID [2018-11-23 12:29:08,807 INFO L273 TraceCheckUtils]: 7: Hoare triple {38104#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38105#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:08,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {38105#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38105#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:08,808 INFO L273 TraceCheckUtils]: 9: Hoare triple {38105#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38106#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:08,808 INFO L273 TraceCheckUtils]: 10: Hoare triple {38106#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38106#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:08,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {38106#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38107#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:08,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {38107#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38107#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:08,809 INFO L273 TraceCheckUtils]: 13: Hoare triple {38107#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38108#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:08,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {38108#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38108#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:08,811 INFO L273 TraceCheckUtils]: 15: Hoare triple {38108#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38109#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:08,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {38109#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38109#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:08,812 INFO L273 TraceCheckUtils]: 17: Hoare triple {38109#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38110#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:08,813 INFO L273 TraceCheckUtils]: 18: Hoare triple {38110#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38110#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:08,813 INFO L273 TraceCheckUtils]: 19: Hoare triple {38110#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38111#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:08,814 INFO L273 TraceCheckUtils]: 20: Hoare triple {38111#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38111#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:08,814 INFO L273 TraceCheckUtils]: 21: Hoare triple {38111#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38112#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:08,815 INFO L273 TraceCheckUtils]: 22: Hoare triple {38112#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38112#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:08,816 INFO L273 TraceCheckUtils]: 23: Hoare triple {38112#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38113#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:08,816 INFO L273 TraceCheckUtils]: 24: Hoare triple {38113#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38113#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:08,817 INFO L273 TraceCheckUtils]: 25: Hoare triple {38113#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38114#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:08,818 INFO L273 TraceCheckUtils]: 26: Hoare triple {38114#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38114#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:08,818 INFO L273 TraceCheckUtils]: 27: Hoare triple {38114#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38115#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:08,819 INFO L273 TraceCheckUtils]: 28: Hoare triple {38115#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38115#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:08,819 INFO L273 TraceCheckUtils]: 29: Hoare triple {38115#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38116#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:08,820 INFO L273 TraceCheckUtils]: 30: Hoare triple {38116#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38116#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:08,821 INFO L273 TraceCheckUtils]: 31: Hoare triple {38116#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38117#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:08,821 INFO L273 TraceCheckUtils]: 32: Hoare triple {38117#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38117#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:08,822 INFO L273 TraceCheckUtils]: 33: Hoare triple {38117#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38118#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:08,823 INFO L273 TraceCheckUtils]: 34: Hoare triple {38118#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38118#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:08,823 INFO L273 TraceCheckUtils]: 35: Hoare triple {38118#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38119#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:08,824 INFO L273 TraceCheckUtils]: 36: Hoare triple {38119#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38119#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:08,825 INFO L273 TraceCheckUtils]: 37: Hoare triple {38119#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38120#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:08,825 INFO L273 TraceCheckUtils]: 38: Hoare triple {38120#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38120#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:08,826 INFO L273 TraceCheckUtils]: 39: Hoare triple {38120#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38121#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:08,826 INFO L273 TraceCheckUtils]: 40: Hoare triple {38121#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38121#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:08,827 INFO L273 TraceCheckUtils]: 41: Hoare triple {38121#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38122#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:08,828 INFO L273 TraceCheckUtils]: 42: Hoare triple {38122#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38122#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:08,828 INFO L273 TraceCheckUtils]: 43: Hoare triple {38122#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38123#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:08,829 INFO L273 TraceCheckUtils]: 44: Hoare triple {38123#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38123#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:08,830 INFO L273 TraceCheckUtils]: 45: Hoare triple {38123#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38124#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:08,830 INFO L273 TraceCheckUtils]: 46: Hoare triple {38124#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38124#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:08,831 INFO L273 TraceCheckUtils]: 47: Hoare triple {38124#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38125#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:08,831 INFO L273 TraceCheckUtils]: 48: Hoare triple {38125#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38125#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:08,832 INFO L273 TraceCheckUtils]: 49: Hoare triple {38125#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38126#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:08,833 INFO L273 TraceCheckUtils]: 50: Hoare triple {38126#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38126#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:08,833 INFO L273 TraceCheckUtils]: 51: Hoare triple {38126#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38127#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:08,834 INFO L273 TraceCheckUtils]: 52: Hoare triple {38127#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38127#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:08,835 INFO L273 TraceCheckUtils]: 53: Hoare triple {38127#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38128#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:08,835 INFO L273 TraceCheckUtils]: 54: Hoare triple {38128#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38128#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:08,836 INFO L273 TraceCheckUtils]: 55: Hoare triple {38128#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38129#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:08,836 INFO L273 TraceCheckUtils]: 56: Hoare triple {38129#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38129#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:08,837 INFO L273 TraceCheckUtils]: 57: Hoare triple {38129#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38130#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:08,838 INFO L273 TraceCheckUtils]: 58: Hoare triple {38130#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38130#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:08,838 INFO L273 TraceCheckUtils]: 59: Hoare triple {38130#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38131#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:08,839 INFO L273 TraceCheckUtils]: 60: Hoare triple {38131#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38131#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:08,840 INFO L273 TraceCheckUtils]: 61: Hoare triple {38131#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38132#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:08,840 INFO L273 TraceCheckUtils]: 62: Hoare triple {38132#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38132#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:08,841 INFO L273 TraceCheckUtils]: 63: Hoare triple {38132#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38133#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:08,842 INFO L273 TraceCheckUtils]: 64: Hoare triple {38133#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38133#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:08,842 INFO L273 TraceCheckUtils]: 65: Hoare triple {38133#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38134#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:08,843 INFO L273 TraceCheckUtils]: 66: Hoare triple {38134#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38134#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:08,843 INFO L273 TraceCheckUtils]: 67: Hoare triple {38134#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38135#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:08,844 INFO L273 TraceCheckUtils]: 68: Hoare triple {38135#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38135#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:08,845 INFO L273 TraceCheckUtils]: 69: Hoare triple {38135#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38136#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:08,845 INFO L273 TraceCheckUtils]: 70: Hoare triple {38136#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38136#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:08,846 INFO L273 TraceCheckUtils]: 71: Hoare triple {38136#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38137#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:08,847 INFO L273 TraceCheckUtils]: 72: Hoare triple {38137#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38137#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:08,847 INFO L273 TraceCheckUtils]: 73: Hoare triple {38137#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38138#(<= main_~i~1 34)} is VALID [2018-11-23 12:29:08,848 INFO L273 TraceCheckUtils]: 74: Hoare triple {38138#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38138#(<= main_~i~1 34)} is VALID [2018-11-23 12:29:08,848 INFO L273 TraceCheckUtils]: 75: Hoare triple {38138#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38139#(<= main_~i~1 35)} is VALID [2018-11-23 12:29:08,849 INFO L273 TraceCheckUtils]: 76: Hoare triple {38139#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38139#(<= main_~i~1 35)} is VALID [2018-11-23 12:29:08,850 INFO L273 TraceCheckUtils]: 77: Hoare triple {38139#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38140#(<= main_~i~1 36)} is VALID [2018-11-23 12:29:08,850 INFO L273 TraceCheckUtils]: 78: Hoare triple {38140#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38140#(<= main_~i~1 36)} is VALID [2018-11-23 12:29:08,851 INFO L273 TraceCheckUtils]: 79: Hoare triple {38140#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38141#(<= main_~i~1 37)} is VALID [2018-11-23 12:29:08,852 INFO L273 TraceCheckUtils]: 80: Hoare triple {38141#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38141#(<= main_~i~1 37)} is VALID [2018-11-23 12:29:08,852 INFO L273 TraceCheckUtils]: 81: Hoare triple {38141#(<= main_~i~1 37)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38142#(<= main_~i~1 38)} is VALID [2018-11-23 12:29:08,853 INFO L273 TraceCheckUtils]: 82: Hoare triple {38142#(<= main_~i~1 38)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38142#(<= main_~i~1 38)} is VALID [2018-11-23 12:29:08,854 INFO L273 TraceCheckUtils]: 83: Hoare triple {38142#(<= main_~i~1 38)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38143#(<= main_~i~1 39)} is VALID [2018-11-23 12:29:08,854 INFO L273 TraceCheckUtils]: 84: Hoare triple {38143#(<= main_~i~1 39)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38143#(<= main_~i~1 39)} is VALID [2018-11-23 12:29:08,855 INFO L273 TraceCheckUtils]: 85: Hoare triple {38143#(<= main_~i~1 39)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38144#(<= main_~i~1 40)} is VALID [2018-11-23 12:29:08,855 INFO L273 TraceCheckUtils]: 86: Hoare triple {38144#(<= main_~i~1 40)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38144#(<= main_~i~1 40)} is VALID [2018-11-23 12:29:08,856 INFO L273 TraceCheckUtils]: 87: Hoare triple {38144#(<= main_~i~1 40)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38145#(<= main_~i~1 41)} is VALID [2018-11-23 12:29:08,857 INFO L273 TraceCheckUtils]: 88: Hoare triple {38145#(<= main_~i~1 41)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {38145#(<= main_~i~1 41)} is VALID [2018-11-23 12:29:08,857 INFO L273 TraceCheckUtils]: 89: Hoare triple {38145#(<= main_~i~1 41)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {38146#(<= main_~i~1 42)} is VALID [2018-11-23 12:29:08,858 INFO L273 TraceCheckUtils]: 90: Hoare triple {38146#(<= main_~i~1 42)} assume !(~i~1 < 1000); {38103#false} is VALID [2018-11-23 12:29:08,858 INFO L256 TraceCheckUtils]: 91: Hoare triple {38103#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {38102#true} is VALID [2018-11-23 12:29:08,858 INFO L273 TraceCheckUtils]: 92: Hoare triple {38102#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {38102#true} is VALID [2018-11-23 12:29:08,859 INFO L273 TraceCheckUtils]: 93: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,859 INFO L273 TraceCheckUtils]: 94: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,859 INFO L273 TraceCheckUtils]: 95: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,859 INFO L273 TraceCheckUtils]: 96: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,859 INFO L273 TraceCheckUtils]: 97: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,859 INFO L273 TraceCheckUtils]: 98: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,860 INFO L273 TraceCheckUtils]: 99: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,860 INFO L273 TraceCheckUtils]: 100: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,860 INFO L273 TraceCheckUtils]: 101: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,860 INFO L273 TraceCheckUtils]: 102: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,860 INFO L273 TraceCheckUtils]: 103: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,861 INFO L273 TraceCheckUtils]: 104: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,861 INFO L273 TraceCheckUtils]: 105: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,861 INFO L273 TraceCheckUtils]: 106: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,861 INFO L273 TraceCheckUtils]: 107: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,861 INFO L273 TraceCheckUtils]: 108: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,861 INFO L273 TraceCheckUtils]: 109: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,861 INFO L273 TraceCheckUtils]: 110: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,861 INFO L273 TraceCheckUtils]: 111: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,861 INFO L273 TraceCheckUtils]: 112: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,862 INFO L273 TraceCheckUtils]: 113: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,862 INFO L273 TraceCheckUtils]: 114: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,862 INFO L273 TraceCheckUtils]: 115: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,862 INFO L273 TraceCheckUtils]: 116: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,862 INFO L273 TraceCheckUtils]: 117: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,862 INFO L273 TraceCheckUtils]: 118: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,862 INFO L273 TraceCheckUtils]: 119: Hoare triple {38102#true} assume !(~i~0 < 1000); {38102#true} is VALID [2018-11-23 12:29:08,862 INFO L273 TraceCheckUtils]: 120: Hoare triple {38102#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {38102#true} is VALID [2018-11-23 12:29:08,862 INFO L273 TraceCheckUtils]: 121: Hoare triple {38102#true} assume true; {38102#true} is VALID [2018-11-23 12:29:08,862 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {38102#true} {38103#false} #70#return; {38103#false} is VALID [2018-11-23 12:29:08,863 INFO L273 TraceCheckUtils]: 123: Hoare triple {38103#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {38103#false} is VALID [2018-11-23 12:29:08,863 INFO L256 TraceCheckUtils]: 124: Hoare triple {38103#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {38102#true} is VALID [2018-11-23 12:29:08,863 INFO L273 TraceCheckUtils]: 125: Hoare triple {38102#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {38102#true} is VALID [2018-11-23 12:29:08,863 INFO L273 TraceCheckUtils]: 126: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,863 INFO L273 TraceCheckUtils]: 127: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,863 INFO L273 TraceCheckUtils]: 128: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,863 INFO L273 TraceCheckUtils]: 129: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,863 INFO L273 TraceCheckUtils]: 130: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,863 INFO L273 TraceCheckUtils]: 131: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,864 INFO L273 TraceCheckUtils]: 132: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,864 INFO L273 TraceCheckUtils]: 133: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,864 INFO L273 TraceCheckUtils]: 134: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,864 INFO L273 TraceCheckUtils]: 135: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,864 INFO L273 TraceCheckUtils]: 136: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,864 INFO L273 TraceCheckUtils]: 137: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,864 INFO L273 TraceCheckUtils]: 138: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,864 INFO L273 TraceCheckUtils]: 139: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,864 INFO L273 TraceCheckUtils]: 140: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,864 INFO L273 TraceCheckUtils]: 141: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,865 INFO L273 TraceCheckUtils]: 142: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,865 INFO L273 TraceCheckUtils]: 143: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,865 INFO L273 TraceCheckUtils]: 144: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,865 INFO L273 TraceCheckUtils]: 145: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,865 INFO L273 TraceCheckUtils]: 146: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,865 INFO L273 TraceCheckUtils]: 147: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,865 INFO L273 TraceCheckUtils]: 148: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,865 INFO L273 TraceCheckUtils]: 149: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,865 INFO L273 TraceCheckUtils]: 150: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,866 INFO L273 TraceCheckUtils]: 151: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,866 INFO L273 TraceCheckUtils]: 152: Hoare triple {38102#true} assume !(~i~0 < 1000); {38102#true} is VALID [2018-11-23 12:29:08,866 INFO L273 TraceCheckUtils]: 153: Hoare triple {38102#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {38102#true} is VALID [2018-11-23 12:29:08,866 INFO L273 TraceCheckUtils]: 154: Hoare triple {38102#true} assume true; {38102#true} is VALID [2018-11-23 12:29:08,866 INFO L268 TraceCheckUtils]: 155: Hoare quadruple {38102#true} {38103#false} #72#return; {38103#false} is VALID [2018-11-23 12:29:08,866 INFO L273 TraceCheckUtils]: 156: Hoare triple {38103#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {38103#false} is VALID [2018-11-23 12:29:08,866 INFO L273 TraceCheckUtils]: 157: Hoare triple {38103#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {38103#false} is VALID [2018-11-23 12:29:08,866 INFO L273 TraceCheckUtils]: 158: Hoare triple {38103#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {38103#false} is VALID [2018-11-23 12:29:08,866 INFO L273 TraceCheckUtils]: 159: Hoare triple {38103#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {38103#false} is VALID [2018-11-23 12:29:08,866 INFO L273 TraceCheckUtils]: 160: Hoare triple {38103#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {38103#false} is VALID [2018-11-23 12:29:08,867 INFO L273 TraceCheckUtils]: 161: Hoare triple {38103#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {38103#false} is VALID [2018-11-23 12:29:08,867 INFO L273 TraceCheckUtils]: 162: Hoare triple {38103#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {38103#false} is VALID [2018-11-23 12:29:08,867 INFO L273 TraceCheckUtils]: 163: Hoare triple {38103#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {38103#false} is VALID [2018-11-23 12:29:08,867 INFO L273 TraceCheckUtils]: 164: Hoare triple {38103#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {38103#false} is VALID [2018-11-23 12:29:08,867 INFO L273 TraceCheckUtils]: 165: Hoare triple {38103#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {38103#false} is VALID [2018-11-23 12:29:08,867 INFO L273 TraceCheckUtils]: 166: Hoare triple {38103#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {38103#false} is VALID [2018-11-23 12:29:08,867 INFO L273 TraceCheckUtils]: 167: Hoare triple {38103#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {38103#false} is VALID [2018-11-23 12:29:08,867 INFO L273 TraceCheckUtils]: 168: Hoare triple {38103#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {38103#false} is VALID [2018-11-23 12:29:08,867 INFO L273 TraceCheckUtils]: 169: Hoare triple {38103#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {38103#false} is VALID [2018-11-23 12:29:08,867 INFO L273 TraceCheckUtils]: 170: Hoare triple {38103#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {38103#false} is VALID [2018-11-23 12:29:08,868 INFO L273 TraceCheckUtils]: 171: Hoare triple {38103#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {38103#false} is VALID [2018-11-23 12:29:08,868 INFO L273 TraceCheckUtils]: 172: Hoare triple {38103#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {38103#false} is VALID [2018-11-23 12:29:08,868 INFO L273 TraceCheckUtils]: 173: Hoare triple {38103#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {38103#false} is VALID [2018-11-23 12:29:08,868 INFO L273 TraceCheckUtils]: 174: Hoare triple {38103#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {38103#false} is VALID [2018-11-23 12:29:08,868 INFO L273 TraceCheckUtils]: 175: Hoare triple {38103#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {38103#false} is VALID [2018-11-23 12:29:08,868 INFO L273 TraceCheckUtils]: 176: Hoare triple {38103#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {38103#false} is VALID [2018-11-23 12:29:08,868 INFO L273 TraceCheckUtils]: 177: Hoare triple {38103#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {38103#false} is VALID [2018-11-23 12:29:08,868 INFO L273 TraceCheckUtils]: 178: Hoare triple {38103#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {38103#false} is VALID [2018-11-23 12:29:08,868 INFO L273 TraceCheckUtils]: 179: Hoare triple {38103#false} assume !(~i~2 < 999); {38103#false} is VALID [2018-11-23 12:29:08,869 INFO L273 TraceCheckUtils]: 180: Hoare triple {38103#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {38103#false} is VALID [2018-11-23 12:29:08,869 INFO L256 TraceCheckUtils]: 181: Hoare triple {38103#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {38102#true} is VALID [2018-11-23 12:29:08,869 INFO L273 TraceCheckUtils]: 182: Hoare triple {38102#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {38102#true} is VALID [2018-11-23 12:29:08,869 INFO L273 TraceCheckUtils]: 183: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,869 INFO L273 TraceCheckUtils]: 184: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,869 INFO L273 TraceCheckUtils]: 185: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,869 INFO L273 TraceCheckUtils]: 186: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,869 INFO L273 TraceCheckUtils]: 187: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,869 INFO L273 TraceCheckUtils]: 188: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,869 INFO L273 TraceCheckUtils]: 189: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,870 INFO L273 TraceCheckUtils]: 190: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,870 INFO L273 TraceCheckUtils]: 191: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,870 INFO L273 TraceCheckUtils]: 192: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,870 INFO L273 TraceCheckUtils]: 193: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,870 INFO L273 TraceCheckUtils]: 194: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,870 INFO L273 TraceCheckUtils]: 195: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,870 INFO L273 TraceCheckUtils]: 196: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,870 INFO L273 TraceCheckUtils]: 197: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,870 INFO L273 TraceCheckUtils]: 198: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,870 INFO L273 TraceCheckUtils]: 199: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,871 INFO L273 TraceCheckUtils]: 200: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,871 INFO L273 TraceCheckUtils]: 201: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,871 INFO L273 TraceCheckUtils]: 202: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,871 INFO L273 TraceCheckUtils]: 203: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,871 INFO L273 TraceCheckUtils]: 204: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,871 INFO L273 TraceCheckUtils]: 205: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,871 INFO L273 TraceCheckUtils]: 206: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,871 INFO L273 TraceCheckUtils]: 207: Hoare triple {38102#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {38102#true} is VALID [2018-11-23 12:29:08,871 INFO L273 TraceCheckUtils]: 208: Hoare triple {38102#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38102#true} is VALID [2018-11-23 12:29:08,872 INFO L273 TraceCheckUtils]: 209: Hoare triple {38102#true} assume !(~i~0 < 1000); {38102#true} is VALID [2018-11-23 12:29:08,872 INFO L273 TraceCheckUtils]: 210: Hoare triple {38102#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 1000 then 1 + ~ret~0 / 1000 else ~ret~0 / 1000) % 4294967296 - 4294967296); {38102#true} is VALID [2018-11-23 12:29:08,872 INFO L273 TraceCheckUtils]: 211: Hoare triple {38102#true} assume true; {38102#true} is VALID [2018-11-23 12:29:08,872 INFO L268 TraceCheckUtils]: 212: Hoare quadruple {38102#true} {38103#false} #74#return; {38103#false} is VALID [2018-11-23 12:29:08,872 INFO L273 TraceCheckUtils]: 213: Hoare triple {38103#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {38103#false} is VALID [2018-11-23 12:29:08,872 INFO L273 TraceCheckUtils]: 214: Hoare triple {38103#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {38103#false} is VALID [2018-11-23 12:29:08,872 INFO L273 TraceCheckUtils]: 215: Hoare triple {38103#false} assume !false; {38103#false} is VALID [2018-11-23 12:29:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3499 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2018-11-23 12:29:08,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:08,891 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:29:08,924 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1