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/mapavg3_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:26:58,299 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:26:58,302 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:26:58,316 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:26:58,316 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:26:58,317 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:26:58,318 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:26:58,320 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:26:58,322 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:26:58,323 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:26:58,324 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:26:58,324 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:26:58,325 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:26:58,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:26:58,327 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:26:58,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:26:58,329 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:26:58,331 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:26:58,333 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:26:58,335 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:26:58,336 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:26:58,338 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:26:58,340 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:26:58,341 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:26:58,341 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:26:58,342 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:26:58,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:26:58,344 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:26:58,345 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:26:58,346 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:26:58,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:26:58,347 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:26:58,347 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:26:58,347 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:26:58,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:26:58,349 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:26:58,350 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:58,365 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:26:58,365 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:26:58,366 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:26:58,367 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:26:58,367 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:26:58,367 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:26:58,368 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:26:58,368 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:26:58,368 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:26:58,368 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:26:58,369 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:26:58,369 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:26:58,369 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:26:58,369 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:26:58,369 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:26:58,370 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:26:58,370 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:26:58,370 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:26:58,370 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:26:58,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:26:58,371 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:26:58,371 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:26:58,371 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:26:58,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:26:58,371 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:26:58,372 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:26:58,372 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:26:58,372 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:26:58,372 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:26:58,372 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:26:58,373 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:26:58,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:26:58,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:26:58,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:26:58,436 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:26:58,437 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:26:58,438 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapavg3_true-unreach-call.i [2018-11-23 12:26:58,497 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2143203c/f7432aefa6504e0ca9dad4447b1aafe9/FLAGd0627720c [2018-11-23 12:26:58,940 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:26:58,941 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapavg3_true-unreach-call.i [2018-11-23 12:26:58,947 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2143203c/f7432aefa6504e0ca9dad4447b1aafe9/FLAGd0627720c [2018-11-23 12:26:59,309 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2143203c/f7432aefa6504e0ca9dad4447b1aafe9 [2018-11-23 12:26:59,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:26:59,321 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:26:59,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:26:59,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:26:59,326 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:26:59,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:26:59" (1/1) ... [2018-11-23 12:26:59,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4aca20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:59, skipping insertion in model container [2018-11-23 12:26:59,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:26:59" (1/1) ... [2018-11-23 12:26:59,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:26:59,373 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:26:59,669 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:26:59,683 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:26:59,720 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:26:59,748 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:26:59,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:59 WrapperNode [2018-11-23 12:26:59,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:26:59,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:26:59,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:26:59,749 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:26:59,758 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:59" (1/1) ... [2018-11-23 12:26:59,768 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:59" (1/1) ... [2018-11-23 12:26:59,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:26:59,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:26:59,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:26:59,776 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:26:59,784 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:59" (1/1) ... [2018-11-23 12:26:59,785 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:59" (1/1) ... [2018-11-23 12:26:59,787 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:59" (1/1) ... [2018-11-23 12:26:59,787 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:59" (1/1) ... [2018-11-23 12:26:59,801 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:59" (1/1) ... [2018-11-23 12:26:59,807 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:59" (1/1) ... [2018-11-23 12:26:59,813 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:59" (1/1) ... [2018-11-23 12:26:59,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:26:59,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:26:59,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:26:59,820 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:26:59,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:59" (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:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:26:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:26:59,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:26:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:26:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:26:59,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:26:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:26:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:26:59,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:26:59,960 INFO L130 BoogieDeclarations]: Found specification of procedure mapavg [2018-11-23 12:26:59,960 INFO L138 BoogieDeclarations]: Found implementation of procedure mapavg [2018-11-23 12:26:59,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:27:00,713 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:27:00,714 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:27:00,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:00 BoogieIcfgContainer [2018-11-23 12:27:00,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:27:00,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:27:00,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:27:00,720 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:27:00,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:26:59" (1/3) ... [2018-11-23 12:27:00,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a41388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:27:00, skipping insertion in model container [2018-11-23 12:27:00,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:59" (2/3) ... [2018-11-23 12:27:00,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a41388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:27:00, skipping insertion in model container [2018-11-23 12:27:00,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:00" (3/3) ... [2018-11-23 12:27:00,725 INFO L112 eAbstractionObserver]: Analyzing ICFG mapavg3_true-unreach-call.i [2018-11-23 12:27:00,736 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:27:00,746 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:27:00,767 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:27:00,814 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:27:00,815 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:27:00,815 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:27:00,815 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:27:00,815 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:27:00,816 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:27:00,816 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:27:00,816 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:27:00,816 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:27:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:27:00,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:27:00,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:00,864 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:27:00,866 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:00,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:00,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1234592251, now seen corresponding path program 1 times [2018-11-23 12:27:00,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:00,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:00,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:00,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:00,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:01,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:27:01,116 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:27:01,117 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:01,117 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 12:27:01,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret12 := main(); {34#true} is VALID [2018-11-23 12:27:01,118 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34#true} is VALID [2018-11-23 12:27:01,119 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:27:01,119 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:27:01,119 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:27:01,120 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !(~i~0 < 10000); {34#true} is VALID [2018-11-23 12:27:01,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:27:01,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:01,121 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {34#true} {35#false} #70#return; {35#false} is VALID [2018-11-23 12:27:01,121 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:27:01,122 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:27:01,122 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:27:01,122 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !(~i~0 < 10000); {34#true} is VALID [2018-11-23 12:27:01,122 INFO L273 TraceCheckUtils]: 17: Hoare triple {34#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:27:01,123 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:01,123 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #72#return; {35#false} is VALID [2018-11-23 12:27:01,123 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:27:01,124 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:27:01,124 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:27:01,124 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:27:01,125 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:27:01,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !(~i~0 < 10000); {34#true} is VALID [2018-11-23 12:27:01,125 INFO L273 TraceCheckUtils]: 26: Hoare triple {34#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:27:01,126 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:01,126 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #74#return; {35#false} is VALID [2018-11-23 12:27:01,126 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:27:01,127 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:27:01,127 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:27:01,134 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:27:01,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:01,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:27:01,143 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:27:01,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:01,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:27:01,451 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:27:01,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:27:01,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:27:01,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:27:01,462 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:27:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:01,619 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 12:27:01,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:27:01,620 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:27:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:27:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:27:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:27:01,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:27:01,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 12:27:01,918 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:01,930 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:27:01,930 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:27:01,934 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:27:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:27:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:27:01,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:01,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:01,984 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:01,984 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:01,991 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:27:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:27:01,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:01,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:01,993 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:01,993 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:01,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:01,998 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:27:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:27:01,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:01,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:01,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:02,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:27:02,005 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 12:27:02,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:02,006 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:27:02,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:27:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:27:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:27:02,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:02,008 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:27:02,009 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:02,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:02,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1054720325, now seen corresponding path program 1 times [2018-11-23 12:27:02,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:02,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:02,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:02,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:02,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:02,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2018-11-23 12:27:02,133 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:27:02,133 INFO L273 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:02,133 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #66#return; {198#true} is VALID [2018-11-23 12:27:02,133 INFO L256 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret12 := main(); {198#true} is VALID [2018-11-23 12:27:02,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {198#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:27:02,136 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= main_~i~1 0)} assume !(~i~1 < 10000); {199#false} is VALID [2018-11-23 12:27:02,136 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:27:02,136 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:27:02,137 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#true} assume !(~i~0 < 10000); {198#true} is VALID [2018-11-23 12:27:02,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:27:02,137 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:02,137 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {198#true} {199#false} #70#return; {199#false} is VALID [2018-11-23 12:27:02,138 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:27:02,138 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:27:02,138 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:27:02,138 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#true} assume !(~i~0 < 10000); {198#true} is VALID [2018-11-23 12:27:02,139 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:27:02,140 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:02,140 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {198#true} {199#false} #72#return; {199#false} is VALID [2018-11-23 12:27:02,141 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:27:02,141 INFO L273 TraceCheckUtils]: 21: Hoare triple {199#false} assume !(~i~2 < 9999); {199#false} is VALID [2018-11-23 12:27:02,141 INFO L273 TraceCheckUtils]: 22: Hoare triple {199#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:27:02,142 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:27:02,142 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:27:02,142 INFO L273 TraceCheckUtils]: 25: Hoare triple {198#true} assume !(~i~0 < 10000); {198#true} is VALID [2018-11-23 12:27:02,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {198#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:27:02,143 INFO L273 TraceCheckUtils]: 27: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:02,143 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {198#true} {199#false} #74#return; {199#false} is VALID [2018-11-23 12:27:02,144 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:27:02,144 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:27:02,144 INFO L273 TraceCheckUtils]: 31: Hoare triple {199#false} assume !false; {199#false} is VALID [2018-11-23 12:27:02,147 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:27:02,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:02,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:27:02,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:27:02,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:02,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:27:02,215 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:27:02,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:27:02,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:27:02,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:27:02,216 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 12:27:02,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:02,817 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:27:02,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:27:02,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:27:02,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:02,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:27:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:27:02,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:27:02,978 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:27:02,980 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:27:02,981 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:27:02,982 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:27:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:27:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:27:03,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:03,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:27:03,015 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:27:03,015 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:27:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:03,019 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:27:03,020 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:27:03,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:03,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:03,021 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:27:03,022 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:27:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:03,026 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:27:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:27:03,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:03,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:03,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:03,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:27:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:27:03,034 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:27:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:03,036 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:27:03,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:27:03,036 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:27:03,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:27:03,037 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:03,038 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:27:03,038 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:03,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:03,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1286970653, now seen corresponding path program 1 times [2018-11-23 12:27:03,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:03,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:03,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:03,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:03,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:03,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:27:03,177 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:27:03,177 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:03,178 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:27:03,178 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret12 := main(); {362#true} is VALID [2018-11-23 12:27:03,178 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:27:03,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 10000);assume -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:27:03,179 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:27:03,179 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 10000); {362#true} is VALID [2018-11-23 12:27:03,180 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:27:03,187 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:27:03,188 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= mapavg_~i~0 0)} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:27:03,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:03,188 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:03,189 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:27:03,189 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:27:03,189 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:27:03,190 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:27:03,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {362#true} assume !(~i~0 < 10000); {362#true} is VALID [2018-11-23 12:27:03,190 INFO L273 TraceCheckUtils]: 19: Hoare triple {362#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:27:03,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:03,191 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {362#true} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:27:03,191 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:27:03,192 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 9999); {363#false} is VALID [2018-11-23 12:27:03,192 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:27:03,192 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:27:03,193 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:27:03,193 INFO L273 TraceCheckUtils]: 27: Hoare triple {362#true} assume !(~i~0 < 10000); {362#true} is VALID [2018-11-23 12:27:03,193 INFO L273 TraceCheckUtils]: 28: Hoare triple {362#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:27:03,194 INFO L273 TraceCheckUtils]: 29: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:03,194 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {362#true} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:27:03,194 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:27:03,195 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:27:03,195 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:27:03,197 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:27:03,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:03,198 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:27:03,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:03,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:03,562 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:27:03,562 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:27:03,563 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:03,563 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:27:03,563 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret12 := main(); {362#true} is VALID [2018-11-23 12:27:03,564 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:27:03,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 10000);assume -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:27:03,565 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:27:03,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 10000); {362#true} is VALID [2018-11-23 12:27:03,566 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:27:03,570 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:27:03,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(<= mapavg_~i~0 0)} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:27:03,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:03,571 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:03,572 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:27:03,572 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:27:03,572 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:27:03,572 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:27:03,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {363#false} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:27:03,573 INFO L273 TraceCheckUtils]: 19: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:03,573 INFO L273 TraceCheckUtils]: 20: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:03,573 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {363#false} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:27:03,574 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:27:03,574 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 9999); {363#false} is VALID [2018-11-23 12:27:03,574 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:27:03,575 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:27:03,576 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:27:03,576 INFO L273 TraceCheckUtils]: 27: Hoare triple {363#false} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:27:03,576 INFO L273 TraceCheckUtils]: 28: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:03,577 INFO L273 TraceCheckUtils]: 29: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:03,577 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {363#false} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:27:03,577 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:27:03,578 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:27:03,578 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:27:03,580 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:27:03,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:27:03,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:27:03,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:27:03,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:03,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:27:03,720 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:27:03,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:27:03,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:27:03,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:03,721 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2018-11-23 12:27:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:04,090 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:27:04,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:27:04,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:27:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:27:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:27:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:27:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:27:04,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:27:04,205 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:27:04,206 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:27:04,207 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:27:04,208 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:27:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:27:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:27:04,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:04,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:27:04,232 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:27:04,232 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:27:04,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:04,235 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:27:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:27:04,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:04,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:04,236 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:27:04,237 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:27:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:04,239 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:27:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:27:04,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:04,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:04,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:04,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:27:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:27:04,243 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2018-11-23 12:27:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:04,244 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:27:04,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:27:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:27:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:27:04,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:04,246 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:27:04,246 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:04,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:04,247 INFO L82 PathProgramCache]: Analyzing trace with hash -631694085, now seen corresponding path program 1 times [2018-11-23 12:27:04,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:04,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:04,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:04,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:04,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:04,375 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-23 12:27:04,376 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:27:04,376 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:04,377 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #66#return; {630#true} is VALID [2018-11-23 12:27:04,377 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret12 := main(); {630#true} is VALID [2018-11-23 12:27:04,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {630#true} is VALID [2018-11-23 12:27:04,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {630#true} assume !!(~i~1 < 10000);assume -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:27:04,378 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:27:04,378 INFO L273 TraceCheckUtils]: 8: Hoare triple {630#true} assume !(~i~1 < 10000); {630#true} is VALID [2018-11-23 12:27:04,378 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:27:04,379 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:27:04,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {630#true} assume !!(~i~0 < 10000);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:27:04,379 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:27:04,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {630#true} assume !(~i~0 < 10000); {630#true} is VALID [2018-11-23 12:27:04,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {630#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:27:04,380 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:04,380 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {630#true} {630#true} #70#return; {630#true} is VALID [2018-11-23 12:27:04,381 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:27:04,381 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:27:04,381 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:27:04,381 INFO L273 TraceCheckUtils]: 20: Hoare triple {630#true} assume !!(~i~0 < 10000);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:27:04,382 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:27:04,382 INFO L273 TraceCheckUtils]: 22: Hoare triple {630#true} assume !(~i~0 < 10000); {630#true} is VALID [2018-11-23 12:27:04,382 INFO L273 TraceCheckUtils]: 23: Hoare triple {630#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:27:04,383 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:04,383 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {630#true} {630#true} #72#return; {630#true} is VALID [2018-11-23 12:27:04,390 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:27:04,392 INFO L273 TraceCheckUtils]: 27: Hoare triple {632#(= main_~i~2 0)} assume !(~i~2 < 9999); {631#false} is VALID [2018-11-23 12:27:04,392 INFO L273 TraceCheckUtils]: 28: Hoare triple {631#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {631#false} is VALID [2018-11-23 12:27:04,392 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:27:04,392 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:27:04,393 INFO L273 TraceCheckUtils]: 31: Hoare triple {630#true} assume !!(~i~0 < 10000);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:27:04,393 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:27:04,393 INFO L273 TraceCheckUtils]: 33: Hoare triple {630#true} assume !(~i~0 < 10000); {630#true} is VALID [2018-11-23 12:27:04,394 INFO L273 TraceCheckUtils]: 34: Hoare triple {630#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:27:04,394 INFO L273 TraceCheckUtils]: 35: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:04,395 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {630#true} {631#false} #74#return; {631#false} is VALID [2018-11-23 12:27:04,395 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:27:04,395 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:27:04,395 INFO L273 TraceCheckUtils]: 39: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-23 12:27:04,398 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:27:04,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:04,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:27:04,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:27:04,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:04,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:27:04,473 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:27:04,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:27:04,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:27:04,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:27:04,474 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 12:27:04,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:04,583 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:27:04,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:27:04,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:27:04,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:27:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:27:04,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 12:27:04,687 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:27:04,689 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:27:04,689 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:27:04,690 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:27:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:27:04,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:27:04,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:04,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:27:04,705 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:27:04,705 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:27:04,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:04,709 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:27:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:27:04,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:04,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:04,710 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:27:04,710 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:27:04,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:04,714 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:27:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:27:04,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:04,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:04,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:04,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:27:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:27:04,721 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2018-11-23 12:27:04,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:04,721 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:27:04,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:27:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:27:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:27:04,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:04,724 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:27:04,730 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:04,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:04,730 INFO L82 PathProgramCache]: Analyzing trace with hash -490156423, now seen corresponding path program 1 times [2018-11-23 12:27:04,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:04,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:04,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:04,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:04,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:04,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:27:04,934 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:27:04,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:04,935 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:27:04,935 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret12 := main(); {799#true} is VALID [2018-11-23 12:27:04,936 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:27:04,936 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:27:04,937 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:27:04,938 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 10000); {800#false} is VALID [2018-11-23 12:27:04,938 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:27:04,938 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:27:04,939 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#true} assume !!(~i~0 < 10000);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:27:04,939 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:27:04,939 INFO L273 TraceCheckUtils]: 13: Hoare triple {799#true} assume !(~i~0 < 10000); {799#true} is VALID [2018-11-23 12:27:04,940 INFO L273 TraceCheckUtils]: 14: Hoare triple {799#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:27:04,940 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:04,941 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {799#true} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:27:04,941 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:27:04,941 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:27:04,941 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:27:04,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {799#true} assume !!(~i~0 < 10000);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:27:04,942 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:27:04,942 INFO L273 TraceCheckUtils]: 22: Hoare triple {799#true} assume !(~i~0 < 10000); {799#true} is VALID [2018-11-23 12:27:04,943 INFO L273 TraceCheckUtils]: 23: Hoare triple {799#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:27:04,943 INFO L273 TraceCheckUtils]: 24: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:04,943 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {799#true} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:27:04,943 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:27:04,944 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:27:04,944 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:27:04,944 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 9999); {800#false} is VALID [2018-11-23 12:27:04,945 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:27:04,945 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:27:04,945 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:27:04,945 INFO L273 TraceCheckUtils]: 33: Hoare triple {799#true} assume !!(~i~0 < 10000);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:27:04,946 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:27:04,946 INFO L273 TraceCheckUtils]: 35: Hoare triple {799#true} assume !(~i~0 < 10000); {799#true} is VALID [2018-11-23 12:27:04,946 INFO L273 TraceCheckUtils]: 36: Hoare triple {799#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:27:04,946 INFO L273 TraceCheckUtils]: 37: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:04,947 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {799#true} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:27:04,947 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:27:04,947 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:27:04,947 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:27:04,950 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:27:04,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:04,951 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:27:04,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:05,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:05,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:27:05,368 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:27:05,368 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:05,369 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:27:05,369 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret12 := main(); {799#true} is VALID [2018-11-23 12:27:05,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:27:05,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:27:05,371 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:27:05,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 10000); {800#false} is VALID [2018-11-23 12:27:05,372 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:27:05,372 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:27:05,372 INFO L273 TraceCheckUtils]: 11: Hoare triple {800#false} assume !!(~i~0 < 10000);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:27:05,373 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:27:05,373 INFO L273 TraceCheckUtils]: 13: Hoare triple {800#false} assume !(~i~0 < 10000); {800#false} is VALID [2018-11-23 12:27:05,374 INFO L273 TraceCheckUtils]: 14: Hoare triple {800#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:27:05,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:27:05,374 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#false} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:27:05,375 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:27:05,375 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:27:05,375 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:27:05,375 INFO L273 TraceCheckUtils]: 20: Hoare triple {800#false} assume !!(~i~0 < 10000);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:27:05,376 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:27:05,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {800#false} assume !(~i~0 < 10000); {800#false} is VALID [2018-11-23 12:27:05,376 INFO L273 TraceCheckUtils]: 23: Hoare triple {800#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:27:05,377 INFO L273 TraceCheckUtils]: 24: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:27:05,377 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {800#false} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:27:05,377 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:27:05,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:27:05,378 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:27:05,378 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 9999); {800#false} is VALID [2018-11-23 12:27:05,378 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:27:05,378 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:27:05,379 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:27:05,379 INFO L273 TraceCheckUtils]: 33: Hoare triple {800#false} assume !!(~i~0 < 10000);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:27:05,379 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:27:05,380 INFO L273 TraceCheckUtils]: 35: Hoare triple {800#false} assume !(~i~0 < 10000); {800#false} is VALID [2018-11-23 12:27:05,380 INFO L273 TraceCheckUtils]: 36: Hoare triple {800#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:27:05,380 INFO L273 TraceCheckUtils]: 37: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:27:05,380 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {800#false} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:27:05,381 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:27:05,381 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:27:05,381 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:27:05,384 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:27:05,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:05,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:27:05,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:27:05,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:05,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:27:05,481 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:27:05,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:27:05,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:27:05,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:27:05,482 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2018-11-23 12:27:05,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:05,701 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:27:05,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:27:05,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:27:05,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:27:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:27:05,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:27:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:27:05,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-23 12:27:05,820 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:27:05,821 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:27:05,821 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:27:05,822 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:27:05,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:27:05,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:27:05,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:05,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:27:05,886 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:27:05,886 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:27:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:05,889 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:27:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:27:05,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:05,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:05,890 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:27:05,890 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:27:05,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:05,892 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:27:05,893 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:27:05,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:05,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:05,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:05,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:27:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:27:05,896 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2018-11-23 12:27:05,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:05,896 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:27:05,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:27:05,896 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:27:05,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:27:05,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:05,898 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:27:05,898 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:05,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:05,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1271601755, now seen corresponding path program 2 times [2018-11-23 12:27:05,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:05,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:05,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:05,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:05,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:06,032 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:27:06,033 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:27:06,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:06,034 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:27:06,034 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret12 := main(); {1114#true} is VALID [2018-11-23 12:27:06,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:27:06,039 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:27:06,041 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:27:06,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:27:06,043 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:27:06,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 10000); {1115#false} is VALID [2018-11-23 12:27:06,044 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:27:06,044 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:27:06,045 INFO L273 TraceCheckUtils]: 13: Hoare triple {1114#true} assume !!(~i~0 < 10000);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:27:06,045 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:27:06,045 INFO L273 TraceCheckUtils]: 15: Hoare triple {1114#true} assume !(~i~0 < 10000); {1114#true} is VALID [2018-11-23 12:27:06,046 INFO L273 TraceCheckUtils]: 16: Hoare triple {1114#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:27:06,046 INFO L273 TraceCheckUtils]: 17: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:06,046 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1114#true} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:27:06,047 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:27:06,047 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:27:06,048 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:27:06,048 INFO L273 TraceCheckUtils]: 22: Hoare triple {1114#true} assume !!(~i~0 < 10000);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:27:06,048 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:27:06,049 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#true} assume !(~i~0 < 10000); {1114#true} is VALID [2018-11-23 12:27:06,049 INFO L273 TraceCheckUtils]: 25: Hoare triple {1114#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:27:06,049 INFO L273 TraceCheckUtils]: 26: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:06,049 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1114#true} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:27:06,050 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:27:06,050 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:27:06,050 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:27:06,050 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 9999); {1115#false} is VALID [2018-11-23 12:27:06,051 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:27:06,051 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:27:06,051 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:27:06,051 INFO L273 TraceCheckUtils]: 35: Hoare triple {1114#true} assume !!(~i~0 < 10000);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:27:06,051 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:27:06,052 INFO L273 TraceCheckUtils]: 37: Hoare triple {1114#true} assume !(~i~0 < 10000); {1114#true} is VALID [2018-11-23 12:27:06,052 INFO L273 TraceCheckUtils]: 38: Hoare triple {1114#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:27:06,052 INFO L273 TraceCheckUtils]: 39: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:06,052 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1114#true} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:27:06,052 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:27:06,053 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:27:06,053 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:27:06,055 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:27:06,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:06,055 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:27:06,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:06,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:06,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:06,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:06,238 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:27:06,239 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:27:06,239 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:06,240 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:27:06,240 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret12 := main(); {1114#true} is VALID [2018-11-23 12:27:06,245 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:27:06,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {1137#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:27:06,247 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:27:06,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:27:06,248 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:27:06,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 10000); {1115#false} is VALID [2018-11-23 12:27:06,249 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:27:06,249 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:27:06,249 INFO L273 TraceCheckUtils]: 13: Hoare triple {1115#false} assume !!(~i~0 < 10000);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:27:06,250 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:27:06,250 INFO L273 TraceCheckUtils]: 15: Hoare triple {1115#false} assume !(~i~0 < 10000); {1115#false} is VALID [2018-11-23 12:27:06,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {1115#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:27:06,251 INFO L273 TraceCheckUtils]: 17: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:27:06,252 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1115#false} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:27:06,252 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:27:06,252 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:27:06,253 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:27:06,253 INFO L273 TraceCheckUtils]: 22: Hoare triple {1115#false} assume !!(~i~0 < 10000);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:27:06,253 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:27:06,253 INFO L273 TraceCheckUtils]: 24: Hoare triple {1115#false} assume !(~i~0 < 10000); {1115#false} is VALID [2018-11-23 12:27:06,253 INFO L273 TraceCheckUtils]: 25: Hoare triple {1115#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:27:06,254 INFO L273 TraceCheckUtils]: 26: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:27:06,254 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1115#false} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:27:06,254 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:27:06,254 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:27:06,254 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:27:06,254 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 9999); {1115#false} is VALID [2018-11-23 12:27:06,255 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:27:06,255 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:27:06,255 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:27:06,255 INFO L273 TraceCheckUtils]: 35: Hoare triple {1115#false} assume !!(~i~0 < 10000);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:27:06,255 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:27:06,256 INFO L273 TraceCheckUtils]: 37: Hoare triple {1115#false} assume !(~i~0 < 10000); {1115#false} is VALID [2018-11-23 12:27:06,256 INFO L273 TraceCheckUtils]: 38: Hoare triple {1115#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:27:06,256 INFO L273 TraceCheckUtils]: 39: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:27:06,256 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1115#false} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:27:06,257 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:27:06,257 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:27:06,257 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:27:06,259 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:27:06,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:06,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:27:06,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:27:06,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:06,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:27:06,346 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:27:06,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:27:06,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:27:06,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:27:06,348 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-23 12:27:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:06,521 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 12:27:06,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:27:06,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:27:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:27:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:27:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:27:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:27:06,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:27:06,653 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:27:06,656 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:27:06,656 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:27:06,657 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:27:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:27:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:27:06,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:06,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:27:06,751 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:27:06,751 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:27:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:06,754 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:27:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:27:06,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:06,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:06,755 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:27:06,755 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:27:06,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:06,757 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:27:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:27:06,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:06,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:06,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:06,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:27:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:27:06,760 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2018-11-23 12:27:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:06,760 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:27:06,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:27:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:27:06,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:27:06,762 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:06,762 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:27:06,762 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:06,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:06,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2104096189, now seen corresponding path program 3 times [2018-11-23 12:27:06,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:06,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:06,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:06,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:06,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:06,894 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:27:06,894 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:27:06,895 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:06,895 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:27:06,896 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret12 := main(); {1446#true} is VALID [2018-11-23 12:27:06,896 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:27:06,897 INFO L273 TraceCheckUtils]: 6: Hoare triple {1448#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:27:06,897 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:27:06,898 INFO L273 TraceCheckUtils]: 8: Hoare triple {1449#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:27:06,898 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:27:06,899 INFO L273 TraceCheckUtils]: 10: Hoare triple {1450#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:27:06,899 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:27:06,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#(<= main_~i~1 3)} assume !(~i~1 < 10000); {1447#false} is VALID [2018-11-23 12:27:06,900 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:27:06,901 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:27:06,901 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 10000);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:27:06,902 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:27:06,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:27:06,902 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:06,903 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:06,903 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1447#false} #70#return; {1447#false} is VALID [2018-11-23 12:27:06,903 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:27:06,903 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:27:06,904 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:27:06,904 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 10000);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:27:06,904 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:27:06,904 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:27:06,905 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:06,905 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:06,905 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1447#false} #72#return; {1447#false} is VALID [2018-11-23 12:27:06,905 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:27:06,906 INFO L273 TraceCheckUtils]: 31: Hoare triple {1447#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:27:06,906 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:27:06,906 INFO L273 TraceCheckUtils]: 33: Hoare triple {1447#false} assume !(~i~2 < 9999); {1447#false} is VALID [2018-11-23 12:27:06,907 INFO L273 TraceCheckUtils]: 34: Hoare triple {1447#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:27:06,907 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:27:06,907 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:27:06,907 INFO L273 TraceCheckUtils]: 37: Hoare triple {1446#true} assume !!(~i~0 < 10000);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:27:06,908 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:27:06,908 INFO L273 TraceCheckUtils]: 39: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:27:06,908 INFO L273 TraceCheckUtils]: 40: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:06,908 INFO L273 TraceCheckUtils]: 41: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:06,909 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1446#true} {1447#false} #74#return; {1447#false} is VALID [2018-11-23 12:27:06,909 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:27:06,909 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:27:06,909 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:27:06,912 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:27:06,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:06,913 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:27:06,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:06,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:27:06,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:07,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:07,548 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:27:07,549 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:27:07,549 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:07,549 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:27:07,549 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret12 := main(); {1446#true} is VALID [2018-11-23 12:27:07,550 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1446#true} is VALID [2018-11-23 12:27:07,550 INFO L273 TraceCheckUtils]: 6: Hoare triple {1446#true} assume !!(~i~1 < 10000);assume -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:27:07,550 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:27:07,550 INFO L273 TraceCheckUtils]: 8: Hoare triple {1446#true} assume !!(~i~1 < 10000);assume -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:27:07,550 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:27:07,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {1446#true} assume !!(~i~1 < 10000);assume -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:27:07,551 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:27:07,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {1446#true} assume !(~i~1 < 10000); {1446#true} is VALID [2018-11-23 12:27:07,551 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:27:07,551 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:27:07,551 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 10000);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:27:07,552 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:27:07,552 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:27:07,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:07,552 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:07,552 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1446#true} #70#return; {1446#true} is VALID [2018-11-23 12:27:07,552 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:27:07,553 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:27:07,553 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:27:07,553 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 10000);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:27:07,553 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:27:07,553 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:27:07,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:07,554 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:07,554 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1446#true} #72#return; {1446#true} is VALID [2018-11-23 12:27:07,554 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:27:07,554 INFO L273 TraceCheckUtils]: 31: Hoare triple {1446#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:27:07,554 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:27:07,555 INFO L273 TraceCheckUtils]: 33: Hoare triple {1446#true} assume !(~i~2 < 9999); {1446#true} is VALID [2018-11-23 12:27:07,555 INFO L273 TraceCheckUtils]: 34: Hoare triple {1446#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:27:07,555 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:27:07,556 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:27:07,556 INFO L273 TraceCheckUtils]: 37: Hoare triple {1563#(<= mapavg_~i~0 0)} assume !!(~i~0 < 10000);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:27:07,557 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:27:07,557 INFO L273 TraceCheckUtils]: 39: Hoare triple {1570#(<= mapavg_~i~0 1)} assume !(~i~0 < 10000); {1447#false} is VALID [2018-11-23 12:27:07,558 INFO L273 TraceCheckUtils]: 40: Hoare triple {1447#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1447#false} is VALID [2018-11-23 12:27:07,558 INFO L273 TraceCheckUtils]: 41: Hoare triple {1447#false} assume true; {1447#false} is VALID [2018-11-23 12:27:07,558 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1447#false} {1446#true} #74#return; {1447#false} is VALID [2018-11-23 12:27:07,558 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:27:07,558 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:27:07,558 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:27:07,561 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:27:07,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:07,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:27:07,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:27:07,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:07,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:27:07,695 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:27:07,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:27:07,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:27:07,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:07,696 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-23 12:27:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:08,142 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 12:27:08,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:27:08,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:27:08,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:27:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:27:08,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2018-11-23 12:27:08,320 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:08,322 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:27:08,323 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:27:08,323 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:27:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:27:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:27:08,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:08,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:27:08,345 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:27:08,345 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:27:08,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:08,347 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:27:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:27:08,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:08,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:08,349 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:27:08,350 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:27:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:08,352 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:27:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:27:08,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:08,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:08,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:08,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:27:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:27:08,356 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2018-11-23 12:27:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:08,356 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:27:08,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:27:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:27:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:27:08,357 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:08,357 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:27:08,358 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:08,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:08,358 INFO L82 PathProgramCache]: Analyzing trace with hash 780809725, now seen corresponding path program 4 times [2018-11-23 12:27:08,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:08,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:08,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:08,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:08,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:08,995 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:27:08,996 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:27:08,996 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:08,996 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:27:08,997 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 12:27:08,998 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:27:08,999 INFO L273 TraceCheckUtils]: 6: Hoare triple {1811#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:27:09,000 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:27:09,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:27:09,001 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:27:09,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:27:09,002 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:27:09,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:27:09,003 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:27:09,004 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 10000); {1810#false} is VALID [2018-11-23 12:27:09,005 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:27:09,005 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:27:09,005 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#true} assume !!(~i~0 < 10000);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:27:09,006 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:27:09,006 INFO L273 TraceCheckUtils]: 19: Hoare triple {1809#true} assume !!(~i~0 < 10000);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:27:09,006 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:27:09,006 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} assume !(~i~0 < 10000); {1809#true} is VALID [2018-11-23 12:27:09,007 INFO L273 TraceCheckUtils]: 22: Hoare triple {1809#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:27:09,007 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:09,007 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1809#true} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:27:09,008 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:27:09,008 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:27:09,008 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:27:09,009 INFO L273 TraceCheckUtils]: 28: Hoare triple {1809#true} assume !!(~i~0 < 10000);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:27:09,009 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:27:09,009 INFO L273 TraceCheckUtils]: 30: Hoare triple {1809#true} assume !!(~i~0 < 10000);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:27:09,009 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:27:09,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {1809#true} assume !(~i~0 < 10000); {1809#true} is VALID [2018-11-23 12:27:09,010 INFO L273 TraceCheckUtils]: 33: Hoare triple {1809#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:27:09,010 INFO L273 TraceCheckUtils]: 34: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:09,010 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1809#true} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:27:09,010 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:27:09,010 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:27:09,011 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:27:09,011 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 9999); {1810#false} is VALID [2018-11-23 12:27:09,011 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:27:09,011 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:27:09,011 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:27:09,012 INFO L273 TraceCheckUtils]: 43: Hoare triple {1809#true} assume !!(~i~0 < 10000);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:27:09,012 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:27:09,012 INFO L273 TraceCheckUtils]: 45: Hoare triple {1809#true} assume !!(~i~0 < 10000);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:27:09,012 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:27:09,012 INFO L273 TraceCheckUtils]: 47: Hoare triple {1809#true} assume !(~i~0 < 10000); {1809#true} is VALID [2018-11-23 12:27:09,013 INFO L273 TraceCheckUtils]: 48: Hoare triple {1809#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:27:09,013 INFO L273 TraceCheckUtils]: 49: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:09,013 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1809#true} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:27:09,013 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:27:09,014 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:27:09,014 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:27:09,017 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:27:09,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:09,018 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:27:09,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:09,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:09,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:09,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:09,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:27:09,364 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:27:09,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:09,364 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:27:09,364 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 12:27:09,365 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:27:09,365 INFO L273 TraceCheckUtils]: 6: Hoare triple {1834#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:27:09,366 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:27:09,367 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:27:09,367 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:27:09,368 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:27:09,368 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:27:09,369 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:27:09,375 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:27:09,376 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 10000); {1810#false} is VALID [2018-11-23 12:27:09,376 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:27:09,376 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:27:09,376 INFO L273 TraceCheckUtils]: 17: Hoare triple {1810#false} assume !!(~i~0 < 10000);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:27:09,376 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:27:09,377 INFO L273 TraceCheckUtils]: 19: Hoare triple {1810#false} assume !!(~i~0 < 10000);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:27:09,377 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:27:09,377 INFO L273 TraceCheckUtils]: 21: Hoare triple {1810#false} assume !(~i~0 < 10000); {1810#false} is VALID [2018-11-23 12:27:09,378 INFO L273 TraceCheckUtils]: 22: Hoare triple {1810#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:27:09,378 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:27:09,378 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1810#false} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:27:09,378 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:27:09,379 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:27:09,379 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:27:09,379 INFO L273 TraceCheckUtils]: 28: Hoare triple {1810#false} assume !!(~i~0 < 10000);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:27:09,380 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:27:09,380 INFO L273 TraceCheckUtils]: 30: Hoare triple {1810#false} assume !!(~i~0 < 10000);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:27:09,380 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:27:09,380 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} assume !(~i~0 < 10000); {1810#false} is VALID [2018-11-23 12:27:09,381 INFO L273 TraceCheckUtils]: 33: Hoare triple {1810#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:27:09,381 INFO L273 TraceCheckUtils]: 34: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:27:09,381 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1810#false} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:27:09,381 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:27:09,382 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:27:09,382 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:27:09,382 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 9999); {1810#false} is VALID [2018-11-23 12:27:09,382 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:27:09,383 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:27:09,383 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:27:09,383 INFO L273 TraceCheckUtils]: 43: Hoare triple {1810#false} assume !!(~i~0 < 10000);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:27:09,383 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:27:09,384 INFO L273 TraceCheckUtils]: 45: Hoare triple {1810#false} assume !!(~i~0 < 10000);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:27:09,384 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:27:09,384 INFO L273 TraceCheckUtils]: 47: Hoare triple {1810#false} assume !(~i~0 < 10000); {1810#false} is VALID [2018-11-23 12:27:09,384 INFO L273 TraceCheckUtils]: 48: Hoare triple {1810#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:27:09,385 INFO L273 TraceCheckUtils]: 49: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:27:09,385 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1810#false} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:27:09,385 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:27:09,385 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:27:09,386 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:27:09,395 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:27:09,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:09,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:27:09,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:27:09,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:09,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:27:09,541 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:27:09,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:27:09,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:27:09,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:09,541 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 12:27:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:09,941 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:27:09,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:27:09,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:27:09,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:09,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:27:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:27:09,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2018-11-23 12:27:10,143 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:27:10,145 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:27:10,146 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:27:10,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:27:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:27:10,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:10,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:27:10,163 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:27:10,163 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:27:10,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:10,165 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:27:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:27:10,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:10,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:10,166 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:27:10,166 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:27:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:10,168 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:27:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:27:10,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:10,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:10,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:10,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:27:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:27:10,171 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2018-11-23 12:27:10,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:10,171 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:27:10,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:27:10,171 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:27:10,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:27:10,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:10,172 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:27:10,172 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:10,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:10,173 INFO L82 PathProgramCache]: Analyzing trace with hash 387956447, now seen corresponding path program 5 times [2018-11-23 12:27:10,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:10,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:10,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:10,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:10,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:10,442 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:27:10,442 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:27:10,443 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:10,443 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:27:10,443 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret12 := main(); {2206#true} is VALID [2018-11-23 12:27:10,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:27:10,447 INFO L273 TraceCheckUtils]: 6: Hoare triple {2208#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:27:10,448 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:27:10,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {2209#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:27:10,449 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:27:10,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {2210#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:27:10,449 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:27:10,450 INFO L273 TraceCheckUtils]: 12: Hoare triple {2211#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:27:10,450 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:27:10,451 INFO L273 TraceCheckUtils]: 14: Hoare triple {2212#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:27:10,451 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:27:10,452 INFO L273 TraceCheckUtils]: 16: Hoare triple {2213#(<= main_~i~1 5)} assume !(~i~1 < 10000); {2207#false} is VALID [2018-11-23 12:27:10,452 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:27:10,452 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:27:10,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#true} assume !!(~i~0 < 10000);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:27:10,453 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:27:10,453 INFO L273 TraceCheckUtils]: 21: Hoare triple {2206#true} assume !!(~i~0 < 10000);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:27:10,453 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:27:10,454 INFO L273 TraceCheckUtils]: 23: Hoare triple {2206#true} assume !(~i~0 < 10000); {2206#true} is VALID [2018-11-23 12:27:10,454 INFO L273 TraceCheckUtils]: 24: Hoare triple {2206#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:27:10,454 INFO L273 TraceCheckUtils]: 25: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:10,454 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2206#true} {2207#false} #70#return; {2207#false} is VALID [2018-11-23 12:27:10,455 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:27:10,455 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:27:10,455 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:27:10,455 INFO L273 TraceCheckUtils]: 30: Hoare triple {2206#true} assume !!(~i~0 < 10000);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:27:10,456 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:27:10,456 INFO L273 TraceCheckUtils]: 32: Hoare triple {2206#true} assume !!(~i~0 < 10000);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:27:10,456 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:27:10,456 INFO L273 TraceCheckUtils]: 34: Hoare triple {2206#true} assume !(~i~0 < 10000); {2206#true} is VALID [2018-11-23 12:27:10,456 INFO L273 TraceCheckUtils]: 35: Hoare triple {2206#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:27:10,456 INFO L273 TraceCheckUtils]: 36: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:10,457 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2206#true} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:27:10,457 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:27:10,457 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:27:10,457 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:27:10,457 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 9999); {2207#false} is VALID [2018-11-23 12:27:10,457 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:27:10,457 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:27:10,457 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:27:10,458 INFO L273 TraceCheckUtils]: 45: Hoare triple {2206#true} assume !!(~i~0 < 10000);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:27:10,458 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:27:10,458 INFO L273 TraceCheckUtils]: 47: Hoare triple {2206#true} assume !!(~i~0 < 10000);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:27:10,458 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:27:10,458 INFO L273 TraceCheckUtils]: 49: Hoare triple {2206#true} assume !(~i~0 < 10000); {2206#true} is VALID [2018-11-23 12:27:10,458 INFO L273 TraceCheckUtils]: 50: Hoare triple {2206#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:27:10,459 INFO L273 TraceCheckUtils]: 51: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:10,459 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2206#true} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:27:10,459 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:27:10,459 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:27:10,460 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:27:10,462 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:27:10,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:10,462 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:27:10,474 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:10,586 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:27:10,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:10,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:10,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:27:10,756 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:27:10,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:10,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:27:10,757 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret12 := main(); {2206#true} is VALID [2018-11-23 12:27:10,757 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2206#true} is VALID [2018-11-23 12:27:10,757 INFO L273 TraceCheckUtils]: 6: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -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:27:10,757 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:27:10,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -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:27:10,758 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:27:10,758 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -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:27:10,758 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:27:10,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -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:27:10,758 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:27:10,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -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:27:10,758 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:27:10,759 INFO L273 TraceCheckUtils]: 16: Hoare triple {2206#true} assume !(~i~1 < 10000); {2206#true} is VALID [2018-11-23 12:27:10,759 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:27:10,759 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:27:10,760 INFO L273 TraceCheckUtils]: 19: Hoare triple {2271#(<= mapavg_~i~0 0)} assume !!(~i~0 < 10000);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:27:10,760 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:27:10,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {2278#(<= mapavg_~i~0 1)} assume !!(~i~0 < 10000);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:27:10,761 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:27:10,762 INFO L273 TraceCheckUtils]: 23: Hoare triple {2285#(<= mapavg_~i~0 2)} assume !(~i~0 < 10000); {2207#false} is VALID [2018-11-23 12:27:10,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {2207#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:27:10,762 INFO L273 TraceCheckUtils]: 25: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:27:10,763 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2207#false} {2206#true} #70#return; {2207#false} is VALID [2018-11-23 12:27:10,763 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:27:10,763 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:27:10,763 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:27:10,764 INFO L273 TraceCheckUtils]: 30: Hoare triple {2207#false} assume !!(~i~0 < 10000);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:27:10,764 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:27:10,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {2207#false} assume !!(~i~0 < 10000);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:27:10,764 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:27:10,764 INFO L273 TraceCheckUtils]: 34: Hoare triple {2207#false} assume !(~i~0 < 10000); {2207#false} is VALID [2018-11-23 12:27:10,765 INFO L273 TraceCheckUtils]: 35: Hoare triple {2207#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:27:10,765 INFO L273 TraceCheckUtils]: 36: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:27:10,765 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2207#false} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:27:10,765 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:27:10,766 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:27:10,766 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:27:10,766 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 9999); {2207#false} is VALID [2018-11-23 12:27:10,767 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:27:10,767 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:27:10,767 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:27:10,767 INFO L273 TraceCheckUtils]: 45: Hoare triple {2207#false} assume !!(~i~0 < 10000);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:27:10,767 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:27:10,768 INFO L273 TraceCheckUtils]: 47: Hoare triple {2207#false} assume !!(~i~0 < 10000);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:27:10,768 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:27:10,768 INFO L273 TraceCheckUtils]: 49: Hoare triple {2207#false} assume !(~i~0 < 10000); {2207#false} is VALID [2018-11-23 12:27:10,768 INFO L273 TraceCheckUtils]: 50: Hoare triple {2207#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:27:10,768 INFO L273 TraceCheckUtils]: 51: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:27:10,769 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2207#false} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:27:10,769 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:27:10,769 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:27:10,769 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:27:10,771 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:27:10,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:10,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 12:27:10,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:27:10,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:10,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:10,981 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:27:10,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:10,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:10,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:10,982 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-11-23 12:27:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:11,617 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-23 12:27:11,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:11,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:27:11,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:11,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:27:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:27:11,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 12:27:11,704 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:11,707 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:27:11,707 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:27:11,708 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:27:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:27:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 12:27:11,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:11,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 12:27:11,724 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 12:27:11,725 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 12:27:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:11,728 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:27:11,728 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:27:11,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:11,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:11,729 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 12:27:11,729 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 12:27:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:11,731 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:27:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:27:11,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:11,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:11,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:11,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:27:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 12:27:11,733 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2018-11-23 12:27:11,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:11,734 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 12:27:11,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:27:11,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:27:11,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:11,735 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:27:11,735 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:11,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash -482079969, now seen corresponding path program 6 times [2018-11-23 12:27:11,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:11,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:11,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:11,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:11,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:11,985 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:27:11,986 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:27:11,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:11,986 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:27:11,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret12 := main(); {2635#true} is VALID [2018-11-23 12:27:12,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:27:12,011 INFO L273 TraceCheckUtils]: 6: Hoare triple {2637#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:27:12,012 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:27:12,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:27:12,013 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:27:12,013 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:27:12,013 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:27:12,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:27:12,014 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:27:12,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {2641#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:27:12,015 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:27:12,016 INFO L273 TraceCheckUtils]: 16: Hoare triple {2642#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:27:12,016 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:27:12,017 INFO L273 TraceCheckUtils]: 18: Hoare triple {2643#(<= main_~i~1 6)} assume !(~i~1 < 10000); {2636#false} is VALID [2018-11-23 12:27:12,017 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:27:12,018 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:27:12,018 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:27:12,018 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:27:12,018 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:27:12,018 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:27:12,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:27:12,019 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:27:12,019 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:27:12,019 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:12,019 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:12,020 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2636#false} #70#return; {2636#false} is VALID [2018-11-23 12:27:12,020 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:27:12,020 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:27:12,020 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:27:12,020 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:27:12,020 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:27:12,021 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:27:12,021 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:27:12,021 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:27:12,021 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:27:12,021 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:27:12,021 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:12,021 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:12,021 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2636#false} #72#return; {2636#false} is VALID [2018-11-23 12:27:12,022 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:27:12,022 INFO L273 TraceCheckUtils]: 45: Hoare triple {2636#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:27:12,022 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:27:12,022 INFO L273 TraceCheckUtils]: 47: Hoare triple {2636#false} assume !(~i~2 < 9999); {2636#false} is VALID [2018-11-23 12:27:12,022 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:27:12,022 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:27:12,022 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:27:12,023 INFO L273 TraceCheckUtils]: 51: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:27:12,023 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:27:12,023 INFO L273 TraceCheckUtils]: 53: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:27:12,023 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:27:12,023 INFO L273 TraceCheckUtils]: 55: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:27:12,023 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:27:12,023 INFO L273 TraceCheckUtils]: 57: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:27:12,023 INFO L273 TraceCheckUtils]: 58: Hoare triple {2635#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:12,024 INFO L273 TraceCheckUtils]: 59: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:12,024 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2635#true} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:27:12,024 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:27:12,024 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:27:12,024 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:27:12,026 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:27:12,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:12,026 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:27:12,036 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:12,115 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:27:12,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:12,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:12,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:27:12,550 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:27:12,550 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:12,550 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:27:12,551 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret12 := main(); {2635#true} is VALID [2018-11-23 12:27:12,551 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2635#true} is VALID [2018-11-23 12:27:12,551 INFO L273 TraceCheckUtils]: 6: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -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:27:12,551 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:27:12,551 INFO L273 TraceCheckUtils]: 8: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -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:27:12,551 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:27:12,551 INFO L273 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -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:27:12,551 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:27:12,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -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:27:12,552 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:27:12,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -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:27:12,552 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:27:12,552 INFO L273 TraceCheckUtils]: 16: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -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:27:12,552 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:27:12,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {2635#true} assume !(~i~1 < 10000); {2635#true} is VALID [2018-11-23 12:27:12,552 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:27:12,553 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:27:12,553 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:27:12,553 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:27:12,553 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:27:12,553 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:27:12,553 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:27:12,553 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:27:12,553 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:27:12,557 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:12,557 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:12,557 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2635#true} #70#return; {2635#true} is VALID [2018-11-23 12:27:12,557 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:27:12,557 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:27:12,557 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:27:12,558 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:27:12,558 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:27:12,558 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:27:12,558 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:27:12,558 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:27:12,558 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:27:12,558 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:27:12,558 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:12,559 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:12,559 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2635#true} #72#return; {2635#true} is VALID [2018-11-23 12:27:12,560 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:27:12,560 INFO L273 TraceCheckUtils]: 45: Hoare triple {2779#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:27:12,562 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:27:12,562 INFO L273 TraceCheckUtils]: 47: Hoare triple {2786#(<= main_~i~2 1)} assume !(~i~2 < 9999); {2636#false} is VALID [2018-11-23 12:27:12,562 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:27:12,562 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:27:12,563 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:27:12,563 INFO L273 TraceCheckUtils]: 51: Hoare triple {2636#false} assume !!(~i~0 < 10000);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:27:12,563 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:27:12,563 INFO L273 TraceCheckUtils]: 53: Hoare triple {2636#false} assume !!(~i~0 < 10000);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:27:12,563 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:27:12,563 INFO L273 TraceCheckUtils]: 55: Hoare triple {2636#false} assume !!(~i~0 < 10000);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:27:12,564 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:27:12,564 INFO L273 TraceCheckUtils]: 57: Hoare triple {2636#false} assume !(~i~0 < 10000); {2636#false} is VALID [2018-11-23 12:27:12,564 INFO L273 TraceCheckUtils]: 58: Hoare triple {2636#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {2636#false} is VALID [2018-11-23 12:27:12,564 INFO L273 TraceCheckUtils]: 59: Hoare triple {2636#false} assume true; {2636#false} is VALID [2018-11-23 12:27:12,564 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2636#false} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:27:12,565 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:27:12,565 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:27:12,565 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:27:12,569 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:27:12,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:12,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:27:12,597 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:27:12,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:12,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:12,683 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:27:12,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:12,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:12,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:12,684 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-11-23 12:27:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:13,014 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:27:13,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:13,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:27:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:27:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:27:13,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:27:13,142 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:13,144 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:27:13,145 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:27:13,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:27:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:27:13,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:13,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:27:13,163 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:27:13,164 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:27:13,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:13,166 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:27:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:13,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:13,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:13,167 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:27:13,167 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:27:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:13,169 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:27:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:13,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:13,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:13,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:13,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:27:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 12:27:13,171 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2018-11-23 12:27:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:13,171 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 12:27:13,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:27:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:27:13,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:13,173 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:27:13,173 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:13,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:13,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1276959103, now seen corresponding path program 7 times [2018-11-23 12:27:13,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:13,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:13,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:13,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:13,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:13,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:27:13,427 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:13,427 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:13,427 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:27:13,427 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret12 := main(); {3111#true} is VALID [2018-11-23 12:27:13,428 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:27:13,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {3113#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:27:13,429 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:27:13,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:13,430 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:13,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:13,431 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:13,431 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:13,432 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:13,432 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:13,433 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:13,433 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:13,434 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:13,435 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:13,436 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:13,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 10000); {3112#false} is VALID [2018-11-23 12:27:13,437 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:27:13,437 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:27:13,437 INFO L273 TraceCheckUtils]: 23: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:27:13,437 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:27:13,437 INFO L273 TraceCheckUtils]: 25: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:27:13,438 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:27:13,438 INFO L273 TraceCheckUtils]: 27: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:27:13,438 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:27:13,438 INFO L273 TraceCheckUtils]: 29: Hoare triple {3111#true} assume !(~i~0 < 10000); {3111#true} is VALID [2018-11-23 12:27:13,438 INFO L273 TraceCheckUtils]: 30: Hoare triple {3111#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:27:13,439 INFO L273 TraceCheckUtils]: 31: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:13,439 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3111#true} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:27:13,439 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:13,439 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:27:13,440 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:27:13,440 INFO L273 TraceCheckUtils]: 36: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:27:13,440 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:27:13,440 INFO L273 TraceCheckUtils]: 38: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:27:13,440 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:27:13,440 INFO L273 TraceCheckUtils]: 40: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:27:13,440 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:27:13,440 INFO L273 TraceCheckUtils]: 42: Hoare triple {3111#true} assume !(~i~0 < 10000); {3111#true} is VALID [2018-11-23 12:27:13,441 INFO L273 TraceCheckUtils]: 43: Hoare triple {3111#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:27:13,441 INFO L273 TraceCheckUtils]: 44: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:13,441 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3111#true} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:27:13,441 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:13,441 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:13,441 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:13,441 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:13,441 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:13,442 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 9999); {3112#false} is VALID [2018-11-23 12:27:13,442 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:27:13,442 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:27:13,442 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:27:13,442 INFO L273 TraceCheckUtils]: 55: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:27:13,442 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:27:13,442 INFO L273 TraceCheckUtils]: 57: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:27:13,442 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:27:13,443 INFO L273 TraceCheckUtils]: 59: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:27:13,443 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:27:13,443 INFO L273 TraceCheckUtils]: 61: Hoare triple {3111#true} assume !(~i~0 < 10000); {3111#true} is VALID [2018-11-23 12:27:13,443 INFO L273 TraceCheckUtils]: 62: Hoare triple {3111#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:27:13,443 INFO L273 TraceCheckUtils]: 63: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:13,443 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3111#true} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:27:13,443 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:13,443 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:13,444 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:27:13,447 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:13,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:13,447 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:27:13,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:13,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:13,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:27:13,634 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:13,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:13,635 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:27:13,635 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret12 := main(); {3111#true} is VALID [2018-11-23 12:27:13,636 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:13,636 INFO L273 TraceCheckUtils]: 6: Hoare triple {3139#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:13,637 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:13,637 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:13,638 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:13,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:13,639 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:13,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:13,640 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:13,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:13,641 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:13,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:13,643 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:13,643 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:13,644 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:13,645 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 10000); {3112#false} is VALID [2018-11-23 12:27:13,645 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:13,645 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:13,645 INFO L273 TraceCheckUtils]: 23: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:13,646 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:13,646 INFO L273 TraceCheckUtils]: 25: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:13,646 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:13,646 INFO L273 TraceCheckUtils]: 27: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:13,646 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:13,647 INFO L273 TraceCheckUtils]: 29: Hoare triple {3112#false} assume !(~i~0 < 10000); {3112#false} is VALID [2018-11-23 12:27:13,647 INFO L273 TraceCheckUtils]: 30: Hoare triple {3112#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:27:13,647 INFO L273 TraceCheckUtils]: 31: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:13,647 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3112#false} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:27:13,647 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:13,648 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:13,648 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:13,648 INFO L273 TraceCheckUtils]: 36: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:13,648 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:13,649 INFO L273 TraceCheckUtils]: 38: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:13,649 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:13,649 INFO L273 TraceCheckUtils]: 40: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:13,649 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:13,649 INFO L273 TraceCheckUtils]: 42: Hoare triple {3112#false} assume !(~i~0 < 10000); {3112#false} is VALID [2018-11-23 12:27:13,650 INFO L273 TraceCheckUtils]: 43: Hoare triple {3112#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:27:13,650 INFO L273 TraceCheckUtils]: 44: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:13,650 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3112#false} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:27:13,650 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:13,650 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:13,650 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:13,651 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:13,651 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:13,651 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 9999); {3112#false} is VALID [2018-11-23 12:27:13,651 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:27:13,651 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:13,651 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:13,652 INFO L273 TraceCheckUtils]: 55: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:13,652 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:13,652 INFO L273 TraceCheckUtils]: 57: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:13,652 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:13,652 INFO L273 TraceCheckUtils]: 59: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:13,652 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:13,653 INFO L273 TraceCheckUtils]: 61: Hoare triple {3112#false} assume !(~i~0 < 10000); {3112#false} is VALID [2018-11-23 12:27:13,653 INFO L273 TraceCheckUtils]: 62: Hoare triple {3112#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:27:13,653 INFO L273 TraceCheckUtils]: 63: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:13,653 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3112#false} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:27:13,653 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:13,653 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:13,654 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:27:13,656 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:13,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:13,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:27:13,677 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:27:13,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:13,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:13,739 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:13,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:13,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:13,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:13,740 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2018-11-23 12:27:13,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:13,998 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 12:27:13,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:27:13,999 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:27:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:14,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:27:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:27:14,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-23 12:27:14,073 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:14,075 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:27:14,075 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:27:14,076 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:14,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:27:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 12:27:14,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:14,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:14,106 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:14,106 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:14,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:14,108 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:27:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:27:14,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:14,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:14,108 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 12:27:14,109 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 12:27:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:14,110 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:27:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:27:14,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:14,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:14,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:14,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:14,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:27:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 12:27:14,113 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2018-11-23 12:27:14,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:14,113 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 12:27:14,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:27:14,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:14,114 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:14,115 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:14,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:14,115 INFO L82 PathProgramCache]: Analyzing trace with hash -266850591, now seen corresponding path program 8 times [2018-11-23 12:27:14,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:14,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:14,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:14,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:14,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:14,306 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:27:14,306 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:14,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:14,306 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:27:14,306 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret12 := main(); {3609#true} is VALID [2018-11-23 12:27:14,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:14,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {3611#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:14,308 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:14,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:14,309 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:14,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:14,310 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:14,310 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:14,311 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:14,312 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:14,312 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:14,313 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:14,314 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:14,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:14,315 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:14,315 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:14,316 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:14,317 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 10000); {3610#false} is VALID [2018-11-23 12:27:14,317 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:14,317 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:14,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:14,318 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:14,318 INFO L273 TraceCheckUtils]: 27: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:14,318 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:14,318 INFO L273 TraceCheckUtils]: 29: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:14,319 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:14,319 INFO L273 TraceCheckUtils]: 31: Hoare triple {3609#true} assume !(~i~0 < 10000); {3609#true} is VALID [2018-11-23 12:27:14,319 INFO L273 TraceCheckUtils]: 32: Hoare triple {3609#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:27:14,319 INFO L273 TraceCheckUtils]: 33: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:14,320 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3609#true} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:27:14,320 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:14,320 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:14,320 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:14,320 INFO L273 TraceCheckUtils]: 38: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:14,320 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:14,321 INFO L273 TraceCheckUtils]: 40: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:14,321 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:14,321 INFO L273 TraceCheckUtils]: 42: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:14,321 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:14,321 INFO L273 TraceCheckUtils]: 44: Hoare triple {3609#true} assume !(~i~0 < 10000); {3609#true} is VALID [2018-11-23 12:27:14,321 INFO L273 TraceCheckUtils]: 45: Hoare triple {3609#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:27:14,321 INFO L273 TraceCheckUtils]: 46: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:14,322 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3609#true} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:27:14,322 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:14,322 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,322 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:14,322 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,322 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:14,323 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 9999); {3610#false} is VALID [2018-11-23 12:27:14,323 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:27:14,323 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:14,323 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:14,323 INFO L273 TraceCheckUtils]: 57: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:14,323 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:14,324 INFO L273 TraceCheckUtils]: 59: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:14,324 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:14,324 INFO L273 TraceCheckUtils]: 61: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:14,324 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:14,324 INFO L273 TraceCheckUtils]: 63: Hoare triple {3609#true} assume !(~i~0 < 10000); {3609#true} is VALID [2018-11-23 12:27:14,324 INFO L273 TraceCheckUtils]: 64: Hoare triple {3609#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:27:14,324 INFO L273 TraceCheckUtils]: 65: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:14,324 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3609#true} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:27:14,325 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:14,325 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:14,325 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:27:14,328 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:14,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:14,328 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:14,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:14,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:14,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:14,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:14,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:27:14,575 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:14,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:14,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:27:14,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret12 := main(); {3609#true} is VALID [2018-11-23 12:27:14,577 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:14,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {3638#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:14,578 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:14,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:14,578 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:14,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:14,579 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:14,580 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:14,581 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:14,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:14,582 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:14,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:14,583 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:14,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:14,585 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:14,585 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:14,586 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:14,587 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 10000); {3610#false} is VALID [2018-11-23 12:27:14,587 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:14,587 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:14,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:14,588 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:14,588 INFO L273 TraceCheckUtils]: 27: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:14,588 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:14,588 INFO L273 TraceCheckUtils]: 29: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:14,588 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:14,589 INFO L273 TraceCheckUtils]: 31: Hoare triple {3610#false} assume !(~i~0 < 10000); {3610#false} is VALID [2018-11-23 12:27:14,589 INFO L273 TraceCheckUtils]: 32: Hoare triple {3610#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:27:14,589 INFO L273 TraceCheckUtils]: 33: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:14,589 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3610#false} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:27:14,590 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:14,590 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:14,590 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:14,590 INFO L273 TraceCheckUtils]: 38: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:14,590 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:14,591 INFO L273 TraceCheckUtils]: 40: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:14,591 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:14,591 INFO L273 TraceCheckUtils]: 42: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:14,591 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:14,591 INFO L273 TraceCheckUtils]: 44: Hoare triple {3610#false} assume !(~i~0 < 10000); {3610#false} is VALID [2018-11-23 12:27:14,592 INFO L273 TraceCheckUtils]: 45: Hoare triple {3610#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:27:14,592 INFO L273 TraceCheckUtils]: 46: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:14,592 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3610#false} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:27:14,592 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:14,592 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,592 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:14,592 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,593 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:14,593 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 9999); {3610#false} is VALID [2018-11-23 12:27:14,593 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:27:14,593 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:14,593 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:14,593 INFO L273 TraceCheckUtils]: 57: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:14,593 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:14,593 INFO L273 TraceCheckUtils]: 59: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:14,594 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:14,594 INFO L273 TraceCheckUtils]: 61: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:14,594 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:14,594 INFO L273 TraceCheckUtils]: 63: Hoare triple {3610#false} assume !(~i~0 < 10000); {3610#false} is VALID [2018-11-23 12:27:14,594 INFO L273 TraceCheckUtils]: 64: Hoare triple {3610#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:27:14,594 INFO L273 TraceCheckUtils]: 65: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:14,594 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3610#false} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:27:14,594 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:14,595 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:14,595 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:27:14,597 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:14,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:14,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:27:14,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:27:14,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:14,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:27:14,676 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:14,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:27:14,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:27:14,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:27:14,677 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2018-11-23 12:27:14,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:14,871 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-23 12:27:14,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:14,871 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:27:14,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:27:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:27:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:27:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:27:14,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:27:14,965 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:14,967 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:27:14,967 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:27:14,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:27:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:27:14,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:27:14,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:14,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:14,991 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:14,991 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:14,993 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:27:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:27:14,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:14,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:14,994 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:27:14,994 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:27:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:14,996 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:27:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:27:14,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:14,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:14,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:14,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:27:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 12:27:14,999 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2018-11-23 12:27:14,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:14,999 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 12:27:14,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:27:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:27:15,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:27:15,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:15,000 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:15,000 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:15,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:15,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2104249405, now seen corresponding path program 9 times [2018-11-23 12:27:15,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:15,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:15,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:15,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:15,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:15,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:27:15,242 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:15,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:15,242 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:27:15,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret12 := main(); {4124#true} is VALID [2018-11-23 12:27:15,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:15,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {4126#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:15,245 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:15,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {4127#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:15,245 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:15,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {4128#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:15,247 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:15,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {4129#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:15,248 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:15,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {4130#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:15,250 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:15,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {4131#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:15,251 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:15,252 INFO L273 TraceCheckUtils]: 18: Hoare triple {4132#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:15,253 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:15,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {4133#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:15,254 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:15,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {4134#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:15,256 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:15,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {4135#(<= main_~i~1 9)} assume !(~i~1 < 10000); {4125#false} is VALID [2018-11-23 12:27:15,257 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:15,257 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:15,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:15,258 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:15,258 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:15,258 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:15,259 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:15,259 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:15,259 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:27:15,260 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:15,260 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:15,260 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4125#false} #70#return; {4125#false} is VALID [2018-11-23 12:27:15,260 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:15,261 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:15,261 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:15,261 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:15,261 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:15,261 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:15,262 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:15,262 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:15,262 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:15,262 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:27:15,262 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:15,263 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:15,263 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4125#false} #72#return; {4125#false} is VALID [2018-11-23 12:27:15,263 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:15,263 INFO L273 TraceCheckUtils]: 51: Hoare triple {4125#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:15,263 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:15,264 INFO L273 TraceCheckUtils]: 53: Hoare triple {4125#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:15,264 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:15,264 INFO L273 TraceCheckUtils]: 55: Hoare triple {4125#false} assume !(~i~2 < 9999); {4125#false} is VALID [2018-11-23 12:27:15,264 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:27:15,265 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:15,265 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:15,265 INFO L273 TraceCheckUtils]: 59: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:15,265 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:15,265 INFO L273 TraceCheckUtils]: 61: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:15,266 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:15,266 INFO L273 TraceCheckUtils]: 63: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:15,266 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:15,266 INFO L273 TraceCheckUtils]: 65: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:27:15,267 INFO L273 TraceCheckUtils]: 66: Hoare triple {4124#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:15,267 INFO L273 TraceCheckUtils]: 67: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:15,267 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4124#true} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:27:15,267 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:15,267 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:15,268 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:27:15,274 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:15,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:15,274 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:15,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:15,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:27:15,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:15,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:15,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:27:15,507 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:15,507 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:15,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:27:15,507 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret12 := main(); {4124#true} is VALID [2018-11-23 12:27:15,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4124#true} is VALID [2018-11-23 12:27:15,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:15,508 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:15,508 INFO L273 TraceCheckUtils]: 8: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:15,509 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:15,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:15,509 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:15,509 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:15,509 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:15,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:15,510 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:15,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:15,510 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:15,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:15,510 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:15,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:15,510 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:15,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:15,511 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:15,511 INFO L273 TraceCheckUtils]: 24: Hoare triple {4124#true} assume !(~i~1 < 10000); {4124#true} is VALID [2018-11-23 12:27:15,511 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:15,511 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:15,511 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:15,512 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:15,512 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:15,512 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:15,512 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:15,512 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:15,512 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:27:15,512 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:15,513 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:15,513 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4124#true} #70#return; {4124#true} is VALID [2018-11-23 12:27:15,513 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:15,513 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:15,513 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:15,513 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:15,514 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:15,514 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:15,514 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:15,514 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:15,514 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:15,514 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:27:15,515 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:15,515 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:15,515 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4124#true} #72#return; {4124#true} is VALID [2018-11-23 12:27:15,516 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:15,516 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:15,517 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:15,517 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:15,517 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:15,518 INFO L273 TraceCheckUtils]: 55: Hoare triple {4303#(<= main_~i~2 2)} assume !(~i~2 < 9999); {4125#false} is VALID [2018-11-23 12:27:15,518 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:27:15,518 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:15,518 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:15,519 INFO L273 TraceCheckUtils]: 59: Hoare triple {4125#false} assume !!(~i~0 < 10000);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:15,519 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:15,519 INFO L273 TraceCheckUtils]: 61: Hoare triple {4125#false} assume !!(~i~0 < 10000);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:15,519 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:15,519 INFO L273 TraceCheckUtils]: 63: Hoare triple {4125#false} assume !!(~i~0 < 10000);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:15,519 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:15,520 INFO L273 TraceCheckUtils]: 65: Hoare triple {4125#false} assume !(~i~0 < 10000); {4125#false} is VALID [2018-11-23 12:27:15,520 INFO L273 TraceCheckUtils]: 66: Hoare triple {4125#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {4125#false} is VALID [2018-11-23 12:27:15,520 INFO L273 TraceCheckUtils]: 67: Hoare triple {4125#false} assume true; {4125#false} is VALID [2018-11-23 12:27:15,520 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4125#false} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:27:15,521 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:15,521 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:15,521 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:27:15,525 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:15,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:15,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:27:15,546 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:27:15,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:15,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:27:15,629 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:15,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:27:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:27:15,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:27:15,630 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2018-11-23 12:27:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:16,105 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-23 12:27:16,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:27:16,105 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:27:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:27:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:27:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:27:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:27:16,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2018-11-23 12:27:16,193 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:16,194 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:27:16,194 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:27:16,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:27:16,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:27:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 12:27:16,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:16,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:16,221 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:16,221 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:16,223 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:27:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:27:16,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:16,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:16,224 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2018-11-23 12:27:16,224 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2018-11-23 12:27:16,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:16,225 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:27:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:27:16,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:16,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:16,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:16,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:16,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:27:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-23 12:27:16,228 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2018-11-23 12:27:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:16,228 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-23 12:27:16,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:27:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 12:27:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:27:16,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:16,229 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:16,230 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:16,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:16,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1485183197, now seen corresponding path program 10 times [2018-11-23 12:27:16,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:16,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:16,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:16,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:16,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:17,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:27:17,345 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:17,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:17,346 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:27:17,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret12 := main(); {4671#true} is VALID [2018-11-23 12:27:17,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:17,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {4673#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:17,349 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:17,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {4674#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:17,350 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:17,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {4675#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:17,350 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:17,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {4676#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:17,351 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:17,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {4677#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:17,353 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:17,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {4678#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:17,354 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:17,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:17,355 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:17,356 INFO L273 TraceCheckUtils]: 20: Hoare triple {4680#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:17,357 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:17,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {4681#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:17,358 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:17,358 INFO L273 TraceCheckUtils]: 24: Hoare triple {4682#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:17,359 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:17,360 INFO L273 TraceCheckUtils]: 26: Hoare triple {4683#(<= main_~i~1 10)} assume !(~i~1 < 10000); {4672#false} is VALID [2018-11-23 12:27:17,360 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:17,360 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:17,361 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:17,361 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:17,361 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:17,361 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:17,361 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:17,362 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:17,362 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:27:17,362 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:17,362 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:17,363 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4672#false} #70#return; {4672#false} is VALID [2018-11-23 12:27:17,363 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:17,363 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:17,363 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:17,363 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:17,364 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:17,364 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:17,364 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:17,364 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:17,364 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:17,365 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:27:17,365 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:17,365 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:17,365 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4672#false} #72#return; {4672#false} is VALID [2018-11-23 12:27:17,365 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:17,365 INFO L273 TraceCheckUtils]: 53: Hoare triple {4672#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:17,366 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:17,366 INFO L273 TraceCheckUtils]: 55: Hoare triple {4672#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:17,366 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:17,366 INFO L273 TraceCheckUtils]: 57: Hoare triple {4672#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:17,366 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:17,366 INFO L273 TraceCheckUtils]: 59: Hoare triple {4672#false} assume !(~i~2 < 9999); {4672#false} is VALID [2018-11-23 12:27:17,366 INFO L273 TraceCheckUtils]: 60: Hoare triple {4672#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:27:17,366 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:17,367 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:17,367 INFO L273 TraceCheckUtils]: 63: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:17,367 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:17,367 INFO L273 TraceCheckUtils]: 65: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:17,367 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:17,367 INFO L273 TraceCheckUtils]: 67: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:17,367 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:17,367 INFO L273 TraceCheckUtils]: 69: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:27:17,367 INFO L273 TraceCheckUtils]: 70: Hoare triple {4671#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:17,368 INFO L273 TraceCheckUtils]: 71: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:17,368 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4671#true} {4672#false} #74#return; {4672#false} is VALID [2018-11-23 12:27:17,368 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:17,368 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:17,368 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:27:17,371 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:17,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:17,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:17,381 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:17,422 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:17,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:17,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:17,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:27:17,880 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:17,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:17,880 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:27:17,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret12 := main(); {4671#true} is VALID [2018-11-23 12:27:17,881 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4671#true} is VALID [2018-11-23 12:27:17,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:17,881 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:17,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:17,881 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:17,882 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:17,882 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:17,882 INFO L273 TraceCheckUtils]: 12: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:17,882 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:17,882 INFO L273 TraceCheckUtils]: 14: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:17,882 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:17,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:17,883 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:17,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:17,883 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:17,883 INFO L273 TraceCheckUtils]: 20: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:17,883 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:17,883 INFO L273 TraceCheckUtils]: 22: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:17,883 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:17,883 INFO L273 TraceCheckUtils]: 24: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:17,884 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:17,884 INFO L273 TraceCheckUtils]: 26: Hoare triple {4671#true} assume !(~i~1 < 10000); {4671#true} is VALID [2018-11-23 12:27:17,884 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:17,884 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:17,884 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:17,884 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:17,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:17,884 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:17,885 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:17,885 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:17,885 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:27:17,885 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:17,885 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:17,885 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4671#true} #70#return; {4671#true} is VALID [2018-11-23 12:27:17,885 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:17,885 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:17,886 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:17,886 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:17,886 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:17,886 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:17,886 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:17,886 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:17,886 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:17,886 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:27:17,886 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:17,887 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:17,887 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4671#true} #72#return; {4671#true} is VALID [2018-11-23 12:27:17,887 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:17,887 INFO L273 TraceCheckUtils]: 53: Hoare triple {4671#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:17,887 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:17,887 INFO L273 TraceCheckUtils]: 55: Hoare triple {4671#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:17,887 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:17,887 INFO L273 TraceCheckUtils]: 57: Hoare triple {4671#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:17,888 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:17,888 INFO L273 TraceCheckUtils]: 59: Hoare triple {4671#true} assume !(~i~2 < 9999); {4671#true} is VALID [2018-11-23 12:27:17,888 INFO L273 TraceCheckUtils]: 60: Hoare triple {4671#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:27:17,888 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:17,889 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:17,889 INFO L273 TraceCheckUtils]: 63: Hoare triple {4873#(<= mapavg_~i~0 0)} assume !!(~i~0 < 10000);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:17,889 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:17,890 INFO L273 TraceCheckUtils]: 65: Hoare triple {4880#(<= mapavg_~i~0 1)} assume !!(~i~0 < 10000);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:17,890 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:17,891 INFO L273 TraceCheckUtils]: 67: Hoare triple {4887#(<= mapavg_~i~0 2)} assume !!(~i~0 < 10000);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:17,891 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:17,891 INFO L273 TraceCheckUtils]: 69: Hoare triple {4894#(<= mapavg_~i~0 3)} assume !(~i~0 < 10000); {4672#false} is VALID [2018-11-23 12:27:17,892 INFO L273 TraceCheckUtils]: 70: Hoare triple {4672#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {4672#false} is VALID [2018-11-23 12:27:17,892 INFO L273 TraceCheckUtils]: 71: Hoare triple {4672#false} assume true; {4672#false} is VALID [2018-11-23 12:27:17,892 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4672#false} {4671#true} #74#return; {4672#false} is VALID [2018-11-23 12:27:17,892 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:17,892 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:17,892 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:27:17,896 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:17,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:17,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2018-11-23 12:27:17,917 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:27:17,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:17,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:27:17,988 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:17,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:27:17,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:27:17,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:17,990 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2018-11-23 12:27:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:18,496 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-11-23 12:27:18,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:27:18,496 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:27:18,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:27:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:27:18,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 12:27:18,614 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:18,616 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:27:18,616 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:27:18,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:18,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:27:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 12:27:18,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:18,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:18,662 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:18,662 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:18,664 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:27:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:27:18,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:18,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:18,664 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 12:27:18,664 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 12:27:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:18,666 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:27:18,666 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:27:18,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:18,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:18,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:18,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:27:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 12:27:18,669 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2018-11-23 12:27:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:18,669 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 12:27:18,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:27:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 12:27:18,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 12:27:18,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:18,670 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:18,671 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:18,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:18,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1828841827, now seen corresponding path program 11 times [2018-11-23 12:27:18,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:18,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:18,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:18,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:18,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:19,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:27:19,782 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:19,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:19,782 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:27:19,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret12 := main(); {5255#true} is VALID [2018-11-23 12:27:19,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:19,783 INFO L273 TraceCheckUtils]: 6: Hoare triple {5257#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:19,783 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:19,784 INFO L273 TraceCheckUtils]: 8: Hoare triple {5258#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:19,784 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:19,784 INFO L273 TraceCheckUtils]: 10: Hoare triple {5259#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:19,785 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:19,785 INFO L273 TraceCheckUtils]: 12: Hoare triple {5260#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:19,786 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:19,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {5261#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:19,787 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:19,787 INFO L273 TraceCheckUtils]: 16: Hoare triple {5262#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:19,788 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:19,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {5263#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:19,812 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:19,812 INFO L273 TraceCheckUtils]: 20: Hoare triple {5264#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:19,813 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:19,813 INFO L273 TraceCheckUtils]: 22: Hoare triple {5265#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:19,814 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:19,814 INFO L273 TraceCheckUtils]: 24: Hoare triple {5266#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:19,815 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:19,815 INFO L273 TraceCheckUtils]: 26: Hoare triple {5267#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:19,815 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:19,816 INFO L273 TraceCheckUtils]: 28: Hoare triple {5268#(<= main_~i~1 11)} assume !(~i~1 < 10000); {5256#false} is VALID [2018-11-23 12:27:19,816 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:19,816 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:19,816 INFO L273 TraceCheckUtils]: 31: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:19,816 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:19,816 INFO L273 TraceCheckUtils]: 33: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:19,817 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:19,817 INFO L273 TraceCheckUtils]: 35: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:19,817 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:19,817 INFO L273 TraceCheckUtils]: 37: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:19,817 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:19,817 INFO L273 TraceCheckUtils]: 39: Hoare triple {5255#true} assume !(~i~0 < 10000); {5255#true} is VALID [2018-11-23 12:27:19,818 INFO L273 TraceCheckUtils]: 40: Hoare triple {5255#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:27:19,818 INFO L273 TraceCheckUtils]: 41: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:19,818 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5255#true} {5256#false} #70#return; {5256#false} is VALID [2018-11-23 12:27:19,818 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:19,819 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:19,819 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:19,819 INFO L273 TraceCheckUtils]: 46: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:19,819 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:19,819 INFO L273 TraceCheckUtils]: 48: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:19,820 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:19,820 INFO L273 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:19,820 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:19,820 INFO L273 TraceCheckUtils]: 52: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:19,820 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:19,820 INFO L273 TraceCheckUtils]: 54: Hoare triple {5255#true} assume !(~i~0 < 10000); {5255#true} is VALID [2018-11-23 12:27:19,820 INFO L273 TraceCheckUtils]: 55: Hoare triple {5255#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:27:19,820 INFO L273 TraceCheckUtils]: 56: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:19,821 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5255#true} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:27:19,821 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:19,821 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:19,821 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:19,821 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:19,821 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:19,821 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:19,821 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:19,822 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 9999); {5256#false} is VALID [2018-11-23 12:27:19,822 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:27:19,822 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:19,822 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:19,822 INFO L273 TraceCheckUtils]: 69: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:19,822 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:19,822 INFO L273 TraceCheckUtils]: 71: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:19,822 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:19,823 INFO L273 TraceCheckUtils]: 73: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:19,823 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:19,823 INFO L273 TraceCheckUtils]: 75: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:19,823 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:19,823 INFO L273 TraceCheckUtils]: 77: Hoare triple {5255#true} assume !(~i~0 < 10000); {5255#true} is VALID [2018-11-23 12:27:19,823 INFO L273 TraceCheckUtils]: 78: Hoare triple {5255#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:27:19,823 INFO L273 TraceCheckUtils]: 79: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:19,823 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5255#true} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:27:19,823 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:19,824 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:19,824 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:27:19,827 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:19,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:19,827 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:19,837 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:20,129 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 12:27:20,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:20,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:20,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:27:20,288 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:20,288 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:20,288 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:27:20,288 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret12 := main(); {5255#true} is VALID [2018-11-23 12:27:20,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5255#true} is VALID [2018-11-23 12:27:20,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:20,289 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:20,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:20,289 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:20,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:20,290 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:20,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:20,290 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:20,290 INFO L273 TraceCheckUtils]: 14: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:20,290 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:20,290 INFO L273 TraceCheckUtils]: 16: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:20,290 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:20,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:20,291 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:20,291 INFO L273 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:20,291 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:20,291 INFO L273 TraceCheckUtils]: 22: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:20,291 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:20,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:20,291 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:20,292 INFO L273 TraceCheckUtils]: 26: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:20,292 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:20,292 INFO L273 TraceCheckUtils]: 28: Hoare triple {5255#true} assume !(~i~1 < 10000); {5255#true} is VALID [2018-11-23 12:27:20,292 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:20,292 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:20,293 INFO L273 TraceCheckUtils]: 31: Hoare triple {5362#(<= mapavg_~i~0 0)} assume !!(~i~0 < 10000);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:20,293 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:20,294 INFO L273 TraceCheckUtils]: 33: Hoare triple {5369#(<= mapavg_~i~0 1)} assume !!(~i~0 < 10000);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:20,294 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:20,294 INFO L273 TraceCheckUtils]: 35: Hoare triple {5376#(<= mapavg_~i~0 2)} assume !!(~i~0 < 10000);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:20,295 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:20,295 INFO L273 TraceCheckUtils]: 37: Hoare triple {5383#(<= mapavg_~i~0 3)} assume !!(~i~0 < 10000);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:20,296 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:20,296 INFO L273 TraceCheckUtils]: 39: Hoare triple {5390#(<= mapavg_~i~0 4)} assume !(~i~0 < 10000); {5256#false} is VALID [2018-11-23 12:27:20,297 INFO L273 TraceCheckUtils]: 40: Hoare triple {5256#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:27:20,297 INFO L273 TraceCheckUtils]: 41: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:20,297 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5256#false} {5255#true} #70#return; {5256#false} is VALID [2018-11-23 12:27:20,297 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:20,297 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:20,298 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:20,298 INFO L273 TraceCheckUtils]: 46: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:20,298 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:20,298 INFO L273 TraceCheckUtils]: 48: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:20,298 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:20,299 INFO L273 TraceCheckUtils]: 50: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:20,299 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:20,299 INFO L273 TraceCheckUtils]: 52: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:20,299 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:20,300 INFO L273 TraceCheckUtils]: 54: Hoare triple {5256#false} assume !(~i~0 < 10000); {5256#false} is VALID [2018-11-23 12:27:20,300 INFO L273 TraceCheckUtils]: 55: Hoare triple {5256#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:27:20,300 INFO L273 TraceCheckUtils]: 56: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:20,300 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5256#false} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:27:20,300 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:20,301 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,301 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:20,301 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,301 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:20,301 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,302 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:20,302 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 9999); {5256#false} is VALID [2018-11-23 12:27:20,302 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:27:20,302 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:20,302 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:20,302 INFO L273 TraceCheckUtils]: 69: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:20,302 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:20,302 INFO L273 TraceCheckUtils]: 71: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:20,303 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:20,303 INFO L273 TraceCheckUtils]: 73: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:20,303 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:20,303 INFO L273 TraceCheckUtils]: 75: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:20,303 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:20,303 INFO L273 TraceCheckUtils]: 77: Hoare triple {5256#false} assume !(~i~0 < 10000); {5256#false} is VALID [2018-11-23 12:27:20,303 INFO L273 TraceCheckUtils]: 78: Hoare triple {5256#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:27:20,303 INFO L273 TraceCheckUtils]: 79: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:20,303 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5256#false} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:27:20,304 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:20,304 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:20,304 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:27:20,307 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:20,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:20,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-23 12:27:20,327 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:27:20,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:20,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:27:20,404 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:20,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:27:20,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:27:20,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:20,405 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2018-11-23 12:27:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:20,921 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-23 12:27:20,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:20,921 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:27:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:27:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:20,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:27:20,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2018-11-23 12:27:21,941 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:21,943 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:27:21,943 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:27:21,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:27:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 12:27:21,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:21,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:21,977 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:21,978 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:21,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:21,979 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:27:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:27:21,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:21,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:21,980 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 12:27:21,980 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 12:27:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:21,982 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:27:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:27:21,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:21,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:21,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:21,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:27:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 12:27:21,985 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2018-11-23 12:27:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:21,985 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 12:27:21,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:27:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 12:27:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:27:21,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:21,987 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:21,987 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:21,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:21,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1538721373, now seen corresponding path program 12 times [2018-11-23 12:27:21,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:21,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:21,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:21,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:21,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:23,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:27:23,490 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:23,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:23,490 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:27:23,490 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret12 := main(); {5888#true} is VALID [2018-11-23 12:27:23,491 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:23,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {5890#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:23,492 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:23,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {5891#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:23,493 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:23,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {5892#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:23,495 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:23,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {5893#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:23,496 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:23,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {5894#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:23,498 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:23,498 INFO L273 TraceCheckUtils]: 16: Hoare triple {5895#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:23,499 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:23,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {5896#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:23,500 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:23,501 INFO L273 TraceCheckUtils]: 20: Hoare triple {5897#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:23,502 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:23,502 INFO L273 TraceCheckUtils]: 22: Hoare triple {5898#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:23,503 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:23,503 INFO L273 TraceCheckUtils]: 24: Hoare triple {5899#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:23,504 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:23,505 INFO L273 TraceCheckUtils]: 26: Hoare triple {5900#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:23,506 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:23,506 INFO L273 TraceCheckUtils]: 28: Hoare triple {5901#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:23,507 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:23,508 INFO L273 TraceCheckUtils]: 30: Hoare triple {5902#(<= main_~i~1 12)} assume !(~i~1 < 10000); {5889#false} is VALID [2018-11-23 12:27:23,508 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:23,508 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:23,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,508 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:23,509 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,509 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:23,509 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,509 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:23,509 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,510 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:23,510 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,510 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:23,510 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:27:23,511 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:23,511 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:23,511 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5889#false} #70#return; {5889#false} is VALID [2018-11-23 12:27:23,511 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:23,511 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:23,511 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:23,511 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,511 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:23,512 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,512 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:23,512 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,512 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:23,512 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,512 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:23,512 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,512 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:23,513 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:27:23,513 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:23,513 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:23,513 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5889#false} #72#return; {5889#false} is VALID [2018-11-23 12:27:23,513 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:23,513 INFO L273 TraceCheckUtils]: 65: Hoare triple {5889#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:23,513 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:23,513 INFO L273 TraceCheckUtils]: 67: Hoare triple {5889#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:23,513 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:23,514 INFO L273 TraceCheckUtils]: 69: Hoare triple {5889#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:23,514 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:23,514 INFO L273 TraceCheckUtils]: 71: Hoare triple {5889#false} assume !(~i~2 < 9999); {5889#false} is VALID [2018-11-23 12:27:23,514 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:27:23,514 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:23,514 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:23,514 INFO L273 TraceCheckUtils]: 75: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,514 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:23,515 INFO L273 TraceCheckUtils]: 77: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,515 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:23,515 INFO L273 TraceCheckUtils]: 79: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,515 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:23,515 INFO L273 TraceCheckUtils]: 81: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,515 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:23,515 INFO L273 TraceCheckUtils]: 83: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,515 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:23,516 INFO L273 TraceCheckUtils]: 85: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:27:23,516 INFO L273 TraceCheckUtils]: 86: Hoare triple {5888#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:23,516 INFO L273 TraceCheckUtils]: 87: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:23,516 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5888#true} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:27:23,516 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:23,516 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:23,516 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:27:23,520 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:23,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:23,520 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:23,531 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:23,650 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:27:23,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:23,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:23,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:27:23,809 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:23,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:23,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:27:23,810 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret12 := main(); {5888#true} is VALID [2018-11-23 12:27:23,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5888#true} is VALID [2018-11-23 12:27:23,810 INFO L273 TraceCheckUtils]: 6: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:23,810 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:23,810 INFO L273 TraceCheckUtils]: 8: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:23,810 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:23,810 INFO L273 TraceCheckUtils]: 10: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:23,810 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:23,811 INFO L273 TraceCheckUtils]: 12: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:23,811 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:23,811 INFO L273 TraceCheckUtils]: 14: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:23,811 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:23,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:23,811 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:23,811 INFO L273 TraceCheckUtils]: 18: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:23,811 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:23,811 INFO L273 TraceCheckUtils]: 20: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:23,812 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:23,812 INFO L273 TraceCheckUtils]: 22: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:23,812 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:23,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:23,812 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:23,812 INFO L273 TraceCheckUtils]: 26: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:23,812 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:23,812 INFO L273 TraceCheckUtils]: 28: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:23,813 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:23,813 INFO L273 TraceCheckUtils]: 30: Hoare triple {5888#true} assume !(~i~1 < 10000); {5888#true} is VALID [2018-11-23 12:27:23,813 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:23,813 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:23,813 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,813 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:23,813 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,813 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:23,814 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,814 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:23,814 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,814 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:23,814 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,814 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:23,814 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:27:23,814 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:23,814 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:23,815 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5888#true} #70#return; {5888#true} is VALID [2018-11-23 12:27:23,815 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:23,815 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:23,815 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:23,815 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,815 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:23,815 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,816 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:23,816 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,816 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:23,816 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,816 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:23,816 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:23,816 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:23,816 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:27:23,816 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:23,817 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:23,817 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5888#true} #72#return; {5888#true} is VALID [2018-11-23 12:27:23,817 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:23,818 INFO L273 TraceCheckUtils]: 65: Hoare triple {6098#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:23,818 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:23,819 INFO L273 TraceCheckUtils]: 67: Hoare triple {6105#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:23,819 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:23,819 INFO L273 TraceCheckUtils]: 69: Hoare triple {6112#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:23,820 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:23,820 INFO L273 TraceCheckUtils]: 71: Hoare triple {6119#(<= main_~i~2 3)} assume !(~i~2 < 9999); {5889#false} is VALID [2018-11-23 12:27:23,821 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:27:23,821 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:23,821 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:23,821 INFO L273 TraceCheckUtils]: 75: Hoare triple {5889#false} assume !!(~i~0 < 10000);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:23,821 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:23,822 INFO L273 TraceCheckUtils]: 77: Hoare triple {5889#false} assume !!(~i~0 < 10000);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:23,822 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:23,822 INFO L273 TraceCheckUtils]: 79: Hoare triple {5889#false} assume !!(~i~0 < 10000);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:23,822 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:23,822 INFO L273 TraceCheckUtils]: 81: Hoare triple {5889#false} assume !!(~i~0 < 10000);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:23,823 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:23,823 INFO L273 TraceCheckUtils]: 83: Hoare triple {5889#false} assume !!(~i~0 < 10000);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:23,823 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:23,823 INFO L273 TraceCheckUtils]: 85: Hoare triple {5889#false} assume !(~i~0 < 10000); {5889#false} is VALID [2018-11-23 12:27:23,824 INFO L273 TraceCheckUtils]: 86: Hoare triple {5889#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {5889#false} is VALID [2018-11-23 12:27:23,824 INFO L273 TraceCheckUtils]: 87: Hoare triple {5889#false} assume true; {5889#false} is VALID [2018-11-23 12:27:23,824 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5889#false} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:27:23,824 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:23,824 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:23,824 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:27:23,828 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:23,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:23,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-11-23 12:27:23,850 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:27:23,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:23,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:27:23,927 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:23,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:27:23,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:27:23,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:23,928 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2018-11-23 12:27:24,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:24,525 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-23 12:27:24,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:24,525 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:27:24,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:27:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:27:24,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 87 transitions. [2018-11-23 12:27:24,971 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:24,974 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:27:24,974 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:27:24,974 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:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:27:25,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:27:25,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:25,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:27:25,003 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:27:25,003 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:27:25,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:25,005 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:27:25,005 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:27:25,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:25,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:25,006 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:27:25,006 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:27:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:25,008 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:27:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:27:25,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:25,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:25,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:25,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:27:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 12:27:25,011 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2018-11-23 12:27:25,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:25,011 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 12:27:25,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:27:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:27:25,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:27:25,013 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:25,013 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:25,013 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:25,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:25,013 INFO L82 PathProgramCache]: Analyzing trace with hash 713900035, now seen corresponding path program 13 times [2018-11-23 12:27:25,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:25,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:25,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:25,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:25,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:25,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:27:25,733 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:25,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:25,733 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:27:25,734 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret12 := main(); {6568#true} is VALID [2018-11-23 12:27:25,734 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:25,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {6570#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:25,736 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:25,736 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:25,736 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:25,737 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:25,738 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:25,738 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:25,739 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:25,740 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:25,741 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:25,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:25,742 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:25,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:25,744 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:25,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:25,746 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:25,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:25,747 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:25,748 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:25,749 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:25,749 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:25,750 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:25,751 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:25,752 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:25,752 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:25,753 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:25,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 10000); {6569#false} is VALID [2018-11-23 12:27:25,754 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:25,754 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:25,755 INFO L273 TraceCheckUtils]: 35: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:25,755 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:25,755 INFO L273 TraceCheckUtils]: 37: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:25,756 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:25,756 INFO L273 TraceCheckUtils]: 39: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:25,756 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:25,756 INFO L273 TraceCheckUtils]: 41: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:25,757 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:25,757 INFO L273 TraceCheckUtils]: 43: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:25,757 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:25,757 INFO L273 TraceCheckUtils]: 45: Hoare triple {6568#true} assume !(~i~0 < 10000); {6568#true} is VALID [2018-11-23 12:27:25,758 INFO L273 TraceCheckUtils]: 46: Hoare triple {6568#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:27:25,758 INFO L273 TraceCheckUtils]: 47: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:25,758 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6568#true} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:27:25,758 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:25,758 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:25,759 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:25,759 INFO L273 TraceCheckUtils]: 52: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:25,759 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:25,759 INFO L273 TraceCheckUtils]: 54: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:25,759 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:25,759 INFO L273 TraceCheckUtils]: 56: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:25,759 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:25,760 INFO L273 TraceCheckUtils]: 58: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:25,760 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:25,760 INFO L273 TraceCheckUtils]: 60: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:25,760 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:25,760 INFO L273 TraceCheckUtils]: 62: Hoare triple {6568#true} assume !(~i~0 < 10000); {6568#true} is VALID [2018-11-23 12:27:25,760 INFO L273 TraceCheckUtils]: 63: Hoare triple {6568#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:27:25,761 INFO L273 TraceCheckUtils]: 64: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:25,761 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6568#true} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:27:25,761 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:25,761 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:25,761 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:25,761 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:25,761 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:25,762 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:25,762 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:25,762 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:25,762 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:25,762 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 9999); {6569#false} is VALID [2018-11-23 12:27:25,762 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:27:25,763 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:25,763 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:25,763 INFO L273 TraceCheckUtils]: 79: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:25,763 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:25,763 INFO L273 TraceCheckUtils]: 81: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:25,763 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:25,763 INFO L273 TraceCheckUtils]: 83: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:25,764 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:25,764 INFO L273 TraceCheckUtils]: 85: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:25,764 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:25,764 INFO L273 TraceCheckUtils]: 87: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:25,764 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:25,764 INFO L273 TraceCheckUtils]: 89: Hoare triple {6568#true} assume !(~i~0 < 10000); {6568#true} is VALID [2018-11-23 12:27:25,765 INFO L273 TraceCheckUtils]: 90: Hoare triple {6568#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:27:25,765 INFO L273 TraceCheckUtils]: 91: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:25,765 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6568#true} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:27:25,765 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:25,765 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:25,765 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:27:25,774 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:25,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:25,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:25,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:26,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:27:26,243 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:26,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:26,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:27:26,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret12 := main(); {6568#true} is VALID [2018-11-23 12:27:26,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:26,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {6602#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:26,246 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:26,246 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:26,246 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:26,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:26,247 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:26,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:26,249 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:26,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:26,250 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:26,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:26,252 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:26,252 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:26,253 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:26,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:26,255 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:26,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:26,256 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:26,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:26,258 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:26,258 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:26,259 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:26,260 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:26,261 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:26,261 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:26,262 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:26,263 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 10000); {6569#false} is VALID [2018-11-23 12:27:26,263 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:26,264 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:26,264 INFO L273 TraceCheckUtils]: 35: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:26,264 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:26,264 INFO L273 TraceCheckUtils]: 37: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:26,265 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:26,265 INFO L273 TraceCheckUtils]: 39: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:26,265 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:26,265 INFO L273 TraceCheckUtils]: 41: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:26,266 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:26,266 INFO L273 TraceCheckUtils]: 43: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:26,266 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:26,266 INFO L273 TraceCheckUtils]: 45: Hoare triple {6569#false} assume !(~i~0 < 10000); {6569#false} is VALID [2018-11-23 12:27:26,267 INFO L273 TraceCheckUtils]: 46: Hoare triple {6569#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:27:26,267 INFO L273 TraceCheckUtils]: 47: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:27:26,267 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6569#false} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:27:26,268 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:26,268 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:26,268 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:26,268 INFO L273 TraceCheckUtils]: 52: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:26,268 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:26,268 INFO L273 TraceCheckUtils]: 54: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:26,269 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:26,269 INFO L273 TraceCheckUtils]: 56: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:26,269 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:26,269 INFO L273 TraceCheckUtils]: 58: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:26,269 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:26,269 INFO L273 TraceCheckUtils]: 60: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:26,269 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:26,270 INFO L273 TraceCheckUtils]: 62: Hoare triple {6569#false} assume !(~i~0 < 10000); {6569#false} is VALID [2018-11-23 12:27:26,270 INFO L273 TraceCheckUtils]: 63: Hoare triple {6569#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:27:26,270 INFO L273 TraceCheckUtils]: 64: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:27:26,270 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6569#false} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:27:26,270 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:26,270 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:26,271 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:26,271 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:26,271 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:26,271 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:26,271 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:26,271 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:26,271 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:26,272 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 9999); {6569#false} is VALID [2018-11-23 12:27:26,272 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:27:26,272 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:26,272 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:26,272 INFO L273 TraceCheckUtils]: 79: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:26,272 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:26,273 INFO L273 TraceCheckUtils]: 81: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:26,273 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:26,273 INFO L273 TraceCheckUtils]: 83: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:26,273 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:26,273 INFO L273 TraceCheckUtils]: 85: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:26,273 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:26,273 INFO L273 TraceCheckUtils]: 87: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:26,274 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:26,274 INFO L273 TraceCheckUtils]: 89: Hoare triple {6569#false} assume !(~i~0 < 10000); {6569#false} is VALID [2018-11-23 12:27:26,274 INFO L273 TraceCheckUtils]: 90: Hoare triple {6569#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:27:26,274 INFO L273 TraceCheckUtils]: 91: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:27:26,274 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6569#false} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:27:26,274 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:26,275 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:26,275 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:27:26,283 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:26,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:26,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:27:26,304 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:27:26,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:26,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:27:26,403 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:26,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:27:26,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:27:26,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:26,404 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2018-11-23 12:27:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:27,106 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 12:27:27,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:27:27,106 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:27:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:27:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:27:27,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2018-11-23 12:27:27,591 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:27,596 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:27:27,596 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:27:27,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:27,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:27:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:27:27,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:27,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:27:27,621 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:27:27,621 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:27:27,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:27,625 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:27:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:27:27,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:27,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:27,626 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:27:27,626 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:27:27,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:27,628 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:27:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:27:27,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:27,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:27,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:27,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:27:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 12:27:27,631 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2018-11-23 12:27:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:27,631 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 12:27:27,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:27:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:27:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 12:27:27,632 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:27,632 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:27,633 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:27,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1350791579, now seen corresponding path program 14 times [2018-11-23 12:27:27,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:27,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:27,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:28,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:27:28,153 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:28,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:28,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:27:28,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret12 := main(); {7268#true} is VALID [2018-11-23 12:27:28,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28,154 INFO L273 TraceCheckUtils]: 6: Hoare triple {7270#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28,155 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:28,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28,156 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:28,157 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:28,158 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:28,158 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:28,159 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:28,160 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:28,160 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:28,161 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:28,162 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:28,162 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:28,163 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:28,164 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:28,164 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:28,165 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:28,166 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:28,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:28,167 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:28,167 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:28,168 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:28,169 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:28,170 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:28,170 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:28,171 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:28,171 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:28,172 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:28,173 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 10000); {7269#false} is VALID [2018-11-23 12:27:28,173 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:28,173 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:28,174 INFO L273 TraceCheckUtils]: 37: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:28,174 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:28,174 INFO L273 TraceCheckUtils]: 39: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:28,174 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:28,174 INFO L273 TraceCheckUtils]: 41: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:28,175 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:28,175 INFO L273 TraceCheckUtils]: 43: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:28,175 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:28,175 INFO L273 TraceCheckUtils]: 45: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:28,175 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:28,176 INFO L273 TraceCheckUtils]: 47: Hoare triple {7268#true} assume !(~i~0 < 10000); {7268#true} is VALID [2018-11-23 12:27:28,176 INFO L273 TraceCheckUtils]: 48: Hoare triple {7268#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:27:28,176 INFO L273 TraceCheckUtils]: 49: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:28,176 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7268#true} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:27:28,176 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:28,176 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:28,176 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:28,176 INFO L273 TraceCheckUtils]: 54: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:28,176 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:28,177 INFO L273 TraceCheckUtils]: 56: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:28,177 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:28,177 INFO L273 TraceCheckUtils]: 58: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:28,177 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:28,177 INFO L273 TraceCheckUtils]: 60: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:28,177 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:28,177 INFO L273 TraceCheckUtils]: 62: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:28,177 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:28,178 INFO L273 TraceCheckUtils]: 64: Hoare triple {7268#true} assume !(~i~0 < 10000); {7268#true} is VALID [2018-11-23 12:27:28,178 INFO L273 TraceCheckUtils]: 65: Hoare triple {7268#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:27:28,178 INFO L273 TraceCheckUtils]: 66: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:28,178 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7268#true} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:27:28,178 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:28,178 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:28,179 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:28,179 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:28,179 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:28,179 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:28,179 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:28,179 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:28,180 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:28,180 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 9999); {7269#false} is VALID [2018-11-23 12:27:28,180 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:27:28,180 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:28,180 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:28,180 INFO L273 TraceCheckUtils]: 81: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:28,181 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:28,181 INFO L273 TraceCheckUtils]: 83: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:28,181 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:28,181 INFO L273 TraceCheckUtils]: 85: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:28,181 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:28,181 INFO L273 TraceCheckUtils]: 87: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:28,182 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:28,182 INFO L273 TraceCheckUtils]: 89: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:28,182 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:28,182 INFO L273 TraceCheckUtils]: 91: Hoare triple {7268#true} assume !(~i~0 < 10000); {7268#true} is VALID [2018-11-23 12:27:28,182 INFO L273 TraceCheckUtils]: 92: Hoare triple {7268#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:27:28,182 INFO L273 TraceCheckUtils]: 93: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:28,183 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7268#true} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:27:28,183 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:28,183 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:28,183 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:27:28,188 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:28,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:28,188 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:28,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:28,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:28,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:28,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:28,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:27:28,575 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:28,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:28,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:27:28,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret12 := main(); {7268#true} is VALID [2018-11-23 12:27:28,577 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {7303#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28,578 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:28,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28,579 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:28,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:28,580 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:28,580 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:28,581 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:28,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:28,582 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:28,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:28,583 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:28,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:28,585 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:28,585 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:28,586 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:28,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:28,587 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:28,588 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:28,589 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:28,589 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:28,590 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:28,590 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:28,591 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:28,592 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:28,592 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:28,593 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:28,594 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:28,594 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 10000); {7269#false} is VALID [2018-11-23 12:27:28,595 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:28,595 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:28,595 INFO L273 TraceCheckUtils]: 37: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:28,595 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:28,596 INFO L273 TraceCheckUtils]: 39: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:28,596 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:28,596 INFO L273 TraceCheckUtils]: 41: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:28,596 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:28,596 INFO L273 TraceCheckUtils]: 43: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:28,597 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:28,597 INFO L273 TraceCheckUtils]: 45: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:28,597 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:28,597 INFO L273 TraceCheckUtils]: 47: Hoare triple {7269#false} assume !(~i~0 < 10000); {7269#false} is VALID [2018-11-23 12:27:28,597 INFO L273 TraceCheckUtils]: 48: Hoare triple {7269#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:27:28,598 INFO L273 TraceCheckUtils]: 49: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:27:28,598 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7269#false} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:27:28,598 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:28,598 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:28,598 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:28,599 INFO L273 TraceCheckUtils]: 54: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:28,599 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:28,599 INFO L273 TraceCheckUtils]: 56: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:28,599 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:28,599 INFO L273 TraceCheckUtils]: 58: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:28,600 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:28,600 INFO L273 TraceCheckUtils]: 60: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:28,600 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:28,600 INFO L273 TraceCheckUtils]: 62: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:28,600 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:28,600 INFO L273 TraceCheckUtils]: 64: Hoare triple {7269#false} assume !(~i~0 < 10000); {7269#false} is VALID [2018-11-23 12:27:28,600 INFO L273 TraceCheckUtils]: 65: Hoare triple {7269#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:27:28,600 INFO L273 TraceCheckUtils]: 66: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:27:28,600 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7269#false} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:27:28,601 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:28,601 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:28,601 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:28,601 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:28,601 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:28,601 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:28,601 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:28,601 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:28,602 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:28,602 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 9999); {7269#false} is VALID [2018-11-23 12:27:28,602 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:27:28,602 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:28,602 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:28,602 INFO L273 TraceCheckUtils]: 81: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:28,602 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:28,602 INFO L273 TraceCheckUtils]: 83: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:28,602 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:28,603 INFO L273 TraceCheckUtils]: 85: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:28,603 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:28,603 INFO L273 TraceCheckUtils]: 87: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:28,603 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:28,603 INFO L273 TraceCheckUtils]: 89: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:28,603 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:28,603 INFO L273 TraceCheckUtils]: 91: Hoare triple {7269#false} assume !(~i~0 < 10000); {7269#false} is VALID [2018-11-23 12:27:28,603 INFO L273 TraceCheckUtils]: 92: Hoare triple {7269#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:27:28,604 INFO L273 TraceCheckUtils]: 93: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:27:28,604 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7269#false} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:27:28,604 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:28,604 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:28,604 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:27:28,608 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:28,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:28,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:27:28,629 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:27:28,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:28,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:27:28,697 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:28,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:27:28,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:27:28,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:27:28,698 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2018-11-23 12:27:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:29,161 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 12:27:29,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:27:29,161 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:27:29,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:27:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:27:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:27:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:27:29,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2018-11-23 12:27:29,266 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:29,268 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:27:29,268 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:27:29,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:27:29,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:27:29,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 12:27:29,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:29,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 12:27:29,301 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 12:27:29,301 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 12:27:29,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:29,303 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:27:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:27:29,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:29,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:29,304 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 12:27:29,304 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 12:27:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:29,306 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:27:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:27:29,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:29,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:29,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:29,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:27:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 12:27:29,309 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2018-11-23 12:27:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:29,309 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 12:27:29,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:27:29,309 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 12:27:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:27:29,310 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:29,310 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:29,310 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:29,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:29,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1244541881, now seen corresponding path program 15 times [2018-11-23 12:27:29,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:29,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:29,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:29,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:29,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:29,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:27:29,647 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:29,647 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:29,647 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:27:29,647 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret12 := main(); {7985#true} is VALID [2018-11-23 12:27:29,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29,648 INFO L273 TraceCheckUtils]: 6: Hoare triple {7987#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29,649 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:29,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {7988#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29,651 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:29,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {7989#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29,652 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:29,652 INFO L273 TraceCheckUtils]: 12: Hoare triple {7990#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29,653 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:29,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {7991#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29,655 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:29,655 INFO L273 TraceCheckUtils]: 16: Hoare triple {7992#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29,656 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:29,656 INFO L273 TraceCheckUtils]: 18: Hoare triple {7993#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29,657 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:29,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {7994#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29,659 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:29,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {7995#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29,660 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:29,660 INFO L273 TraceCheckUtils]: 24: Hoare triple {7996#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29,661 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:29,662 INFO L273 TraceCheckUtils]: 26: Hoare triple {7997#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29,662 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:29,663 INFO L273 TraceCheckUtils]: 28: Hoare triple {7998#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29,664 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:29,664 INFO L273 TraceCheckUtils]: 30: Hoare triple {7999#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29,665 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:29,666 INFO L273 TraceCheckUtils]: 32: Hoare triple {8000#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29,666 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:29,667 INFO L273 TraceCheckUtils]: 34: Hoare triple {8001#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29,668 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:29,668 INFO L273 TraceCheckUtils]: 36: Hoare triple {8002#(<= main_~i~1 15)} assume !(~i~1 < 10000); {7986#false} is VALID [2018-11-23 12:27:29,669 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:29,669 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:29,669 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,669 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:29,669 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,670 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:29,670 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,670 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:29,670 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,671 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:29,671 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,671 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:29,671 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:27:29,671 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:29,672 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:29,672 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7986#false} #70#return; {7986#false} is VALID [2018-11-23 12:27:29,672 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:29,672 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:29,672 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:29,673 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,673 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:29,673 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,673 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:29,673 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,674 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:29,674 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,674 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:29,674 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,674 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:29,674 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:27:29,674 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:29,674 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:29,674 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7986#false} #72#return; {7986#false} is VALID [2018-11-23 12:27:29,675 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:29,675 INFO L273 TraceCheckUtils]: 71: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:29,675 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:29,675 INFO L273 TraceCheckUtils]: 73: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:29,675 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:29,675 INFO L273 TraceCheckUtils]: 75: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:29,675 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:29,675 INFO L273 TraceCheckUtils]: 77: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:29,676 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:29,676 INFO L273 TraceCheckUtils]: 79: Hoare triple {7986#false} assume !(~i~2 < 9999); {7986#false} is VALID [2018-11-23 12:27:29,676 INFO L273 TraceCheckUtils]: 80: Hoare triple {7986#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:27:29,676 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:29,676 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:29,676 INFO L273 TraceCheckUtils]: 83: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,676 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:29,676 INFO L273 TraceCheckUtils]: 85: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,677 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:29,677 INFO L273 TraceCheckUtils]: 87: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,677 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:29,677 INFO L273 TraceCheckUtils]: 89: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,677 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:29,677 INFO L273 TraceCheckUtils]: 91: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,677 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:29,677 INFO L273 TraceCheckUtils]: 93: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:27:29,677 INFO L273 TraceCheckUtils]: 94: Hoare triple {7985#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:29,678 INFO L273 TraceCheckUtils]: 95: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:29,678 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7985#true} {7986#false} #74#return; {7986#false} is VALID [2018-11-23 12:27:29,678 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:29,678 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:29,678 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:27:29,683 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:29,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:29,683 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:29,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:29,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:27:29,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:29,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:29,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:27:29,954 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:29,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:29,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:27:29,955 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret12 := main(); {7985#true} is VALID [2018-11-23 12:27:29,955 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7985#true} is VALID [2018-11-23 12:27:29,955 INFO L273 TraceCheckUtils]: 6: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29,956 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:29,956 INFO L273 TraceCheckUtils]: 8: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29,956 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:29,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29,957 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:29,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29,957 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:29,957 INFO L273 TraceCheckUtils]: 14: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29,957 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:29,957 INFO L273 TraceCheckUtils]: 16: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29,957 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:29,957 INFO L273 TraceCheckUtils]: 18: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29,958 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:29,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29,958 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:29,958 INFO L273 TraceCheckUtils]: 22: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29,958 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:29,958 INFO L273 TraceCheckUtils]: 24: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29,958 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:29,958 INFO L273 TraceCheckUtils]: 26: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29,959 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:29,959 INFO L273 TraceCheckUtils]: 28: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29,959 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:29,959 INFO L273 TraceCheckUtils]: 30: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29,959 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:29,959 INFO L273 TraceCheckUtils]: 32: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29,959 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:29,959 INFO L273 TraceCheckUtils]: 34: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29,960 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:29,960 INFO L273 TraceCheckUtils]: 36: Hoare triple {7985#true} assume !(~i~1 < 10000); {7985#true} is VALID [2018-11-23 12:27:29,960 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:29,960 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:29,960 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,960 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:29,960 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,960 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:29,960 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,961 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:29,961 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,961 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:29,961 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,961 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:29,961 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:27:29,961 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:29,962 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:29,962 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7985#true} #70#return; {7985#true} is VALID [2018-11-23 12:27:29,962 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:29,962 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:29,962 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:29,962 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,962 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:29,962 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,962 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:29,963 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,963 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:29,963 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,963 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:29,963 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29,963 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:29,963 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:27:29,963 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:29,964 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:29,964 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7985#true} #72#return; {7985#true} is VALID [2018-11-23 12:27:29,964 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:29,964 INFO L273 TraceCheckUtils]: 71: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:29,964 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:29,964 INFO L273 TraceCheckUtils]: 73: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:29,964 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:29,964 INFO L273 TraceCheckUtils]: 75: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:29,964 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:29,965 INFO L273 TraceCheckUtils]: 77: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:29,965 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:29,965 INFO L273 TraceCheckUtils]: 79: Hoare triple {7985#true} assume !(~i~2 < 9999); {7985#true} is VALID [2018-11-23 12:27:29,965 INFO L273 TraceCheckUtils]: 80: Hoare triple {7985#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:27:29,965 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:29,966 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:29,966 INFO L273 TraceCheckUtils]: 83: Hoare triple {8252#(<= mapavg_~i~0 0)} assume !!(~i~0 < 10000);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:29,967 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:29,967 INFO L273 TraceCheckUtils]: 85: Hoare triple {8259#(<= mapavg_~i~0 1)} assume !!(~i~0 < 10000);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:29,967 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:29,968 INFO L273 TraceCheckUtils]: 87: Hoare triple {8266#(<= mapavg_~i~0 2)} assume !!(~i~0 < 10000);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:29,968 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:29,969 INFO L273 TraceCheckUtils]: 89: Hoare triple {8273#(<= mapavg_~i~0 3)} assume !!(~i~0 < 10000);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:29,970 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:29,970 INFO L273 TraceCheckUtils]: 91: Hoare triple {8280#(<= mapavg_~i~0 4)} assume !!(~i~0 < 10000);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:29,971 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:29,972 INFO L273 TraceCheckUtils]: 93: Hoare triple {8287#(<= mapavg_~i~0 5)} assume !(~i~0 < 10000); {7986#false} is VALID [2018-11-23 12:27:29,972 INFO L273 TraceCheckUtils]: 94: Hoare triple {7986#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {7986#false} is VALID [2018-11-23 12:27:29,972 INFO L273 TraceCheckUtils]: 95: Hoare triple {7986#false} assume true; {7986#false} is VALID [2018-11-23 12:27:29,972 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7986#false} {7985#true} #74#return; {7986#false} is VALID [2018-11-23 12:27:29,973 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:29,973 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:29,973 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:27:29,978 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:29,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:29,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2018-11-23 12:27:29,998 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:27:29,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:29,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:27:30,122 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:30,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:27:30,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:27:30,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:30,124 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2018-11-23 12:27:30,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:30,491 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-23 12:27:30,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:27:30,492 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:27:30,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:27:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:27:30,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 100 transitions. [2018-11-23 12:27:30,662 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:30,664 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:27:30,664 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:27:30,665 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:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:27:30,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:27:30,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:30,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 12:27:30,692 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 12:27:30,692 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 12:27:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:30,693 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:27:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:27:30,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:30,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:30,694 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 12:27:30,694 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 12:27:30,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:30,696 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:27:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:27:30,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:30,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:30,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:30,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:27:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 12:27:30,698 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2018-11-23 12:27:30,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:30,699 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 12:27:30,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:27:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 12:27:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:27:30,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:30,700 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:30,700 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:30,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:30,701 INFO L82 PathProgramCache]: Analyzing trace with hash -261735289, now seen corresponding path program 16 times [2018-11-23 12:27:30,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:30,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:30,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:30,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:30,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:31,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:27:31,132 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:31,132 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:31,132 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:27:31,133 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret12 := main(); {8737#true} is VALID [2018-11-23 12:27:31,133 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:31,133 INFO L273 TraceCheckUtils]: 6: Hoare triple {8739#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:31,134 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:31,134 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:31,135 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:31,135 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:31,135 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:31,136 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:31,136 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:31,136 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:31,137 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:31,137 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:31,138 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:31,139 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:31,139 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:31,140 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:31,141 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:31,141 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:31,142 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:31,143 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:31,143 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:31,144 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:31,145 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:31,145 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:31,146 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:31,146 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:31,147 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:31,148 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:31,149 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:31,149 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:31,150 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:31,150 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:31,151 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:31,152 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 10000); {8738#false} is VALID [2018-11-23 12:27:31,152 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:31,152 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:31,153 INFO L273 TraceCheckUtils]: 41: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,153 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:31,153 INFO L273 TraceCheckUtils]: 43: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,153 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:31,153 INFO L273 TraceCheckUtils]: 45: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,154 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:31,154 INFO L273 TraceCheckUtils]: 47: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,154 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:31,154 INFO L273 TraceCheckUtils]: 49: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,154 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:31,154 INFO L273 TraceCheckUtils]: 51: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,154 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:31,155 INFO L273 TraceCheckUtils]: 53: Hoare triple {8737#true} assume !(~i~0 < 10000); {8737#true} is VALID [2018-11-23 12:27:31,155 INFO L273 TraceCheckUtils]: 54: Hoare triple {8737#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:27:31,155 INFO L273 TraceCheckUtils]: 55: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:31,155 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8737#true} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:27:31,155 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:31,155 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:31,155 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:31,155 INFO L273 TraceCheckUtils]: 60: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,156 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:31,156 INFO L273 TraceCheckUtils]: 62: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,156 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:31,156 INFO L273 TraceCheckUtils]: 64: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,156 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:31,156 INFO L273 TraceCheckUtils]: 66: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,156 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:31,156 INFO L273 TraceCheckUtils]: 68: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,156 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:31,157 INFO L273 TraceCheckUtils]: 70: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,157 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:31,157 INFO L273 TraceCheckUtils]: 72: Hoare triple {8737#true} assume !(~i~0 < 10000); {8737#true} is VALID [2018-11-23 12:27:31,157 INFO L273 TraceCheckUtils]: 73: Hoare triple {8737#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:27:31,157 INFO L273 TraceCheckUtils]: 74: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:31,157 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8737#true} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:27:31,157 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:31,157 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:31,157 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:31,158 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:31,158 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:31,158 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:31,158 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:31,158 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:31,158 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:31,158 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 9999); {8738#false} is VALID [2018-11-23 12:27:31,158 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:27:31,159 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:31,159 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:31,159 INFO L273 TraceCheckUtils]: 89: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,159 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:31,159 INFO L273 TraceCheckUtils]: 91: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,159 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:31,159 INFO L273 TraceCheckUtils]: 93: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,159 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:31,159 INFO L273 TraceCheckUtils]: 95: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,160 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:31,160 INFO L273 TraceCheckUtils]: 97: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,160 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:31,160 INFO L273 TraceCheckUtils]: 99: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:31,160 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:31,160 INFO L273 TraceCheckUtils]: 101: Hoare triple {8737#true} assume !(~i~0 < 10000); {8737#true} is VALID [2018-11-23 12:27:31,160 INFO L273 TraceCheckUtils]: 102: Hoare triple {8737#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:27:31,160 INFO L273 TraceCheckUtils]: 103: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:31,160 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8737#true} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:27:31,161 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:31,161 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:31,161 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:27:31,166 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:31,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:31,166 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:31,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:31,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:31,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:31,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:31,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:27:31,432 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:31,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:31,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:27:31,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret12 := main(); {8737#true} is VALID [2018-11-23 12:27:31,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:31,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {8774#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:31,435 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:31,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:31,436 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:31,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:31,437 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:31,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:31,437 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:31,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:31,438 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:31,439 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:31,440 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:31,440 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:31,441 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:31,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:31,442 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:31,443 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:31,444 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:31,444 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:31,445 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:31,445 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:31,446 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:31,447 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:31,448 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:31,448 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:31,449 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:31,449 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:31,450 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:31,451 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:31,451 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:31,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:31,453 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:31,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 10000); {8738#false} is VALID [2018-11-23 12:27:31,454 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:31,454 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:31,454 INFO L273 TraceCheckUtils]: 41: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,454 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:31,454 INFO L273 TraceCheckUtils]: 43: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,455 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:31,455 INFO L273 TraceCheckUtils]: 45: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,455 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:31,455 INFO L273 TraceCheckUtils]: 47: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,456 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:31,456 INFO L273 TraceCheckUtils]: 49: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,456 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:31,456 INFO L273 TraceCheckUtils]: 51: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,456 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:31,457 INFO L273 TraceCheckUtils]: 53: Hoare triple {8738#false} assume !(~i~0 < 10000); {8738#false} is VALID [2018-11-23 12:27:31,457 INFO L273 TraceCheckUtils]: 54: Hoare triple {8738#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:27:31,457 INFO L273 TraceCheckUtils]: 55: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:27:31,457 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8738#false} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:27:31,457 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:31,458 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:31,458 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:31,458 INFO L273 TraceCheckUtils]: 60: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,458 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:31,458 INFO L273 TraceCheckUtils]: 62: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,458 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:31,458 INFO L273 TraceCheckUtils]: 64: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,458 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:31,459 INFO L273 TraceCheckUtils]: 66: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,459 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:31,459 INFO L273 TraceCheckUtils]: 68: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,459 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:31,459 INFO L273 TraceCheckUtils]: 70: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,459 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:31,459 INFO L273 TraceCheckUtils]: 72: Hoare triple {8738#false} assume !(~i~0 < 10000); {8738#false} is VALID [2018-11-23 12:27:31,459 INFO L273 TraceCheckUtils]: 73: Hoare triple {8738#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:27:31,459 INFO L273 TraceCheckUtils]: 74: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:27:31,460 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8738#false} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:27:31,460 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:31,460 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:31,460 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:31,460 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:31,460 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:31,460 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:31,460 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:31,460 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:31,461 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:31,461 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 9999); {8738#false} is VALID [2018-11-23 12:27:31,461 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:27:31,461 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:31,461 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:31,461 INFO L273 TraceCheckUtils]: 89: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,461 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:31,461 INFO L273 TraceCheckUtils]: 91: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,462 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:31,462 INFO L273 TraceCheckUtils]: 93: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,462 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:31,462 INFO L273 TraceCheckUtils]: 95: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,462 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:31,462 INFO L273 TraceCheckUtils]: 97: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,462 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:31,462 INFO L273 TraceCheckUtils]: 99: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:31,462 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:31,463 INFO L273 TraceCheckUtils]: 101: Hoare triple {8738#false} assume !(~i~0 < 10000); {8738#false} is VALID [2018-11-23 12:27:31,463 INFO L273 TraceCheckUtils]: 102: Hoare triple {8738#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:27:31,463 INFO L273 TraceCheckUtils]: 103: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:27:31,463 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8738#false} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:27:31,463 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:31,463 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:31,463 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:27:31,468 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:31,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:31,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:27:31,489 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:27:31,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:31,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:27:31,567 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:31,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:27:31,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:27:31,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:27:31,568 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2018-11-23 12:27:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,103 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-23 12:27:32,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:32,103 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:27:32,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:27:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:27:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:27:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:27:32,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 86 transitions. [2018-11-23 12:27:32,382 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:32,385 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:27:32,385 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:27:32,386 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:32,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:27:32,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 12:27:32,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:32,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 12:27:32,420 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 12:27:32,420 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 12:27:32,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,422 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:27:32,422 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:27:32,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:32,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:32,423 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 12:27:32,423 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 12:27:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,424 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:27:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:27:32,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:32,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:32,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:32,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:27:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 12:27:32,427 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2018-11-23 12:27:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:32,428 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 12:27:32,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:27:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:27:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 12:27:32,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:32,429 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:32,429 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:32,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:32,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1057421335, now seen corresponding path program 17 times [2018-11-23 12:27:32,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:32,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:32,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:32,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:32,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:33,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:27:33,464 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:33,464 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:33,464 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:27:33,465 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret12 := main(); {9519#true} is VALID [2018-11-23 12:27:33,465 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:33,466 INFO L273 TraceCheckUtils]: 6: Hoare triple {9521#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:33,466 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:33,467 INFO L273 TraceCheckUtils]: 8: Hoare triple {9522#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:33,468 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:33,468 INFO L273 TraceCheckUtils]: 10: Hoare triple {9523#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:33,469 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:33,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {9524#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:33,470 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:33,471 INFO L273 TraceCheckUtils]: 14: Hoare triple {9525#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:33,472 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:33,472 INFO L273 TraceCheckUtils]: 16: Hoare triple {9526#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:33,473 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:33,474 INFO L273 TraceCheckUtils]: 18: Hoare triple {9527#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:33,474 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:33,475 INFO L273 TraceCheckUtils]: 20: Hoare triple {9528#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:33,495 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:33,496 INFO L273 TraceCheckUtils]: 22: Hoare triple {9529#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:33,496 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:33,497 INFO L273 TraceCheckUtils]: 24: Hoare triple {9530#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:33,497 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:33,497 INFO L273 TraceCheckUtils]: 26: Hoare triple {9531#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:33,498 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:33,501 INFO L273 TraceCheckUtils]: 28: Hoare triple {9532#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:33,501 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:33,502 INFO L273 TraceCheckUtils]: 30: Hoare triple {9533#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:33,502 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:33,503 INFO L273 TraceCheckUtils]: 32: Hoare triple {9534#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:33,503 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:33,503 INFO L273 TraceCheckUtils]: 34: Hoare triple {9535#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:33,504 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:33,504 INFO L273 TraceCheckUtils]: 36: Hoare triple {9536#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:33,504 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:33,505 INFO L273 TraceCheckUtils]: 38: Hoare triple {9537#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:33,506 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:33,506 INFO L273 TraceCheckUtils]: 40: Hoare triple {9538#(<= main_~i~1 17)} assume !(~i~1 < 10000); {9520#false} is VALID [2018-11-23 12:27:33,507 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:33,507 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:33,507 INFO L273 TraceCheckUtils]: 43: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,507 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:33,507 INFO L273 TraceCheckUtils]: 45: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,508 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:33,508 INFO L273 TraceCheckUtils]: 47: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,508 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:33,508 INFO L273 TraceCheckUtils]: 49: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,508 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:33,509 INFO L273 TraceCheckUtils]: 51: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,509 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:33,509 INFO L273 TraceCheckUtils]: 53: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,509 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:33,509 INFO L273 TraceCheckUtils]: 55: Hoare triple {9519#true} assume !(~i~0 < 10000); {9519#true} is VALID [2018-11-23 12:27:33,510 INFO L273 TraceCheckUtils]: 56: Hoare triple {9519#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:27:33,510 INFO L273 TraceCheckUtils]: 57: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:33,510 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9519#true} {9520#false} #70#return; {9520#false} is VALID [2018-11-23 12:27:33,510 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:33,510 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:33,510 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:33,510 INFO L273 TraceCheckUtils]: 62: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,510 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:33,511 INFO L273 TraceCheckUtils]: 64: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,511 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:33,511 INFO L273 TraceCheckUtils]: 66: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,511 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:33,511 INFO L273 TraceCheckUtils]: 68: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,511 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:33,511 INFO L273 TraceCheckUtils]: 70: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,511 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:33,511 INFO L273 TraceCheckUtils]: 72: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,512 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:33,512 INFO L273 TraceCheckUtils]: 74: Hoare triple {9519#true} assume !(~i~0 < 10000); {9519#true} is VALID [2018-11-23 12:27:33,512 INFO L273 TraceCheckUtils]: 75: Hoare triple {9519#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:27:33,512 INFO L273 TraceCheckUtils]: 76: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:33,512 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9519#true} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:27:33,512 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:33,512 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:33,512 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:33,513 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:33,513 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:33,513 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:33,513 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:33,513 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:33,513 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:33,513 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 9999); {9520#false} is VALID [2018-11-23 12:27:33,513 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:27:33,513 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:33,514 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:33,514 INFO L273 TraceCheckUtils]: 91: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,514 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:33,514 INFO L273 TraceCheckUtils]: 93: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,514 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:33,514 INFO L273 TraceCheckUtils]: 95: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,514 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:33,514 INFO L273 TraceCheckUtils]: 97: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,514 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:33,515 INFO L273 TraceCheckUtils]: 99: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,515 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:33,515 INFO L273 TraceCheckUtils]: 101: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:33,515 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:33,515 INFO L273 TraceCheckUtils]: 103: Hoare triple {9519#true} assume !(~i~0 < 10000); {9519#true} is VALID [2018-11-23 12:27:33,515 INFO L273 TraceCheckUtils]: 104: Hoare triple {9519#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:27:33,515 INFO L273 TraceCheckUtils]: 105: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:33,515 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9519#true} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:27:33,516 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:33,516 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:33,516 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:27:33,521 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:33,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:33,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:33,531 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:36,320 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-23 12:27:36,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:36,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:36,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:27:36,593 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:36,593 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:36,593 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:27:36,594 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret12 := main(); {9519#true} is VALID [2018-11-23 12:27:36,594 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9519#true} is VALID [2018-11-23 12:27:36,594 INFO L273 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,594 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:36,595 INFO L273 TraceCheckUtils]: 8: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,595 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:36,595 INFO L273 TraceCheckUtils]: 10: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,595 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:36,595 INFO L273 TraceCheckUtils]: 12: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,595 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:36,596 INFO L273 TraceCheckUtils]: 14: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,596 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:36,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,596 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:36,596 INFO L273 TraceCheckUtils]: 18: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,597 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:36,597 INFO L273 TraceCheckUtils]: 20: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,597 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:36,597 INFO L273 TraceCheckUtils]: 22: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,597 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:36,597 INFO L273 TraceCheckUtils]: 24: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,598 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:36,598 INFO L273 TraceCheckUtils]: 26: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,598 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:36,598 INFO L273 TraceCheckUtils]: 28: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,598 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:36,598 INFO L273 TraceCheckUtils]: 30: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,599 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:36,599 INFO L273 TraceCheckUtils]: 32: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,599 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:36,599 INFO L273 TraceCheckUtils]: 34: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,599 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:36,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,600 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:36,600 INFO L273 TraceCheckUtils]: 38: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:36,600 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:36,600 INFO L273 TraceCheckUtils]: 40: Hoare triple {9519#true} assume !(~i~1 < 10000); {9519#true} is VALID [2018-11-23 12:27:36,600 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:36,615 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:36,624 INFO L273 TraceCheckUtils]: 43: Hoare triple {9668#(<= mapavg_~i~0 0)} assume !!(~i~0 < 10000);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:36,628 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:36,628 INFO L273 TraceCheckUtils]: 45: Hoare triple {9675#(<= mapavg_~i~0 1)} assume !!(~i~0 < 10000);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:36,630 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:36,630 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= mapavg_~i~0 2)} assume !!(~i~0 < 10000);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:36,630 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:36,631 INFO L273 TraceCheckUtils]: 49: Hoare triple {9689#(<= mapavg_~i~0 3)} assume !!(~i~0 < 10000);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:36,632 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:36,632 INFO L273 TraceCheckUtils]: 51: Hoare triple {9696#(<= mapavg_~i~0 4)} assume !!(~i~0 < 10000);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:36,632 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:36,633 INFO L273 TraceCheckUtils]: 53: Hoare triple {9703#(<= mapavg_~i~0 5)} assume !!(~i~0 < 10000);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:36,633 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:36,634 INFO L273 TraceCheckUtils]: 55: Hoare triple {9710#(<= mapavg_~i~0 6)} assume !(~i~0 < 10000); {9520#false} is VALID [2018-11-23 12:27:36,634 INFO L273 TraceCheckUtils]: 56: Hoare triple {9520#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:27:36,634 INFO L273 TraceCheckUtils]: 57: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:27:36,634 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9520#false} {9519#true} #70#return; {9520#false} is VALID [2018-11-23 12:27:36,635 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:36,635 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:36,635 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:36,635 INFO L273 TraceCheckUtils]: 62: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:36,635 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:36,636 INFO L273 TraceCheckUtils]: 64: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:36,636 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:36,636 INFO L273 TraceCheckUtils]: 66: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:36,636 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:36,636 INFO L273 TraceCheckUtils]: 68: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:36,637 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:36,637 INFO L273 TraceCheckUtils]: 70: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:36,637 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:36,637 INFO L273 TraceCheckUtils]: 72: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:36,637 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:36,637 INFO L273 TraceCheckUtils]: 74: Hoare triple {9520#false} assume !(~i~0 < 10000); {9520#false} is VALID [2018-11-23 12:27:36,637 INFO L273 TraceCheckUtils]: 75: Hoare triple {9520#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:27:36,637 INFO L273 TraceCheckUtils]: 76: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:27:36,637 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9520#false} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:27:36,638 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:36,638 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:36,638 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:36,638 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:36,638 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:36,638 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:36,638 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:36,638 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:36,638 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:36,639 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 9999); {9520#false} is VALID [2018-11-23 12:27:36,639 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:27:36,639 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:36,639 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:36,639 INFO L273 TraceCheckUtils]: 91: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:36,639 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:36,639 INFO L273 TraceCheckUtils]: 93: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:36,639 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:36,639 INFO L273 TraceCheckUtils]: 95: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:36,640 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:36,640 INFO L273 TraceCheckUtils]: 97: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:36,640 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:36,640 INFO L273 TraceCheckUtils]: 99: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:36,640 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:36,640 INFO L273 TraceCheckUtils]: 101: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:36,640 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:36,640 INFO L273 TraceCheckUtils]: 103: Hoare triple {9520#false} assume !(~i~0 < 10000); {9520#false} is VALID [2018-11-23 12:27:36,640 INFO L273 TraceCheckUtils]: 104: Hoare triple {9520#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:27:36,641 INFO L273 TraceCheckUtils]: 105: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:27:36,641 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9520#false} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:27:36,641 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:36,641 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:36,641 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:27:36,646 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:36,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:36,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-23 12:27:36,668 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:27:36,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:36,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:27:36,761 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:36,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:27:36,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:27:36,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:27:36,762 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2018-11-23 12:27:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:37,920 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-11-23 12:27:37,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:27:37,921 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:27:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:37,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:27:37,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:27:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:27:37,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:27:37,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 106 transitions. [2018-11-23 12:27:38,107 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,109 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:27:38,109 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:27:38,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:27:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:27:38,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 12:27:38,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:38,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 12:27:38,269 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 12:27:38,269 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 12:27:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:38,271 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:27:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:27:38,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:38,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:38,272 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 12:27:38,272 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 12:27:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:38,273 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:27:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:27:38,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:38,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:38,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:38,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:27:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 12:27:38,276 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2018-11-23 12:27:38,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:38,276 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 12:27:38,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:27:38,276 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:27:38,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:27:38,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:38,278 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:38,278 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:38,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:38,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1308787753, now seen corresponding path program 18 times [2018-11-23 12:27:38,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:38,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:38,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:38,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:38,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:38,626 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:27:38,627 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:38,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:38,627 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:27:38,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret12 := main(); {10337#true} is VALID [2018-11-23 12:27:38,628 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:38,629 INFO L273 TraceCheckUtils]: 6: Hoare triple {10339#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:38,629 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:38,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {10340#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:38,630 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:38,630 INFO L273 TraceCheckUtils]: 10: Hoare triple {10341#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:38,631 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:38,631 INFO L273 TraceCheckUtils]: 12: Hoare triple {10342#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:38,632 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:38,632 INFO L273 TraceCheckUtils]: 14: Hoare triple {10343#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:38,633 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:38,634 INFO L273 TraceCheckUtils]: 16: Hoare triple {10344#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:38,634 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:38,635 INFO L273 TraceCheckUtils]: 18: Hoare triple {10345#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:38,636 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:38,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {10346#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:38,639 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:38,641 INFO L273 TraceCheckUtils]: 22: Hoare triple {10347#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:38,641 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:38,641 INFO L273 TraceCheckUtils]: 24: Hoare triple {10348#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:38,642 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:38,642 INFO L273 TraceCheckUtils]: 26: Hoare triple {10349#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:38,643 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:38,643 INFO L273 TraceCheckUtils]: 28: Hoare triple {10350#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:38,643 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:38,644 INFO L273 TraceCheckUtils]: 30: Hoare triple {10351#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:38,647 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:38,647 INFO L273 TraceCheckUtils]: 32: Hoare triple {10352#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:38,647 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:38,648 INFO L273 TraceCheckUtils]: 34: Hoare triple {10353#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:38,648 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:38,649 INFO L273 TraceCheckUtils]: 36: Hoare triple {10354#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:38,649 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:38,649 INFO L273 TraceCheckUtils]: 38: Hoare triple {10355#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:38,650 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:38,650 INFO L273 TraceCheckUtils]: 40: Hoare triple {10356#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:38,650 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:38,651 INFO L273 TraceCheckUtils]: 42: Hoare triple {10357#(<= main_~i~1 18)} assume !(~i~1 < 10000); {10338#false} is VALID [2018-11-23 12:27:38,651 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:38,651 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:38,651 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,651 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:38,652 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,652 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:38,652 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,652 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:38,652 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,653 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:38,653 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,653 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:38,653 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,653 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:38,653 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,654 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:38,654 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 60: Hoare triple {10337#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:38,654 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10338#false} #70#return; {10338#false} is VALID [2018-11-23 12:27:38,654 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:38,654 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:38,654 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:38,655 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,655 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:38,655 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,655 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:38,655 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,655 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:38,655 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,655 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:38,655 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,656 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:38,656 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,656 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:38,656 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,656 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:38,656 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 81: Hoare triple {10337#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:38,656 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10338#false} #72#return; {10338#false} is VALID [2018-11-23 12:27:38,657 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:38,657 INFO L273 TraceCheckUtils]: 85: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:38,657 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:38,657 INFO L273 TraceCheckUtils]: 87: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:38,657 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:38,657 INFO L273 TraceCheckUtils]: 89: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:38,657 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:38,657 INFO L273 TraceCheckUtils]: 91: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:38,658 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:38,658 INFO L273 TraceCheckUtils]: 93: Hoare triple {10338#false} assume !(~i~2 < 9999); {10338#false} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:27:38,658 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:38,658 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:38,658 INFO L273 TraceCheckUtils]: 97: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,658 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:38,658 INFO L273 TraceCheckUtils]: 99: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,658 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:38,659 INFO L273 TraceCheckUtils]: 101: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,659 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:38,659 INFO L273 TraceCheckUtils]: 103: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,659 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:38,659 INFO L273 TraceCheckUtils]: 105: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,659 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:38,659 INFO L273 TraceCheckUtils]: 107: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,659 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:38,660 INFO L273 TraceCheckUtils]: 109: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:38,660 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:38,660 INFO L273 TraceCheckUtils]: 111: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:27:38,660 INFO L273 TraceCheckUtils]: 112: Hoare triple {10337#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:38,660 INFO L273 TraceCheckUtils]: 113: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:38,660 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10337#true} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:27:38,660 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:38,660 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:38,660 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:27:38,667 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:38,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:38,667 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:38,676 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:38,983 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:27:38,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:39,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:39,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:27:39,167 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:39,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:39,167 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:27:39,167 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret12 := main(); {10337#true} is VALID [2018-11-23 12:27:39,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10337#true} is VALID [2018-11-23 12:27:39,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,168 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:39,168 INFO L273 TraceCheckUtils]: 8: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,168 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:39,168 INFO L273 TraceCheckUtils]: 10: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,168 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:39,169 INFO L273 TraceCheckUtils]: 12: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,169 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:39,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,169 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:39,169 INFO L273 TraceCheckUtils]: 16: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,169 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:39,170 INFO L273 TraceCheckUtils]: 18: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,170 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:39,170 INFO L273 TraceCheckUtils]: 20: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,170 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:39,170 INFO L273 TraceCheckUtils]: 22: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,170 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:39,170 INFO L273 TraceCheckUtils]: 24: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,170 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:39,171 INFO L273 TraceCheckUtils]: 26: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,171 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:39,171 INFO L273 TraceCheckUtils]: 28: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,171 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:39,171 INFO L273 TraceCheckUtils]: 30: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,171 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:39,171 INFO L273 TraceCheckUtils]: 32: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,171 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:39,171 INFO L273 TraceCheckUtils]: 34: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,172 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:39,172 INFO L273 TraceCheckUtils]: 36: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,172 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:39,172 INFO L273 TraceCheckUtils]: 38: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,172 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:39,172 INFO L273 TraceCheckUtils]: 40: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:39,172 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:39,173 INFO L273 TraceCheckUtils]: 42: Hoare triple {10337#true} assume !(~i~1 < 10000); {10337#true} is VALID [2018-11-23 12:27:39,173 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:39,173 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:39,173 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:39,173 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:39,173 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:39,174 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:39,174 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:39,174 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:39,174 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:39,174 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:39,174 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:39,174 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:39,175 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:39,175 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:39,175 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:39,175 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:39,175 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:27:39,175 INFO L273 TraceCheckUtils]: 60: Hoare triple {10337#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:39,176 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:39,176 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10337#true} #70#return; {10337#true} is VALID [2018-11-23 12:27:39,176 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:39,176 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:39,176 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:39,176 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:39,177 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:39,177 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:39,177 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:39,177 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:39,177 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:39,177 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:39,177 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:39,177 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:39,177 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:39,178 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:39,178 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:39,178 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:39,178 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:39,178 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:27:39,178 INFO L273 TraceCheckUtils]: 81: Hoare triple {10337#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:39,178 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:39,178 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10337#true} #72#return; {10337#true} is VALID [2018-11-23 12:27:39,180 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:39,180 INFO L273 TraceCheckUtils]: 85: Hoare triple {10613#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:39,181 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:39,181 INFO L273 TraceCheckUtils]: 87: Hoare triple {10620#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:39,182 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:39,182 INFO L273 TraceCheckUtils]: 89: Hoare triple {10627#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:39,186 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:39,186 INFO L273 TraceCheckUtils]: 91: Hoare triple {10634#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:39,186 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:39,187 INFO L273 TraceCheckUtils]: 93: Hoare triple {10641#(<= main_~i~2 4)} assume !(~i~2 < 9999); {10338#false} is VALID [2018-11-23 12:27:39,187 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:27:39,187 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:39,187 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:39,187 INFO L273 TraceCheckUtils]: 97: Hoare triple {10338#false} assume !!(~i~0 < 10000);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:39,187 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:39,188 INFO L273 TraceCheckUtils]: 99: Hoare triple {10338#false} assume !!(~i~0 < 10000);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:39,188 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:39,188 INFO L273 TraceCheckUtils]: 101: Hoare triple {10338#false} assume !!(~i~0 < 10000);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:39,188 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:39,188 INFO L273 TraceCheckUtils]: 103: Hoare triple {10338#false} assume !!(~i~0 < 10000);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:39,188 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:39,188 INFO L273 TraceCheckUtils]: 105: Hoare triple {10338#false} assume !!(~i~0 < 10000);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:39,188 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:39,188 INFO L273 TraceCheckUtils]: 107: Hoare triple {10338#false} assume !!(~i~0 < 10000);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:39,189 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:39,189 INFO L273 TraceCheckUtils]: 109: Hoare triple {10338#false} assume !!(~i~0 < 10000);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:39,189 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:39,189 INFO L273 TraceCheckUtils]: 111: Hoare triple {10338#false} assume !(~i~0 < 10000); {10338#false} is VALID [2018-11-23 12:27:39,189 INFO L273 TraceCheckUtils]: 112: Hoare triple {10338#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {10338#false} is VALID [2018-11-23 12:27:39,189 INFO L273 TraceCheckUtils]: 113: Hoare triple {10338#false} assume true; {10338#false} is VALID [2018-11-23 12:27:39,189 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10338#false} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:27:39,189 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:39,189 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:39,190 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:27:39,195 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:39,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:39,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2018-11-23 12:27:39,217 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:27:39,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:39,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:27:39,304 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:39,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:27:39,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:27:39,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:39,306 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2018-11-23 12:27:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:40,079 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-11-23 12:27:40,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:27:40,080 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:27:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:40,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:27:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:27:40,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 101 transitions. [2018-11-23 12:27:40,317 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:40,319 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:27:40,319 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 12:27:40,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:40,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 12:27:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-23 12:27:40,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:40,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 85 states. [2018-11-23 12:27:40,351 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 85 states. [2018-11-23 12:27:40,351 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 85 states. [2018-11-23 12:27:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:40,354 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:27:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:27:40,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:40,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:40,354 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 87 states. [2018-11-23 12:27:40,355 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 87 states. [2018-11-23 12:27:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:40,356 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:27:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:27:40,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:40,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:40,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:40,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:27:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-23 12:27:40,358 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2018-11-23 12:27:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:40,358 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-23 12:27:40,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:27:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-23 12:27:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 12:27:40,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:40,359 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:40,359 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:40,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:40,360 INFO L82 PathProgramCache]: Analyzing trace with hash -242984311, now seen corresponding path program 19 times [2018-11-23 12:27:40,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:40,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:40,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:40,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:40,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:41,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:27:41,992 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:41,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:41,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:27:41,993 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret12 := main(); {11201#true} is VALID [2018-11-23 12:27:41,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:41,994 INFO L273 TraceCheckUtils]: 6: Hoare triple {11203#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:41,994 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:41,994 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:41,995 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:41,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:41,996 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:41,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:41,996 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:41,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:41,997 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:41,998 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:41,999 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:41,999 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:42,000 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:42,001 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:42,001 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:42,002 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:42,002 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:42,003 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:42,004 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:42,004 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:42,005 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:42,006 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:42,006 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:42,007 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:42,008 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:42,008 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:42,009 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:42,009 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:42,010 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:42,011 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:42,011 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:42,012 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:42,013 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:42,013 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:42,014 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:42,014 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:42,015 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:42,016 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 10000); {11202#false} is VALID [2018-11-23 12:27:42,016 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:42,016 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:42,017 INFO L273 TraceCheckUtils]: 47: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,017 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:42,017 INFO L273 TraceCheckUtils]: 49: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,017 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:42,017 INFO L273 TraceCheckUtils]: 51: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,018 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:42,018 INFO L273 TraceCheckUtils]: 53: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,018 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:42,018 INFO L273 TraceCheckUtils]: 55: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,018 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:42,019 INFO L273 TraceCheckUtils]: 57: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,019 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:42,019 INFO L273 TraceCheckUtils]: 59: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,019 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:42,019 INFO L273 TraceCheckUtils]: 61: Hoare triple {11201#true} assume !(~i~0 < 10000); {11201#true} is VALID [2018-11-23 12:27:42,020 INFO L273 TraceCheckUtils]: 62: Hoare triple {11201#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:27:42,020 INFO L273 TraceCheckUtils]: 63: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:42,020 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11201#true} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:27:42,020 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:42,020 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:42,021 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:42,021 INFO L273 TraceCheckUtils]: 68: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,021 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:42,021 INFO L273 TraceCheckUtils]: 70: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,021 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:42,021 INFO L273 TraceCheckUtils]: 72: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,021 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:42,021 INFO L273 TraceCheckUtils]: 74: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,021 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:42,022 INFO L273 TraceCheckUtils]: 76: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,022 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:42,022 INFO L273 TraceCheckUtils]: 78: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,022 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:42,022 INFO L273 TraceCheckUtils]: 80: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,022 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:42,022 INFO L273 TraceCheckUtils]: 82: Hoare triple {11201#true} assume !(~i~0 < 10000); {11201#true} is VALID [2018-11-23 12:27:42,022 INFO L273 TraceCheckUtils]: 83: Hoare triple {11201#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:27:42,023 INFO L273 TraceCheckUtils]: 84: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:42,023 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11201#true} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:27:42,023 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:42,023 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:42,023 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:42,023 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:42,023 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:42,023 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:42,023 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:42,024 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:42,024 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:42,024 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:42,024 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:42,024 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 9999); {11202#false} is VALID [2018-11-23 12:27:42,024 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:27:42,024 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:42,024 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:42,024 INFO L273 TraceCheckUtils]: 101: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,025 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:42,025 INFO L273 TraceCheckUtils]: 103: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,025 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:42,025 INFO L273 TraceCheckUtils]: 105: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,025 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:42,025 INFO L273 TraceCheckUtils]: 107: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,025 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:42,025 INFO L273 TraceCheckUtils]: 109: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,025 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:42,026 INFO L273 TraceCheckUtils]: 111: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,026 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:42,026 INFO L273 TraceCheckUtils]: 113: Hoare triple {11201#true} assume !!(~i~0 < 10000);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:42,026 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:42,026 INFO L273 TraceCheckUtils]: 115: Hoare triple {11201#true} assume !(~i~0 < 10000); {11201#true} is VALID [2018-11-23 12:27:42,026 INFO L273 TraceCheckUtils]: 116: Hoare triple {11201#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:27:42,026 INFO L273 TraceCheckUtils]: 117: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:42,026 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11201#true} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:27:42,027 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:42,027 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:42,027 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:27:42,033 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:42,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:42,034 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:42,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:42,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:42,424 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:27:42,424 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:42,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:42,425 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:27:42,425 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret12 := main(); {11201#true} is VALID [2018-11-23 12:27:42,426 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:42,426 INFO L273 TraceCheckUtils]: 6: Hoare triple {11241#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:42,427 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:42,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:42,428 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:42,428 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:42,428 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:42,429 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:42,429 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:42,429 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:42,430 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:42,431 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:42,431 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:42,432 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:42,433 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:42,433 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:42,434 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:42,434 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:42,435 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:42,436 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:42,436 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:42,437 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:42,438 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:42,438 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:42,439 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:42,440 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:42,440 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:42,441 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:42,442 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:42,442 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:42,443 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:42,443 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:42,444 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:42,445 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:42,445 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:42,446 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:42,447 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:42,447 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:42,448 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:42,449 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 10000); {11202#false} is VALID [2018-11-23 12:27:42,449 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:42,449 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:42,449 INFO L273 TraceCheckUtils]: 47: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,450 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:42,450 INFO L273 TraceCheckUtils]: 49: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,450 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:42,450 INFO L273 TraceCheckUtils]: 51: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,450 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:42,451 INFO L273 TraceCheckUtils]: 53: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,451 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:42,451 INFO L273 TraceCheckUtils]: 55: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,451 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:42,451 INFO L273 TraceCheckUtils]: 57: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,451 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:42,452 INFO L273 TraceCheckUtils]: 59: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,452 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:42,452 INFO L273 TraceCheckUtils]: 61: Hoare triple {11202#false} assume !(~i~0 < 10000); {11202#false} is VALID [2018-11-23 12:27:42,452 INFO L273 TraceCheckUtils]: 62: Hoare triple {11202#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:27:42,452 INFO L273 TraceCheckUtils]: 63: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:27:42,452 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11202#false} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:27:42,452 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:42,452 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:42,453 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:42,453 INFO L273 TraceCheckUtils]: 68: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,453 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:42,453 INFO L273 TraceCheckUtils]: 70: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,453 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:42,453 INFO L273 TraceCheckUtils]: 72: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,453 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:42,453 INFO L273 TraceCheckUtils]: 74: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,453 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:42,454 INFO L273 TraceCheckUtils]: 76: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,454 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:42,454 INFO L273 TraceCheckUtils]: 78: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,454 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:42,454 INFO L273 TraceCheckUtils]: 80: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,454 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:42,454 INFO L273 TraceCheckUtils]: 82: Hoare triple {11202#false} assume !(~i~0 < 10000); {11202#false} is VALID [2018-11-23 12:27:42,454 INFO L273 TraceCheckUtils]: 83: Hoare triple {11202#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:27:42,454 INFO L273 TraceCheckUtils]: 84: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:27:42,455 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11202#false} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:27:42,455 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:42,455 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:42,455 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:42,455 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:42,455 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:42,455 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:42,455 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:42,455 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:42,456 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:42,456 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:42,456 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:42,456 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 9999); {11202#false} is VALID [2018-11-23 12:27:42,456 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:27:42,456 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:42,456 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:42,456 INFO L273 TraceCheckUtils]: 101: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,457 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:42,457 INFO L273 TraceCheckUtils]: 103: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,457 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:42,457 INFO L273 TraceCheckUtils]: 105: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,457 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:42,457 INFO L273 TraceCheckUtils]: 107: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,457 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:42,457 INFO L273 TraceCheckUtils]: 109: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,457 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:42,458 INFO L273 TraceCheckUtils]: 111: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,458 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:42,458 INFO L273 TraceCheckUtils]: 113: Hoare triple {11202#false} assume !!(~i~0 < 10000);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:42,458 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:42,458 INFO L273 TraceCheckUtils]: 115: Hoare triple {11202#false} assume !(~i~0 < 10000); {11202#false} is VALID [2018-11-23 12:27:42,458 INFO L273 TraceCheckUtils]: 116: Hoare triple {11202#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:27:42,458 INFO L273 TraceCheckUtils]: 117: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:27:42,458 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11202#false} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:27:42,458 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:42,459 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:42,459 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:27:42,465 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:42,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:42,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:27:42,485 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:27:42,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:42,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:27:42,564 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:42,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:27:42,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:27:42,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:27:42,565 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2018-11-23 12:27:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:43,337 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-23 12:27:43,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:27:43,338 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:27:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:27:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:27:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:27:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:27:43,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 92 transitions. [2018-11-23 12:27:43,472 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:43,474 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:27:43,474 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:27:43,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:27:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:27:43,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 12:27:43,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:43,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 12:27:43,538 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 12:27:43,539 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 12:27:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:43,541 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:27:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:27:43,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:43,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:43,542 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 12:27:43,542 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 12:27:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:43,544 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:27:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:27:43,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:43,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:43,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:43,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:27:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-23 12:27:43,547 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2018-11-23 12:27:43,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:43,547 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-23 12:27:43,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:27:43,548 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:27:43,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:27:43,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:43,549 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:43,549 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:43,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:43,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1110011285, now seen corresponding path program 20 times [2018-11-23 12:27:43,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:43,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:43,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:43,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:43,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:44,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:27:44,331 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:44,331 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:44,331 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:27:44,332 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret12 := main(); {12084#true} is VALID [2018-11-23 12:27:44,332 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:44,333 INFO L273 TraceCheckUtils]: 6: Hoare triple {12086#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:44,333 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:44,334 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:44,334 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:44,334 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:44,335 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:44,335 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:44,336 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:44,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:44,337 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:44,338 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:44,338 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:44,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:44,340 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:44,340 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:44,341 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:44,342 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:44,342 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:44,343 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:44,344 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:44,344 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:44,345 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:44,345 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:44,346 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:44,347 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:44,348 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:44,348 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:44,349 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:44,349 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:44,350 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:44,351 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:44,351 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:44,352 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:44,353 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:44,353 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:44,354 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:44,354 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:44,355 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:44,356 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:44,356 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:44,357 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 10000); {12085#false} is VALID [2018-11-23 12:27:44,357 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:44,358 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:44,358 INFO L273 TraceCheckUtils]: 49: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,358 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:44,358 INFO L273 TraceCheckUtils]: 51: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,358 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:44,359 INFO L273 TraceCheckUtils]: 53: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,359 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:44,359 INFO L273 TraceCheckUtils]: 55: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,359 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:44,359 INFO L273 TraceCheckUtils]: 57: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,360 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:44,360 INFO L273 TraceCheckUtils]: 59: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,360 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:44,360 INFO L273 TraceCheckUtils]: 61: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,360 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:44,361 INFO L273 TraceCheckUtils]: 63: Hoare triple {12084#true} assume !(~i~0 < 10000); {12084#true} is VALID [2018-11-23 12:27:44,361 INFO L273 TraceCheckUtils]: 64: Hoare triple {12084#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:27:44,361 INFO L273 TraceCheckUtils]: 65: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:44,361 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12084#true} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:27:44,361 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:44,361 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:44,361 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:44,362 INFO L273 TraceCheckUtils]: 70: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,362 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:44,362 INFO L273 TraceCheckUtils]: 72: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,362 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:44,362 INFO L273 TraceCheckUtils]: 74: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,362 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:44,362 INFO L273 TraceCheckUtils]: 76: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,362 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:44,363 INFO L273 TraceCheckUtils]: 78: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,363 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:44,363 INFO L273 TraceCheckUtils]: 80: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,363 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:44,363 INFO L273 TraceCheckUtils]: 82: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,363 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:44,364 INFO L273 TraceCheckUtils]: 84: Hoare triple {12084#true} assume !(~i~0 < 10000); {12084#true} is VALID [2018-11-23 12:27:44,364 INFO L273 TraceCheckUtils]: 85: Hoare triple {12084#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:27:44,364 INFO L273 TraceCheckUtils]: 86: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:44,364 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12084#true} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:27:44,364 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:44,364 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:44,365 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:44,365 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:44,365 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:44,365 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:44,365 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:44,365 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:44,366 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:44,366 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:44,366 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:44,366 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 9999); {12085#false} is VALID [2018-11-23 12:27:44,366 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:27:44,367 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:44,367 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:44,367 INFO L273 TraceCheckUtils]: 103: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,367 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:44,367 INFO L273 TraceCheckUtils]: 105: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,367 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:44,368 INFO L273 TraceCheckUtils]: 107: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,368 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:44,368 INFO L273 TraceCheckUtils]: 109: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,368 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:44,368 INFO L273 TraceCheckUtils]: 111: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,368 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:44,369 INFO L273 TraceCheckUtils]: 113: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,369 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:44,369 INFO L273 TraceCheckUtils]: 115: Hoare triple {12084#true} assume !!(~i~0 < 10000);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:44,369 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:44,369 INFO L273 TraceCheckUtils]: 117: Hoare triple {12084#true} assume !(~i~0 < 10000); {12084#true} is VALID [2018-11-23 12:27:44,369 INFO L273 TraceCheckUtils]: 118: Hoare triple {12084#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:27:44,370 INFO L273 TraceCheckUtils]: 119: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:44,370 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12084#true} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:27:44,370 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:44,370 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:44,370 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:27:44,379 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:44,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:44,380 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:44,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:44,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:44,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:44,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:44,705 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:27:44,706 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:44,706 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:44,706 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:27:44,706 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret12 := main(); {12084#true} is VALID [2018-11-23 12:27:44,707 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:44,708 INFO L273 TraceCheckUtils]: 6: Hoare triple {12125#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:44,708 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:44,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:44,709 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:44,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:44,710 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:44,710 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:44,711 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:44,712 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:44,712 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:44,713 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:44,714 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:44,714 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:44,715 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:44,715 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:44,716 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:44,717 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:44,717 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:44,718 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:44,719 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:44,719 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:44,720 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:44,721 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:44,721 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:44,722 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:44,723 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:44,723 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:44,724 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:44,724 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:44,725 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:44,726 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:44,726 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:44,727 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:44,728 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:44,728 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:44,729 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:44,729 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:44,730 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:44,731 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:44,731 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:44,732 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 10000); {12085#false} is VALID [2018-11-23 12:27:44,732 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:44,733 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:44,733 INFO L273 TraceCheckUtils]: 49: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,733 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:44,733 INFO L273 TraceCheckUtils]: 51: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,733 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:44,734 INFO L273 TraceCheckUtils]: 53: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,734 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:44,734 INFO L273 TraceCheckUtils]: 55: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,734 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:44,734 INFO L273 TraceCheckUtils]: 57: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,735 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:44,735 INFO L273 TraceCheckUtils]: 59: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,735 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:44,735 INFO L273 TraceCheckUtils]: 61: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,735 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:44,735 INFO L273 TraceCheckUtils]: 63: Hoare triple {12085#false} assume !(~i~0 < 10000); {12085#false} is VALID [2018-11-23 12:27:44,735 INFO L273 TraceCheckUtils]: 64: Hoare triple {12085#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:27:44,735 INFO L273 TraceCheckUtils]: 65: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:27:44,736 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12085#false} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:27:44,736 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:44,736 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:44,736 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:44,736 INFO L273 TraceCheckUtils]: 70: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,736 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:44,736 INFO L273 TraceCheckUtils]: 72: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,736 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:44,736 INFO L273 TraceCheckUtils]: 74: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,737 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:44,737 INFO L273 TraceCheckUtils]: 76: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,737 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:44,737 INFO L273 TraceCheckUtils]: 78: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,737 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:44,737 INFO L273 TraceCheckUtils]: 80: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,737 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:44,737 INFO L273 TraceCheckUtils]: 82: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,737 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:44,738 INFO L273 TraceCheckUtils]: 84: Hoare triple {12085#false} assume !(~i~0 < 10000); {12085#false} is VALID [2018-11-23 12:27:44,738 INFO L273 TraceCheckUtils]: 85: Hoare triple {12085#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:27:44,738 INFO L273 TraceCheckUtils]: 86: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:27:44,738 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12085#false} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:27:44,738 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:44,738 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:44,738 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:44,738 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:44,738 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:44,739 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:44,739 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:44,739 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:44,739 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:44,739 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:44,739 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:44,739 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 9999); {12085#false} is VALID [2018-11-23 12:27:44,739 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:27:44,739 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:44,740 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:44,740 INFO L273 TraceCheckUtils]: 103: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,740 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:44,740 INFO L273 TraceCheckUtils]: 105: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,740 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:44,740 INFO L273 TraceCheckUtils]: 107: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,740 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:44,740 INFO L273 TraceCheckUtils]: 109: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,740 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:44,741 INFO L273 TraceCheckUtils]: 111: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,741 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:44,741 INFO L273 TraceCheckUtils]: 113: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,741 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:44,741 INFO L273 TraceCheckUtils]: 115: Hoare triple {12085#false} assume !!(~i~0 < 10000);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:44,741 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:44,741 INFO L273 TraceCheckUtils]: 117: Hoare triple {12085#false} assume !(~i~0 < 10000); {12085#false} is VALID [2018-11-23 12:27:44,741 INFO L273 TraceCheckUtils]: 118: Hoare triple {12085#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:27:44,741 INFO L273 TraceCheckUtils]: 119: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:27:44,742 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12085#false} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:27:44,742 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:44,742 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:44,742 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:27:44,749 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:44,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:44,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:27:44,769 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:27:44,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:44,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:27:44,850 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:44,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:27:44,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:27:44,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:44,852 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2018-11-23 12:27:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:45,255 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-23 12:27:45,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:27:45,255 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:27:45,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:27:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:45,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:27:45,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 94 transitions. [2018-11-23 12:27:45,396 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:45,398 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:27:45,400 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:27:45,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:27:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 12:27:45,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:45,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 12:27:45,433 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 12:27:45,433 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 12:27:45,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:45,435 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:27:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:27:45,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:45,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:45,435 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 12:27:45,436 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 12:27:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:45,437 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:27:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:27:45,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:45,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:45,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:45,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:27:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-23 12:27:45,440 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-23 12:27:45,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:45,440 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-23 12:27:45,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:27:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-23 12:27:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:27:45,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:45,442 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:45,442 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:45,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:45,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1099277875, now seen corresponding path program 21 times [2018-11-23 12:27:45,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:45,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:45,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:45,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:45,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:45,840 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:27:45,840 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:45,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:45,841 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:27:45,841 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret12 := main(); {12984#true} is VALID [2018-11-23 12:27:45,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:45,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {12986#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:45,890 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:45,903 INFO L273 TraceCheckUtils]: 8: Hoare triple {12987#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:45,917 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:45,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {12988#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:45,935 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:45,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {12989#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:45,964 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:45,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {12990#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:45,987 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:45,999 INFO L273 TraceCheckUtils]: 16: Hoare triple {12991#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:46,012 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:46,025 INFO L273 TraceCheckUtils]: 18: Hoare triple {12992#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:46,042 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:46,051 INFO L273 TraceCheckUtils]: 20: Hoare triple {12993#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:46,065 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:46,074 INFO L273 TraceCheckUtils]: 22: Hoare triple {12994#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:46,086 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:46,104 INFO L273 TraceCheckUtils]: 24: Hoare triple {12995#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:46,113 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:46,126 INFO L273 TraceCheckUtils]: 26: Hoare triple {12996#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:46,138 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:46,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {12997#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:46,153 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:46,155 INFO L273 TraceCheckUtils]: 30: Hoare triple {12998#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:46,155 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:46,157 INFO L273 TraceCheckUtils]: 32: Hoare triple {12999#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:46,157 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:46,159 INFO L273 TraceCheckUtils]: 34: Hoare triple {13000#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:46,159 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:46,161 INFO L273 TraceCheckUtils]: 36: Hoare triple {13001#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:46,161 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:46,161 INFO L273 TraceCheckUtils]: 38: Hoare triple {13002#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:46,162 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:46,162 INFO L273 TraceCheckUtils]: 40: Hoare triple {13003#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:46,163 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:46,163 INFO L273 TraceCheckUtils]: 42: Hoare triple {13004#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:46,163 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:46,164 INFO L273 TraceCheckUtils]: 44: Hoare triple {13005#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:46,164 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:46,164 INFO L273 TraceCheckUtils]: 46: Hoare triple {13006#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:46,165 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:46,166 INFO L273 TraceCheckUtils]: 48: Hoare triple {13007#(<= main_~i~1 21)} assume !(~i~1 < 10000); {12985#false} is VALID [2018-11-23 12:27:46,166 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:46,166 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:46,166 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,167 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:46,167 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,167 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:46,167 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,167 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:46,168 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,168 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:46,168 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,168 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:46,168 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,168 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:46,169 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,169 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:46,169 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 10000); {12984#true} is VALID [2018-11-23 12:27:46,169 INFO L273 TraceCheckUtils]: 66: Hoare triple {12984#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:27:46,169 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:46,170 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12985#false} #70#return; {12985#false} is VALID [2018-11-23 12:27:46,170 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:46,170 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:46,170 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:46,170 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,173 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:46,173 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,173 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:46,173 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,173 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:46,173 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,174 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:46,174 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,174 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:46,174 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,174 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:46,174 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,175 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:46,175 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 10000); {12984#true} is VALID [2018-11-23 12:27:46,175 INFO L273 TraceCheckUtils]: 87: Hoare triple {12984#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:27:46,175 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:46,175 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12985#false} #72#return; {12985#false} is VALID [2018-11-23 12:27:46,175 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:46,175 INFO L273 TraceCheckUtils]: 91: Hoare triple {12985#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:46,175 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:46,175 INFO L273 TraceCheckUtils]: 93: Hoare triple {12985#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:46,176 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:46,176 INFO L273 TraceCheckUtils]: 95: Hoare triple {12985#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:46,176 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:46,176 INFO L273 TraceCheckUtils]: 97: Hoare triple {12985#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:46,176 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:46,176 INFO L273 TraceCheckUtils]: 99: Hoare triple {12985#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:46,176 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:46,176 INFO L273 TraceCheckUtils]: 101: Hoare triple {12985#false} assume !(~i~2 < 9999); {12985#false} is VALID [2018-11-23 12:27:46,176 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:27:46,177 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:46,177 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:46,177 INFO L273 TraceCheckUtils]: 105: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,177 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:46,177 INFO L273 TraceCheckUtils]: 107: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,177 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:46,177 INFO L273 TraceCheckUtils]: 109: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,177 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:46,177 INFO L273 TraceCheckUtils]: 111: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,178 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:46,178 INFO L273 TraceCheckUtils]: 113: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,178 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:46,178 INFO L273 TraceCheckUtils]: 115: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,178 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:46,178 INFO L273 TraceCheckUtils]: 117: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,178 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:46,178 INFO L273 TraceCheckUtils]: 119: Hoare triple {12984#true} assume !(~i~0 < 10000); {12984#true} is VALID [2018-11-23 12:27:46,178 INFO L273 TraceCheckUtils]: 120: Hoare triple {12984#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:27:46,179 INFO L273 TraceCheckUtils]: 121: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:46,179 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12984#true} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:27:46,179 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:46,179 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:46,179 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:27:46,186 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:46,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:46,186 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:46,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:46,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:27:46,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:46,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:46,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:27:46,469 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:46,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:46,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:27:46,469 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret12 := main(); {12984#true} is VALID [2018-11-23 12:27:46,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12984#true} is VALID [2018-11-23 12:27:46,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,470 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:46,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,470 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:46,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,470 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:46,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,470 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:46,470 INFO L273 TraceCheckUtils]: 14: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,470 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:46,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,471 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:46,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,471 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:46,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,471 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:46,471 INFO L273 TraceCheckUtils]: 22: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,471 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:46,471 INFO L273 TraceCheckUtils]: 24: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,471 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:46,472 INFO L273 TraceCheckUtils]: 26: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,472 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:46,472 INFO L273 TraceCheckUtils]: 28: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,472 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:46,472 INFO L273 TraceCheckUtils]: 30: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,472 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:46,473 INFO L273 TraceCheckUtils]: 32: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,473 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:46,473 INFO L273 TraceCheckUtils]: 34: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,473 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:46,473 INFO L273 TraceCheckUtils]: 36: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,473 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:46,474 INFO L273 TraceCheckUtils]: 38: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,474 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:46,474 INFO L273 TraceCheckUtils]: 40: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,474 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:46,474 INFO L273 TraceCheckUtils]: 42: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,474 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:46,475 INFO L273 TraceCheckUtils]: 44: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,475 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:46,475 INFO L273 TraceCheckUtils]: 46: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -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:46,475 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:46,475 INFO L273 TraceCheckUtils]: 48: Hoare triple {12984#true} assume !(~i~1 < 10000); {12984#true} is VALID [2018-11-23 12:27:46,475 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:46,475 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:46,476 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,476 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:46,476 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,476 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:46,476 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,476 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:46,476 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,476 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:46,476 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,477 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:46,477 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,477 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:46,477 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,477 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:46,477 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 10000); {12984#true} is VALID [2018-11-23 12:27:46,477 INFO L273 TraceCheckUtils]: 66: Hoare triple {12984#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:27:46,477 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:46,477 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12984#true} #70#return; {12984#true} is VALID [2018-11-23 12:27:46,478 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:46,478 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:46,478 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:46,478 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,478 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:46,478 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,478 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:46,478 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,479 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:46,479 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,479 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:46,479 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,479 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:46,479 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,480 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:46,480 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 10000);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:46,480 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:46,480 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 10000); {12984#true} is VALID [2018-11-23 12:27:46,480 INFO L273 TraceCheckUtils]: 87: Hoare triple {12984#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:27:46,480 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:46,481 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12984#true} #72#return; {12984#true} is VALID [2018-11-23 12:27:46,483 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:46,484 INFO L273 TraceCheckUtils]: 91: Hoare triple {13281#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:46,487 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:46,489 INFO L273 TraceCheckUtils]: 93: Hoare triple {13288#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:46,489 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:46,491 INFO L273 TraceCheckUtils]: 95: Hoare triple {13295#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:46,491 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:46,493 INFO L273 TraceCheckUtils]: 97: Hoare triple {13302#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:46,493 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:46,493 INFO L273 TraceCheckUtils]: 99: Hoare triple {13309#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:46,494 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:46,494 INFO L273 TraceCheckUtils]: 101: Hoare triple {13316#(<= main_~i~2 5)} assume !(~i~2 < 9999); {12985#false} is VALID [2018-11-23 12:27:46,494 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:27:46,494 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:46,495 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:46,495 INFO L273 TraceCheckUtils]: 105: Hoare triple {12985#false} assume !!(~i~0 < 10000);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:46,495 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:46,495 INFO L273 TraceCheckUtils]: 107: Hoare triple {12985#false} assume !!(~i~0 < 10000);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:46,495 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:46,495 INFO L273 TraceCheckUtils]: 109: Hoare triple {12985#false} assume !!(~i~0 < 10000);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:46,495 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:46,495 INFO L273 TraceCheckUtils]: 111: Hoare triple {12985#false} assume !!(~i~0 < 10000);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:46,495 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:46,496 INFO L273 TraceCheckUtils]: 113: Hoare triple {12985#false} assume !!(~i~0 < 10000);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:46,496 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:46,496 INFO L273 TraceCheckUtils]: 115: Hoare triple {12985#false} assume !!(~i~0 < 10000);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:46,496 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:46,496 INFO L273 TraceCheckUtils]: 117: Hoare triple {12985#false} assume !!(~i~0 < 10000);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:46,496 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:46,496 INFO L273 TraceCheckUtils]: 119: Hoare triple {12985#false} assume !(~i~0 < 10000); {12985#false} is VALID [2018-11-23 12:27:46,496 INFO L273 TraceCheckUtils]: 120: Hoare triple {12985#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {12985#false} is VALID [2018-11-23 12:27:46,496 INFO L273 TraceCheckUtils]: 121: Hoare triple {12985#false} assume true; {12985#false} is VALID [2018-11-23 12:27:46,497 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12985#false} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:27:46,497 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:46,497 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:46,497 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:27:46,503 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:46,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:46,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2018-11-23 12:27:46,523 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:27:46,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:46,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:27:46,632 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:46,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:27:46,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:27:46,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:27:46,634 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2018-11-23 12:27:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:47,258 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-11-23 12:27:47,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:27:47,259 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:27:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:27:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:27:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:27:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:27:47,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 109 transitions. [2018-11-23 12:27:47,369 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:47,371 INFO L225 Difference]: With dead ends: 135 [2018-11-23 12:27:47,371 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:27:47,372 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:47,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:27:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-23 12:27:47,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:47,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 93 states. [2018-11-23 12:27:47,421 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 93 states. [2018-11-23 12:27:47,421 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 93 states. [2018-11-23 12:27:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:47,423 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:27:47,423 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:27:47,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:47,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:47,424 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 95 states. [2018-11-23 12:27:47,424 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 95 states. [2018-11-23 12:27:47,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:47,425 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:27:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:27:47,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:47,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:47,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:47,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 12:27:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-11-23 12:27:47,428 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2018-11-23 12:27:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:47,428 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-11-23 12:27:47,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:27:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-23 12:27:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:27:47,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:47,429 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:47,430 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:47,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1514657069, now seen corresponding path program 22 times [2018-11-23 12:27:47,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:47,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:47,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:47,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:47,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:48,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:27:48,007 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:48,007 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:48,007 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:27:48,008 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret12 := main(); {13919#true} is VALID [2018-11-23 12:27:48,011 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:48,012 INFO L273 TraceCheckUtils]: 6: Hoare triple {13921#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:48,012 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:48,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:48,013 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:48,013 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:48,014 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:48,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:48,015 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:48,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:48,016 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:48,016 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:48,017 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:48,018 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:48,018 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:48,019 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:48,020 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:48,020 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:48,021 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:48,022 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:48,022 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:48,023 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:48,023 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:48,024 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:48,025 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:48,025 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:48,026 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:48,027 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:48,027 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:48,028 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:48,029 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:48,029 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:48,030 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:48,030 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:48,031 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:48,032 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:48,032 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:48,033 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:48,034 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:48,034 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:48,035 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:48,035 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:48,036 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:48,037 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:48,037 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:48,038 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 10000); {13920#false} is VALID [2018-11-23 12:27:48,038 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:48,039 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:48,039 INFO L273 TraceCheckUtils]: 53: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,039 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:48,039 INFO L273 TraceCheckUtils]: 55: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,039 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:48,040 INFO L273 TraceCheckUtils]: 57: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,040 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:48,040 INFO L273 TraceCheckUtils]: 59: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,040 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:48,040 INFO L273 TraceCheckUtils]: 61: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,040 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:48,041 INFO L273 TraceCheckUtils]: 63: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,041 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:48,041 INFO L273 TraceCheckUtils]: 65: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,041 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:48,041 INFO L273 TraceCheckUtils]: 67: Hoare triple {13919#true} assume !(~i~0 < 10000); {13919#true} is VALID [2018-11-23 12:27:48,041 INFO L273 TraceCheckUtils]: 68: Hoare triple {13919#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:27:48,041 INFO L273 TraceCheckUtils]: 69: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:48,042 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13919#true} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:27:48,042 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:48,042 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:48,042 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:48,042 INFO L273 TraceCheckUtils]: 74: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,042 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:48,042 INFO L273 TraceCheckUtils]: 76: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,042 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:48,042 INFO L273 TraceCheckUtils]: 78: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,043 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:48,043 INFO L273 TraceCheckUtils]: 80: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,043 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:48,043 INFO L273 TraceCheckUtils]: 82: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,043 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:48,043 INFO L273 TraceCheckUtils]: 84: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,043 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:48,043 INFO L273 TraceCheckUtils]: 86: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,043 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:48,044 INFO L273 TraceCheckUtils]: 88: Hoare triple {13919#true} assume !(~i~0 < 10000); {13919#true} is VALID [2018-11-23 12:27:48,044 INFO L273 TraceCheckUtils]: 89: Hoare triple {13919#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:27:48,044 INFO L273 TraceCheckUtils]: 90: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:48,044 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13919#true} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:27:48,044 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:48,044 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:48,044 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:48,044 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:48,044 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:48,045 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:48,045 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:48,045 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:48,045 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:48,045 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:48,045 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:48,045 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:48,045 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:48,045 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 9999); {13920#false} is VALID [2018-11-23 12:27:48,045 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:27:48,046 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:48,046 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:48,046 INFO L273 TraceCheckUtils]: 109: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,046 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:48,046 INFO L273 TraceCheckUtils]: 111: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,046 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:48,046 INFO L273 TraceCheckUtils]: 113: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,047 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:48,047 INFO L273 TraceCheckUtils]: 115: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,047 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:48,047 INFO L273 TraceCheckUtils]: 117: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,047 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:48,047 INFO L273 TraceCheckUtils]: 119: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,047 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:48,048 INFO L273 TraceCheckUtils]: 121: Hoare triple {13919#true} assume !!(~i~0 < 10000);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:48,048 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:48,048 INFO L273 TraceCheckUtils]: 123: Hoare triple {13919#true} assume !(~i~0 < 10000); {13919#true} is VALID [2018-11-23 12:27:48,048 INFO L273 TraceCheckUtils]: 124: Hoare triple {13919#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:27:48,048 INFO L273 TraceCheckUtils]: 125: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:48,048 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13919#true} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:27:48,049 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:48,049 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:48,049 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:27:48,057 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:48,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:48,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 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:48,066 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:48,134 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:48,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:48,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:48,672 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:27:48,673 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:48,673 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:48,673 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:27:48,673 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret12 := main(); {13919#true} is VALID [2018-11-23 12:27:48,674 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:48,674 INFO L273 TraceCheckUtils]: 6: Hoare triple {13962#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:48,675 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:48,676 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:48,676 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:48,676 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:48,677 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:48,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:48,678 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:48,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:48,679 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:48,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:48,680 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:48,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:48,681 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:48,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:48,682 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:48,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:48,683 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:48,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:48,685 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:48,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:48,686 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:48,686 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:48,687 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:48,688 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:48,688 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:48,689 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:48,689 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:48,690 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:48,691 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:48,691 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:48,692 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:48,692 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:48,693 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:48,693 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:48,694 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:48,695 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:48,695 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:48,696 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:48,696 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:48,697 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:48,698 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:48,698 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:48,699 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:48,699 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 10000); {13920#false} is VALID [2018-11-23 12:27:48,700 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:48,700 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:48,700 INFO L273 TraceCheckUtils]: 53: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,700 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:48,700 INFO L273 TraceCheckUtils]: 55: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,701 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:48,701 INFO L273 TraceCheckUtils]: 57: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,701 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:48,701 INFO L273 TraceCheckUtils]: 59: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,701 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:48,701 INFO L273 TraceCheckUtils]: 61: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,702 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:48,702 INFO L273 TraceCheckUtils]: 63: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,702 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:48,702 INFO L273 TraceCheckUtils]: 65: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,702 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:48,702 INFO L273 TraceCheckUtils]: 67: Hoare triple {13920#false} assume !(~i~0 < 10000); {13920#false} is VALID [2018-11-23 12:27:48,703 INFO L273 TraceCheckUtils]: 68: Hoare triple {13920#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:27:48,703 INFO L273 TraceCheckUtils]: 69: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:27:48,703 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13920#false} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:27:48,703 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:48,703 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:48,703 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:48,704 INFO L273 TraceCheckUtils]: 74: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,704 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:48,704 INFO L273 TraceCheckUtils]: 76: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,704 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:48,704 INFO L273 TraceCheckUtils]: 78: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,704 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:48,704 INFO L273 TraceCheckUtils]: 80: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,704 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:48,704 INFO L273 TraceCheckUtils]: 82: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,704 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:48,705 INFO L273 TraceCheckUtils]: 84: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,705 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:48,705 INFO L273 TraceCheckUtils]: 86: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,705 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:48,705 INFO L273 TraceCheckUtils]: 88: Hoare triple {13920#false} assume !(~i~0 < 10000); {13920#false} is VALID [2018-11-23 12:27:48,705 INFO L273 TraceCheckUtils]: 89: Hoare triple {13920#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:27:48,705 INFO L273 TraceCheckUtils]: 90: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:27:48,705 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13920#false} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:27:48,705 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:48,706 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:48,706 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:48,706 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:48,706 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:48,706 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:48,706 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:48,706 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:48,706 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:48,706 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:48,707 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:48,707 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:48,707 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:48,707 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 9999); {13920#false} is VALID [2018-11-23 12:27:48,707 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:27:48,707 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:48,707 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:48,707 INFO L273 TraceCheckUtils]: 109: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,707 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:48,708 INFO L273 TraceCheckUtils]: 111: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,708 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:48,708 INFO L273 TraceCheckUtils]: 113: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,708 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:48,708 INFO L273 TraceCheckUtils]: 115: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,708 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:48,708 INFO L273 TraceCheckUtils]: 117: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,708 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:48,708 INFO L273 TraceCheckUtils]: 119: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,708 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:48,709 INFO L273 TraceCheckUtils]: 121: Hoare triple {13920#false} assume !!(~i~0 < 10000);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:48,709 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:48,709 INFO L273 TraceCheckUtils]: 123: Hoare triple {13920#false} assume !(~i~0 < 10000); {13920#false} is VALID [2018-11-23 12:27:48,709 INFO L273 TraceCheckUtils]: 124: Hoare triple {13920#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:27:48,709 INFO L273 TraceCheckUtils]: 125: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:27:48,709 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13920#false} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:27:48,709 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:48,709 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:48,709 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:27:48,717 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:48,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:48,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:27:48,737 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:27:48,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:48,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:27:48,821 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:48,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:27:48,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:27:48,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:48,822 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2018-11-23 12:27:49,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:49,802 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 12:27:49,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:27:49,803 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:27:49,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:27:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:27:49,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 98 transitions. [2018-11-23 12:27:49,895 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:49,897 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:27:49,897 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:27:49,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:49,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:27:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-23 12:27:49,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:49,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-23 12:27:49,939 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-23 12:27:49,940 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-23 12:27:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:49,942 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:27:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:27:49,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:49,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:49,943 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-23 12:27:49,943 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-23 12:27:49,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:49,945 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:27:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:27:49,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:49,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:49,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:49,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:27:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-23 12:27:49,948 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2018-11-23 12:27:49,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:49,948 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-23 12:27:49,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:27:49,948 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:27:49,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 12:27:49,949 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:49,949 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:49,950 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:49,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:49,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1289554703, now seen corresponding path program 23 times [2018-11-23 12:27:49,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:49,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:49,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:49,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:49,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:51,010 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:27:51,010 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:51,010 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:27:51,011 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:27:51,011 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret12 := main(); {14872#true} is VALID [2018-11-23 12:27:51,014 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:51,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {14874#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:51,015 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:51,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {14875#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:51,016 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:51,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {14876#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:51,017 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:51,017 INFO L273 TraceCheckUtils]: 12: Hoare triple {14877#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:51,018 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:51,018 INFO L273 TraceCheckUtils]: 14: Hoare triple {14878#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:51,019 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:51,019 INFO L273 TraceCheckUtils]: 16: Hoare triple {14879#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:51,020 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:51,021 INFO L273 TraceCheckUtils]: 18: Hoare triple {14880#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:51,021 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:51,022 INFO L273 TraceCheckUtils]: 20: Hoare triple {14881#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:51,023 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:51,023 INFO L273 TraceCheckUtils]: 22: Hoare triple {14882#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:51,024 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:51,025 INFO L273 TraceCheckUtils]: 24: Hoare triple {14883#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:51,025 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:51,026 INFO L273 TraceCheckUtils]: 26: Hoare triple {14884#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:51,027 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:51,027 INFO L273 TraceCheckUtils]: 28: Hoare triple {14885#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:51,028 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:51,028 INFO L273 TraceCheckUtils]: 30: Hoare triple {14886#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:51,029 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:51,030 INFO L273 TraceCheckUtils]: 32: Hoare triple {14887#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:51,030 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:51,031 INFO L273 TraceCheckUtils]: 34: Hoare triple {14888#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:51,032 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:51,032 INFO L273 TraceCheckUtils]: 36: Hoare triple {14889#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:51,033 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:51,033 INFO L273 TraceCheckUtils]: 38: Hoare triple {14890#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:51,034 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:51,035 INFO L273 TraceCheckUtils]: 40: Hoare triple {14891#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:51,035 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:51,036 INFO L273 TraceCheckUtils]: 42: Hoare triple {14892#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:51,037 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:51,037 INFO L273 TraceCheckUtils]: 44: Hoare triple {14893#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:51,038 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:51,039 INFO L273 TraceCheckUtils]: 46: Hoare triple {14894#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:51,039 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:51,040 INFO L273 TraceCheckUtils]: 48: Hoare triple {14895#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:51,041 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:51,041 INFO L273 TraceCheckUtils]: 50: Hoare triple {14896#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:51,042 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:51,042 INFO L273 TraceCheckUtils]: 52: Hoare triple {14897#(<= main_~i~1 23)} assume !(~i~1 < 10000); {14873#false} is VALID [2018-11-23 12:27:51,043 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:51,043 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:51,043 INFO L273 TraceCheckUtils]: 55: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,043 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:51,043 INFO L273 TraceCheckUtils]: 57: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,044 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:51,044 INFO L273 TraceCheckUtils]: 59: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,044 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:51,044 INFO L273 TraceCheckUtils]: 61: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,044 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:51,045 INFO L273 TraceCheckUtils]: 63: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,045 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:51,045 INFO L273 TraceCheckUtils]: 65: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,045 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:51,045 INFO L273 TraceCheckUtils]: 67: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,045 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:51,045 INFO L273 TraceCheckUtils]: 69: Hoare triple {14872#true} assume !(~i~0 < 10000); {14872#true} is VALID [2018-11-23 12:27:51,045 INFO L273 TraceCheckUtils]: 70: Hoare triple {14872#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:27:51,046 INFO L273 TraceCheckUtils]: 71: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:27:51,046 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14872#true} {14873#false} #70#return; {14873#false} is VALID [2018-11-23 12:27:51,046 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:51,046 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:51,046 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:51,046 INFO L273 TraceCheckUtils]: 76: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,046 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:51,046 INFO L273 TraceCheckUtils]: 78: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,046 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:51,047 INFO L273 TraceCheckUtils]: 80: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,047 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:51,047 INFO L273 TraceCheckUtils]: 82: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,047 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:51,047 INFO L273 TraceCheckUtils]: 84: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,047 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:51,047 INFO L273 TraceCheckUtils]: 86: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,047 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:51,047 INFO L273 TraceCheckUtils]: 88: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,048 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:51,048 INFO L273 TraceCheckUtils]: 90: Hoare triple {14872#true} assume !(~i~0 < 10000); {14872#true} is VALID [2018-11-23 12:27:51,048 INFO L273 TraceCheckUtils]: 91: Hoare triple {14872#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:27:51,048 INFO L273 TraceCheckUtils]: 92: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:27:51,048 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14872#true} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:27:51,048 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:51,048 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,048 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:51,048 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,049 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:51,049 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,049 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:51,049 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,049 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:51,049 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,049 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:51,049 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,049 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:51,050 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 9999); {14873#false} is VALID [2018-11-23 12:27:51,050 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:27:51,050 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:51,050 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:51,050 INFO L273 TraceCheckUtils]: 111: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,050 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:51,050 INFO L273 TraceCheckUtils]: 113: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,050 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:51,050 INFO L273 TraceCheckUtils]: 115: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,051 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:51,051 INFO L273 TraceCheckUtils]: 117: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,051 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:51,051 INFO L273 TraceCheckUtils]: 119: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,051 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:51,051 INFO L273 TraceCheckUtils]: 121: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,051 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:51,051 INFO L273 TraceCheckUtils]: 123: Hoare triple {14872#true} assume !!(~i~0 < 10000);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:51,051 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:51,052 INFO L273 TraceCheckUtils]: 125: Hoare triple {14872#true} assume !(~i~0 < 10000); {14872#true} is VALID [2018-11-23 12:27:51,052 INFO L273 TraceCheckUtils]: 126: Hoare triple {14872#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:27:51,052 INFO L273 TraceCheckUtils]: 127: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:27:51,052 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14872#true} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:27:51,052 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:51,052 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:51,052 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:27:51,060 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:51,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:51,060 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:51,071 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:53,700 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-23 12:27:53,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:53,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:54,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:27:54,422 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:54,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:27:54,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:27:54,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret12 := main(); {14872#true} is VALID [2018-11-23 12:27:54,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14872#true} is VALID [2018-11-23 12:27:54,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,423 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:54,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,423 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:54,423 INFO L273 TraceCheckUtils]: 10: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,424 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:54,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,424 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:54,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,424 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:54,424 INFO L273 TraceCheckUtils]: 16: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,424 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:54,425 INFO L273 TraceCheckUtils]: 18: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,425 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:54,425 INFO L273 TraceCheckUtils]: 20: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,425 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:54,425 INFO L273 TraceCheckUtils]: 22: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,425 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:54,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,425 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:54,425 INFO L273 TraceCheckUtils]: 26: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,426 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:54,426 INFO L273 TraceCheckUtils]: 28: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,426 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:54,426 INFO L273 TraceCheckUtils]: 30: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,426 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:54,426 INFO L273 TraceCheckUtils]: 32: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,426 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:54,426 INFO L273 TraceCheckUtils]: 34: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,426 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:54,426 INFO L273 TraceCheckUtils]: 36: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,427 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:54,427 INFO L273 TraceCheckUtils]: 38: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,427 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:54,427 INFO L273 TraceCheckUtils]: 40: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,427 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:54,427 INFO L273 TraceCheckUtils]: 42: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,427 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:54,427 INFO L273 TraceCheckUtils]: 44: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,427 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:54,428 INFO L273 TraceCheckUtils]: 46: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,428 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:54,428 INFO L273 TraceCheckUtils]: 48: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,428 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:54,428 INFO L273 TraceCheckUtils]: 50: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -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:54,428 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:54,428 INFO L273 TraceCheckUtils]: 52: Hoare triple {14872#true} assume !(~i~1 < 10000); {14872#true} is VALID [2018-11-23 12:27:54,428 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:54,429 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:54,429 INFO L273 TraceCheckUtils]: 55: Hoare triple {15063#(<= mapavg_~i~0 0)} assume !!(~i~0 < 10000);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:54,430 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:54,430 INFO L273 TraceCheckUtils]: 57: Hoare triple {15070#(<= mapavg_~i~0 1)} assume !!(~i~0 < 10000);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:54,431 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:54,431 INFO L273 TraceCheckUtils]: 59: Hoare triple {15077#(<= mapavg_~i~0 2)} assume !!(~i~0 < 10000);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:54,431 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:54,432 INFO L273 TraceCheckUtils]: 61: Hoare triple {15084#(<= mapavg_~i~0 3)} assume !!(~i~0 < 10000);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:54,432 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:54,433 INFO L273 TraceCheckUtils]: 63: Hoare triple {15091#(<= mapavg_~i~0 4)} assume !!(~i~0 < 10000);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:54,433 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:54,434 INFO L273 TraceCheckUtils]: 65: Hoare triple {15098#(<= mapavg_~i~0 5)} assume !!(~i~0 < 10000);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:54,435 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:54,435 INFO L273 TraceCheckUtils]: 67: Hoare triple {15105#(<= mapavg_~i~0 6)} assume !!(~i~0 < 10000);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:54,436 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:54,437 INFO L273 TraceCheckUtils]: 69: Hoare triple {15112#(<= mapavg_~i~0 7)} assume !(~i~0 < 10000); {14873#false} is VALID [2018-11-23 12:27:54,437 INFO L273 TraceCheckUtils]: 70: Hoare triple {14873#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:27:54,437 INFO L273 TraceCheckUtils]: 71: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:27:54,437 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14873#false} {14872#true} #70#return; {14873#false} is VALID [2018-11-23 12:27:54,437 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:54,438 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:54,438 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:54,438 INFO L273 TraceCheckUtils]: 76: Hoare triple {14873#false} assume !!(~i~0 < 10000);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:54,438 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:54,438 INFO L273 TraceCheckUtils]: 78: Hoare triple {14873#false} assume !!(~i~0 < 10000);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:54,438 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:54,439 INFO L273 TraceCheckUtils]: 80: Hoare triple {14873#false} assume !!(~i~0 < 10000);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:54,439 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:54,439 INFO L273 TraceCheckUtils]: 82: Hoare triple {14873#false} assume !!(~i~0 < 10000);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:54,439 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:54,439 INFO L273 TraceCheckUtils]: 84: Hoare triple {14873#false} assume !!(~i~0 < 10000);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:54,439 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:54,440 INFO L273 TraceCheckUtils]: 86: Hoare triple {14873#false} assume !!(~i~0 < 10000);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:54,440 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:54,440 INFO L273 TraceCheckUtils]: 88: Hoare triple {14873#false} assume !!(~i~0 < 10000);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:54,440 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:54,440 INFO L273 TraceCheckUtils]: 90: Hoare triple {14873#false} assume !(~i~0 < 10000); {14873#false} is VALID [2018-11-23 12:27:54,440 INFO L273 TraceCheckUtils]: 91: Hoare triple {14873#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:27:54,440 INFO L273 TraceCheckUtils]: 92: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:27:54,440 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14873#false} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:27:54,440 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:54,440 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:54,441 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:54,441 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:54,441 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:54,441 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:54,441 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:54,441 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:54,441 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:54,441 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:54,441 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:54,442 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:54,442 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:54,442 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 9999); {14873#false} is VALID [2018-11-23 12:27:54,442 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:27:54,442 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:54,442 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:54,442 INFO L273 TraceCheckUtils]: 111: Hoare triple {14873#false} assume !!(~i~0 < 10000);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:54,442 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:54,442 INFO L273 TraceCheckUtils]: 113: Hoare triple {14873#false} assume !!(~i~0 < 10000);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:54,443 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:54,443 INFO L273 TraceCheckUtils]: 115: Hoare triple {14873#false} assume !!(~i~0 < 10000);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:54,443 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:54,443 INFO L273 TraceCheckUtils]: 117: Hoare triple {14873#false} assume !!(~i~0 < 10000);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:54,443 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:54,443 INFO L273 TraceCheckUtils]: 119: Hoare triple {14873#false} assume !!(~i~0 < 10000);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:54,443 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:54,443 INFO L273 TraceCheckUtils]: 121: Hoare triple {14873#false} assume !!(~i~0 < 10000);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:54,443 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:54,444 INFO L273 TraceCheckUtils]: 123: Hoare triple {14873#false} assume !!(~i~0 < 10000);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:54,444 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:54,444 INFO L273 TraceCheckUtils]: 125: Hoare triple {14873#false} assume !(~i~0 < 10000); {14873#false} is VALID [2018-11-23 12:27:54,444 INFO L273 TraceCheckUtils]: 126: Hoare triple {14873#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:27:54,444 INFO L273 TraceCheckUtils]: 127: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:27:54,444 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14873#false} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:27:54,444 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:54,444 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:54,444 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:27:54,451 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:54,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:54,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2018-11-23 12:27:54,474 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:27:54,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:54,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:27:54,652 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:54,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:27:54,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:27:54,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:27:54,653 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2018-11-23 12:27:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:55,461 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-11-23 12:27:55,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:27:55,461 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:27:55,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:27:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:27:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:27:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:27:55,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 120 transitions. [2018-11-23 12:27:55,848 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:55,850 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:27:55,850 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:27:55,851 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:55,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:27:56,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-23 12:27:56,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:56,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2018-11-23 12:27:56,411 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2018-11-23 12:27:56,411 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2018-11-23 12:27:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:56,414 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:27:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:27:56,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:56,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:56,415 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2018-11-23 12:27:56,415 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2018-11-23 12:27:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:56,417 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:27:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:27:56,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:56,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:56,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:56,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 12:27:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-11-23 12:27:56,420 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2018-11-23 12:27:56,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:56,420 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-11-23 12:27:56,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:27:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-23 12:27:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-23 12:27:56,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:56,422 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:56,422 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:56,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:56,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1283933361, now seen corresponding path program 24 times [2018-11-23 12:27:56,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:56,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:56,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:56,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:56,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:57,053 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:27:57,054 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:57,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:27:57,054 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:27:57,054 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret12 := main(); {15862#true} is VALID [2018-11-23 12:27:57,055 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:57,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {15864#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:57,056 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:57,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {15865#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:57,057 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:57,057 INFO L273 TraceCheckUtils]: 10: Hoare triple {15866#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:57,058 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:57,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {15867#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:57,059 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:57,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {15868#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:57,059 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:57,060 INFO L273 TraceCheckUtils]: 16: Hoare triple {15869#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:57,061 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:57,061 INFO L273 TraceCheckUtils]: 18: Hoare triple {15870#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:57,062 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:57,062 INFO L273 TraceCheckUtils]: 20: Hoare triple {15871#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:57,063 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:57,063 INFO L273 TraceCheckUtils]: 22: Hoare triple {15872#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:57,080 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:57,088 INFO L273 TraceCheckUtils]: 24: Hoare triple {15873#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:57,102 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:57,110 INFO L273 TraceCheckUtils]: 26: Hoare triple {15874#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:57,111 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:57,112 INFO L273 TraceCheckUtils]: 28: Hoare triple {15875#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:57,112 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:57,112 INFO L273 TraceCheckUtils]: 30: Hoare triple {15876#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:57,113 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:57,113 INFO L273 TraceCheckUtils]: 32: Hoare triple {15877#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:57,114 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:57,114 INFO L273 TraceCheckUtils]: 34: Hoare triple {15878#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:57,114 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:57,115 INFO L273 TraceCheckUtils]: 36: Hoare triple {15879#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:57,115 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:57,116 INFO L273 TraceCheckUtils]: 38: Hoare triple {15880#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:57,116 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:57,117 INFO L273 TraceCheckUtils]: 40: Hoare triple {15881#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:57,118 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:57,118 INFO L273 TraceCheckUtils]: 42: Hoare triple {15882#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:57,119 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:57,119 INFO L273 TraceCheckUtils]: 44: Hoare triple {15883#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:57,120 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:57,120 INFO L273 TraceCheckUtils]: 46: Hoare triple {15884#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:57,121 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:57,122 INFO L273 TraceCheckUtils]: 48: Hoare triple {15885#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:57,122 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:57,123 INFO L273 TraceCheckUtils]: 50: Hoare triple {15886#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:57,123 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:57,124 INFO L273 TraceCheckUtils]: 52: Hoare triple {15887#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:57,125 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:57,125 INFO L273 TraceCheckUtils]: 54: Hoare triple {15888#(<= main_~i~1 24)} assume !(~i~1 < 10000); {15863#false} is VALID [2018-11-23 12:27:57,125 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:57,126 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:57,126 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,126 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:57,126 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,126 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:57,126 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,127 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:57,127 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,127 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:57,127 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,127 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:57,127 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,128 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:57,128 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,128 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:57,128 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,128 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:57,128 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 10000); {15862#true} is VALID [2018-11-23 12:27:57,128 INFO L273 TraceCheckUtils]: 74: Hoare triple {15862#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:27:57,128 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:27:57,128 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15863#false} #70#return; {15863#false} is VALID [2018-11-23 12:27:57,128 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:57,129 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:57,129 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:57,129 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,129 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:57,129 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,129 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:57,129 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,129 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:57,129 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,130 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:57,130 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,130 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:57,130 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,130 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:57,130 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,130 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:57,130 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,130 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:57,130 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 10000); {15862#true} is VALID [2018-11-23 12:27:57,131 INFO L273 TraceCheckUtils]: 97: Hoare triple {15862#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:27:57,131 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:27:57,131 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15863#false} #72#return; {15863#false} is VALID [2018-11-23 12:27:57,131 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:57,131 INFO L273 TraceCheckUtils]: 101: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:57,131 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:57,131 INFO L273 TraceCheckUtils]: 103: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:57,131 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:57,131 INFO L273 TraceCheckUtils]: 105: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:57,132 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:57,132 INFO L273 TraceCheckUtils]: 107: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:57,132 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:57,132 INFO L273 TraceCheckUtils]: 109: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:57,132 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:57,132 INFO L273 TraceCheckUtils]: 111: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:57,132 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:57,132 INFO L273 TraceCheckUtils]: 113: Hoare triple {15863#false} assume !(~i~2 < 9999); {15863#false} is VALID [2018-11-23 12:27:57,132 INFO L273 TraceCheckUtils]: 114: Hoare triple {15863#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:27:57,132 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:57,133 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:57,133 INFO L273 TraceCheckUtils]: 117: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,133 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:57,133 INFO L273 TraceCheckUtils]: 119: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,133 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:57,133 INFO L273 TraceCheckUtils]: 121: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,133 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:57,133 INFO L273 TraceCheckUtils]: 123: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,133 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:57,134 INFO L273 TraceCheckUtils]: 125: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,134 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:57,134 INFO L273 TraceCheckUtils]: 127: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,134 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:57,134 INFO L273 TraceCheckUtils]: 129: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,134 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:57,134 INFO L273 TraceCheckUtils]: 131: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:57,134 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:57,134 INFO L273 TraceCheckUtils]: 133: Hoare triple {15862#true} assume !(~i~0 < 10000); {15862#true} is VALID [2018-11-23 12:27:57,135 INFO L273 TraceCheckUtils]: 134: Hoare triple {15862#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:27:57,135 INFO L273 TraceCheckUtils]: 135: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:27:57,135 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15862#true} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:27:57,135 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:57,135 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:57,135 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:27:57,144 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:57,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:57,144 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:57,154 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:57,985 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-23 12:27:57,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:58,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:58,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:27:58,990 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:58,991 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:27:58,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:27:58,991 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret12 := main(); {15862#true} is VALID [2018-11-23 12:27:58,991 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15862#true} is VALID [2018-11-23 12:27:58,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,992 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:58,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,992 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:58,992 INFO L273 TraceCheckUtils]: 10: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,992 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:58,992 INFO L273 TraceCheckUtils]: 12: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,992 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:58,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,993 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:58,993 INFO L273 TraceCheckUtils]: 16: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,993 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:58,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,993 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:58,993 INFO L273 TraceCheckUtils]: 20: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,993 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:58,993 INFO L273 TraceCheckUtils]: 22: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,993 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:58,993 INFO L273 TraceCheckUtils]: 24: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,994 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:58,994 INFO L273 TraceCheckUtils]: 26: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,994 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:58,994 INFO L273 TraceCheckUtils]: 28: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,994 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:58,994 INFO L273 TraceCheckUtils]: 30: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,994 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:58,994 INFO L273 TraceCheckUtils]: 32: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,994 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:58,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,995 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:58,995 INFO L273 TraceCheckUtils]: 36: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,995 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:58,995 INFO L273 TraceCheckUtils]: 38: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,995 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:58,995 INFO L273 TraceCheckUtils]: 40: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,995 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:58,995 INFO L273 TraceCheckUtils]: 42: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,995 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:58,996 INFO L273 TraceCheckUtils]: 44: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,996 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:58,996 INFO L273 TraceCheckUtils]: 46: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,996 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:58,996 INFO L273 TraceCheckUtils]: 48: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,996 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:58,996 INFO L273 TraceCheckUtils]: 50: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,996 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:58,996 INFO L273 TraceCheckUtils]: 52: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -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:58,997 INFO L273 TraceCheckUtils]: 53: 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:58,997 INFO L273 TraceCheckUtils]: 54: Hoare triple {15862#true} assume !(~i~1 < 10000); {15862#true} is VALID [2018-11-23 12:27:58,997 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:58,997 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:58,997 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:58,997 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:58,997 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:58,997 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:58,997 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:58,997 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:58,998 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:58,998 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:58,998 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:58,998 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:58,998 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:58,998 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:58,998 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:58,998 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:58,998 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:58,999 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:58,999 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 10000); {15862#true} is VALID [2018-11-23 12:27:58,999 INFO L273 TraceCheckUtils]: 74: Hoare triple {15862#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:27:58,999 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:27:58,999 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15862#true} #70#return; {15862#true} is VALID [2018-11-23 12:27:58,999 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:58,999 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:58,999 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:58,999 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:58,999 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:59,000 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:59,000 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:59,000 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:59,000 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:59,000 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:59,000 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:59,000 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:59,000 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:59,000 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:59,001 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:59,001 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:59,001 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:59,001 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 10000);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:59,001 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:59,001 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 10000); {15862#true} is VALID [2018-11-23 12:27:59,001 INFO L273 TraceCheckUtils]: 97: Hoare triple {15862#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:27:59,001 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:27:59,001 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15862#true} #72#return; {15862#true} is VALID [2018-11-23 12:27:59,002 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; {16192#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:59,002 INFO L273 TraceCheckUtils]: 101: Hoare triple {16192#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16192#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:59,003 INFO L273 TraceCheckUtils]: 102: Hoare triple {16192#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16199#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:59,003 INFO L273 TraceCheckUtils]: 103: Hoare triple {16199#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16199#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:59,003 INFO L273 TraceCheckUtils]: 104: Hoare triple {16199#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16206#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:59,004 INFO L273 TraceCheckUtils]: 105: Hoare triple {16206#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16206#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:59,004 INFO L273 TraceCheckUtils]: 106: Hoare triple {16206#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16213#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:59,004 INFO L273 TraceCheckUtils]: 107: Hoare triple {16213#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16213#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:59,005 INFO L273 TraceCheckUtils]: 108: Hoare triple {16213#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16220#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:59,005 INFO L273 TraceCheckUtils]: 109: Hoare triple {16220#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16220#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:59,006 INFO L273 TraceCheckUtils]: 110: Hoare triple {16220#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16227#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:59,006 INFO L273 TraceCheckUtils]: 111: Hoare triple {16227#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16227#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:59,007 INFO L273 TraceCheckUtils]: 112: Hoare triple {16227#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16234#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:59,008 INFO L273 TraceCheckUtils]: 113: Hoare triple {16234#(<= main_~i~2 6)} assume !(~i~2 < 9999); {15863#false} is VALID [2018-11-23 12:27:59,008 INFO L273 TraceCheckUtils]: 114: Hoare triple {15863#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:27:59,008 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:59,008 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:59,008 INFO L273 TraceCheckUtils]: 117: Hoare triple {15863#false} assume !!(~i~0 < 10000);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:59,009 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:59,009 INFO L273 TraceCheckUtils]: 119: Hoare triple {15863#false} assume !!(~i~0 < 10000);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:59,009 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:59,009 INFO L273 TraceCheckUtils]: 121: Hoare triple {15863#false} assume !!(~i~0 < 10000);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:59,009 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:59,009 INFO L273 TraceCheckUtils]: 123: Hoare triple {15863#false} assume !!(~i~0 < 10000);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:59,010 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:59,010 INFO L273 TraceCheckUtils]: 125: Hoare triple {15863#false} assume !!(~i~0 < 10000);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:59,010 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:59,010 INFO L273 TraceCheckUtils]: 127: Hoare triple {15863#false} assume !!(~i~0 < 10000);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:59,010 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:59,011 INFO L273 TraceCheckUtils]: 129: Hoare triple {15863#false} assume !!(~i~0 < 10000);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:59,011 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:59,011 INFO L273 TraceCheckUtils]: 131: Hoare triple {15863#false} assume !!(~i~0 < 10000);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:59,011 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:59,011 INFO L273 TraceCheckUtils]: 133: Hoare triple {15863#false} assume !(~i~0 < 10000); {15863#false} is VALID [2018-11-23 12:27:59,011 INFO L273 TraceCheckUtils]: 134: Hoare triple {15863#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {15863#false} is VALID [2018-11-23 12:27:59,011 INFO L273 TraceCheckUtils]: 135: Hoare triple {15863#false} assume true; {15863#false} is VALID [2018-11-23 12:27:59,011 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15863#false} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:27:59,011 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:59,012 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:59,012 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:27:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2018-11-23 12:27:59,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:59,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2018-11-23 12:27:59,040 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2018-11-23 12:27:59,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:59,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:27:59,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:59,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:27:59,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:27:59,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:27:59,629 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 34 states. [2018-11-23 12:28:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:00,554 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-11-23 12:28:00,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:28:00,555 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2018-11-23 12:28:00,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:28:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-23 12:28:00,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:28:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-23 12:28:00,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 117 transitions. [2018-11-23 12:28:00,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:00,672 INFO L225 Difference]: With dead ends: 149 [2018-11-23 12:28:00,673 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 12:28:00,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:28:00,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 12:28:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-23 12:28:00,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:00,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 103 states. [2018-11-23 12:28:00,728 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 103 states. [2018-11-23 12:28:00,728 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 103 states. [2018-11-23 12:28:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:00,730 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:28:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:28:00,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:00,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:00,731 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 105 states. [2018-11-23 12:28:00,731 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 105 states. [2018-11-23 12:28:00,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:00,733 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:28:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:28:00,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:00,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:00,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:00,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 12:28:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-11-23 12:28:00,736 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 140 [2018-11-23 12:28:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:00,737 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-11-23 12:28:00,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:28:00,737 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 12:28:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-23 12:28:00,738 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:00,738 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:00,738 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:00,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:00,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1912835409, now seen corresponding path program 25 times [2018-11-23 12:28:00,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:00,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:00,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:00,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:00,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:01,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {16899#true} call ULTIMATE.init(); {16899#true} is VALID [2018-11-23 12:28:01,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {16899#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16899#true} is VALID [2018-11-23 12:28:01,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:28:01,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16899#true} {16899#true} #66#return; {16899#true} is VALID [2018-11-23 12:28:01,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {16899#true} call #t~ret12 := main(); {16899#true} is VALID [2018-11-23 12:28:01,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {16899#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16901#(= main_~i~1 0)} is VALID [2018-11-23 12:28:01,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {16901#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16901#(= main_~i~1 0)} is VALID [2018-11-23 12:28:01,325 INFO L273 TraceCheckUtils]: 7: Hoare triple {16901#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:01,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {16902#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:01,326 INFO L273 TraceCheckUtils]: 9: Hoare triple {16902#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:01,326 INFO L273 TraceCheckUtils]: 10: Hoare triple {16903#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:01,327 INFO L273 TraceCheckUtils]: 11: Hoare triple {16903#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:01,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {16904#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:01,327 INFO L273 TraceCheckUtils]: 13: Hoare triple {16904#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:01,328 INFO L273 TraceCheckUtils]: 14: Hoare triple {16905#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:01,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {16905#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:01,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {16906#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:01,330 INFO L273 TraceCheckUtils]: 17: Hoare triple {16906#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:01,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {16907#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:01,331 INFO L273 TraceCheckUtils]: 19: Hoare triple {16907#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:01,331 INFO L273 TraceCheckUtils]: 20: Hoare triple {16908#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:01,332 INFO L273 TraceCheckUtils]: 21: Hoare triple {16908#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:01,333 INFO L273 TraceCheckUtils]: 22: Hoare triple {16909#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:01,333 INFO L273 TraceCheckUtils]: 23: Hoare triple {16909#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:01,334 INFO L273 TraceCheckUtils]: 24: Hoare triple {16910#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:01,335 INFO L273 TraceCheckUtils]: 25: Hoare triple {16910#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:01,335 INFO L273 TraceCheckUtils]: 26: Hoare triple {16911#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:01,336 INFO L273 TraceCheckUtils]: 27: Hoare triple {16911#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:01,336 INFO L273 TraceCheckUtils]: 28: Hoare triple {16912#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:01,337 INFO L273 TraceCheckUtils]: 29: Hoare triple {16912#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:01,337 INFO L273 TraceCheckUtils]: 30: Hoare triple {16913#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:01,338 INFO L273 TraceCheckUtils]: 31: Hoare triple {16913#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:01,339 INFO L273 TraceCheckUtils]: 32: Hoare triple {16914#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:01,339 INFO L273 TraceCheckUtils]: 33: Hoare triple {16914#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:01,340 INFO L273 TraceCheckUtils]: 34: Hoare triple {16915#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:01,341 INFO L273 TraceCheckUtils]: 35: Hoare triple {16915#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:01,341 INFO L273 TraceCheckUtils]: 36: Hoare triple {16916#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:01,342 INFO L273 TraceCheckUtils]: 37: Hoare triple {16916#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:01,342 INFO L273 TraceCheckUtils]: 38: Hoare triple {16917#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:01,343 INFO L273 TraceCheckUtils]: 39: Hoare triple {16917#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:01,344 INFO L273 TraceCheckUtils]: 40: Hoare triple {16918#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:01,344 INFO L273 TraceCheckUtils]: 41: Hoare triple {16918#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:01,345 INFO L273 TraceCheckUtils]: 42: Hoare triple {16919#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:01,345 INFO L273 TraceCheckUtils]: 43: Hoare triple {16919#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:01,346 INFO L273 TraceCheckUtils]: 44: Hoare triple {16920#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:01,347 INFO L273 TraceCheckUtils]: 45: Hoare triple {16920#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:01,347 INFO L273 TraceCheckUtils]: 46: Hoare triple {16921#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:01,348 INFO L273 TraceCheckUtils]: 47: Hoare triple {16921#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:01,348 INFO L273 TraceCheckUtils]: 48: Hoare triple {16922#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:01,349 INFO L273 TraceCheckUtils]: 49: Hoare triple {16922#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:01,350 INFO L273 TraceCheckUtils]: 50: Hoare triple {16923#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:01,350 INFO L273 TraceCheckUtils]: 51: Hoare triple {16923#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:01,351 INFO L273 TraceCheckUtils]: 52: Hoare triple {16924#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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 23)} is VALID [2018-11-23 12:28:01,351 INFO L273 TraceCheckUtils]: 53: Hoare triple {16924#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:01,352 INFO L273 TraceCheckUtils]: 54: Hoare triple {16925#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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 24)} is VALID [2018-11-23 12:28:01,353 INFO L273 TraceCheckUtils]: 55: Hoare triple {16925#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16926#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:01,353 INFO L273 TraceCheckUtils]: 56: Hoare triple {16926#(<= main_~i~1 25)} assume !(~i~1 < 10000); {16900#false} is VALID [2018-11-23 12:28:01,354 INFO L256 TraceCheckUtils]: 57: Hoare triple {16900#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {16899#true} is VALID [2018-11-23 12:28:01,354 INFO L273 TraceCheckUtils]: 58: Hoare triple {16899#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16899#true} is VALID [2018-11-23 12:28:01,354 INFO L273 TraceCheckUtils]: 59: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,354 INFO L273 TraceCheckUtils]: 60: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,354 INFO L273 TraceCheckUtils]: 61: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,354 INFO L273 TraceCheckUtils]: 62: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,355 INFO L273 TraceCheckUtils]: 63: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,355 INFO L273 TraceCheckUtils]: 64: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,355 INFO L273 TraceCheckUtils]: 65: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,355 INFO L273 TraceCheckUtils]: 66: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,355 INFO L273 TraceCheckUtils]: 67: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,355 INFO L273 TraceCheckUtils]: 68: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,355 INFO L273 TraceCheckUtils]: 69: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,356 INFO L273 TraceCheckUtils]: 70: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,356 INFO L273 TraceCheckUtils]: 71: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,356 INFO L273 TraceCheckUtils]: 72: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,356 INFO L273 TraceCheckUtils]: 73: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,356 INFO L273 TraceCheckUtils]: 74: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,356 INFO L273 TraceCheckUtils]: 75: Hoare triple {16899#true} assume !(~i~0 < 10000); {16899#true} is VALID [2018-11-23 12:28:01,356 INFO L273 TraceCheckUtils]: 76: Hoare triple {16899#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {16899#true} is VALID [2018-11-23 12:28:01,356 INFO L273 TraceCheckUtils]: 77: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:28:01,356 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16899#true} {16900#false} #70#return; {16900#false} is VALID [2018-11-23 12:28:01,357 INFO L273 TraceCheckUtils]: 79: Hoare triple {16900#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); {16900#false} is VALID [2018-11-23 12:28:01,357 INFO L256 TraceCheckUtils]: 80: Hoare triple {16900#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {16899#true} is VALID [2018-11-23 12:28:01,357 INFO L273 TraceCheckUtils]: 81: Hoare triple {16899#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16899#true} is VALID [2018-11-23 12:28:01,357 INFO L273 TraceCheckUtils]: 82: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,357 INFO L273 TraceCheckUtils]: 83: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,357 INFO L273 TraceCheckUtils]: 84: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,357 INFO L273 TraceCheckUtils]: 85: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,357 INFO L273 TraceCheckUtils]: 86: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,357 INFO L273 TraceCheckUtils]: 87: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,358 INFO L273 TraceCheckUtils]: 88: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,358 INFO L273 TraceCheckUtils]: 89: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,358 INFO L273 TraceCheckUtils]: 90: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,358 INFO L273 TraceCheckUtils]: 91: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,358 INFO L273 TraceCheckUtils]: 92: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,358 INFO L273 TraceCheckUtils]: 93: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,358 INFO L273 TraceCheckUtils]: 94: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,358 INFO L273 TraceCheckUtils]: 95: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,358 INFO L273 TraceCheckUtils]: 96: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,359 INFO L273 TraceCheckUtils]: 97: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,359 INFO L273 TraceCheckUtils]: 98: Hoare triple {16899#true} assume !(~i~0 < 10000); {16899#true} is VALID [2018-11-23 12:28:01,359 INFO L273 TraceCheckUtils]: 99: Hoare triple {16899#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {16899#true} is VALID [2018-11-23 12:28:01,359 INFO L273 TraceCheckUtils]: 100: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:28:01,359 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16899#true} {16900#false} #72#return; {16900#false} is VALID [2018-11-23 12:28:01,359 INFO L273 TraceCheckUtils]: 102: Hoare triple {16900#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; {16900#false} is VALID [2018-11-23 12:28:01,359 INFO L273 TraceCheckUtils]: 103: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:01,359 INFO L273 TraceCheckUtils]: 104: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:01,359 INFO L273 TraceCheckUtils]: 105: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:01,359 INFO L273 TraceCheckUtils]: 106: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:01,360 INFO L273 TraceCheckUtils]: 107: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:01,360 INFO L273 TraceCheckUtils]: 108: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:01,360 INFO L273 TraceCheckUtils]: 109: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:01,360 INFO L273 TraceCheckUtils]: 110: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:01,360 INFO L273 TraceCheckUtils]: 111: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:01,360 INFO L273 TraceCheckUtils]: 112: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:01,360 INFO L273 TraceCheckUtils]: 113: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:01,360 INFO L273 TraceCheckUtils]: 114: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:01,360 INFO L273 TraceCheckUtils]: 115: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:01,361 INFO L273 TraceCheckUtils]: 116: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:01,361 INFO L273 TraceCheckUtils]: 117: Hoare triple {16900#false} assume !(~i~2 < 9999); {16900#false} is VALID [2018-11-23 12:28:01,361 INFO L273 TraceCheckUtils]: 118: Hoare triple {16900#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:28:01,361 INFO L256 TraceCheckUtils]: 119: Hoare triple {16900#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {16899#true} is VALID [2018-11-23 12:28:01,361 INFO L273 TraceCheckUtils]: 120: Hoare triple {16899#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16899#true} is VALID [2018-11-23 12:28:01,361 INFO L273 TraceCheckUtils]: 121: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,361 INFO L273 TraceCheckUtils]: 122: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,361 INFO L273 TraceCheckUtils]: 123: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,361 INFO L273 TraceCheckUtils]: 124: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,361 INFO L273 TraceCheckUtils]: 125: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,362 INFO L273 TraceCheckUtils]: 126: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,362 INFO L273 TraceCheckUtils]: 127: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,362 INFO L273 TraceCheckUtils]: 128: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,362 INFO L273 TraceCheckUtils]: 129: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,362 INFO L273 TraceCheckUtils]: 130: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,362 INFO L273 TraceCheckUtils]: 131: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,362 INFO L273 TraceCheckUtils]: 132: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,362 INFO L273 TraceCheckUtils]: 133: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,362 INFO L273 TraceCheckUtils]: 134: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,363 INFO L273 TraceCheckUtils]: 135: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:01,363 INFO L273 TraceCheckUtils]: 136: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:01,363 INFO L273 TraceCheckUtils]: 137: Hoare triple {16899#true} assume !(~i~0 < 10000); {16899#true} is VALID [2018-11-23 12:28:01,363 INFO L273 TraceCheckUtils]: 138: Hoare triple {16899#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {16899#true} is VALID [2018-11-23 12:28:01,363 INFO L273 TraceCheckUtils]: 139: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:28:01,363 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16899#true} {16900#false} #74#return; {16900#false} is VALID [2018-11-23 12:28:01,363 INFO L273 TraceCheckUtils]: 141: Hoare triple {16900#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {16900#false} is VALID [2018-11-23 12:28:01,363 INFO L273 TraceCheckUtils]: 142: Hoare triple {16900#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {16900#false} is VALID [2018-11-23 12:28:01,363 INFO L273 TraceCheckUtils]: 143: Hoare triple {16900#false} assume !false; {16900#false} is VALID [2018-11-23 12:28:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:28:01,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:01,373 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:28:01,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:01,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:01,726 INFO L256 TraceCheckUtils]: 0: Hoare triple {16899#true} call ULTIMATE.init(); {16899#true} is VALID [2018-11-23 12:28:01,726 INFO L273 TraceCheckUtils]: 1: Hoare triple {16899#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16899#true} is VALID [2018-11-23 12:28:01,727 INFO L273 TraceCheckUtils]: 2: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:28:01,727 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16899#true} {16899#true} #66#return; {16899#true} is VALID [2018-11-23 12:28:01,727 INFO L256 TraceCheckUtils]: 4: Hoare triple {16899#true} call #t~ret12 := main(); {16899#true} is VALID [2018-11-23 12:28:01,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {16899#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16945#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:01,729 INFO L273 TraceCheckUtils]: 6: Hoare triple {16945#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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 0)} is VALID [2018-11-23 12:28:01,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {16945#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:01,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {16902#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:01,731 INFO L273 TraceCheckUtils]: 9: Hoare triple {16902#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:01,731 INFO L273 TraceCheckUtils]: 10: Hoare triple {16903#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:01,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {16903#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:01,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {16904#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:01,734 INFO L273 TraceCheckUtils]: 13: Hoare triple {16904#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:01,734 INFO L273 TraceCheckUtils]: 14: Hoare triple {16905#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:01,735 INFO L273 TraceCheckUtils]: 15: Hoare triple {16905#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:01,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {16906#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:01,736 INFO L273 TraceCheckUtils]: 17: Hoare triple {16906#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:01,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {16907#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:01,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {16907#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:01,738 INFO L273 TraceCheckUtils]: 20: Hoare triple {16908#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:01,739 INFO L273 TraceCheckUtils]: 21: Hoare triple {16908#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:01,740 INFO L273 TraceCheckUtils]: 22: Hoare triple {16909#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:01,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {16909#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:01,741 INFO L273 TraceCheckUtils]: 24: Hoare triple {16910#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:01,742 INFO L273 TraceCheckUtils]: 25: Hoare triple {16910#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:01,743 INFO L273 TraceCheckUtils]: 26: Hoare triple {16911#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:01,743 INFO L273 TraceCheckUtils]: 27: Hoare triple {16911#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:01,744 INFO L273 TraceCheckUtils]: 28: Hoare triple {16912#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:01,745 INFO L273 TraceCheckUtils]: 29: Hoare triple {16912#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:01,745 INFO L273 TraceCheckUtils]: 30: Hoare triple {16913#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:01,746 INFO L273 TraceCheckUtils]: 31: Hoare triple {16913#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:01,747 INFO L273 TraceCheckUtils]: 32: Hoare triple {16914#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:01,748 INFO L273 TraceCheckUtils]: 33: Hoare triple {16914#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:01,748 INFO L273 TraceCheckUtils]: 34: Hoare triple {16915#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:01,749 INFO L273 TraceCheckUtils]: 35: Hoare triple {16915#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:01,750 INFO L273 TraceCheckUtils]: 36: Hoare triple {16916#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:01,751 INFO L273 TraceCheckUtils]: 37: Hoare triple {16916#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:01,751 INFO L273 TraceCheckUtils]: 38: Hoare triple {16917#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:01,752 INFO L273 TraceCheckUtils]: 39: Hoare triple {16917#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:01,753 INFO L273 TraceCheckUtils]: 40: Hoare triple {16918#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:01,753 INFO L273 TraceCheckUtils]: 41: Hoare triple {16918#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:01,754 INFO L273 TraceCheckUtils]: 42: Hoare triple {16919#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:01,755 INFO L273 TraceCheckUtils]: 43: Hoare triple {16919#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:01,755 INFO L273 TraceCheckUtils]: 44: Hoare triple {16920#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:01,756 INFO L273 TraceCheckUtils]: 45: Hoare triple {16920#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:01,757 INFO L273 TraceCheckUtils]: 46: Hoare triple {16921#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:01,758 INFO L273 TraceCheckUtils]: 47: Hoare triple {16921#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:01,758 INFO L273 TraceCheckUtils]: 48: Hoare triple {16922#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:01,759 INFO L273 TraceCheckUtils]: 49: Hoare triple {16922#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:01,760 INFO L273 TraceCheckUtils]: 50: Hoare triple {16923#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:01,761 INFO L273 TraceCheckUtils]: 51: Hoare triple {16923#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:01,761 INFO L273 TraceCheckUtils]: 52: Hoare triple {16924#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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 23)} is VALID [2018-11-23 12:28:01,762 INFO L273 TraceCheckUtils]: 53: Hoare triple {16924#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:01,763 INFO L273 TraceCheckUtils]: 54: Hoare triple {16925#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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 24)} is VALID [2018-11-23 12:28:01,764 INFO L273 TraceCheckUtils]: 55: Hoare triple {16925#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16926#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:01,764 INFO L273 TraceCheckUtils]: 56: Hoare triple {16926#(<= main_~i~1 25)} assume !(~i~1 < 10000); {16900#false} is VALID [2018-11-23 12:28:01,764 INFO L256 TraceCheckUtils]: 57: Hoare triple {16900#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {16900#false} is VALID [2018-11-23 12:28:01,765 INFO L273 TraceCheckUtils]: 58: Hoare triple {16900#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16900#false} is VALID [2018-11-23 12:28:01,765 INFO L273 TraceCheckUtils]: 59: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,765 INFO L273 TraceCheckUtils]: 60: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,765 INFO L273 TraceCheckUtils]: 61: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,766 INFO L273 TraceCheckUtils]: 62: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,766 INFO L273 TraceCheckUtils]: 63: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,766 INFO L273 TraceCheckUtils]: 64: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,766 INFO L273 TraceCheckUtils]: 65: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,767 INFO L273 TraceCheckUtils]: 66: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,767 INFO L273 TraceCheckUtils]: 67: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,767 INFO L273 TraceCheckUtils]: 68: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,767 INFO L273 TraceCheckUtils]: 69: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,768 INFO L273 TraceCheckUtils]: 70: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,768 INFO L273 TraceCheckUtils]: 71: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,768 INFO L273 TraceCheckUtils]: 72: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,768 INFO L273 TraceCheckUtils]: 73: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,768 INFO L273 TraceCheckUtils]: 74: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,769 INFO L273 TraceCheckUtils]: 75: Hoare triple {16900#false} assume !(~i~0 < 10000); {16900#false} is VALID [2018-11-23 12:28:01,769 INFO L273 TraceCheckUtils]: 76: Hoare triple {16900#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {16900#false} is VALID [2018-11-23 12:28:01,769 INFO L273 TraceCheckUtils]: 77: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:28:01,769 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16900#false} {16900#false} #70#return; {16900#false} is VALID [2018-11-23 12:28:01,769 INFO L273 TraceCheckUtils]: 79: Hoare triple {16900#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); {16900#false} is VALID [2018-11-23 12:28:01,769 INFO L256 TraceCheckUtils]: 80: Hoare triple {16900#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {16900#false} is VALID [2018-11-23 12:28:01,770 INFO L273 TraceCheckUtils]: 81: Hoare triple {16900#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16900#false} is VALID [2018-11-23 12:28:01,770 INFO L273 TraceCheckUtils]: 82: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,770 INFO L273 TraceCheckUtils]: 83: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,770 INFO L273 TraceCheckUtils]: 84: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,770 INFO L273 TraceCheckUtils]: 85: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,770 INFO L273 TraceCheckUtils]: 86: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,770 INFO L273 TraceCheckUtils]: 87: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,771 INFO L273 TraceCheckUtils]: 88: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,771 INFO L273 TraceCheckUtils]: 89: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,771 INFO L273 TraceCheckUtils]: 90: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,771 INFO L273 TraceCheckUtils]: 91: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,771 INFO L273 TraceCheckUtils]: 92: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,771 INFO L273 TraceCheckUtils]: 93: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,771 INFO L273 TraceCheckUtils]: 94: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,772 INFO L273 TraceCheckUtils]: 95: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,772 INFO L273 TraceCheckUtils]: 96: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,772 INFO L273 TraceCheckUtils]: 97: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,772 INFO L273 TraceCheckUtils]: 98: Hoare triple {16900#false} assume !(~i~0 < 10000); {16900#false} is VALID [2018-11-23 12:28:01,772 INFO L273 TraceCheckUtils]: 99: Hoare triple {16900#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {16900#false} is VALID [2018-11-23 12:28:01,772 INFO L273 TraceCheckUtils]: 100: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:28:01,772 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16900#false} {16900#false} #72#return; {16900#false} is VALID [2018-11-23 12:28:01,773 INFO L273 TraceCheckUtils]: 102: Hoare triple {16900#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; {16900#false} is VALID [2018-11-23 12:28:01,773 INFO L273 TraceCheckUtils]: 103: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:01,773 INFO L273 TraceCheckUtils]: 104: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:01,773 INFO L273 TraceCheckUtils]: 105: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:01,773 INFO L273 TraceCheckUtils]: 106: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:01,773 INFO L273 TraceCheckUtils]: 107: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:01,773 INFO L273 TraceCheckUtils]: 108: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:01,773 INFO L273 TraceCheckUtils]: 109: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:01,774 INFO L273 TraceCheckUtils]: 110: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:01,774 INFO L273 TraceCheckUtils]: 111: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:01,774 INFO L273 TraceCheckUtils]: 112: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:01,774 INFO L273 TraceCheckUtils]: 113: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:01,774 INFO L273 TraceCheckUtils]: 114: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:01,774 INFO L273 TraceCheckUtils]: 115: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:01,774 INFO L273 TraceCheckUtils]: 116: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:01,775 INFO L273 TraceCheckUtils]: 117: Hoare triple {16900#false} assume !(~i~2 < 9999); {16900#false} is VALID [2018-11-23 12:28:01,775 INFO L273 TraceCheckUtils]: 118: Hoare triple {16900#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:28:01,775 INFO L256 TraceCheckUtils]: 119: Hoare triple {16900#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {16900#false} is VALID [2018-11-23 12:28:01,775 INFO L273 TraceCheckUtils]: 120: Hoare triple {16900#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16900#false} is VALID [2018-11-23 12:28:01,775 INFO L273 TraceCheckUtils]: 121: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,775 INFO L273 TraceCheckUtils]: 122: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,775 INFO L273 TraceCheckUtils]: 123: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,776 INFO L273 TraceCheckUtils]: 124: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,776 INFO L273 TraceCheckUtils]: 125: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,776 INFO L273 TraceCheckUtils]: 126: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,776 INFO L273 TraceCheckUtils]: 127: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,776 INFO L273 TraceCheckUtils]: 128: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,776 INFO L273 TraceCheckUtils]: 129: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,776 INFO L273 TraceCheckUtils]: 130: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,776 INFO L273 TraceCheckUtils]: 131: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,777 INFO L273 TraceCheckUtils]: 132: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,777 INFO L273 TraceCheckUtils]: 133: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,777 INFO L273 TraceCheckUtils]: 134: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,777 INFO L273 TraceCheckUtils]: 135: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:01,777 INFO L273 TraceCheckUtils]: 136: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:01,777 INFO L273 TraceCheckUtils]: 137: Hoare triple {16900#false} assume !(~i~0 < 10000); {16900#false} is VALID [2018-11-23 12:28:01,777 INFO L273 TraceCheckUtils]: 138: Hoare triple {16900#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {16900#false} is VALID [2018-11-23 12:28:01,778 INFO L273 TraceCheckUtils]: 139: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:28:01,778 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16900#false} {16900#false} #74#return; {16900#false} is VALID [2018-11-23 12:28:01,778 INFO L273 TraceCheckUtils]: 141: Hoare triple {16900#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {16900#false} is VALID [2018-11-23 12:28:01,778 INFO L273 TraceCheckUtils]: 142: Hoare triple {16900#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {16900#false} is VALID [2018-11-23 12:28:01,778 INFO L273 TraceCheckUtils]: 143: Hoare triple {16900#false} assume !false; {16900#false} is VALID [2018-11-23 12:28:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:28:01,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:01,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:28:01,818 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:28:01,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:01,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:28:01,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:01,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:28:01,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:28:01,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:28:01,953 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2018-11-23 12:28:02,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:02,649 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-23 12:28:02,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:28:02,649 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:28:02,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:28:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:28:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:28:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:28:02,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 104 transitions. [2018-11-23 12:28:02,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:02,747 INFO L225 Difference]: With dead ends: 152 [2018-11-23 12:28:02,748 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:28:02,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:28:02,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:28:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-23 12:28:02,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:02,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 105 states. [2018-11-23 12:28:02,784 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 105 states. [2018-11-23 12:28:02,785 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 105 states. [2018-11-23 12:28:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:02,786 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:28:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:28:02,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:02,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:02,787 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 106 states. [2018-11-23 12:28:02,787 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 106 states. [2018-11-23 12:28:02,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:02,789 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:28:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:28:02,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:02,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:02,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:02,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 12:28:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-23 12:28:02,792 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2018-11-23 12:28:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:02,793 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-23 12:28:02,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:28:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:28:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 12:28:02,794 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:02,794 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:28:02,794 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:02,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:02,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1736133359, now seen corresponding path program 26 times [2018-11-23 12:28:02,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:02,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:02,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:02,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:02,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:03,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {17953#true} call ULTIMATE.init(); {17953#true} is VALID [2018-11-23 12:28:03,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {17953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17953#true} is VALID [2018-11-23 12:28:03,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:28:03,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17953#true} {17953#true} #66#return; {17953#true} is VALID [2018-11-23 12:28:03,397 INFO L256 TraceCheckUtils]: 4: Hoare triple {17953#true} call #t~ret12 := main(); {17953#true} is VALID [2018-11-23 12:28:03,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {17953#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17955#(= main_~i~1 0)} is VALID [2018-11-23 12:28:03,398 INFO L273 TraceCheckUtils]: 6: Hoare triple {17955#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17955#(= main_~i~1 0)} is VALID [2018-11-23 12:28:03,399 INFO L273 TraceCheckUtils]: 7: Hoare triple {17955#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:03,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {17956#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:03,400 INFO L273 TraceCheckUtils]: 9: Hoare triple {17956#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:03,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {17957#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:03,401 INFO L273 TraceCheckUtils]: 11: Hoare triple {17957#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:03,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {17958#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:03,402 INFO L273 TraceCheckUtils]: 13: Hoare triple {17958#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:03,403 INFO L273 TraceCheckUtils]: 14: Hoare triple {17959#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:03,403 INFO L273 TraceCheckUtils]: 15: Hoare triple {17959#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:03,404 INFO L273 TraceCheckUtils]: 16: Hoare triple {17960#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:03,404 INFO L273 TraceCheckUtils]: 17: Hoare triple {17960#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:03,405 INFO L273 TraceCheckUtils]: 18: Hoare triple {17961#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:03,406 INFO L273 TraceCheckUtils]: 19: Hoare triple {17961#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:03,406 INFO L273 TraceCheckUtils]: 20: Hoare triple {17962#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:03,407 INFO L273 TraceCheckUtils]: 21: Hoare triple {17962#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:03,407 INFO L273 TraceCheckUtils]: 22: Hoare triple {17963#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:03,408 INFO L273 TraceCheckUtils]: 23: Hoare triple {17963#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:03,408 INFO L273 TraceCheckUtils]: 24: Hoare triple {17964#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:03,409 INFO L273 TraceCheckUtils]: 25: Hoare triple {17964#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:03,410 INFO L273 TraceCheckUtils]: 26: Hoare triple {17965#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:03,410 INFO L273 TraceCheckUtils]: 27: Hoare triple {17965#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:03,411 INFO L273 TraceCheckUtils]: 28: Hoare triple {17966#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:03,411 INFO L273 TraceCheckUtils]: 29: Hoare triple {17966#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:03,412 INFO L273 TraceCheckUtils]: 30: Hoare triple {17967#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:03,413 INFO L273 TraceCheckUtils]: 31: Hoare triple {17967#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:03,413 INFO L273 TraceCheckUtils]: 32: Hoare triple {17968#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:03,414 INFO L273 TraceCheckUtils]: 33: Hoare triple {17968#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:03,414 INFO L273 TraceCheckUtils]: 34: Hoare triple {17969#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:03,415 INFO L273 TraceCheckUtils]: 35: Hoare triple {17969#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:03,416 INFO L273 TraceCheckUtils]: 36: Hoare triple {17970#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:03,416 INFO L273 TraceCheckUtils]: 37: Hoare triple {17970#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:03,417 INFO L273 TraceCheckUtils]: 38: Hoare triple {17971#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:03,417 INFO L273 TraceCheckUtils]: 39: Hoare triple {17971#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:03,418 INFO L273 TraceCheckUtils]: 40: Hoare triple {17972#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:03,419 INFO L273 TraceCheckUtils]: 41: Hoare triple {17972#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:03,419 INFO L273 TraceCheckUtils]: 42: Hoare triple {17973#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:03,420 INFO L273 TraceCheckUtils]: 43: Hoare triple {17973#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:03,420 INFO L273 TraceCheckUtils]: 44: Hoare triple {17974#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:03,421 INFO L273 TraceCheckUtils]: 45: Hoare triple {17974#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:03,421 INFO L273 TraceCheckUtils]: 46: Hoare triple {17975#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:03,422 INFO L273 TraceCheckUtils]: 47: Hoare triple {17975#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:03,423 INFO L273 TraceCheckUtils]: 48: Hoare triple {17976#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:03,423 INFO L273 TraceCheckUtils]: 49: Hoare triple {17976#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:03,424 INFO L273 TraceCheckUtils]: 50: Hoare triple {17977#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:03,424 INFO L273 TraceCheckUtils]: 51: Hoare triple {17977#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:03,425 INFO L273 TraceCheckUtils]: 52: Hoare triple {17978#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:03,426 INFO L273 TraceCheckUtils]: 53: Hoare triple {17978#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:03,426 INFO L273 TraceCheckUtils]: 54: Hoare triple {17979#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:03,427 INFO L273 TraceCheckUtils]: 55: Hoare triple {17979#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:03,427 INFO L273 TraceCheckUtils]: 56: Hoare triple {17980#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:03,428 INFO L273 TraceCheckUtils]: 57: Hoare triple {17980#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17981#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:03,429 INFO L273 TraceCheckUtils]: 58: Hoare triple {17981#(<= main_~i~1 26)} assume !(~i~1 < 10000); {17954#false} is VALID [2018-11-23 12:28:03,429 INFO L256 TraceCheckUtils]: 59: Hoare triple {17954#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {17953#true} is VALID [2018-11-23 12:28:03,429 INFO L273 TraceCheckUtils]: 60: Hoare triple {17953#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17953#true} is VALID [2018-11-23 12:28:03,429 INFO L273 TraceCheckUtils]: 61: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,429 INFO L273 TraceCheckUtils]: 62: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,429 INFO L273 TraceCheckUtils]: 63: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,430 INFO L273 TraceCheckUtils]: 64: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,430 INFO L273 TraceCheckUtils]: 65: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,430 INFO L273 TraceCheckUtils]: 66: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,430 INFO L273 TraceCheckUtils]: 67: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,430 INFO L273 TraceCheckUtils]: 68: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,431 INFO L273 TraceCheckUtils]: 69: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,431 INFO L273 TraceCheckUtils]: 70: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,431 INFO L273 TraceCheckUtils]: 71: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,431 INFO L273 TraceCheckUtils]: 72: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,431 INFO L273 TraceCheckUtils]: 73: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,431 INFO L273 TraceCheckUtils]: 74: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,431 INFO L273 TraceCheckUtils]: 75: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,432 INFO L273 TraceCheckUtils]: 76: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,432 INFO L273 TraceCheckUtils]: 77: Hoare triple {17953#true} assume !(~i~0 < 10000); {17953#true} is VALID [2018-11-23 12:28:03,432 INFO L273 TraceCheckUtils]: 78: Hoare triple {17953#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {17953#true} is VALID [2018-11-23 12:28:03,432 INFO L273 TraceCheckUtils]: 79: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:28:03,432 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17953#true} {17954#false} #70#return; {17954#false} is VALID [2018-11-23 12:28:03,432 INFO L273 TraceCheckUtils]: 81: Hoare triple {17954#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); {17954#false} is VALID [2018-11-23 12:28:03,432 INFO L256 TraceCheckUtils]: 82: Hoare triple {17954#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {17953#true} is VALID [2018-11-23 12:28:03,432 INFO L273 TraceCheckUtils]: 83: Hoare triple {17953#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17953#true} is VALID [2018-11-23 12:28:03,432 INFO L273 TraceCheckUtils]: 84: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,432 INFO L273 TraceCheckUtils]: 85: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,433 INFO L273 TraceCheckUtils]: 86: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,433 INFO L273 TraceCheckUtils]: 87: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,433 INFO L273 TraceCheckUtils]: 88: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,433 INFO L273 TraceCheckUtils]: 89: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,433 INFO L273 TraceCheckUtils]: 90: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,433 INFO L273 TraceCheckUtils]: 91: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,433 INFO L273 TraceCheckUtils]: 92: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,433 INFO L273 TraceCheckUtils]: 93: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,433 INFO L273 TraceCheckUtils]: 94: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,434 INFO L273 TraceCheckUtils]: 95: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,434 INFO L273 TraceCheckUtils]: 96: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,434 INFO L273 TraceCheckUtils]: 97: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,434 INFO L273 TraceCheckUtils]: 98: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,434 INFO L273 TraceCheckUtils]: 99: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,434 INFO L273 TraceCheckUtils]: 100: Hoare triple {17953#true} assume !(~i~0 < 10000); {17953#true} is VALID [2018-11-23 12:28:03,434 INFO L273 TraceCheckUtils]: 101: Hoare triple {17953#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {17953#true} is VALID [2018-11-23 12:28:03,434 INFO L273 TraceCheckUtils]: 102: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:28:03,434 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17953#true} {17954#false} #72#return; {17954#false} is VALID [2018-11-23 12:28:03,434 INFO L273 TraceCheckUtils]: 104: Hoare triple {17954#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; {17954#false} is VALID [2018-11-23 12:28:03,435 INFO L273 TraceCheckUtils]: 105: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:03,435 INFO L273 TraceCheckUtils]: 106: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:03,435 INFO L273 TraceCheckUtils]: 107: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:03,435 INFO L273 TraceCheckUtils]: 108: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:03,435 INFO L273 TraceCheckUtils]: 109: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:03,435 INFO L273 TraceCheckUtils]: 110: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:03,435 INFO L273 TraceCheckUtils]: 111: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:03,435 INFO L273 TraceCheckUtils]: 112: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:03,435 INFO L273 TraceCheckUtils]: 113: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:03,436 INFO L273 TraceCheckUtils]: 114: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:03,436 INFO L273 TraceCheckUtils]: 115: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:03,436 INFO L273 TraceCheckUtils]: 116: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:03,436 INFO L273 TraceCheckUtils]: 117: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:03,436 INFO L273 TraceCheckUtils]: 118: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:03,436 INFO L273 TraceCheckUtils]: 119: Hoare triple {17954#false} assume !(~i~2 < 9999); {17954#false} is VALID [2018-11-23 12:28:03,436 INFO L273 TraceCheckUtils]: 120: Hoare triple {17954#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:28:03,436 INFO L256 TraceCheckUtils]: 121: Hoare triple {17954#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {17953#true} is VALID [2018-11-23 12:28:03,436 INFO L273 TraceCheckUtils]: 122: Hoare triple {17953#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17953#true} is VALID [2018-11-23 12:28:03,437 INFO L273 TraceCheckUtils]: 123: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,437 INFO L273 TraceCheckUtils]: 124: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,437 INFO L273 TraceCheckUtils]: 125: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,437 INFO L273 TraceCheckUtils]: 126: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,437 INFO L273 TraceCheckUtils]: 127: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,437 INFO L273 TraceCheckUtils]: 128: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,437 INFO L273 TraceCheckUtils]: 129: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,437 INFO L273 TraceCheckUtils]: 130: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,437 INFO L273 TraceCheckUtils]: 131: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,437 INFO L273 TraceCheckUtils]: 132: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,438 INFO L273 TraceCheckUtils]: 133: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,438 INFO L273 TraceCheckUtils]: 134: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,438 INFO L273 TraceCheckUtils]: 135: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,438 INFO L273 TraceCheckUtils]: 136: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,438 INFO L273 TraceCheckUtils]: 137: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:03,438 INFO L273 TraceCheckUtils]: 138: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:03,438 INFO L273 TraceCheckUtils]: 139: Hoare triple {17953#true} assume !(~i~0 < 10000); {17953#true} is VALID [2018-11-23 12:28:03,438 INFO L273 TraceCheckUtils]: 140: Hoare triple {17953#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {17953#true} is VALID [2018-11-23 12:28:03,438 INFO L273 TraceCheckUtils]: 141: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:28:03,439 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17953#true} {17954#false} #74#return; {17954#false} is VALID [2018-11-23 12:28:03,439 INFO L273 TraceCheckUtils]: 143: Hoare triple {17954#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {17954#false} is VALID [2018-11-23 12:28:03,439 INFO L273 TraceCheckUtils]: 144: Hoare triple {17954#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {17954#false} is VALID [2018-11-23 12:28:03,439 INFO L273 TraceCheckUtils]: 145: Hoare triple {17954#false} assume !false; {17954#false} is VALID [2018-11-23 12:28:03,448 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:28:03,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:03,449 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:28:03,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:03,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:03,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:03,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:04,029 INFO L256 TraceCheckUtils]: 0: Hoare triple {17953#true} call ULTIMATE.init(); {17953#true} is VALID [2018-11-23 12:28:04,030 INFO L273 TraceCheckUtils]: 1: Hoare triple {17953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17953#true} is VALID [2018-11-23 12:28:04,030 INFO L273 TraceCheckUtils]: 2: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:28:04,030 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17953#true} {17953#true} #66#return; {17953#true} is VALID [2018-11-23 12:28:04,030 INFO L256 TraceCheckUtils]: 4: Hoare triple {17953#true} call #t~ret12 := main(); {17953#true} is VALID [2018-11-23 12:28:04,031 INFO L273 TraceCheckUtils]: 5: Hoare triple {17953#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {18000#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:04,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {18000#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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 0)} is VALID [2018-11-23 12:28:04,032 INFO L273 TraceCheckUtils]: 7: Hoare triple {18000#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:04,033 INFO L273 TraceCheckUtils]: 8: Hoare triple {17956#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:04,033 INFO L273 TraceCheckUtils]: 9: Hoare triple {17956#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:04,033 INFO L273 TraceCheckUtils]: 10: Hoare triple {17957#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:04,034 INFO L273 TraceCheckUtils]: 11: Hoare triple {17957#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:04,034 INFO L273 TraceCheckUtils]: 12: Hoare triple {17958#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:04,035 INFO L273 TraceCheckUtils]: 13: Hoare triple {17958#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:04,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {17959#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:04,036 INFO L273 TraceCheckUtils]: 15: Hoare triple {17959#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:04,036 INFO L273 TraceCheckUtils]: 16: Hoare triple {17960#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:04,037 INFO L273 TraceCheckUtils]: 17: Hoare triple {17960#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:04,037 INFO L273 TraceCheckUtils]: 18: Hoare triple {17961#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:04,038 INFO L273 TraceCheckUtils]: 19: Hoare triple {17961#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:04,039 INFO L273 TraceCheckUtils]: 20: Hoare triple {17962#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:04,039 INFO L273 TraceCheckUtils]: 21: Hoare triple {17962#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:04,040 INFO L273 TraceCheckUtils]: 22: Hoare triple {17963#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:04,040 INFO L273 TraceCheckUtils]: 23: Hoare triple {17963#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:04,041 INFO L273 TraceCheckUtils]: 24: Hoare triple {17964#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:04,042 INFO L273 TraceCheckUtils]: 25: Hoare triple {17964#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:04,042 INFO L273 TraceCheckUtils]: 26: Hoare triple {17965#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:04,043 INFO L273 TraceCheckUtils]: 27: Hoare triple {17965#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:04,044 INFO L273 TraceCheckUtils]: 28: Hoare triple {17966#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:04,044 INFO L273 TraceCheckUtils]: 29: Hoare triple {17966#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:04,045 INFO L273 TraceCheckUtils]: 30: Hoare triple {17967#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:04,045 INFO L273 TraceCheckUtils]: 31: Hoare triple {17967#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:04,046 INFO L273 TraceCheckUtils]: 32: Hoare triple {17968#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:04,047 INFO L273 TraceCheckUtils]: 33: Hoare triple {17968#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:04,047 INFO L273 TraceCheckUtils]: 34: Hoare triple {17969#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:04,048 INFO L273 TraceCheckUtils]: 35: Hoare triple {17969#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:04,048 INFO L273 TraceCheckUtils]: 36: Hoare triple {17970#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:04,049 INFO L273 TraceCheckUtils]: 37: Hoare triple {17970#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:04,049 INFO L273 TraceCheckUtils]: 38: Hoare triple {17971#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:04,050 INFO L273 TraceCheckUtils]: 39: Hoare triple {17971#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:04,051 INFO L273 TraceCheckUtils]: 40: Hoare triple {17972#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:04,051 INFO L273 TraceCheckUtils]: 41: Hoare triple {17972#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:04,052 INFO L273 TraceCheckUtils]: 42: Hoare triple {17973#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:04,052 INFO L273 TraceCheckUtils]: 43: Hoare triple {17973#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:04,053 INFO L273 TraceCheckUtils]: 44: Hoare triple {17974#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:04,054 INFO L273 TraceCheckUtils]: 45: Hoare triple {17974#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:04,054 INFO L273 TraceCheckUtils]: 46: Hoare triple {17975#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:04,055 INFO L273 TraceCheckUtils]: 47: Hoare triple {17975#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:04,055 INFO L273 TraceCheckUtils]: 48: Hoare triple {17976#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:04,056 INFO L273 TraceCheckUtils]: 49: Hoare triple {17976#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:04,057 INFO L273 TraceCheckUtils]: 50: Hoare triple {17977#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:04,057 INFO L273 TraceCheckUtils]: 51: Hoare triple {17977#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:04,058 INFO L273 TraceCheckUtils]: 52: Hoare triple {17978#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:04,058 INFO L273 TraceCheckUtils]: 53: Hoare triple {17978#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:04,059 INFO L273 TraceCheckUtils]: 54: Hoare triple {17979#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:04,060 INFO L273 TraceCheckUtils]: 55: Hoare triple {17979#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:04,060 INFO L273 TraceCheckUtils]: 56: Hoare triple {17980#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:04,061 INFO L273 TraceCheckUtils]: 57: Hoare triple {17980#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17981#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:04,061 INFO L273 TraceCheckUtils]: 58: Hoare triple {17981#(<= main_~i~1 26)} assume !(~i~1 < 10000); {17954#false} is VALID [2018-11-23 12:28:04,062 INFO L256 TraceCheckUtils]: 59: Hoare triple {17954#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {17954#false} is VALID [2018-11-23 12:28:04,062 INFO L273 TraceCheckUtils]: 60: Hoare triple {17954#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17954#false} is VALID [2018-11-23 12:28:04,062 INFO L273 TraceCheckUtils]: 61: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,062 INFO L273 TraceCheckUtils]: 62: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,062 INFO L273 TraceCheckUtils]: 63: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,062 INFO L273 TraceCheckUtils]: 64: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,063 INFO L273 TraceCheckUtils]: 65: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,063 INFO L273 TraceCheckUtils]: 66: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,063 INFO L273 TraceCheckUtils]: 67: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,063 INFO L273 TraceCheckUtils]: 68: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,063 INFO L273 TraceCheckUtils]: 69: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,063 INFO L273 TraceCheckUtils]: 70: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,064 INFO L273 TraceCheckUtils]: 71: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,064 INFO L273 TraceCheckUtils]: 72: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,064 INFO L273 TraceCheckUtils]: 73: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,064 INFO L273 TraceCheckUtils]: 74: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,064 INFO L273 TraceCheckUtils]: 75: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,064 INFO L273 TraceCheckUtils]: 76: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,065 INFO L273 TraceCheckUtils]: 77: Hoare triple {17954#false} assume !(~i~0 < 10000); {17954#false} is VALID [2018-11-23 12:28:04,065 INFO L273 TraceCheckUtils]: 78: Hoare triple {17954#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {17954#false} is VALID [2018-11-23 12:28:04,065 INFO L273 TraceCheckUtils]: 79: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:28:04,065 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17954#false} {17954#false} #70#return; {17954#false} is VALID [2018-11-23 12:28:04,065 INFO L273 TraceCheckUtils]: 81: Hoare triple {17954#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); {17954#false} is VALID [2018-11-23 12:28:04,065 INFO L256 TraceCheckUtils]: 82: Hoare triple {17954#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {17954#false} is VALID [2018-11-23 12:28:04,066 INFO L273 TraceCheckUtils]: 83: Hoare triple {17954#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17954#false} is VALID [2018-11-23 12:28:04,066 INFO L273 TraceCheckUtils]: 84: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,066 INFO L273 TraceCheckUtils]: 85: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,066 INFO L273 TraceCheckUtils]: 86: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,066 INFO L273 TraceCheckUtils]: 87: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,066 INFO L273 TraceCheckUtils]: 88: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,066 INFO L273 TraceCheckUtils]: 89: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,066 INFO L273 TraceCheckUtils]: 90: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,066 INFO L273 TraceCheckUtils]: 91: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,066 INFO L273 TraceCheckUtils]: 92: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,067 INFO L273 TraceCheckUtils]: 93: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,067 INFO L273 TraceCheckUtils]: 94: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,067 INFO L273 TraceCheckUtils]: 95: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,067 INFO L273 TraceCheckUtils]: 96: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,067 INFO L273 TraceCheckUtils]: 97: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,067 INFO L273 TraceCheckUtils]: 98: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,067 INFO L273 TraceCheckUtils]: 99: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,067 INFO L273 TraceCheckUtils]: 100: Hoare triple {17954#false} assume !(~i~0 < 10000); {17954#false} is VALID [2018-11-23 12:28:04,067 INFO L273 TraceCheckUtils]: 101: Hoare triple {17954#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {17954#false} is VALID [2018-11-23 12:28:04,068 INFO L273 TraceCheckUtils]: 102: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:28:04,068 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17954#false} {17954#false} #72#return; {17954#false} is VALID [2018-11-23 12:28:04,068 INFO L273 TraceCheckUtils]: 104: Hoare triple {17954#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; {17954#false} is VALID [2018-11-23 12:28:04,068 INFO L273 TraceCheckUtils]: 105: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:04,068 INFO L273 TraceCheckUtils]: 106: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:04,068 INFO L273 TraceCheckUtils]: 107: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:04,068 INFO L273 TraceCheckUtils]: 108: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:04,068 INFO L273 TraceCheckUtils]: 109: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:04,068 INFO L273 TraceCheckUtils]: 110: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:04,068 INFO L273 TraceCheckUtils]: 111: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:04,069 INFO L273 TraceCheckUtils]: 112: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:04,069 INFO L273 TraceCheckUtils]: 113: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:04,069 INFO L273 TraceCheckUtils]: 114: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:04,069 INFO L273 TraceCheckUtils]: 115: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:04,069 INFO L273 TraceCheckUtils]: 116: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:04,069 INFO L273 TraceCheckUtils]: 117: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:04,069 INFO L273 TraceCheckUtils]: 118: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:04,069 INFO L273 TraceCheckUtils]: 119: Hoare triple {17954#false} assume !(~i~2 < 9999); {17954#false} is VALID [2018-11-23 12:28:04,069 INFO L273 TraceCheckUtils]: 120: Hoare triple {17954#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:28:04,070 INFO L256 TraceCheckUtils]: 121: Hoare triple {17954#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {17954#false} is VALID [2018-11-23 12:28:04,070 INFO L273 TraceCheckUtils]: 122: Hoare triple {17954#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17954#false} is VALID [2018-11-23 12:28:04,070 INFO L273 TraceCheckUtils]: 123: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,070 INFO L273 TraceCheckUtils]: 124: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,070 INFO L273 TraceCheckUtils]: 125: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,070 INFO L273 TraceCheckUtils]: 126: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,070 INFO L273 TraceCheckUtils]: 127: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,070 INFO L273 TraceCheckUtils]: 128: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,070 INFO L273 TraceCheckUtils]: 129: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,070 INFO L273 TraceCheckUtils]: 130: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,071 INFO L273 TraceCheckUtils]: 131: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,071 INFO L273 TraceCheckUtils]: 132: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,071 INFO L273 TraceCheckUtils]: 133: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,071 INFO L273 TraceCheckUtils]: 134: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,071 INFO L273 TraceCheckUtils]: 135: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,071 INFO L273 TraceCheckUtils]: 136: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,071 INFO L273 TraceCheckUtils]: 137: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:04,071 INFO L273 TraceCheckUtils]: 138: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:04,071 INFO L273 TraceCheckUtils]: 139: Hoare triple {17954#false} assume !(~i~0 < 10000); {17954#false} is VALID [2018-11-23 12:28:04,071 INFO L273 TraceCheckUtils]: 140: Hoare triple {17954#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {17954#false} is VALID [2018-11-23 12:28:04,072 INFO L273 TraceCheckUtils]: 141: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:28:04,072 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17954#false} {17954#false} #74#return; {17954#false} is VALID [2018-11-23 12:28:04,072 INFO L273 TraceCheckUtils]: 143: Hoare triple {17954#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {17954#false} is VALID [2018-11-23 12:28:04,072 INFO L273 TraceCheckUtils]: 144: Hoare triple {17954#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {17954#false} is VALID [2018-11-23 12:28:04,072 INFO L273 TraceCheckUtils]: 145: Hoare triple {17954#false} assume !false; {17954#false} is VALID [2018-11-23 12:28:04,082 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:28:04,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:04,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:28:04,103 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:28:04,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:04,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:28:04,189 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:28:04,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:28:04,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:28:04,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:28:04,191 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2018-11-23 12:28:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:04,950 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-11-23 12:28:04,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:28:04,950 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:28:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:28:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:28:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:28:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:28:04,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 106 transitions. [2018-11-23 12:28:05,117 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:28:05,120 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:28:05,120 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:28:05,121 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:28:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:28:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-23 12:28:05,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:05,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-23 12:28:05,196 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-23 12:28:05,196 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-23 12:28:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:05,198 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:28:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:28:05,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:05,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:05,199 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-23 12:28:05,199 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-23 12:28:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:05,201 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:28:05,201 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:28:05,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:05,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:05,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:05,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:28:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-23 12:28:05,204 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2018-11-23 12:28:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:05,204 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-23 12:28:05,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:28:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:28:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:28:05,205 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:05,206 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:28:05,206 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:05,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:05,206 INFO L82 PathProgramCache]: Analyzing trace with hash 570812147, now seen corresponding path program 27 times [2018-11-23 12:28:05,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:05,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:05,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:05,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:05,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:05,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {19024#true} call ULTIMATE.init(); {19024#true} is VALID [2018-11-23 12:28:05,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {19024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19024#true} is VALID [2018-11-23 12:28:05,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:05,834 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19024#true} {19024#true} #66#return; {19024#true} is VALID [2018-11-23 12:28:05,834 INFO L256 TraceCheckUtils]: 4: Hoare triple {19024#true} call #t~ret12 := main(); {19024#true} is VALID [2018-11-23 12:28:05,834 INFO L273 TraceCheckUtils]: 5: Hoare triple {19024#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19026#(= main_~i~1 0)} is VALID [2018-11-23 12:28:05,834 INFO L273 TraceCheckUtils]: 6: Hoare triple {19026#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19026#(= main_~i~1 0)} is VALID [2018-11-23 12:28:05,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {19026#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19027#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:05,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {19027#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19027#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:05,836 INFO L273 TraceCheckUtils]: 9: Hoare triple {19027#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19028#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:05,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {19028#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19028#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:05,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {19028#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19029#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:05,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {19029#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19029#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:05,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {19029#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19030#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:05,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {19030#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19030#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:05,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {19030#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19031#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:05,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {19031#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19031#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:05,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {19031#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19032#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:05,841 INFO L273 TraceCheckUtils]: 18: Hoare triple {19032#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19032#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:05,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {19032#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19033#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:05,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {19033#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19033#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:05,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {19033#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19034#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:05,844 INFO L273 TraceCheckUtils]: 22: Hoare triple {19034#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19034#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:05,844 INFO L273 TraceCheckUtils]: 23: Hoare triple {19034#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19035#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:05,845 INFO L273 TraceCheckUtils]: 24: Hoare triple {19035#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19035#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:05,845 INFO L273 TraceCheckUtils]: 25: Hoare triple {19035#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19036#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:05,846 INFO L273 TraceCheckUtils]: 26: Hoare triple {19036#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19036#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:05,847 INFO L273 TraceCheckUtils]: 27: Hoare triple {19036#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19037#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:05,847 INFO L273 TraceCheckUtils]: 28: Hoare triple {19037#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19037#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:05,848 INFO L273 TraceCheckUtils]: 29: Hoare triple {19037#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19038#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:05,849 INFO L273 TraceCheckUtils]: 30: Hoare triple {19038#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19038#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:05,849 INFO L273 TraceCheckUtils]: 31: Hoare triple {19038#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19039#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:05,850 INFO L273 TraceCheckUtils]: 32: Hoare triple {19039#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19039#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:05,850 INFO L273 TraceCheckUtils]: 33: Hoare triple {19039#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19040#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:05,851 INFO L273 TraceCheckUtils]: 34: Hoare triple {19040#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19040#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:05,852 INFO L273 TraceCheckUtils]: 35: Hoare triple {19040#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19041#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:05,852 INFO L273 TraceCheckUtils]: 36: Hoare triple {19041#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19041#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:05,853 INFO L273 TraceCheckUtils]: 37: Hoare triple {19041#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19042#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:05,853 INFO L273 TraceCheckUtils]: 38: Hoare triple {19042#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19042#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:05,854 INFO L273 TraceCheckUtils]: 39: Hoare triple {19042#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19043#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:05,855 INFO L273 TraceCheckUtils]: 40: Hoare triple {19043#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19043#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:05,855 INFO L273 TraceCheckUtils]: 41: Hoare triple {19043#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19044#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:05,856 INFO L273 TraceCheckUtils]: 42: Hoare triple {19044#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19044#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:05,857 INFO L273 TraceCheckUtils]: 43: Hoare triple {19044#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19045#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:05,857 INFO L273 TraceCheckUtils]: 44: Hoare triple {19045#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19045#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:05,858 INFO L273 TraceCheckUtils]: 45: Hoare triple {19045#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19046#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:05,858 INFO L273 TraceCheckUtils]: 46: Hoare triple {19046#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19046#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:05,859 INFO L273 TraceCheckUtils]: 47: Hoare triple {19046#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19047#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:05,860 INFO L273 TraceCheckUtils]: 48: Hoare triple {19047#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19047#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:05,860 INFO L273 TraceCheckUtils]: 49: Hoare triple {19047#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19048#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:05,861 INFO L273 TraceCheckUtils]: 50: Hoare triple {19048#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19048#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:05,862 INFO L273 TraceCheckUtils]: 51: Hoare triple {19048#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19049#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:05,862 INFO L273 TraceCheckUtils]: 52: Hoare triple {19049#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19049#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:05,863 INFO L273 TraceCheckUtils]: 53: Hoare triple {19049#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19050#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:05,863 INFO L273 TraceCheckUtils]: 54: Hoare triple {19050#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19050#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:05,864 INFO L273 TraceCheckUtils]: 55: Hoare triple {19050#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19051#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:05,865 INFO L273 TraceCheckUtils]: 56: Hoare triple {19051#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19051#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:05,865 INFO L273 TraceCheckUtils]: 57: Hoare triple {19051#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19052#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:05,866 INFO L273 TraceCheckUtils]: 58: Hoare triple {19052#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19052#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:05,867 INFO L273 TraceCheckUtils]: 59: Hoare triple {19052#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19053#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:05,867 INFO L273 TraceCheckUtils]: 60: Hoare triple {19053#(<= main_~i~1 27)} assume !(~i~1 < 10000); {19025#false} is VALID [2018-11-23 12:28:05,868 INFO L256 TraceCheckUtils]: 61: Hoare triple {19025#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:28:05,868 INFO L273 TraceCheckUtils]: 62: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19024#true} is VALID [2018-11-23 12:28:05,868 INFO L273 TraceCheckUtils]: 63: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,868 INFO L273 TraceCheckUtils]: 64: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,868 INFO L273 TraceCheckUtils]: 65: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,868 INFO L273 TraceCheckUtils]: 66: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,869 INFO L273 TraceCheckUtils]: 67: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,869 INFO L273 TraceCheckUtils]: 68: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,869 INFO L273 TraceCheckUtils]: 69: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,869 INFO L273 TraceCheckUtils]: 70: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,869 INFO L273 TraceCheckUtils]: 71: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,870 INFO L273 TraceCheckUtils]: 72: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,870 INFO L273 TraceCheckUtils]: 73: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,870 INFO L273 TraceCheckUtils]: 74: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,870 INFO L273 TraceCheckUtils]: 75: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,870 INFO L273 TraceCheckUtils]: 76: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,870 INFO L273 TraceCheckUtils]: 77: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,870 INFO L273 TraceCheckUtils]: 78: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,870 INFO L273 TraceCheckUtils]: 79: Hoare triple {19024#true} assume !(~i~0 < 10000); {19024#true} is VALID [2018-11-23 12:28:05,870 INFO L273 TraceCheckUtils]: 80: Hoare triple {19024#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:28:05,871 INFO L273 TraceCheckUtils]: 81: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:05,871 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19024#true} {19025#false} #70#return; {19025#false} is VALID [2018-11-23 12:28:05,871 INFO L273 TraceCheckUtils]: 83: Hoare triple {19025#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); {19025#false} is VALID [2018-11-23 12:28:05,871 INFO L256 TraceCheckUtils]: 84: Hoare triple {19025#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:28:05,871 INFO L273 TraceCheckUtils]: 85: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19024#true} is VALID [2018-11-23 12:28:05,871 INFO L273 TraceCheckUtils]: 86: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,871 INFO L273 TraceCheckUtils]: 87: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,871 INFO L273 TraceCheckUtils]: 88: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,871 INFO L273 TraceCheckUtils]: 89: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,872 INFO L273 TraceCheckUtils]: 90: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,872 INFO L273 TraceCheckUtils]: 91: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,872 INFO L273 TraceCheckUtils]: 92: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,872 INFO L273 TraceCheckUtils]: 93: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,872 INFO L273 TraceCheckUtils]: 94: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,872 INFO L273 TraceCheckUtils]: 95: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,872 INFO L273 TraceCheckUtils]: 96: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,872 INFO L273 TraceCheckUtils]: 97: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,872 INFO L273 TraceCheckUtils]: 98: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,872 INFO L273 TraceCheckUtils]: 99: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,873 INFO L273 TraceCheckUtils]: 100: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,873 INFO L273 TraceCheckUtils]: 101: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,873 INFO L273 TraceCheckUtils]: 102: Hoare triple {19024#true} assume !(~i~0 < 10000); {19024#true} is VALID [2018-11-23 12:28:05,873 INFO L273 TraceCheckUtils]: 103: Hoare triple {19024#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:28:05,873 INFO L273 TraceCheckUtils]: 104: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:05,873 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19024#true} {19025#false} #72#return; {19025#false} is VALID [2018-11-23 12:28:05,873 INFO L273 TraceCheckUtils]: 106: Hoare triple {19025#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; {19025#false} is VALID [2018-11-23 12:28:05,873 INFO L273 TraceCheckUtils]: 107: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19025#false} is VALID [2018-11-23 12:28:05,873 INFO L273 TraceCheckUtils]: 108: Hoare triple {19025#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19025#false} is VALID [2018-11-23 12:28:05,874 INFO L273 TraceCheckUtils]: 109: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19025#false} is VALID [2018-11-23 12:28:05,874 INFO L273 TraceCheckUtils]: 110: Hoare triple {19025#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19025#false} is VALID [2018-11-23 12:28:05,874 INFO L273 TraceCheckUtils]: 111: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19025#false} is VALID [2018-11-23 12:28:05,874 INFO L273 TraceCheckUtils]: 112: Hoare triple {19025#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19025#false} is VALID [2018-11-23 12:28:05,874 INFO L273 TraceCheckUtils]: 113: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19025#false} is VALID [2018-11-23 12:28:05,874 INFO L273 TraceCheckUtils]: 114: Hoare triple {19025#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19025#false} is VALID [2018-11-23 12:28:05,874 INFO L273 TraceCheckUtils]: 115: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19025#false} is VALID [2018-11-23 12:28:05,874 INFO L273 TraceCheckUtils]: 116: Hoare triple {19025#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19025#false} is VALID [2018-11-23 12:28:05,874 INFO L273 TraceCheckUtils]: 117: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19025#false} is VALID [2018-11-23 12:28:05,874 INFO L273 TraceCheckUtils]: 118: Hoare triple {19025#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19025#false} is VALID [2018-11-23 12:28:05,875 INFO L273 TraceCheckUtils]: 119: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19025#false} is VALID [2018-11-23 12:28:05,875 INFO L273 TraceCheckUtils]: 120: Hoare triple {19025#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19025#false} is VALID [2018-11-23 12:28:05,875 INFO L273 TraceCheckUtils]: 121: Hoare triple {19025#false} assume !(~i~2 < 9999); {19025#false} is VALID [2018-11-23 12:28:05,875 INFO L273 TraceCheckUtils]: 122: Hoare triple {19025#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:28:05,875 INFO L256 TraceCheckUtils]: 123: Hoare triple {19025#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:28:05,875 INFO L273 TraceCheckUtils]: 124: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19024#true} is VALID [2018-11-23 12:28:05,875 INFO L273 TraceCheckUtils]: 125: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,875 INFO L273 TraceCheckUtils]: 126: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,875 INFO L273 TraceCheckUtils]: 127: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,876 INFO L273 TraceCheckUtils]: 128: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,876 INFO L273 TraceCheckUtils]: 129: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,876 INFO L273 TraceCheckUtils]: 130: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,876 INFO L273 TraceCheckUtils]: 131: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,876 INFO L273 TraceCheckUtils]: 132: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,876 INFO L273 TraceCheckUtils]: 133: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,876 INFO L273 TraceCheckUtils]: 134: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,876 INFO L273 TraceCheckUtils]: 135: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,876 INFO L273 TraceCheckUtils]: 136: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,876 INFO L273 TraceCheckUtils]: 137: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,877 INFO L273 TraceCheckUtils]: 138: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,877 INFO L273 TraceCheckUtils]: 139: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:05,877 INFO L273 TraceCheckUtils]: 140: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:05,877 INFO L273 TraceCheckUtils]: 141: Hoare triple {19024#true} assume !(~i~0 < 10000); {19024#true} is VALID [2018-11-23 12:28:05,877 INFO L273 TraceCheckUtils]: 142: Hoare triple {19024#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:28:05,877 INFO L273 TraceCheckUtils]: 143: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:05,877 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19024#true} {19025#false} #74#return; {19025#false} is VALID [2018-11-23 12:28:05,877 INFO L273 TraceCheckUtils]: 145: Hoare triple {19025#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {19025#false} is VALID [2018-11-23 12:28:05,877 INFO L273 TraceCheckUtils]: 146: Hoare triple {19025#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {19025#false} is VALID [2018-11-23 12:28:05,878 INFO L273 TraceCheckUtils]: 147: Hoare triple {19025#false} assume !false; {19025#false} is VALID [2018-11-23 12:28:05,888 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:28:05,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:05,888 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:28:05,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:06,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:28:06,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:06,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:06,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {19024#true} call ULTIMATE.init(); {19024#true} is VALID [2018-11-23 12:28:06,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {19024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19024#true} is VALID [2018-11-23 12:28:06,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:06,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19024#true} {19024#true} #66#return; {19024#true} is VALID [2018-11-23 12:28:06,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {19024#true} call #t~ret12 := main(); {19024#true} is VALID [2018-11-23 12:28:06,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {19024#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19024#true} is VALID [2018-11-23 12:28:06,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,394 INFO L273 TraceCheckUtils]: 17: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,394 INFO L273 TraceCheckUtils]: 18: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,394 INFO L273 TraceCheckUtils]: 19: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,394 INFO L273 TraceCheckUtils]: 20: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,395 INFO L273 TraceCheckUtils]: 23: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,395 INFO L273 TraceCheckUtils]: 24: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,395 INFO L273 TraceCheckUtils]: 25: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,395 INFO L273 TraceCheckUtils]: 26: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,395 INFO L273 TraceCheckUtils]: 27: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,395 INFO L273 TraceCheckUtils]: 28: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,395 INFO L273 TraceCheckUtils]: 29: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,395 INFO L273 TraceCheckUtils]: 30: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,396 INFO L273 TraceCheckUtils]: 31: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,396 INFO L273 TraceCheckUtils]: 32: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,396 INFO L273 TraceCheckUtils]: 33: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,396 INFO L273 TraceCheckUtils]: 34: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,396 INFO L273 TraceCheckUtils]: 35: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,396 INFO L273 TraceCheckUtils]: 36: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,396 INFO L273 TraceCheckUtils]: 37: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,396 INFO L273 TraceCheckUtils]: 38: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,396 INFO L273 TraceCheckUtils]: 39: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,396 INFO L273 TraceCheckUtils]: 40: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,397 INFO L273 TraceCheckUtils]: 41: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,397 INFO L273 TraceCheckUtils]: 42: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,397 INFO L273 TraceCheckUtils]: 43: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,397 INFO L273 TraceCheckUtils]: 44: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,397 INFO L273 TraceCheckUtils]: 45: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,397 INFO L273 TraceCheckUtils]: 46: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,397 INFO L273 TraceCheckUtils]: 47: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,397 INFO L273 TraceCheckUtils]: 48: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,397 INFO L273 TraceCheckUtils]: 49: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,398 INFO L273 TraceCheckUtils]: 50: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,398 INFO L273 TraceCheckUtils]: 51: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,398 INFO L273 TraceCheckUtils]: 52: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,398 INFO L273 TraceCheckUtils]: 53: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,398 INFO L273 TraceCheckUtils]: 54: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,398 INFO L273 TraceCheckUtils]: 55: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,398 INFO L273 TraceCheckUtils]: 56: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,398 INFO L273 TraceCheckUtils]: 57: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,398 INFO L273 TraceCheckUtils]: 58: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:06,399 INFO L273 TraceCheckUtils]: 59: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:06,399 INFO L273 TraceCheckUtils]: 60: Hoare triple {19024#true} assume !(~i~1 < 10000); {19024#true} is VALID [2018-11-23 12:28:06,399 INFO L256 TraceCheckUtils]: 61: Hoare triple {19024#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:28:06,399 INFO L273 TraceCheckUtils]: 62: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19024#true} is VALID [2018-11-23 12:28:06,399 INFO L273 TraceCheckUtils]: 63: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,399 INFO L273 TraceCheckUtils]: 64: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,399 INFO L273 TraceCheckUtils]: 65: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,399 INFO L273 TraceCheckUtils]: 66: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,399 INFO L273 TraceCheckUtils]: 67: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,399 INFO L273 TraceCheckUtils]: 68: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,400 INFO L273 TraceCheckUtils]: 69: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,400 INFO L273 TraceCheckUtils]: 70: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,400 INFO L273 TraceCheckUtils]: 71: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,400 INFO L273 TraceCheckUtils]: 72: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,400 INFO L273 TraceCheckUtils]: 73: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,400 INFO L273 TraceCheckUtils]: 74: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,400 INFO L273 TraceCheckUtils]: 75: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,400 INFO L273 TraceCheckUtils]: 76: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,400 INFO L273 TraceCheckUtils]: 77: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,401 INFO L273 TraceCheckUtils]: 78: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,401 INFO L273 TraceCheckUtils]: 79: Hoare triple {19024#true} assume !(~i~0 < 10000); {19024#true} is VALID [2018-11-23 12:28:06,401 INFO L273 TraceCheckUtils]: 80: Hoare triple {19024#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:28:06,401 INFO L273 TraceCheckUtils]: 81: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:06,401 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19024#true} {19024#true} #70#return; {19024#true} is VALID [2018-11-23 12:28:06,401 INFO L273 TraceCheckUtils]: 83: Hoare triple {19024#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); {19024#true} is VALID [2018-11-23 12:28:06,401 INFO L256 TraceCheckUtils]: 84: Hoare triple {19024#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:28:06,401 INFO L273 TraceCheckUtils]: 85: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19024#true} is VALID [2018-11-23 12:28:06,401 INFO L273 TraceCheckUtils]: 86: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,402 INFO L273 TraceCheckUtils]: 87: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,402 INFO L273 TraceCheckUtils]: 88: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,402 INFO L273 TraceCheckUtils]: 89: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,402 INFO L273 TraceCheckUtils]: 90: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,402 INFO L273 TraceCheckUtils]: 91: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,402 INFO L273 TraceCheckUtils]: 92: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,402 INFO L273 TraceCheckUtils]: 93: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,402 INFO L273 TraceCheckUtils]: 94: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,402 INFO L273 TraceCheckUtils]: 95: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,402 INFO L273 TraceCheckUtils]: 96: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,403 INFO L273 TraceCheckUtils]: 97: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,403 INFO L273 TraceCheckUtils]: 98: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,403 INFO L273 TraceCheckUtils]: 99: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,403 INFO L273 TraceCheckUtils]: 100: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:06,403 INFO L273 TraceCheckUtils]: 101: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:06,403 INFO L273 TraceCheckUtils]: 102: Hoare triple {19024#true} assume !(~i~0 < 10000); {19024#true} is VALID [2018-11-23 12:28:06,403 INFO L273 TraceCheckUtils]: 103: Hoare triple {19024#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:28:06,403 INFO L273 TraceCheckUtils]: 104: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:06,403 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19024#true} {19024#true} #72#return; {19024#true} is VALID [2018-11-23 12:28:06,404 INFO L273 TraceCheckUtils]: 106: Hoare triple {19024#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; {19375#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:06,404 INFO L273 TraceCheckUtils]: 107: Hoare triple {19375#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19375#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:06,405 INFO L273 TraceCheckUtils]: 108: Hoare triple {19375#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19382#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:06,405 INFO L273 TraceCheckUtils]: 109: Hoare triple {19382#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19382#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:06,406 INFO L273 TraceCheckUtils]: 110: Hoare triple {19382#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19389#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:06,406 INFO L273 TraceCheckUtils]: 111: Hoare triple {19389#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19389#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:06,406 INFO L273 TraceCheckUtils]: 112: Hoare triple {19389#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19396#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:06,407 INFO L273 TraceCheckUtils]: 113: Hoare triple {19396#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19396#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:06,407 INFO L273 TraceCheckUtils]: 114: Hoare triple {19396#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19403#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:06,408 INFO L273 TraceCheckUtils]: 115: Hoare triple {19403#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19403#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:06,409 INFO L273 TraceCheckUtils]: 116: Hoare triple {19403#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19410#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:06,409 INFO L273 TraceCheckUtils]: 117: Hoare triple {19410#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19410#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:06,410 INFO L273 TraceCheckUtils]: 118: Hoare triple {19410#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19417#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:06,410 INFO L273 TraceCheckUtils]: 119: Hoare triple {19417#(<= main_~i~2 6)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19417#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:06,411 INFO L273 TraceCheckUtils]: 120: Hoare triple {19417#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19424#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:06,412 INFO L273 TraceCheckUtils]: 121: Hoare triple {19424#(<= main_~i~2 7)} assume !(~i~2 < 9999); {19025#false} is VALID [2018-11-23 12:28:06,412 INFO L273 TraceCheckUtils]: 122: Hoare triple {19025#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:28:06,412 INFO L256 TraceCheckUtils]: 123: Hoare triple {19025#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {19025#false} is VALID [2018-11-23 12:28:06,412 INFO L273 TraceCheckUtils]: 124: Hoare triple {19025#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19025#false} is VALID [2018-11-23 12:28:06,412 INFO L273 TraceCheckUtils]: 125: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:06,413 INFO L273 TraceCheckUtils]: 126: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:06,413 INFO L273 TraceCheckUtils]: 127: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:06,413 INFO L273 TraceCheckUtils]: 128: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:06,413 INFO L273 TraceCheckUtils]: 129: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:06,413 INFO L273 TraceCheckUtils]: 130: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:06,414 INFO L273 TraceCheckUtils]: 131: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:06,414 INFO L273 TraceCheckUtils]: 132: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:06,414 INFO L273 TraceCheckUtils]: 133: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:06,415 INFO L273 TraceCheckUtils]: 134: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:06,415 INFO L273 TraceCheckUtils]: 135: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:06,415 INFO L273 TraceCheckUtils]: 136: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:06,415 INFO L273 TraceCheckUtils]: 137: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:06,416 INFO L273 TraceCheckUtils]: 138: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:06,416 INFO L273 TraceCheckUtils]: 139: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:06,416 INFO L273 TraceCheckUtils]: 140: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:06,416 INFO L273 TraceCheckUtils]: 141: Hoare triple {19025#false} assume !(~i~0 < 10000); {19025#false} is VALID [2018-11-23 12:28:06,416 INFO L273 TraceCheckUtils]: 142: Hoare triple {19025#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {19025#false} is VALID [2018-11-23 12:28:06,417 INFO L273 TraceCheckUtils]: 143: Hoare triple {19025#false} assume true; {19025#false} is VALID [2018-11-23 12:28:06,417 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19025#false} {19025#false} #74#return; {19025#false} is VALID [2018-11-23 12:28:06,417 INFO L273 TraceCheckUtils]: 145: Hoare triple {19025#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {19025#false} is VALID [2018-11-23 12:28:06,417 INFO L273 TraceCheckUtils]: 146: Hoare triple {19025#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {19025#false} is VALID [2018-11-23 12:28:06,417 INFO L273 TraceCheckUtils]: 147: Hoare triple {19025#false} assume !false; {19025#false} is VALID [2018-11-23 12:28:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2018-11-23 12:28:06,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:06,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2018-11-23 12:28:06,450 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:28:06,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:06,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:28:06,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:06,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:28:06,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:28:06,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:28:06,834 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2018-11-23 12:28:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:07,907 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-11-23 12:28:07,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:28:07,907 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:28:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:07,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:28:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:28:07,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:28:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:28:07,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 125 transitions. [2018-11-23 12:28:08,080 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:08,082 INFO L225 Difference]: With dead ends: 159 [2018-11-23 12:28:08,083 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 12:28:08,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:28:08,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 12:28:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-23 12:28:08,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:08,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 111 states. [2018-11-23 12:28:08,127 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 111 states. [2018-11-23 12:28:08,127 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 111 states. [2018-11-23 12:28:08,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:08,129 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:28:08,130 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:28:08,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:08,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:08,130 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 113 states. [2018-11-23 12:28:08,130 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 113 states. [2018-11-23 12:28:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:08,132 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:28:08,132 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:28:08,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:08,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:08,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:08,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 12:28:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-11-23 12:28:08,134 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2018-11-23 12:28:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:08,134 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-11-23 12:28:08,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:28:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-11-23 12:28:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-23 12:28:08,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:08,136 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 24, 24, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:08,136 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:08,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:08,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1027259565, now seen corresponding path program 28 times [2018-11-23 12:28:08,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:08,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:08,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:08,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:08,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:09,151 INFO L256 TraceCheckUtils]: 0: Hoare triple {20132#true} call ULTIMATE.init(); {20132#true} is VALID [2018-11-23 12:28:09,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {20132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20132#true} is VALID [2018-11-23 12:28:09,152 INFO L273 TraceCheckUtils]: 2: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:09,152 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20132#true} {20132#true} #66#return; {20132#true} is VALID [2018-11-23 12:28:09,153 INFO L256 TraceCheckUtils]: 4: Hoare triple {20132#true} call #t~ret12 := main(); {20132#true} is VALID [2018-11-23 12:28:09,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {20132#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20134#(= main_~i~1 0)} is VALID [2018-11-23 12:28:09,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {20134#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20134#(= main_~i~1 0)} is VALID [2018-11-23 12:28:09,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {20134#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20135#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:09,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {20135#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20135#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:09,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {20135#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20136#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:09,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {20136#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20136#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:09,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {20136#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20137#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:09,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {20137#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20137#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:09,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {20137#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20138#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:09,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {20138#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20138#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:09,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {20138#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20139#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:09,163 INFO L273 TraceCheckUtils]: 16: Hoare triple {20139#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20139#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:09,164 INFO L273 TraceCheckUtils]: 17: Hoare triple {20139#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20140#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:09,164 INFO L273 TraceCheckUtils]: 18: Hoare triple {20140#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20140#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:09,165 INFO L273 TraceCheckUtils]: 19: Hoare triple {20140#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20141#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:09,165 INFO L273 TraceCheckUtils]: 20: Hoare triple {20141#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20141#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:09,166 INFO L273 TraceCheckUtils]: 21: Hoare triple {20141#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20142#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:09,167 INFO L273 TraceCheckUtils]: 22: Hoare triple {20142#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20142#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:09,167 INFO L273 TraceCheckUtils]: 23: Hoare triple {20142#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20143#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:09,168 INFO L273 TraceCheckUtils]: 24: Hoare triple {20143#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20143#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:09,169 INFO L273 TraceCheckUtils]: 25: Hoare triple {20143#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20144#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:09,169 INFO L273 TraceCheckUtils]: 26: Hoare triple {20144#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20144#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:09,170 INFO L273 TraceCheckUtils]: 27: Hoare triple {20144#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20145#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:09,170 INFO L273 TraceCheckUtils]: 28: Hoare triple {20145#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20145#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:09,171 INFO L273 TraceCheckUtils]: 29: Hoare triple {20145#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20146#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:09,172 INFO L273 TraceCheckUtils]: 30: Hoare triple {20146#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20146#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:09,172 INFO L273 TraceCheckUtils]: 31: Hoare triple {20146#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20147#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:09,173 INFO L273 TraceCheckUtils]: 32: Hoare triple {20147#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20147#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:09,174 INFO L273 TraceCheckUtils]: 33: Hoare triple {20147#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20148#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:09,174 INFO L273 TraceCheckUtils]: 34: Hoare triple {20148#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20148#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:09,175 INFO L273 TraceCheckUtils]: 35: Hoare triple {20148#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20149#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:09,175 INFO L273 TraceCheckUtils]: 36: Hoare triple {20149#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20149#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:09,176 INFO L273 TraceCheckUtils]: 37: Hoare triple {20149#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20150#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:09,177 INFO L273 TraceCheckUtils]: 38: Hoare triple {20150#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20150#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:09,177 INFO L273 TraceCheckUtils]: 39: Hoare triple {20150#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20151#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:09,178 INFO L273 TraceCheckUtils]: 40: Hoare triple {20151#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20151#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:09,179 INFO L273 TraceCheckUtils]: 41: Hoare triple {20151#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20152#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:09,179 INFO L273 TraceCheckUtils]: 42: Hoare triple {20152#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20152#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:09,180 INFO L273 TraceCheckUtils]: 43: Hoare triple {20152#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20153#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:09,180 INFO L273 TraceCheckUtils]: 44: Hoare triple {20153#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20153#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:09,181 INFO L273 TraceCheckUtils]: 45: Hoare triple {20153#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20154#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:09,182 INFO L273 TraceCheckUtils]: 46: Hoare triple {20154#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20154#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:09,182 INFO L273 TraceCheckUtils]: 47: Hoare triple {20154#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20155#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:09,183 INFO L273 TraceCheckUtils]: 48: Hoare triple {20155#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20155#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:09,184 INFO L273 TraceCheckUtils]: 49: Hoare triple {20155#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20156#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:09,184 INFO L273 TraceCheckUtils]: 50: Hoare triple {20156#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20156#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:09,185 INFO L273 TraceCheckUtils]: 51: Hoare triple {20156#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20157#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:09,185 INFO L273 TraceCheckUtils]: 52: Hoare triple {20157#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20157#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:09,186 INFO L273 TraceCheckUtils]: 53: Hoare triple {20157#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20158#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:09,187 INFO L273 TraceCheckUtils]: 54: Hoare triple {20158#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20158#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:09,187 INFO L273 TraceCheckUtils]: 55: Hoare triple {20158#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20159#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:09,188 INFO L273 TraceCheckUtils]: 56: Hoare triple {20159#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20159#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:09,189 INFO L273 TraceCheckUtils]: 57: Hoare triple {20159#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20160#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:09,189 INFO L273 TraceCheckUtils]: 58: Hoare triple {20160#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20160#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:09,190 INFO L273 TraceCheckUtils]: 59: Hoare triple {20160#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20161#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:09,190 INFO L273 TraceCheckUtils]: 60: Hoare triple {20161#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20161#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:09,191 INFO L273 TraceCheckUtils]: 61: Hoare triple {20161#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20162#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:09,192 INFO L273 TraceCheckUtils]: 62: Hoare triple {20162#(<= main_~i~1 28)} assume !(~i~1 < 10000); {20133#false} is VALID [2018-11-23 12:28:09,192 INFO L256 TraceCheckUtils]: 63: Hoare triple {20133#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:28:09,192 INFO L273 TraceCheckUtils]: 64: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20132#true} is VALID [2018-11-23 12:28:09,192 INFO L273 TraceCheckUtils]: 65: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,193 INFO L273 TraceCheckUtils]: 66: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,193 INFO L273 TraceCheckUtils]: 67: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,193 INFO L273 TraceCheckUtils]: 68: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,193 INFO L273 TraceCheckUtils]: 69: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,193 INFO L273 TraceCheckUtils]: 70: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,194 INFO L273 TraceCheckUtils]: 71: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,194 INFO L273 TraceCheckUtils]: 72: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,194 INFO L273 TraceCheckUtils]: 73: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,194 INFO L273 TraceCheckUtils]: 74: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,194 INFO L273 TraceCheckUtils]: 75: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,194 INFO L273 TraceCheckUtils]: 76: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,195 INFO L273 TraceCheckUtils]: 77: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,195 INFO L273 TraceCheckUtils]: 78: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,195 INFO L273 TraceCheckUtils]: 79: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,195 INFO L273 TraceCheckUtils]: 80: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,195 INFO L273 TraceCheckUtils]: 81: Hoare triple {20132#true} assume !(~i~0 < 10000); {20132#true} is VALID [2018-11-23 12:28:09,195 INFO L273 TraceCheckUtils]: 82: Hoare triple {20132#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:28:09,195 INFO L273 TraceCheckUtils]: 83: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:09,196 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20132#true} {20133#false} #70#return; {20133#false} is VALID [2018-11-23 12:28:09,196 INFO L273 TraceCheckUtils]: 85: Hoare triple {20133#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); {20133#false} is VALID [2018-11-23 12:28:09,196 INFO L256 TraceCheckUtils]: 86: Hoare triple {20133#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:28:09,196 INFO L273 TraceCheckUtils]: 87: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20132#true} is VALID [2018-11-23 12:28:09,196 INFO L273 TraceCheckUtils]: 88: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,196 INFO L273 TraceCheckUtils]: 89: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,196 INFO L273 TraceCheckUtils]: 90: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,196 INFO L273 TraceCheckUtils]: 91: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,196 INFO L273 TraceCheckUtils]: 92: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,197 INFO L273 TraceCheckUtils]: 93: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,197 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,197 INFO L273 TraceCheckUtils]: 95: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,197 INFO L273 TraceCheckUtils]: 96: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,197 INFO L273 TraceCheckUtils]: 97: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,197 INFO L273 TraceCheckUtils]: 98: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,197 INFO L273 TraceCheckUtils]: 99: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,197 INFO L273 TraceCheckUtils]: 100: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,197 INFO L273 TraceCheckUtils]: 101: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,197 INFO L273 TraceCheckUtils]: 102: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,198 INFO L273 TraceCheckUtils]: 103: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,198 INFO L273 TraceCheckUtils]: 104: Hoare triple {20132#true} assume !(~i~0 < 10000); {20132#true} is VALID [2018-11-23 12:28:09,198 INFO L273 TraceCheckUtils]: 105: Hoare triple {20132#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:28:09,198 INFO L273 TraceCheckUtils]: 106: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:09,198 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20132#true} {20133#false} #72#return; {20133#false} is VALID [2018-11-23 12:28:09,198 INFO L273 TraceCheckUtils]: 108: Hoare triple {20133#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; {20133#false} is VALID [2018-11-23 12:28:09,198 INFO L273 TraceCheckUtils]: 109: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:09,198 INFO L273 TraceCheckUtils]: 110: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:09,198 INFO L273 TraceCheckUtils]: 111: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:09,199 INFO L273 TraceCheckUtils]: 112: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:09,199 INFO L273 TraceCheckUtils]: 113: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:09,199 INFO L273 TraceCheckUtils]: 114: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:09,199 INFO L273 TraceCheckUtils]: 115: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:09,199 INFO L273 TraceCheckUtils]: 116: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:09,199 INFO L273 TraceCheckUtils]: 117: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:09,199 INFO L273 TraceCheckUtils]: 118: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:09,199 INFO L273 TraceCheckUtils]: 119: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:09,199 INFO L273 TraceCheckUtils]: 120: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:09,200 INFO L273 TraceCheckUtils]: 121: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:09,200 INFO L273 TraceCheckUtils]: 122: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:09,200 INFO L273 TraceCheckUtils]: 123: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:09,200 INFO L273 TraceCheckUtils]: 124: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:09,200 INFO L273 TraceCheckUtils]: 125: Hoare triple {20133#false} assume !(~i~2 < 9999); {20133#false} is VALID [2018-11-23 12:28:09,200 INFO L273 TraceCheckUtils]: 126: Hoare triple {20133#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {20133#false} is VALID [2018-11-23 12:28:09,200 INFO L256 TraceCheckUtils]: 127: Hoare triple {20133#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:28:09,200 INFO L273 TraceCheckUtils]: 128: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20132#true} is VALID [2018-11-23 12:28:09,200 INFO L273 TraceCheckUtils]: 129: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,200 INFO L273 TraceCheckUtils]: 130: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,201 INFO L273 TraceCheckUtils]: 131: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,201 INFO L273 TraceCheckUtils]: 132: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,201 INFO L273 TraceCheckUtils]: 133: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,201 INFO L273 TraceCheckUtils]: 134: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,201 INFO L273 TraceCheckUtils]: 135: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,201 INFO L273 TraceCheckUtils]: 136: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,201 INFO L273 TraceCheckUtils]: 137: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,201 INFO L273 TraceCheckUtils]: 138: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,201 INFO L273 TraceCheckUtils]: 139: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,202 INFO L273 TraceCheckUtils]: 140: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,202 INFO L273 TraceCheckUtils]: 141: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,202 INFO L273 TraceCheckUtils]: 142: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,202 INFO L273 TraceCheckUtils]: 143: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,202 INFO L273 TraceCheckUtils]: 144: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,202 INFO L273 TraceCheckUtils]: 145: Hoare triple {20132#true} assume !(~i~0 < 10000); {20132#true} is VALID [2018-11-23 12:28:09,202 INFO L273 TraceCheckUtils]: 146: Hoare triple {20132#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:28:09,202 INFO L273 TraceCheckUtils]: 147: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:09,202 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20132#true} {20133#false} #74#return; {20133#false} is VALID [2018-11-23 12:28:09,202 INFO L273 TraceCheckUtils]: 149: Hoare triple {20133#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {20133#false} is VALID [2018-11-23 12:28:09,203 INFO L273 TraceCheckUtils]: 150: Hoare triple {20133#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {20133#false} is VALID [2018-11-23 12:28:09,203 INFO L273 TraceCheckUtils]: 151: Hoare triple {20133#false} assume !false; {20133#false} is VALID [2018-11-23 12:28:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-23 12:28:09,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:09,214 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:28:09,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:09,303 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:09,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:09,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:09,643 INFO L256 TraceCheckUtils]: 0: Hoare triple {20132#true} call ULTIMATE.init(); {20132#true} is VALID [2018-11-23 12:28:09,643 INFO L273 TraceCheckUtils]: 1: Hoare triple {20132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20132#true} is VALID [2018-11-23 12:28:09,644 INFO L273 TraceCheckUtils]: 2: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:09,644 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20132#true} {20132#true} #66#return; {20132#true} is VALID [2018-11-23 12:28:09,644 INFO L256 TraceCheckUtils]: 4: Hoare triple {20132#true} call #t~ret12 := main(); {20132#true} is VALID [2018-11-23 12:28:09,644 INFO L273 TraceCheckUtils]: 5: Hoare triple {20132#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20132#true} is VALID [2018-11-23 12:28:09,644 INFO L273 TraceCheckUtils]: 6: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,645 INFO L273 TraceCheckUtils]: 7: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,645 INFO L273 TraceCheckUtils]: 9: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,645 INFO L273 TraceCheckUtils]: 10: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,645 INFO L273 TraceCheckUtils]: 11: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,646 INFO L273 TraceCheckUtils]: 12: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,646 INFO L273 TraceCheckUtils]: 13: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,646 INFO L273 TraceCheckUtils]: 14: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,646 INFO L273 TraceCheckUtils]: 17: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,647 INFO L273 TraceCheckUtils]: 18: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,647 INFO L273 TraceCheckUtils]: 21: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,647 INFO L273 TraceCheckUtils]: 22: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,647 INFO L273 TraceCheckUtils]: 23: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,647 INFO L273 TraceCheckUtils]: 24: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,647 INFO L273 TraceCheckUtils]: 25: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,648 INFO L273 TraceCheckUtils]: 26: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,648 INFO L273 TraceCheckUtils]: 27: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,648 INFO L273 TraceCheckUtils]: 28: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,648 INFO L273 TraceCheckUtils]: 29: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,648 INFO L273 TraceCheckUtils]: 30: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,648 INFO L273 TraceCheckUtils]: 31: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,648 INFO L273 TraceCheckUtils]: 32: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,648 INFO L273 TraceCheckUtils]: 33: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,648 INFO L273 TraceCheckUtils]: 34: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,649 INFO L273 TraceCheckUtils]: 35: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,649 INFO L273 TraceCheckUtils]: 36: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,649 INFO L273 TraceCheckUtils]: 37: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,649 INFO L273 TraceCheckUtils]: 38: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,649 INFO L273 TraceCheckUtils]: 39: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,649 INFO L273 TraceCheckUtils]: 40: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,649 INFO L273 TraceCheckUtils]: 41: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,649 INFO L273 TraceCheckUtils]: 42: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,649 INFO L273 TraceCheckUtils]: 43: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,649 INFO L273 TraceCheckUtils]: 44: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,650 INFO L273 TraceCheckUtils]: 45: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,650 INFO L273 TraceCheckUtils]: 46: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,650 INFO L273 TraceCheckUtils]: 47: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,650 INFO L273 TraceCheckUtils]: 48: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,650 INFO L273 TraceCheckUtils]: 49: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,650 INFO L273 TraceCheckUtils]: 50: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,650 INFO L273 TraceCheckUtils]: 51: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,650 INFO L273 TraceCheckUtils]: 52: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,650 INFO L273 TraceCheckUtils]: 53: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,651 INFO L273 TraceCheckUtils]: 54: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,651 INFO L273 TraceCheckUtils]: 55: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,651 INFO L273 TraceCheckUtils]: 56: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,651 INFO L273 TraceCheckUtils]: 57: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,651 INFO L273 TraceCheckUtils]: 58: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,651 INFO L273 TraceCheckUtils]: 59: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,651 INFO L273 TraceCheckUtils]: 60: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:09,651 INFO L273 TraceCheckUtils]: 61: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:09,651 INFO L273 TraceCheckUtils]: 62: Hoare triple {20132#true} assume !(~i~1 < 10000); {20132#true} is VALID [2018-11-23 12:28:09,651 INFO L256 TraceCheckUtils]: 63: Hoare triple {20132#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:28:09,652 INFO L273 TraceCheckUtils]: 64: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20132#true} is VALID [2018-11-23 12:28:09,652 INFO L273 TraceCheckUtils]: 65: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,652 INFO L273 TraceCheckUtils]: 66: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,652 INFO L273 TraceCheckUtils]: 67: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,652 INFO L273 TraceCheckUtils]: 68: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,652 INFO L273 TraceCheckUtils]: 69: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,652 INFO L273 TraceCheckUtils]: 70: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,652 INFO L273 TraceCheckUtils]: 71: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,652 INFO L273 TraceCheckUtils]: 72: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,653 INFO L273 TraceCheckUtils]: 73: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,653 INFO L273 TraceCheckUtils]: 74: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,653 INFO L273 TraceCheckUtils]: 75: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,653 INFO L273 TraceCheckUtils]: 76: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,653 INFO L273 TraceCheckUtils]: 77: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,653 INFO L273 TraceCheckUtils]: 78: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,653 INFO L273 TraceCheckUtils]: 79: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,653 INFO L273 TraceCheckUtils]: 80: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,653 INFO L273 TraceCheckUtils]: 81: Hoare triple {20132#true} assume !(~i~0 < 10000); {20132#true} is VALID [2018-11-23 12:28:09,653 INFO L273 TraceCheckUtils]: 82: Hoare triple {20132#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:28:09,654 INFO L273 TraceCheckUtils]: 83: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:09,654 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20132#true} {20132#true} #70#return; {20132#true} is VALID [2018-11-23 12:28:09,654 INFO L273 TraceCheckUtils]: 85: Hoare triple {20132#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); {20132#true} is VALID [2018-11-23 12:28:09,654 INFO L256 TraceCheckUtils]: 86: Hoare triple {20132#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:28:09,654 INFO L273 TraceCheckUtils]: 87: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20132#true} is VALID [2018-11-23 12:28:09,654 INFO L273 TraceCheckUtils]: 88: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,655 INFO L273 TraceCheckUtils]: 89: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,655 INFO L273 TraceCheckUtils]: 90: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,655 INFO L273 TraceCheckUtils]: 91: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,655 INFO L273 TraceCheckUtils]: 92: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,655 INFO L273 TraceCheckUtils]: 93: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,655 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,655 INFO L273 TraceCheckUtils]: 95: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,656 INFO L273 TraceCheckUtils]: 96: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,656 INFO L273 TraceCheckUtils]: 97: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,656 INFO L273 TraceCheckUtils]: 98: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,656 INFO L273 TraceCheckUtils]: 99: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,656 INFO L273 TraceCheckUtils]: 100: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,656 INFO L273 TraceCheckUtils]: 101: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,657 INFO L273 TraceCheckUtils]: 102: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:09,657 INFO L273 TraceCheckUtils]: 103: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:09,657 INFO L273 TraceCheckUtils]: 104: Hoare triple {20132#true} assume !(~i~0 < 10000); {20132#true} is VALID [2018-11-23 12:28:09,657 INFO L273 TraceCheckUtils]: 105: Hoare triple {20132#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:28:09,657 INFO L273 TraceCheckUtils]: 106: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:09,657 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20132#true} {20132#true} #72#return; {20132#true} is VALID [2018-11-23 12:28:09,658 INFO L273 TraceCheckUtils]: 108: Hoare triple {20132#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; {20132#true} is VALID [2018-11-23 12:28:09,658 INFO L273 TraceCheckUtils]: 109: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:09,658 INFO L273 TraceCheckUtils]: 110: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:09,658 INFO L273 TraceCheckUtils]: 111: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:09,658 INFO L273 TraceCheckUtils]: 112: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:09,658 INFO L273 TraceCheckUtils]: 113: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:09,659 INFO L273 TraceCheckUtils]: 114: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:09,659 INFO L273 TraceCheckUtils]: 115: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:09,659 INFO L273 TraceCheckUtils]: 116: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:09,659 INFO L273 TraceCheckUtils]: 117: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:09,659 INFO L273 TraceCheckUtils]: 118: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:09,659 INFO L273 TraceCheckUtils]: 119: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:09,660 INFO L273 TraceCheckUtils]: 120: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:09,660 INFO L273 TraceCheckUtils]: 121: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:09,660 INFO L273 TraceCheckUtils]: 122: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:09,660 INFO L273 TraceCheckUtils]: 123: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:09,660 INFO L273 TraceCheckUtils]: 124: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:09,660 INFO L273 TraceCheckUtils]: 125: Hoare triple {20132#true} assume !(~i~2 < 9999); {20132#true} is VALID [2018-11-23 12:28:09,661 INFO L273 TraceCheckUtils]: 126: Hoare triple {20132#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {20132#true} is VALID [2018-11-23 12:28:09,661 INFO L256 TraceCheckUtils]: 127: Hoare triple {20132#true} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:28:09,679 INFO L273 TraceCheckUtils]: 128: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20550#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:09,693 INFO L273 TraceCheckUtils]: 129: Hoare triple {20550#(<= mapavg_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20550#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:09,702 INFO L273 TraceCheckUtils]: 130: Hoare triple {20550#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20557#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:09,715 INFO L273 TraceCheckUtils]: 131: Hoare triple {20557#(<= mapavg_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20557#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:09,724 INFO L273 TraceCheckUtils]: 132: Hoare triple {20557#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20564#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:09,737 INFO L273 TraceCheckUtils]: 133: Hoare triple {20564#(<= mapavg_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20564#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:09,739 INFO L273 TraceCheckUtils]: 134: Hoare triple {20564#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20571#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:09,739 INFO L273 TraceCheckUtils]: 135: Hoare triple {20571#(<= mapavg_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20571#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:09,740 INFO L273 TraceCheckUtils]: 136: Hoare triple {20571#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20578#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:09,744 INFO L273 TraceCheckUtils]: 137: Hoare triple {20578#(<= mapavg_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20578#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:09,744 INFO L273 TraceCheckUtils]: 138: Hoare triple {20578#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20585#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:09,747 INFO L273 TraceCheckUtils]: 139: Hoare triple {20585#(<= mapavg_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20585#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:09,747 INFO L273 TraceCheckUtils]: 140: Hoare triple {20585#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20592#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:09,747 INFO L273 TraceCheckUtils]: 141: Hoare triple {20592#(<= mapavg_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20592#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:09,748 INFO L273 TraceCheckUtils]: 142: Hoare triple {20592#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20599#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:09,748 INFO L273 TraceCheckUtils]: 143: Hoare triple {20599#(<= mapavg_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20599#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:09,749 INFO L273 TraceCheckUtils]: 144: Hoare triple {20599#(<= mapavg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20606#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:28:09,749 INFO L273 TraceCheckUtils]: 145: Hoare triple {20606#(<= mapavg_~i~0 8)} assume !(~i~0 < 10000); {20133#false} is VALID [2018-11-23 12:28:09,749 INFO L273 TraceCheckUtils]: 146: Hoare triple {20133#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {20133#false} is VALID [2018-11-23 12:28:09,749 INFO L273 TraceCheckUtils]: 147: Hoare triple {20133#false} assume true; {20133#false} is VALID [2018-11-23 12:28:09,749 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20133#false} {20132#true} #74#return; {20133#false} is VALID [2018-11-23 12:28:09,750 INFO L273 TraceCheckUtils]: 149: Hoare triple {20133#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {20133#false} is VALID [2018-11-23 12:28:09,750 INFO L273 TraceCheckUtils]: 150: Hoare triple {20133#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {20133#false} is VALID [2018-11-23 12:28:09,750 INFO L273 TraceCheckUtils]: 151: Hoare triple {20133#false} assume !false; {20133#false} is VALID [2018-11-23 12:28:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2018-11-23 12:28:09,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:09,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2018-11-23 12:28:09,782 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:28:09,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:09,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:28:09,903 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:09,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:28:09,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:28:09,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:28:09,905 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2018-11-23 12:28:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:10,457 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-11-23 12:28:10,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:28:10,457 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:28:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:28:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:28:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:28:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:28:10,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 132 transitions. [2018-11-23 12:28:10,589 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:10,592 INFO L225 Difference]: With dead ends: 165 [2018-11-23 12:28:10,592 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:28:10,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:28:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:28:10,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-23 12:28:10,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:10,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 115 states. [2018-11-23 12:28:10,652 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 115 states. [2018-11-23 12:28:10,652 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 115 states. [2018-11-23 12:28:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:10,655 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:28:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:28:10,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:10,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:10,656 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 117 states. [2018-11-23 12:28:10,656 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 117 states. [2018-11-23 12:28:10,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:10,658 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:28:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:28:10,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:10,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:10,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:10,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:10,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 12:28:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2018-11-23 12:28:10,660 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2018-11-23 12:28:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:10,660 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-11-23 12:28:10,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:28:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:28:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 12:28:10,661 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:10,661 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 27, 27, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:10,661 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:10,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:10,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1026828691, now seen corresponding path program 29 times [2018-11-23 12:28:10,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:10,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:10,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:10,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:11,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {21277#true} call ULTIMATE.init(); {21277#true} is VALID [2018-11-23 12:28:11,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {21277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21277#true} is VALID [2018-11-23 12:28:11,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:28:11,719 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21277#true} {21277#true} #66#return; {21277#true} is VALID [2018-11-23 12:28:11,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {21277#true} call #t~ret12 := main(); {21277#true} is VALID [2018-11-23 12:28:11,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {21277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21279#(= main_~i~1 0)} is VALID [2018-11-23 12:28:11,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {21279#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21279#(= main_~i~1 0)} is VALID [2018-11-23 12:28:11,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {21279#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21280#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:11,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {21280#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21280#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:11,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {21280#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21281#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:11,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {21281#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21281#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:11,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {21281#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21282#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:11,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {21282#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21282#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:11,725 INFO L273 TraceCheckUtils]: 13: Hoare triple {21282#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21283#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:11,725 INFO L273 TraceCheckUtils]: 14: Hoare triple {21283#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21283#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:11,726 INFO L273 TraceCheckUtils]: 15: Hoare triple {21283#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21284#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:11,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {21284#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21284#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:11,727 INFO L273 TraceCheckUtils]: 17: Hoare triple {21284#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21285#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:11,728 INFO L273 TraceCheckUtils]: 18: Hoare triple {21285#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21285#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:11,728 INFO L273 TraceCheckUtils]: 19: Hoare triple {21285#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21286#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:11,729 INFO L273 TraceCheckUtils]: 20: Hoare triple {21286#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21286#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:11,730 INFO L273 TraceCheckUtils]: 21: Hoare triple {21286#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21287#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:11,730 INFO L273 TraceCheckUtils]: 22: Hoare triple {21287#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21287#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:11,731 INFO L273 TraceCheckUtils]: 23: Hoare triple {21287#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21288#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:11,731 INFO L273 TraceCheckUtils]: 24: Hoare triple {21288#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21288#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:11,732 INFO L273 TraceCheckUtils]: 25: Hoare triple {21288#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21289#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:11,733 INFO L273 TraceCheckUtils]: 26: Hoare triple {21289#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21289#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:11,733 INFO L273 TraceCheckUtils]: 27: Hoare triple {21289#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21290#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:11,734 INFO L273 TraceCheckUtils]: 28: Hoare triple {21290#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21290#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:11,735 INFO L273 TraceCheckUtils]: 29: Hoare triple {21290#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21291#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:11,735 INFO L273 TraceCheckUtils]: 30: Hoare triple {21291#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21291#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:11,736 INFO L273 TraceCheckUtils]: 31: Hoare triple {21291#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21292#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:11,736 INFO L273 TraceCheckUtils]: 32: Hoare triple {21292#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21292#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:11,737 INFO L273 TraceCheckUtils]: 33: Hoare triple {21292#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21293#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:11,738 INFO L273 TraceCheckUtils]: 34: Hoare triple {21293#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21293#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:11,738 INFO L273 TraceCheckUtils]: 35: Hoare triple {21293#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21294#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:11,739 INFO L273 TraceCheckUtils]: 36: Hoare triple {21294#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21294#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:11,740 INFO L273 TraceCheckUtils]: 37: Hoare triple {21294#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21295#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:11,740 INFO L273 TraceCheckUtils]: 38: Hoare triple {21295#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21295#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:11,741 INFO L273 TraceCheckUtils]: 39: Hoare triple {21295#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21296#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:11,741 INFO L273 TraceCheckUtils]: 40: Hoare triple {21296#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21296#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:11,742 INFO L273 TraceCheckUtils]: 41: Hoare triple {21296#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21297#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:11,743 INFO L273 TraceCheckUtils]: 42: Hoare triple {21297#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21297#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:11,743 INFO L273 TraceCheckUtils]: 43: Hoare triple {21297#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21298#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:11,744 INFO L273 TraceCheckUtils]: 44: Hoare triple {21298#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21298#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:11,745 INFO L273 TraceCheckUtils]: 45: Hoare triple {21298#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21299#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:11,745 INFO L273 TraceCheckUtils]: 46: Hoare triple {21299#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21299#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:11,746 INFO L273 TraceCheckUtils]: 47: Hoare triple {21299#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21300#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:11,747 INFO L273 TraceCheckUtils]: 48: Hoare triple {21300#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21300#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:11,747 INFO L273 TraceCheckUtils]: 49: Hoare triple {21300#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21301#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:11,748 INFO L273 TraceCheckUtils]: 50: Hoare triple {21301#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21301#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:11,748 INFO L273 TraceCheckUtils]: 51: Hoare triple {21301#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21302#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:11,749 INFO L273 TraceCheckUtils]: 52: Hoare triple {21302#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21302#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:11,750 INFO L273 TraceCheckUtils]: 53: Hoare triple {21302#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21303#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:11,750 INFO L273 TraceCheckUtils]: 54: Hoare triple {21303#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21303#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:11,751 INFO L273 TraceCheckUtils]: 55: Hoare triple {21303#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21304#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:11,752 INFO L273 TraceCheckUtils]: 56: Hoare triple {21304#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21304#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:11,752 INFO L273 TraceCheckUtils]: 57: Hoare triple {21304#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21305#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:11,753 INFO L273 TraceCheckUtils]: 58: Hoare triple {21305#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21305#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:11,754 INFO L273 TraceCheckUtils]: 59: Hoare triple {21305#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21306#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:11,754 INFO L273 TraceCheckUtils]: 60: Hoare triple {21306#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21306#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:11,755 INFO L273 TraceCheckUtils]: 61: Hoare triple {21306#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21307#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:11,755 INFO L273 TraceCheckUtils]: 62: Hoare triple {21307#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21307#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:11,756 INFO L273 TraceCheckUtils]: 63: Hoare triple {21307#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21308#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:11,757 INFO L273 TraceCheckUtils]: 64: Hoare triple {21308#(<= main_~i~1 29)} assume !(~i~1 < 10000); {21278#false} is VALID [2018-11-23 12:28:11,757 INFO L256 TraceCheckUtils]: 65: Hoare triple {21278#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:28:11,757 INFO L273 TraceCheckUtils]: 66: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21277#true} is VALID [2018-11-23 12:28:11,757 INFO L273 TraceCheckUtils]: 67: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,757 INFO L273 TraceCheckUtils]: 68: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,758 INFO L273 TraceCheckUtils]: 69: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,758 INFO L273 TraceCheckUtils]: 70: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,758 INFO L273 TraceCheckUtils]: 71: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,758 INFO L273 TraceCheckUtils]: 72: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,758 INFO L273 TraceCheckUtils]: 73: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,759 INFO L273 TraceCheckUtils]: 74: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,759 INFO L273 TraceCheckUtils]: 75: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,759 INFO L273 TraceCheckUtils]: 76: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,759 INFO L273 TraceCheckUtils]: 77: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,759 INFO L273 TraceCheckUtils]: 78: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,759 INFO L273 TraceCheckUtils]: 79: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,760 INFO L273 TraceCheckUtils]: 80: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,760 INFO L273 TraceCheckUtils]: 81: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,760 INFO L273 TraceCheckUtils]: 82: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,760 INFO L273 TraceCheckUtils]: 83: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,760 INFO L273 TraceCheckUtils]: 84: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,760 INFO L273 TraceCheckUtils]: 85: Hoare triple {21277#true} assume !(~i~0 < 10000); {21277#true} is VALID [2018-11-23 12:28:11,760 INFO L273 TraceCheckUtils]: 86: Hoare triple {21277#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {21277#true} is VALID [2018-11-23 12:28:11,760 INFO L273 TraceCheckUtils]: 87: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:28:11,761 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21277#true} {21278#false} #70#return; {21278#false} is VALID [2018-11-23 12:28:11,761 INFO L273 TraceCheckUtils]: 89: Hoare triple {21278#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); {21278#false} is VALID [2018-11-23 12:28:11,761 INFO L256 TraceCheckUtils]: 90: Hoare triple {21278#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:28:11,761 INFO L273 TraceCheckUtils]: 91: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21277#true} is VALID [2018-11-23 12:28:11,761 INFO L273 TraceCheckUtils]: 92: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,761 INFO L273 TraceCheckUtils]: 93: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,761 INFO L273 TraceCheckUtils]: 94: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,761 INFO L273 TraceCheckUtils]: 95: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,761 INFO L273 TraceCheckUtils]: 96: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,762 INFO L273 TraceCheckUtils]: 97: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,762 INFO L273 TraceCheckUtils]: 98: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,762 INFO L273 TraceCheckUtils]: 99: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,762 INFO L273 TraceCheckUtils]: 100: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,762 INFO L273 TraceCheckUtils]: 101: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,762 INFO L273 TraceCheckUtils]: 102: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,762 INFO L273 TraceCheckUtils]: 103: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,762 INFO L273 TraceCheckUtils]: 104: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,762 INFO L273 TraceCheckUtils]: 105: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,762 INFO L273 TraceCheckUtils]: 106: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,763 INFO L273 TraceCheckUtils]: 107: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,763 INFO L273 TraceCheckUtils]: 108: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,763 INFO L273 TraceCheckUtils]: 109: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,763 INFO L273 TraceCheckUtils]: 110: Hoare triple {21277#true} assume !(~i~0 < 10000); {21277#true} is VALID [2018-11-23 12:28:11,763 INFO L273 TraceCheckUtils]: 111: Hoare triple {21277#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {21277#true} is VALID [2018-11-23 12:28:11,763 INFO L273 TraceCheckUtils]: 112: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:28:11,763 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21277#true} {21278#false} #72#return; {21278#false} is VALID [2018-11-23 12:28:11,763 INFO L273 TraceCheckUtils]: 114: Hoare triple {21278#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; {21278#false} is VALID [2018-11-23 12:28:11,763 INFO L273 TraceCheckUtils]: 115: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:11,764 INFO L273 TraceCheckUtils]: 116: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:11,764 INFO L273 TraceCheckUtils]: 117: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:11,764 INFO L273 TraceCheckUtils]: 118: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:11,764 INFO L273 TraceCheckUtils]: 119: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:11,764 INFO L273 TraceCheckUtils]: 120: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:11,764 INFO L273 TraceCheckUtils]: 121: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:11,764 INFO L273 TraceCheckUtils]: 122: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:11,764 INFO L273 TraceCheckUtils]: 123: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:11,764 INFO L273 TraceCheckUtils]: 124: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:11,764 INFO L273 TraceCheckUtils]: 125: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:11,765 INFO L273 TraceCheckUtils]: 126: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:11,765 INFO L273 TraceCheckUtils]: 127: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:11,765 INFO L273 TraceCheckUtils]: 128: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:11,765 INFO L273 TraceCheckUtils]: 129: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:11,765 INFO L273 TraceCheckUtils]: 130: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:11,765 INFO L273 TraceCheckUtils]: 131: Hoare triple {21278#false} assume !(~i~2 < 9999); {21278#false} is VALID [2018-11-23 12:28:11,765 INFO L273 TraceCheckUtils]: 132: Hoare triple {21278#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:28:11,765 INFO L256 TraceCheckUtils]: 133: Hoare triple {21278#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:28:11,765 INFO L273 TraceCheckUtils]: 134: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21277#true} is VALID [2018-11-23 12:28:11,765 INFO L273 TraceCheckUtils]: 135: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,766 INFO L273 TraceCheckUtils]: 136: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,766 INFO L273 TraceCheckUtils]: 137: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,766 INFO L273 TraceCheckUtils]: 138: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,766 INFO L273 TraceCheckUtils]: 139: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,766 INFO L273 TraceCheckUtils]: 140: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,766 INFO L273 TraceCheckUtils]: 141: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,766 INFO L273 TraceCheckUtils]: 142: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,766 INFO L273 TraceCheckUtils]: 143: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,766 INFO L273 TraceCheckUtils]: 144: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,767 INFO L273 TraceCheckUtils]: 145: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,767 INFO L273 TraceCheckUtils]: 146: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,767 INFO L273 TraceCheckUtils]: 147: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,767 INFO L273 TraceCheckUtils]: 148: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,767 INFO L273 TraceCheckUtils]: 149: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,767 INFO L273 TraceCheckUtils]: 150: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,767 INFO L273 TraceCheckUtils]: 151: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:11,767 INFO L273 TraceCheckUtils]: 152: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:11,767 INFO L273 TraceCheckUtils]: 153: Hoare triple {21277#true} assume !(~i~0 < 10000); {21277#true} is VALID [2018-11-23 12:28:11,767 INFO L273 TraceCheckUtils]: 154: Hoare triple {21277#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {21277#true} is VALID [2018-11-23 12:28:11,768 INFO L273 TraceCheckUtils]: 155: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:28:11,768 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21277#true} {21278#false} #74#return; {21278#false} is VALID [2018-11-23 12:28:11,768 INFO L273 TraceCheckUtils]: 157: Hoare triple {21278#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {21278#false} is VALID [2018-11-23 12:28:11,768 INFO L273 TraceCheckUtils]: 158: Hoare triple {21278#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {21278#false} is VALID [2018-11-23 12:28:11,768 INFO L273 TraceCheckUtils]: 159: Hoare triple {21278#false} assume !false; {21278#false} is VALID [2018-11-23 12:28:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2018-11-23 12:28:11,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:11,780 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:28:11,792 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:28:30,107 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-11-23 12:28:30,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:30,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:30,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {21277#true} call ULTIMATE.init(); {21277#true} is VALID [2018-11-23 12:28:30,508 INFO L273 TraceCheckUtils]: 1: Hoare triple {21277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21277#true} is VALID [2018-11-23 12:28:30,508 INFO L273 TraceCheckUtils]: 2: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:28:30,508 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21277#true} {21277#true} #66#return; {21277#true} is VALID [2018-11-23 12:28:30,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {21277#true} call #t~ret12 := main(); {21277#true} is VALID [2018-11-23 12:28:30,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {21277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21277#true} is VALID [2018-11-23 12:28:30,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,509 INFO L273 TraceCheckUtils]: 11: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,510 INFO L273 TraceCheckUtils]: 13: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,510 INFO L273 TraceCheckUtils]: 14: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,510 INFO L273 TraceCheckUtils]: 15: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,511 INFO L273 TraceCheckUtils]: 19: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,511 INFO L273 TraceCheckUtils]: 20: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,511 INFO L273 TraceCheckUtils]: 21: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,512 INFO L273 TraceCheckUtils]: 25: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,512 INFO L273 TraceCheckUtils]: 26: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,512 INFO L273 TraceCheckUtils]: 27: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,512 INFO L273 TraceCheckUtils]: 28: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,512 INFO L273 TraceCheckUtils]: 29: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,512 INFO L273 TraceCheckUtils]: 30: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,512 INFO L273 TraceCheckUtils]: 31: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,512 INFO L273 TraceCheckUtils]: 32: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,513 INFO L273 TraceCheckUtils]: 33: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,513 INFO L273 TraceCheckUtils]: 34: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,513 INFO L273 TraceCheckUtils]: 35: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,513 INFO L273 TraceCheckUtils]: 36: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,513 INFO L273 TraceCheckUtils]: 37: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,513 INFO L273 TraceCheckUtils]: 38: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,513 INFO L273 TraceCheckUtils]: 39: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,513 INFO L273 TraceCheckUtils]: 40: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,513 INFO L273 TraceCheckUtils]: 41: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,513 INFO L273 TraceCheckUtils]: 42: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,514 INFO L273 TraceCheckUtils]: 43: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,514 INFO L273 TraceCheckUtils]: 44: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,514 INFO L273 TraceCheckUtils]: 45: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,514 INFO L273 TraceCheckUtils]: 46: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,514 INFO L273 TraceCheckUtils]: 47: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,514 INFO L273 TraceCheckUtils]: 48: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,514 INFO L273 TraceCheckUtils]: 49: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,514 INFO L273 TraceCheckUtils]: 50: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,514 INFO L273 TraceCheckUtils]: 51: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,515 INFO L273 TraceCheckUtils]: 52: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,515 INFO L273 TraceCheckUtils]: 53: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,515 INFO L273 TraceCheckUtils]: 54: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,515 INFO L273 TraceCheckUtils]: 55: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,515 INFO L273 TraceCheckUtils]: 56: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,515 INFO L273 TraceCheckUtils]: 57: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,515 INFO L273 TraceCheckUtils]: 58: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,515 INFO L273 TraceCheckUtils]: 59: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,515 INFO L273 TraceCheckUtils]: 60: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,515 INFO L273 TraceCheckUtils]: 61: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,516 INFO L273 TraceCheckUtils]: 62: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:30,516 INFO L273 TraceCheckUtils]: 63: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:30,516 INFO L273 TraceCheckUtils]: 64: Hoare triple {21277#true} assume !(~i~1 < 10000); {21277#true} is VALID [2018-11-23 12:28:30,516 INFO L256 TraceCheckUtils]: 65: Hoare triple {21277#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:28:30,516 INFO L273 TraceCheckUtils]: 66: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21510#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:30,517 INFO L273 TraceCheckUtils]: 67: Hoare triple {21510#(<= mapavg_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21510#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:30,517 INFO L273 TraceCheckUtils]: 68: Hoare triple {21510#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21517#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:30,518 INFO L273 TraceCheckUtils]: 69: Hoare triple {21517#(<= mapavg_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21517#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:30,518 INFO L273 TraceCheckUtils]: 70: Hoare triple {21517#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21524#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:30,518 INFO L273 TraceCheckUtils]: 71: Hoare triple {21524#(<= mapavg_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21524#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:30,519 INFO L273 TraceCheckUtils]: 72: Hoare triple {21524#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21531#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:30,519 INFO L273 TraceCheckUtils]: 73: Hoare triple {21531#(<= mapavg_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21531#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:30,520 INFO L273 TraceCheckUtils]: 74: Hoare triple {21531#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21538#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:30,520 INFO L273 TraceCheckUtils]: 75: Hoare triple {21538#(<= mapavg_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21538#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:30,521 INFO L273 TraceCheckUtils]: 76: Hoare triple {21538#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21545#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:30,521 INFO L273 TraceCheckUtils]: 77: Hoare triple {21545#(<= mapavg_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21545#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:30,522 INFO L273 TraceCheckUtils]: 78: Hoare triple {21545#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21552#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:30,523 INFO L273 TraceCheckUtils]: 79: Hoare triple {21552#(<= mapavg_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21552#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:30,523 INFO L273 TraceCheckUtils]: 80: Hoare triple {21552#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21559#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:30,524 INFO L273 TraceCheckUtils]: 81: Hoare triple {21559#(<= mapavg_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21559#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:30,526 INFO L273 TraceCheckUtils]: 82: Hoare triple {21559#(<= mapavg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21566#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:28:30,526 INFO L273 TraceCheckUtils]: 83: Hoare triple {21566#(<= mapavg_~i~0 8)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21566#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:28:30,527 INFO L273 TraceCheckUtils]: 84: Hoare triple {21566#(<= mapavg_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21573#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:28:30,528 INFO L273 TraceCheckUtils]: 85: Hoare triple {21573#(<= mapavg_~i~0 9)} assume !(~i~0 < 10000); {21278#false} is VALID [2018-11-23 12:28:30,528 INFO L273 TraceCheckUtils]: 86: Hoare triple {21278#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {21278#false} is VALID [2018-11-23 12:28:30,528 INFO L273 TraceCheckUtils]: 87: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:28:30,528 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21278#false} {21277#true} #70#return; {21278#false} is VALID [2018-11-23 12:28:30,528 INFO L273 TraceCheckUtils]: 89: Hoare triple {21278#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); {21278#false} is VALID [2018-11-23 12:28:30,528 INFO L256 TraceCheckUtils]: 90: Hoare triple {21278#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {21278#false} is VALID [2018-11-23 12:28:30,529 INFO L273 TraceCheckUtils]: 91: Hoare triple {21278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21278#false} is VALID [2018-11-23 12:28:30,529 INFO L273 TraceCheckUtils]: 92: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,529 INFO L273 TraceCheckUtils]: 93: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,529 INFO L273 TraceCheckUtils]: 94: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,529 INFO L273 TraceCheckUtils]: 95: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,529 INFO L273 TraceCheckUtils]: 96: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,529 INFO L273 TraceCheckUtils]: 97: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,529 INFO L273 TraceCheckUtils]: 98: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,530 INFO L273 TraceCheckUtils]: 99: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,530 INFO L273 TraceCheckUtils]: 100: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,530 INFO L273 TraceCheckUtils]: 101: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,530 INFO L273 TraceCheckUtils]: 102: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,530 INFO L273 TraceCheckUtils]: 103: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,531 INFO L273 TraceCheckUtils]: 104: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,531 INFO L273 TraceCheckUtils]: 105: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,531 INFO L273 TraceCheckUtils]: 106: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,531 INFO L273 TraceCheckUtils]: 107: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,531 INFO L273 TraceCheckUtils]: 108: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,531 INFO L273 TraceCheckUtils]: 109: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,531 INFO L273 TraceCheckUtils]: 110: Hoare triple {21278#false} assume !(~i~0 < 10000); {21278#false} is VALID [2018-11-23 12:28:30,532 INFO L273 TraceCheckUtils]: 111: Hoare triple {21278#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {21278#false} is VALID [2018-11-23 12:28:30,532 INFO L273 TraceCheckUtils]: 112: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:28:30,532 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21278#false} {21278#false} #72#return; {21278#false} is VALID [2018-11-23 12:28:30,532 INFO L273 TraceCheckUtils]: 114: Hoare triple {21278#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; {21278#false} is VALID [2018-11-23 12:28:30,532 INFO L273 TraceCheckUtils]: 115: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:30,532 INFO L273 TraceCheckUtils]: 116: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:30,532 INFO L273 TraceCheckUtils]: 117: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:30,532 INFO L273 TraceCheckUtils]: 118: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:30,532 INFO L273 TraceCheckUtils]: 119: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:30,533 INFO L273 TraceCheckUtils]: 120: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:30,533 INFO L273 TraceCheckUtils]: 121: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:30,533 INFO L273 TraceCheckUtils]: 122: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:30,533 INFO L273 TraceCheckUtils]: 123: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:30,533 INFO L273 TraceCheckUtils]: 124: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:30,533 INFO L273 TraceCheckUtils]: 125: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:30,533 INFO L273 TraceCheckUtils]: 126: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:30,533 INFO L273 TraceCheckUtils]: 127: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:30,533 INFO L273 TraceCheckUtils]: 128: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:30,533 INFO L273 TraceCheckUtils]: 129: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:30,534 INFO L273 TraceCheckUtils]: 130: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:30,534 INFO L273 TraceCheckUtils]: 131: Hoare triple {21278#false} assume !(~i~2 < 9999); {21278#false} is VALID [2018-11-23 12:28:30,534 INFO L273 TraceCheckUtils]: 132: Hoare triple {21278#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:28:30,534 INFO L256 TraceCheckUtils]: 133: Hoare triple {21278#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {21278#false} is VALID [2018-11-23 12:28:30,534 INFO L273 TraceCheckUtils]: 134: Hoare triple {21278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21278#false} is VALID [2018-11-23 12:28:30,534 INFO L273 TraceCheckUtils]: 135: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,534 INFO L273 TraceCheckUtils]: 136: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,534 INFO L273 TraceCheckUtils]: 137: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,534 INFO L273 TraceCheckUtils]: 138: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,535 INFO L273 TraceCheckUtils]: 139: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,535 INFO L273 TraceCheckUtils]: 140: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,535 INFO L273 TraceCheckUtils]: 141: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,535 INFO L273 TraceCheckUtils]: 142: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,535 INFO L273 TraceCheckUtils]: 143: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,535 INFO L273 TraceCheckUtils]: 144: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,535 INFO L273 TraceCheckUtils]: 145: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,535 INFO L273 TraceCheckUtils]: 146: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,535 INFO L273 TraceCheckUtils]: 147: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,535 INFO L273 TraceCheckUtils]: 148: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,536 INFO L273 TraceCheckUtils]: 149: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,536 INFO L273 TraceCheckUtils]: 150: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,536 INFO L273 TraceCheckUtils]: 151: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:30,536 INFO L273 TraceCheckUtils]: 152: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:30,536 INFO L273 TraceCheckUtils]: 153: Hoare triple {21278#false} assume !(~i~0 < 10000); {21278#false} is VALID [2018-11-23 12:28:30,536 INFO L273 TraceCheckUtils]: 154: Hoare triple {21278#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {21278#false} is VALID [2018-11-23 12:28:30,536 INFO L273 TraceCheckUtils]: 155: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:28:30,536 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21278#false} {21278#false} #74#return; {21278#false} is VALID [2018-11-23 12:28:30,536 INFO L273 TraceCheckUtils]: 157: Hoare triple {21278#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {21278#false} is VALID [2018-11-23 12:28:30,537 INFO L273 TraceCheckUtils]: 158: Hoare triple {21278#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {21278#false} is VALID [2018-11-23 12:28:30,537 INFO L273 TraceCheckUtils]: 159: Hoare triple {21278#false} assume !false; {21278#false} is VALID [2018-11-23 12:28:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2018-11-23 12:28:30,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:30,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2018-11-23 12:28:30,572 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:28:30,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:30,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:28:30,691 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:28:30,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:28:30,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:28:30,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:30,693 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2018-11-23 12:28:31,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:31,714 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2018-11-23 12:28:31,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:28:31,714 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:28:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:28:31,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:28:31,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 136 transitions. [2018-11-23 12:28:31,849 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:31,852 INFO L225 Difference]: With dead ends: 171 [2018-11-23 12:28:31,852 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 12:28:31,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 12:28:31,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-23 12:28:31,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:31,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 119 states. [2018-11-23 12:28:31,899 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 119 states. [2018-11-23 12:28:31,899 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 119 states. [2018-11-23 12:28:31,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:31,902 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:28:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:28:31,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:31,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:31,902 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 121 states. [2018-11-23 12:28:31,902 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 121 states. [2018-11-23 12:28:31,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:31,904 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:28:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:28:31,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:31,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:31,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:31,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 12:28:31,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-23 12:28:31,908 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2018-11-23 12:28:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:31,908 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-23 12:28:31,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:28:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-23 12:28:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-23 12:28:31,909 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:31,909 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:31,910 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:31,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:31,910 INFO L82 PathProgramCache]: Analyzing trace with hash 574332371, now seen corresponding path program 30 times [2018-11-23 12:28:31,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:31,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:31,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:31,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:31,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:32,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {22471#true} call ULTIMATE.init(); {22471#true} is VALID [2018-11-23 12:28:32,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {22471#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22471#true} is VALID [2018-11-23 12:28:32,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:32,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22471#true} {22471#true} #66#return; {22471#true} is VALID [2018-11-23 12:28:32,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {22471#true} call #t~ret12 := main(); {22471#true} is VALID [2018-11-23 12:28:32,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {22471#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22473#(= main_~i~1 0)} is VALID [2018-11-23 12:28:32,679 INFO L273 TraceCheckUtils]: 6: Hoare triple {22473#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22473#(= main_~i~1 0)} is VALID [2018-11-23 12:28:32,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {22473#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22474#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:32,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {22474#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22474#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:32,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {22474#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22475#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:32,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {22475#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22475#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:32,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {22475#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22476#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:32,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {22476#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22476#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:32,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {22476#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22477#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:32,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {22477#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22477#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:32,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {22477#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22478#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:32,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {22478#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22478#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:32,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {22478#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22479#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:32,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {22479#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22479#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:32,686 INFO L273 TraceCheckUtils]: 19: Hoare triple {22479#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22480#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:32,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {22480#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22480#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:32,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {22480#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22481#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:32,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {22481#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22481#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:32,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {22481#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22482#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:32,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {22482#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22482#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:32,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {22482#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22483#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:32,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {22483#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22483#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:32,691 INFO L273 TraceCheckUtils]: 27: Hoare triple {22483#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22484#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:32,692 INFO L273 TraceCheckUtils]: 28: Hoare triple {22484#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22484#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:32,692 INFO L273 TraceCheckUtils]: 29: Hoare triple {22484#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22485#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:32,693 INFO L273 TraceCheckUtils]: 30: Hoare triple {22485#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22485#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:32,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {22485#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22486#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:32,694 INFO L273 TraceCheckUtils]: 32: Hoare triple {22486#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22486#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:32,695 INFO L273 TraceCheckUtils]: 33: Hoare triple {22486#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22487#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:32,695 INFO L273 TraceCheckUtils]: 34: Hoare triple {22487#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22487#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:32,696 INFO L273 TraceCheckUtils]: 35: Hoare triple {22487#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22488#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:32,697 INFO L273 TraceCheckUtils]: 36: Hoare triple {22488#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22488#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:32,697 INFO L273 TraceCheckUtils]: 37: Hoare triple {22488#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22489#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:32,698 INFO L273 TraceCheckUtils]: 38: Hoare triple {22489#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22489#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:32,699 INFO L273 TraceCheckUtils]: 39: Hoare triple {22489#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22490#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:32,699 INFO L273 TraceCheckUtils]: 40: Hoare triple {22490#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22490#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:32,700 INFO L273 TraceCheckUtils]: 41: Hoare triple {22490#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22491#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:32,700 INFO L273 TraceCheckUtils]: 42: Hoare triple {22491#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22491#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:32,701 INFO L273 TraceCheckUtils]: 43: Hoare triple {22491#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22492#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:32,702 INFO L273 TraceCheckUtils]: 44: Hoare triple {22492#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22492#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:32,702 INFO L273 TraceCheckUtils]: 45: Hoare triple {22492#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22493#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:32,703 INFO L273 TraceCheckUtils]: 46: Hoare triple {22493#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22493#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:32,704 INFO L273 TraceCheckUtils]: 47: Hoare triple {22493#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22494#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:32,704 INFO L273 TraceCheckUtils]: 48: Hoare triple {22494#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22494#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:32,705 INFO L273 TraceCheckUtils]: 49: Hoare triple {22494#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22495#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:32,705 INFO L273 TraceCheckUtils]: 50: Hoare triple {22495#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22495#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:32,706 INFO L273 TraceCheckUtils]: 51: Hoare triple {22495#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22496#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:32,707 INFO L273 TraceCheckUtils]: 52: Hoare triple {22496#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22496#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:32,707 INFO L273 TraceCheckUtils]: 53: Hoare triple {22496#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22497#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:32,708 INFO L273 TraceCheckUtils]: 54: Hoare triple {22497#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22497#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:32,709 INFO L273 TraceCheckUtils]: 55: Hoare triple {22497#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22498#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:32,709 INFO L273 TraceCheckUtils]: 56: Hoare triple {22498#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22498#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:32,710 INFO L273 TraceCheckUtils]: 57: Hoare triple {22498#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22499#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:32,710 INFO L273 TraceCheckUtils]: 58: Hoare triple {22499#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22499#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:32,711 INFO L273 TraceCheckUtils]: 59: Hoare triple {22499#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22500#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:32,712 INFO L273 TraceCheckUtils]: 60: Hoare triple {22500#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22500#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:32,712 INFO L273 TraceCheckUtils]: 61: Hoare triple {22500#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22501#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:32,713 INFO L273 TraceCheckUtils]: 62: Hoare triple {22501#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22501#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:32,714 INFO L273 TraceCheckUtils]: 63: Hoare triple {22501#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22502#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:32,714 INFO L273 TraceCheckUtils]: 64: Hoare triple {22502#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22502#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:32,715 INFO L273 TraceCheckUtils]: 65: Hoare triple {22502#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22503#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:32,716 INFO L273 TraceCheckUtils]: 66: Hoare triple {22503#(<= main_~i~1 30)} assume !(~i~1 < 10000); {22472#false} is VALID [2018-11-23 12:28:32,716 INFO L256 TraceCheckUtils]: 67: Hoare triple {22472#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:28:32,716 INFO L273 TraceCheckUtils]: 68: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22471#true} is VALID [2018-11-23 12:28:32,716 INFO L273 TraceCheckUtils]: 69: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,716 INFO L273 TraceCheckUtils]: 70: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,717 INFO L273 TraceCheckUtils]: 71: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,717 INFO L273 TraceCheckUtils]: 72: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,717 INFO L273 TraceCheckUtils]: 73: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,717 INFO L273 TraceCheckUtils]: 74: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,717 INFO L273 TraceCheckUtils]: 75: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,717 INFO L273 TraceCheckUtils]: 76: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,718 INFO L273 TraceCheckUtils]: 77: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,718 INFO L273 TraceCheckUtils]: 78: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,718 INFO L273 TraceCheckUtils]: 79: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,718 INFO L273 TraceCheckUtils]: 80: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,718 INFO L273 TraceCheckUtils]: 81: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,719 INFO L273 TraceCheckUtils]: 82: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,719 INFO L273 TraceCheckUtils]: 83: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,719 INFO L273 TraceCheckUtils]: 84: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,719 INFO L273 TraceCheckUtils]: 85: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,719 INFO L273 TraceCheckUtils]: 86: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,719 INFO L273 TraceCheckUtils]: 87: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,720 INFO L273 TraceCheckUtils]: 88: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,720 INFO L273 TraceCheckUtils]: 89: Hoare triple {22471#true} assume !(~i~0 < 10000); {22471#true} is VALID [2018-11-23 12:28:32,720 INFO L273 TraceCheckUtils]: 90: Hoare triple {22471#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:28:32,720 INFO L273 TraceCheckUtils]: 91: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:32,720 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22471#true} {22472#false} #70#return; {22472#false} is VALID [2018-11-23 12:28:32,720 INFO L273 TraceCheckUtils]: 93: Hoare triple {22472#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); {22472#false} is VALID [2018-11-23 12:28:32,720 INFO L256 TraceCheckUtils]: 94: Hoare triple {22472#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:28:32,720 INFO L273 TraceCheckUtils]: 95: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22471#true} is VALID [2018-11-23 12:28:32,720 INFO L273 TraceCheckUtils]: 96: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,721 INFO L273 TraceCheckUtils]: 97: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,721 INFO L273 TraceCheckUtils]: 98: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,721 INFO L273 TraceCheckUtils]: 99: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,721 INFO L273 TraceCheckUtils]: 100: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,721 INFO L273 TraceCheckUtils]: 101: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,721 INFO L273 TraceCheckUtils]: 102: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,721 INFO L273 TraceCheckUtils]: 103: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,721 INFO L273 TraceCheckUtils]: 104: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,721 INFO L273 TraceCheckUtils]: 105: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,721 INFO L273 TraceCheckUtils]: 106: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,722 INFO L273 TraceCheckUtils]: 107: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,722 INFO L273 TraceCheckUtils]: 108: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,722 INFO L273 TraceCheckUtils]: 109: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,722 INFO L273 TraceCheckUtils]: 110: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,722 INFO L273 TraceCheckUtils]: 111: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,722 INFO L273 TraceCheckUtils]: 112: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,722 INFO L273 TraceCheckUtils]: 113: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,722 INFO L273 TraceCheckUtils]: 114: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,722 INFO L273 TraceCheckUtils]: 115: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,722 INFO L273 TraceCheckUtils]: 116: Hoare triple {22471#true} assume !(~i~0 < 10000); {22471#true} is VALID [2018-11-23 12:28:32,723 INFO L273 TraceCheckUtils]: 117: Hoare triple {22471#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:28:32,723 INFO L273 TraceCheckUtils]: 118: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:32,723 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22471#true} {22472#false} #72#return; {22472#false} is VALID [2018-11-23 12:28:32,723 INFO L273 TraceCheckUtils]: 120: Hoare triple {22472#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; {22472#false} is VALID [2018-11-23 12:28:32,723 INFO L273 TraceCheckUtils]: 121: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:32,723 INFO L273 TraceCheckUtils]: 122: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:32,723 INFO L273 TraceCheckUtils]: 123: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:32,723 INFO L273 TraceCheckUtils]: 124: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:32,723 INFO L273 TraceCheckUtils]: 125: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:32,724 INFO L273 TraceCheckUtils]: 126: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:32,724 INFO L273 TraceCheckUtils]: 127: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:32,724 INFO L273 TraceCheckUtils]: 128: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:32,724 INFO L273 TraceCheckUtils]: 129: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:32,724 INFO L273 TraceCheckUtils]: 130: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:32,724 INFO L273 TraceCheckUtils]: 131: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:32,724 INFO L273 TraceCheckUtils]: 132: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:32,724 INFO L273 TraceCheckUtils]: 133: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:32,724 INFO L273 TraceCheckUtils]: 134: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:32,724 INFO L273 TraceCheckUtils]: 135: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:32,725 INFO L273 TraceCheckUtils]: 136: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:32,725 INFO L273 TraceCheckUtils]: 137: Hoare triple {22472#false} assume !(~i~2 < 9999); {22472#false} is VALID [2018-11-23 12:28:32,725 INFO L273 TraceCheckUtils]: 138: Hoare triple {22472#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:28:32,725 INFO L256 TraceCheckUtils]: 139: Hoare triple {22472#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:28:32,725 INFO L273 TraceCheckUtils]: 140: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22471#true} is VALID [2018-11-23 12:28:32,725 INFO L273 TraceCheckUtils]: 141: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,725 INFO L273 TraceCheckUtils]: 142: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,725 INFO L273 TraceCheckUtils]: 143: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,726 INFO L273 TraceCheckUtils]: 144: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,726 INFO L273 TraceCheckUtils]: 145: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,726 INFO L273 TraceCheckUtils]: 146: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,726 INFO L273 TraceCheckUtils]: 147: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,726 INFO L273 TraceCheckUtils]: 148: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,726 INFO L273 TraceCheckUtils]: 149: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,726 INFO L273 TraceCheckUtils]: 150: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,727 INFO L273 TraceCheckUtils]: 151: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,727 INFO L273 TraceCheckUtils]: 152: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,727 INFO L273 TraceCheckUtils]: 153: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,727 INFO L273 TraceCheckUtils]: 154: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,727 INFO L273 TraceCheckUtils]: 155: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,727 INFO L273 TraceCheckUtils]: 156: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,727 INFO L273 TraceCheckUtils]: 157: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,728 INFO L273 TraceCheckUtils]: 158: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,728 INFO L273 TraceCheckUtils]: 159: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:32,728 INFO L273 TraceCheckUtils]: 160: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:32,728 INFO L273 TraceCheckUtils]: 161: Hoare triple {22471#true} assume !(~i~0 < 10000); {22471#true} is VALID [2018-11-23 12:28:32,728 INFO L273 TraceCheckUtils]: 162: Hoare triple {22471#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:28:32,728 INFO L273 TraceCheckUtils]: 163: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:32,728 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22471#true} {22472#false} #74#return; {22472#false} is VALID [2018-11-23 12:28:32,729 INFO L273 TraceCheckUtils]: 165: Hoare triple {22472#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {22472#false} is VALID [2018-11-23 12:28:32,729 INFO L273 TraceCheckUtils]: 166: Hoare triple {22472#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {22472#false} is VALID [2018-11-23 12:28:32,729 INFO L273 TraceCheckUtils]: 167: Hoare triple {22472#false} assume !false; {22472#false} is VALID [2018-11-23 12:28:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2018-11-23 12:28:32,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:32,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32,787 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:37,129 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:28:37,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:37,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:37,813 INFO L256 TraceCheckUtils]: 0: Hoare triple {22471#true} call ULTIMATE.init(); {22471#true} is VALID [2018-11-23 12:28:37,814 INFO L273 TraceCheckUtils]: 1: Hoare triple {22471#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22471#true} is VALID [2018-11-23 12:28:37,814 INFO L273 TraceCheckUtils]: 2: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:37,815 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22471#true} {22471#true} #66#return; {22471#true} is VALID [2018-11-23 12:28:37,815 INFO L256 TraceCheckUtils]: 4: Hoare triple {22471#true} call #t~ret12 := main(); {22471#true} is VALID [2018-11-23 12:28:37,815 INFO L273 TraceCheckUtils]: 5: Hoare triple {22471#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22471#true} is VALID [2018-11-23 12:28:37,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,815 INFO L273 TraceCheckUtils]: 7: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,816 INFO L273 TraceCheckUtils]: 9: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,816 INFO L273 TraceCheckUtils]: 13: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,817 INFO L273 TraceCheckUtils]: 14: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,817 INFO L273 TraceCheckUtils]: 17: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,817 INFO L273 TraceCheckUtils]: 18: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,817 INFO L273 TraceCheckUtils]: 19: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,818 INFO L273 TraceCheckUtils]: 20: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,818 INFO L273 TraceCheckUtils]: 21: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,818 INFO L273 TraceCheckUtils]: 22: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,818 INFO L273 TraceCheckUtils]: 23: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,818 INFO L273 TraceCheckUtils]: 24: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,818 INFO L273 TraceCheckUtils]: 25: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,818 INFO L273 TraceCheckUtils]: 26: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,819 INFO L273 TraceCheckUtils]: 27: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,819 INFO L273 TraceCheckUtils]: 28: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,819 INFO L273 TraceCheckUtils]: 29: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,819 INFO L273 TraceCheckUtils]: 30: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,819 INFO L273 TraceCheckUtils]: 31: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,819 INFO L273 TraceCheckUtils]: 32: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,820 INFO L273 TraceCheckUtils]: 33: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,820 INFO L273 TraceCheckUtils]: 34: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,820 INFO L273 TraceCheckUtils]: 35: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,820 INFO L273 TraceCheckUtils]: 36: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,820 INFO L273 TraceCheckUtils]: 37: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,820 INFO L273 TraceCheckUtils]: 38: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,820 INFO L273 TraceCheckUtils]: 39: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,821 INFO L273 TraceCheckUtils]: 40: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,821 INFO L273 TraceCheckUtils]: 41: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,821 INFO L273 TraceCheckUtils]: 42: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,821 INFO L273 TraceCheckUtils]: 43: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,821 INFO L273 TraceCheckUtils]: 44: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,821 INFO L273 TraceCheckUtils]: 45: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,821 INFO L273 TraceCheckUtils]: 46: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,822 INFO L273 TraceCheckUtils]: 47: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,822 INFO L273 TraceCheckUtils]: 48: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,822 INFO L273 TraceCheckUtils]: 49: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,822 INFO L273 TraceCheckUtils]: 50: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,822 INFO L273 TraceCheckUtils]: 51: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,822 INFO L273 TraceCheckUtils]: 52: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,823 INFO L273 TraceCheckUtils]: 53: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,823 INFO L273 TraceCheckUtils]: 54: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,823 INFO L273 TraceCheckUtils]: 55: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,823 INFO L273 TraceCheckUtils]: 56: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,823 INFO L273 TraceCheckUtils]: 57: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,823 INFO L273 TraceCheckUtils]: 58: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,823 INFO L273 TraceCheckUtils]: 59: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,824 INFO L273 TraceCheckUtils]: 60: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,824 INFO L273 TraceCheckUtils]: 61: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,824 INFO L273 TraceCheckUtils]: 62: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,824 INFO L273 TraceCheckUtils]: 63: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,824 INFO L273 TraceCheckUtils]: 64: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:37,824 INFO L273 TraceCheckUtils]: 65: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:37,824 INFO L273 TraceCheckUtils]: 66: Hoare triple {22471#true} assume !(~i~1 < 10000); {22471#true} is VALID [2018-11-23 12:28:37,825 INFO L256 TraceCheckUtils]: 67: Hoare triple {22471#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:28:37,825 INFO L273 TraceCheckUtils]: 68: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22471#true} is VALID [2018-11-23 12:28:37,825 INFO L273 TraceCheckUtils]: 69: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,825 INFO L273 TraceCheckUtils]: 70: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,825 INFO L273 TraceCheckUtils]: 71: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,825 INFO L273 TraceCheckUtils]: 72: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,826 INFO L273 TraceCheckUtils]: 73: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,826 INFO L273 TraceCheckUtils]: 74: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,826 INFO L273 TraceCheckUtils]: 75: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,826 INFO L273 TraceCheckUtils]: 76: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,826 INFO L273 TraceCheckUtils]: 77: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,826 INFO L273 TraceCheckUtils]: 78: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,826 INFO L273 TraceCheckUtils]: 79: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,827 INFO L273 TraceCheckUtils]: 80: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,827 INFO L273 TraceCheckUtils]: 81: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,827 INFO L273 TraceCheckUtils]: 82: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,827 INFO L273 TraceCheckUtils]: 83: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,827 INFO L273 TraceCheckUtils]: 84: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,827 INFO L273 TraceCheckUtils]: 85: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,827 INFO L273 TraceCheckUtils]: 86: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,828 INFO L273 TraceCheckUtils]: 87: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,828 INFO L273 TraceCheckUtils]: 88: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,828 INFO L273 TraceCheckUtils]: 89: Hoare triple {22471#true} assume !(~i~0 < 10000); {22471#true} is VALID [2018-11-23 12:28:37,828 INFO L273 TraceCheckUtils]: 90: Hoare triple {22471#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:28:37,828 INFO L273 TraceCheckUtils]: 91: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:37,828 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22471#true} {22471#true} #70#return; {22471#true} is VALID [2018-11-23 12:28:37,828 INFO L273 TraceCheckUtils]: 93: Hoare triple {22471#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); {22471#true} is VALID [2018-11-23 12:28:37,829 INFO L256 TraceCheckUtils]: 94: Hoare triple {22471#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:28:37,829 INFO L273 TraceCheckUtils]: 95: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22471#true} is VALID [2018-11-23 12:28:37,829 INFO L273 TraceCheckUtils]: 96: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,829 INFO L273 TraceCheckUtils]: 97: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,829 INFO L273 TraceCheckUtils]: 98: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,829 INFO L273 TraceCheckUtils]: 99: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,830 INFO L273 TraceCheckUtils]: 100: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,830 INFO L273 TraceCheckUtils]: 101: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,830 INFO L273 TraceCheckUtils]: 102: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,830 INFO L273 TraceCheckUtils]: 103: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,830 INFO L273 TraceCheckUtils]: 104: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,830 INFO L273 TraceCheckUtils]: 105: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,830 INFO L273 TraceCheckUtils]: 106: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,831 INFO L273 TraceCheckUtils]: 107: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,831 INFO L273 TraceCheckUtils]: 108: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,831 INFO L273 TraceCheckUtils]: 109: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,831 INFO L273 TraceCheckUtils]: 110: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,831 INFO L273 TraceCheckUtils]: 111: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,831 INFO L273 TraceCheckUtils]: 112: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,831 INFO L273 TraceCheckUtils]: 113: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,832 INFO L273 TraceCheckUtils]: 114: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,832 INFO L273 TraceCheckUtils]: 115: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,832 INFO L273 TraceCheckUtils]: 116: Hoare triple {22471#true} assume !(~i~0 < 10000); {22471#true} is VALID [2018-11-23 12:28:37,832 INFO L273 TraceCheckUtils]: 117: Hoare triple {22471#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:28:37,832 INFO L273 TraceCheckUtils]: 118: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:37,832 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22471#true} {22471#true} #72#return; {22471#true} is VALID [2018-11-23 12:28:37,848 INFO L273 TraceCheckUtils]: 120: Hoare triple {22471#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; {22867#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:37,857 INFO L273 TraceCheckUtils]: 121: Hoare triple {22867#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22867#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:37,859 INFO L273 TraceCheckUtils]: 122: Hoare triple {22867#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22874#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:37,859 INFO L273 TraceCheckUtils]: 123: Hoare triple {22874#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22874#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:37,861 INFO L273 TraceCheckUtils]: 124: Hoare triple {22874#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22881#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:37,861 INFO L273 TraceCheckUtils]: 125: Hoare triple {22881#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22881#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:37,863 INFO L273 TraceCheckUtils]: 126: Hoare triple {22881#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22888#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:37,863 INFO L273 TraceCheckUtils]: 127: Hoare triple {22888#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22888#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:37,866 INFO L273 TraceCheckUtils]: 128: Hoare triple {22888#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22895#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:37,866 INFO L273 TraceCheckUtils]: 129: Hoare triple {22895#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22895#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:37,869 INFO L273 TraceCheckUtils]: 130: Hoare triple {22895#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22902#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:37,869 INFO L273 TraceCheckUtils]: 131: Hoare triple {22902#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22902#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:37,869 INFO L273 TraceCheckUtils]: 132: Hoare triple {22902#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22909#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:37,870 INFO L273 TraceCheckUtils]: 133: Hoare triple {22909#(<= main_~i~2 6)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22909#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:37,870 INFO L273 TraceCheckUtils]: 134: Hoare triple {22909#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22916#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:37,870 INFO L273 TraceCheckUtils]: 135: Hoare triple {22916#(<= main_~i~2 7)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22916#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:37,871 INFO L273 TraceCheckUtils]: 136: Hoare triple {22916#(<= main_~i~2 7)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22923#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:37,871 INFO L273 TraceCheckUtils]: 137: Hoare triple {22923#(<= main_~i~2 8)} assume !(~i~2 < 9999); {22472#false} is VALID [2018-11-23 12:28:37,871 INFO L273 TraceCheckUtils]: 138: Hoare triple {22472#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:28:37,872 INFO L256 TraceCheckUtils]: 139: Hoare triple {22472#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {22472#false} is VALID [2018-11-23 12:28:37,872 INFO L273 TraceCheckUtils]: 140: Hoare triple {22472#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22472#false} is VALID [2018-11-23 12:28:37,872 INFO L273 TraceCheckUtils]: 141: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:37,872 INFO L273 TraceCheckUtils]: 142: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:37,872 INFO L273 TraceCheckUtils]: 143: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:37,872 INFO L273 TraceCheckUtils]: 144: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:37,872 INFO L273 TraceCheckUtils]: 145: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:37,872 INFO L273 TraceCheckUtils]: 146: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:37,872 INFO L273 TraceCheckUtils]: 147: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:37,872 INFO L273 TraceCheckUtils]: 148: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:37,873 INFO L273 TraceCheckUtils]: 149: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:37,873 INFO L273 TraceCheckUtils]: 150: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:37,873 INFO L273 TraceCheckUtils]: 151: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:37,873 INFO L273 TraceCheckUtils]: 152: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:37,873 INFO L273 TraceCheckUtils]: 153: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:37,873 INFO L273 TraceCheckUtils]: 154: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:37,873 INFO L273 TraceCheckUtils]: 155: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:37,873 INFO L273 TraceCheckUtils]: 156: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:37,874 INFO L273 TraceCheckUtils]: 157: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:37,874 INFO L273 TraceCheckUtils]: 158: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:37,874 INFO L273 TraceCheckUtils]: 159: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:37,874 INFO L273 TraceCheckUtils]: 160: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:37,874 INFO L273 TraceCheckUtils]: 161: Hoare triple {22472#false} assume !(~i~0 < 10000); {22472#false} is VALID [2018-11-23 12:28:37,874 INFO L273 TraceCheckUtils]: 162: Hoare triple {22472#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {22472#false} is VALID [2018-11-23 12:28:37,875 INFO L273 TraceCheckUtils]: 163: Hoare triple {22472#false} assume true; {22472#false} is VALID [2018-11-23 12:28:37,875 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22472#false} {22472#false} #74#return; {22472#false} is VALID [2018-11-23 12:28:37,875 INFO L273 TraceCheckUtils]: 165: Hoare triple {22472#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {22472#false} is VALID [2018-11-23 12:28:37,875 INFO L273 TraceCheckUtils]: 166: Hoare triple {22472#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {22472#false} is VALID [2018-11-23 12:28:37,875 INFO L273 TraceCheckUtils]: 167: Hoare triple {22472#false} assume !false; {22472#false} is VALID [2018-11-23 12:28:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2018-11-23 12:28:37,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:37,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2018-11-23 12:28:37,909 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:28:37,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:37,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:28:38,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:38,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:28:38,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:28:38,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:38,037 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2018-11-23 12:28:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:39,094 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-11-23 12:28:39,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:28:39,095 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:28:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:28:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:28:39,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 133 transitions. [2018-11-23 12:28:39,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:39,276 INFO L225 Difference]: With dead ends: 177 [2018-11-23 12:28:39,276 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:28:39,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:28:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-23 12:28:39,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:39,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 123 states. [2018-11-23 12:28:39,321 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 123 states. [2018-11-23 12:28:39,321 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 123 states. [2018-11-23 12:28:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:39,325 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:28:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:28:39,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:39,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:39,325 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 125 states. [2018-11-23 12:28:39,325 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 125 states. [2018-11-23 12:28:39,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:39,328 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:28:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:28:39,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:39,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:39,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:39,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 12:28:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-11-23 12:28:39,331 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2018-11-23 12:28:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:39,331 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-11-23 12:28:39,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:28:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-23 12:28:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 12:28:39,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:39,332 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:39,333 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:39,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:39,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1218163405, now seen corresponding path program 31 times [2018-11-23 12:28:39,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:39,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:39,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:39,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:39,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:40,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {23712#true} call ULTIMATE.init(); {23712#true} is VALID [2018-11-23 12:28:40,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {23712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23712#true} is VALID [2018-11-23 12:28:40,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:28:40,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23712#true} {23712#true} #66#return; {23712#true} is VALID [2018-11-23 12:28:40,275 INFO L256 TraceCheckUtils]: 4: Hoare triple {23712#true} call #t~ret12 := main(); {23712#true} is VALID [2018-11-23 12:28:40,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {23712#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23714#(= main_~i~1 0)} is VALID [2018-11-23 12:28:40,276 INFO L273 TraceCheckUtils]: 6: Hoare triple {23714#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23714#(= main_~i~1 0)} is VALID [2018-11-23 12:28:40,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {23714#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:40,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {23715#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:40,278 INFO L273 TraceCheckUtils]: 9: Hoare triple {23715#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:40,279 INFO L273 TraceCheckUtils]: 10: Hoare triple {23716#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:40,279 INFO L273 TraceCheckUtils]: 11: Hoare triple {23716#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:40,280 INFO L273 TraceCheckUtils]: 12: Hoare triple {23717#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:40,281 INFO L273 TraceCheckUtils]: 13: Hoare triple {23717#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:40,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {23718#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:40,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {23718#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:40,282 INFO L273 TraceCheckUtils]: 16: Hoare triple {23719#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:40,283 INFO L273 TraceCheckUtils]: 17: Hoare triple {23719#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:40,283 INFO L273 TraceCheckUtils]: 18: Hoare triple {23720#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:40,284 INFO L273 TraceCheckUtils]: 19: Hoare triple {23720#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:40,285 INFO L273 TraceCheckUtils]: 20: Hoare triple {23721#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:40,285 INFO L273 TraceCheckUtils]: 21: Hoare triple {23721#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:40,286 INFO L273 TraceCheckUtils]: 22: Hoare triple {23722#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:40,286 INFO L273 TraceCheckUtils]: 23: Hoare triple {23722#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:40,287 INFO L273 TraceCheckUtils]: 24: Hoare triple {23723#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:40,288 INFO L273 TraceCheckUtils]: 25: Hoare triple {23723#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:40,288 INFO L273 TraceCheckUtils]: 26: Hoare triple {23724#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:40,289 INFO L273 TraceCheckUtils]: 27: Hoare triple {23724#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:40,289 INFO L273 TraceCheckUtils]: 28: Hoare triple {23725#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:40,290 INFO L273 TraceCheckUtils]: 29: Hoare triple {23725#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:40,290 INFO L273 TraceCheckUtils]: 30: Hoare triple {23726#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:40,291 INFO L273 TraceCheckUtils]: 31: Hoare triple {23726#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:40,292 INFO L273 TraceCheckUtils]: 32: Hoare triple {23727#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:40,292 INFO L273 TraceCheckUtils]: 33: Hoare triple {23727#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:40,293 INFO L273 TraceCheckUtils]: 34: Hoare triple {23728#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:40,293 INFO L273 TraceCheckUtils]: 35: Hoare triple {23728#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:40,294 INFO L273 TraceCheckUtils]: 36: Hoare triple {23729#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:40,295 INFO L273 TraceCheckUtils]: 37: Hoare triple {23729#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:40,295 INFO L273 TraceCheckUtils]: 38: Hoare triple {23730#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:40,296 INFO L273 TraceCheckUtils]: 39: Hoare triple {23730#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:40,296 INFO L273 TraceCheckUtils]: 40: Hoare triple {23731#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:40,297 INFO L273 TraceCheckUtils]: 41: Hoare triple {23731#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:40,297 INFO L273 TraceCheckUtils]: 42: Hoare triple {23732#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:40,298 INFO L273 TraceCheckUtils]: 43: Hoare triple {23732#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:40,299 INFO L273 TraceCheckUtils]: 44: Hoare triple {23733#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:40,299 INFO L273 TraceCheckUtils]: 45: Hoare triple {23733#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:40,300 INFO L273 TraceCheckUtils]: 46: Hoare triple {23734#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:40,300 INFO L273 TraceCheckUtils]: 47: Hoare triple {23734#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:40,301 INFO L273 TraceCheckUtils]: 48: Hoare triple {23735#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:40,302 INFO L273 TraceCheckUtils]: 49: Hoare triple {23735#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:40,311 INFO L273 TraceCheckUtils]: 50: Hoare triple {23736#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:40,311 INFO L273 TraceCheckUtils]: 51: Hoare triple {23736#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:40,312 INFO L273 TraceCheckUtils]: 52: Hoare triple {23737#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:40,312 INFO L273 TraceCheckUtils]: 53: Hoare triple {23737#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:40,313 INFO L273 TraceCheckUtils]: 54: Hoare triple {23738#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:40,313 INFO L273 TraceCheckUtils]: 55: Hoare triple {23738#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:40,313 INFO L273 TraceCheckUtils]: 56: Hoare triple {23739#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:40,314 INFO L273 TraceCheckUtils]: 57: Hoare triple {23739#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:40,314 INFO L273 TraceCheckUtils]: 58: Hoare triple {23740#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:40,315 INFO L273 TraceCheckUtils]: 59: Hoare triple {23740#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:40,315 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:40,316 INFO L273 TraceCheckUtils]: 61: Hoare triple {23741#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:40,316 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:40,317 INFO L273 TraceCheckUtils]: 63: Hoare triple {23742#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:40,317 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:40,318 INFO L273 TraceCheckUtils]: 65: Hoare triple {23743#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:40,319 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:40,319 INFO L273 TraceCheckUtils]: 67: Hoare triple {23744#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23745#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:40,320 INFO L273 TraceCheckUtils]: 68: Hoare triple {23745#(<= main_~i~1 31)} assume !(~i~1 < 10000); {23713#false} is VALID [2018-11-23 12:28:40,320 INFO L256 TraceCheckUtils]: 69: Hoare triple {23713#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {23712#true} is VALID [2018-11-23 12:28:40,320 INFO L273 TraceCheckUtils]: 70: Hoare triple {23712#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23712#true} is VALID [2018-11-23 12:28:40,321 INFO L273 TraceCheckUtils]: 71: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,321 INFO L273 TraceCheckUtils]: 72: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,321 INFO L273 TraceCheckUtils]: 73: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,321 INFO L273 TraceCheckUtils]: 74: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,321 INFO L273 TraceCheckUtils]: 75: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,321 INFO L273 TraceCheckUtils]: 76: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,322 INFO L273 TraceCheckUtils]: 77: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,322 INFO L273 TraceCheckUtils]: 78: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,322 INFO L273 TraceCheckUtils]: 79: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,322 INFO L273 TraceCheckUtils]: 80: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,322 INFO L273 TraceCheckUtils]: 81: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,323 INFO L273 TraceCheckUtils]: 82: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,323 INFO L273 TraceCheckUtils]: 83: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,323 INFO L273 TraceCheckUtils]: 84: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,323 INFO L273 TraceCheckUtils]: 85: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,323 INFO L273 TraceCheckUtils]: 86: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,323 INFO L273 TraceCheckUtils]: 87: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,324 INFO L273 TraceCheckUtils]: 88: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,324 INFO L273 TraceCheckUtils]: 89: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,324 INFO L273 TraceCheckUtils]: 90: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,324 INFO L273 TraceCheckUtils]: 91: Hoare triple {23712#true} assume !(~i~0 < 10000); {23712#true} is VALID [2018-11-23 12:28:40,324 INFO L273 TraceCheckUtils]: 92: Hoare triple {23712#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {23712#true} is VALID [2018-11-23 12:28:40,325 INFO L273 TraceCheckUtils]: 93: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:28:40,325 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23712#true} {23713#false} #70#return; {23713#false} is VALID [2018-11-23 12:28:40,325 INFO L273 TraceCheckUtils]: 95: Hoare triple {23713#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); {23713#false} is VALID [2018-11-23 12:28:40,325 INFO L256 TraceCheckUtils]: 96: Hoare triple {23713#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {23712#true} is VALID [2018-11-23 12:28:40,325 INFO L273 TraceCheckUtils]: 97: Hoare triple {23712#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23712#true} is VALID [2018-11-23 12:28:40,325 INFO L273 TraceCheckUtils]: 98: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,325 INFO L273 TraceCheckUtils]: 99: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,325 INFO L273 TraceCheckUtils]: 100: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,325 INFO L273 TraceCheckUtils]: 101: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,326 INFO L273 TraceCheckUtils]: 102: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,326 INFO L273 TraceCheckUtils]: 103: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,326 INFO L273 TraceCheckUtils]: 104: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,326 INFO L273 TraceCheckUtils]: 105: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,326 INFO L273 TraceCheckUtils]: 106: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,326 INFO L273 TraceCheckUtils]: 107: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,326 INFO L273 TraceCheckUtils]: 108: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,326 INFO L273 TraceCheckUtils]: 109: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,326 INFO L273 TraceCheckUtils]: 110: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,327 INFO L273 TraceCheckUtils]: 111: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,327 INFO L273 TraceCheckUtils]: 112: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,327 INFO L273 TraceCheckUtils]: 113: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,327 INFO L273 TraceCheckUtils]: 114: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,327 INFO L273 TraceCheckUtils]: 115: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,327 INFO L273 TraceCheckUtils]: 116: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,327 INFO L273 TraceCheckUtils]: 117: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,327 INFO L273 TraceCheckUtils]: 118: Hoare triple {23712#true} assume !(~i~0 < 10000); {23712#true} is VALID [2018-11-23 12:28:40,327 INFO L273 TraceCheckUtils]: 119: Hoare triple {23712#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {23712#true} is VALID [2018-11-23 12:28:40,327 INFO L273 TraceCheckUtils]: 120: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:28:40,328 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23712#true} {23713#false} #72#return; {23713#false} is VALID [2018-11-23 12:28:40,328 INFO L273 TraceCheckUtils]: 122: Hoare triple {23713#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; {23713#false} is VALID [2018-11-23 12:28:40,328 INFO L273 TraceCheckUtils]: 123: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,328 INFO L273 TraceCheckUtils]: 124: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,328 INFO L273 TraceCheckUtils]: 125: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,328 INFO L273 TraceCheckUtils]: 126: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,328 INFO L273 TraceCheckUtils]: 127: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,328 INFO L273 TraceCheckUtils]: 128: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,328 INFO L273 TraceCheckUtils]: 129: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,328 INFO L273 TraceCheckUtils]: 130: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,329 INFO L273 TraceCheckUtils]: 131: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,329 INFO L273 TraceCheckUtils]: 132: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,329 INFO L273 TraceCheckUtils]: 133: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,329 INFO L273 TraceCheckUtils]: 134: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,329 INFO L273 TraceCheckUtils]: 135: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,329 INFO L273 TraceCheckUtils]: 136: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,329 INFO L273 TraceCheckUtils]: 137: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,329 INFO L273 TraceCheckUtils]: 138: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,329 INFO L273 TraceCheckUtils]: 139: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,329 INFO L273 TraceCheckUtils]: 140: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,330 INFO L273 TraceCheckUtils]: 141: Hoare triple {23713#false} assume !(~i~2 < 9999); {23713#false} is VALID [2018-11-23 12:28:40,330 INFO L273 TraceCheckUtils]: 142: Hoare triple {23713#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:28:40,330 INFO L256 TraceCheckUtils]: 143: Hoare triple {23713#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {23712#true} is VALID [2018-11-23 12:28:40,330 INFO L273 TraceCheckUtils]: 144: Hoare triple {23712#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23712#true} is VALID [2018-11-23 12:28:40,330 INFO L273 TraceCheckUtils]: 145: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,330 INFO L273 TraceCheckUtils]: 146: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,330 INFO L273 TraceCheckUtils]: 147: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,330 INFO L273 TraceCheckUtils]: 148: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,330 INFO L273 TraceCheckUtils]: 149: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,330 INFO L273 TraceCheckUtils]: 150: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,331 INFO L273 TraceCheckUtils]: 151: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,331 INFO L273 TraceCheckUtils]: 152: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,331 INFO L273 TraceCheckUtils]: 153: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,331 INFO L273 TraceCheckUtils]: 154: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,331 INFO L273 TraceCheckUtils]: 155: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,331 INFO L273 TraceCheckUtils]: 156: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,331 INFO L273 TraceCheckUtils]: 157: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,331 INFO L273 TraceCheckUtils]: 158: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,331 INFO L273 TraceCheckUtils]: 159: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,331 INFO L273 TraceCheckUtils]: 160: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,332 INFO L273 TraceCheckUtils]: 161: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,332 INFO L273 TraceCheckUtils]: 162: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,332 INFO L273 TraceCheckUtils]: 163: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:40,332 INFO L273 TraceCheckUtils]: 164: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:40,332 INFO L273 TraceCheckUtils]: 165: Hoare triple {23712#true} assume !(~i~0 < 10000); {23712#true} is VALID [2018-11-23 12:28:40,332 INFO L273 TraceCheckUtils]: 166: Hoare triple {23712#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {23712#true} is VALID [2018-11-23 12:28:40,332 INFO L273 TraceCheckUtils]: 167: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:28:40,332 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23712#true} {23713#false} #74#return; {23713#false} is VALID [2018-11-23 12:28:40,332 INFO L273 TraceCheckUtils]: 169: Hoare triple {23713#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {23713#false} is VALID [2018-11-23 12:28:40,333 INFO L273 TraceCheckUtils]: 170: Hoare triple {23713#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {23713#false} is VALID [2018-11-23 12:28:40,333 INFO L273 TraceCheckUtils]: 171: Hoare triple {23713#false} assume !false; {23713#false} is VALID [2018-11-23 12:28:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:28:40,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:40,346 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:40,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:40,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:40,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {23712#true} call ULTIMATE.init(); {23712#true} is VALID [2018-11-23 12:28:40,913 INFO L273 TraceCheckUtils]: 1: Hoare triple {23712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23712#true} is VALID [2018-11-23 12:28:40,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:28:40,914 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23712#true} {23712#true} #66#return; {23712#true} is VALID [2018-11-23 12:28:40,914 INFO L256 TraceCheckUtils]: 4: Hoare triple {23712#true} call #t~ret12 := main(); {23712#true} is VALID [2018-11-23 12:28:40,915 INFO L273 TraceCheckUtils]: 5: Hoare triple {23712#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23764#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:40,915 INFO L273 TraceCheckUtils]: 6: Hoare triple {23764#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23764#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:40,916 INFO L273 TraceCheckUtils]: 7: Hoare triple {23764#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:40,916 INFO L273 TraceCheckUtils]: 8: Hoare triple {23715#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:40,916 INFO L273 TraceCheckUtils]: 9: Hoare triple {23715#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:40,917 INFO L273 TraceCheckUtils]: 10: Hoare triple {23716#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:40,917 INFO L273 TraceCheckUtils]: 11: Hoare triple {23716#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:40,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {23717#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:40,919 INFO L273 TraceCheckUtils]: 13: Hoare triple {23717#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:40,919 INFO L273 TraceCheckUtils]: 14: Hoare triple {23718#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:40,920 INFO L273 TraceCheckUtils]: 15: Hoare triple {23718#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:40,920 INFO L273 TraceCheckUtils]: 16: Hoare triple {23719#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:40,921 INFO L273 TraceCheckUtils]: 17: Hoare triple {23719#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:40,922 INFO L273 TraceCheckUtils]: 18: Hoare triple {23720#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:40,922 INFO L273 TraceCheckUtils]: 19: Hoare triple {23720#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:40,923 INFO L273 TraceCheckUtils]: 20: Hoare triple {23721#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:40,924 INFO L273 TraceCheckUtils]: 21: Hoare triple {23721#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:40,924 INFO L273 TraceCheckUtils]: 22: Hoare triple {23722#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:40,925 INFO L273 TraceCheckUtils]: 23: Hoare triple {23722#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:40,925 INFO L273 TraceCheckUtils]: 24: Hoare triple {23723#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:40,926 INFO L273 TraceCheckUtils]: 25: Hoare triple {23723#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:40,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {23724#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:40,927 INFO L273 TraceCheckUtils]: 27: Hoare triple {23724#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:40,928 INFO L273 TraceCheckUtils]: 28: Hoare triple {23725#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:40,928 INFO L273 TraceCheckUtils]: 29: Hoare triple {23725#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:40,929 INFO L273 TraceCheckUtils]: 30: Hoare triple {23726#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:40,930 INFO L273 TraceCheckUtils]: 31: Hoare triple {23726#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:40,930 INFO L273 TraceCheckUtils]: 32: Hoare triple {23727#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:40,931 INFO L273 TraceCheckUtils]: 33: Hoare triple {23727#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:40,931 INFO L273 TraceCheckUtils]: 34: Hoare triple {23728#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:40,932 INFO L273 TraceCheckUtils]: 35: Hoare triple {23728#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:40,933 INFO L273 TraceCheckUtils]: 36: Hoare triple {23729#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:40,933 INFO L273 TraceCheckUtils]: 37: Hoare triple {23729#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:40,934 INFO L273 TraceCheckUtils]: 38: Hoare triple {23730#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:40,935 INFO L273 TraceCheckUtils]: 39: Hoare triple {23730#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:40,935 INFO L273 TraceCheckUtils]: 40: Hoare triple {23731#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:40,936 INFO L273 TraceCheckUtils]: 41: Hoare triple {23731#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:40,936 INFO L273 TraceCheckUtils]: 42: Hoare triple {23732#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:40,937 INFO L273 TraceCheckUtils]: 43: Hoare triple {23732#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:40,938 INFO L273 TraceCheckUtils]: 44: Hoare triple {23733#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:40,938 INFO L273 TraceCheckUtils]: 45: Hoare triple {23733#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:40,939 INFO L273 TraceCheckUtils]: 46: Hoare triple {23734#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:40,940 INFO L273 TraceCheckUtils]: 47: Hoare triple {23734#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:40,940 INFO L273 TraceCheckUtils]: 48: Hoare triple {23735#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:40,941 INFO L273 TraceCheckUtils]: 49: Hoare triple {23735#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:40,941 INFO L273 TraceCheckUtils]: 50: Hoare triple {23736#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:40,942 INFO L273 TraceCheckUtils]: 51: Hoare triple {23736#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:40,943 INFO L273 TraceCheckUtils]: 52: Hoare triple {23737#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:40,943 INFO L273 TraceCheckUtils]: 53: Hoare triple {23737#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:40,944 INFO L273 TraceCheckUtils]: 54: Hoare triple {23738#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:40,945 INFO L273 TraceCheckUtils]: 55: Hoare triple {23738#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:40,945 INFO L273 TraceCheckUtils]: 56: Hoare triple {23739#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:40,946 INFO L273 TraceCheckUtils]: 57: Hoare triple {23739#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:40,946 INFO L273 TraceCheckUtils]: 58: Hoare triple {23740#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:40,947 INFO L273 TraceCheckUtils]: 59: Hoare triple {23740#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:40,948 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:40,948 INFO L273 TraceCheckUtils]: 61: Hoare triple {23741#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:40,949 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:40,950 INFO L273 TraceCheckUtils]: 63: Hoare triple {23742#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:40,950 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:40,951 INFO L273 TraceCheckUtils]: 65: Hoare triple {23743#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:40,951 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:40,952 INFO L273 TraceCheckUtils]: 67: Hoare triple {23744#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23745#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:40,953 INFO L273 TraceCheckUtils]: 68: Hoare triple {23745#(<= main_~i~1 31)} assume !(~i~1 < 10000); {23713#false} is VALID [2018-11-23 12:28:40,953 INFO L256 TraceCheckUtils]: 69: Hoare triple {23713#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {23713#false} is VALID [2018-11-23 12:28:40,953 INFO L273 TraceCheckUtils]: 70: Hoare triple {23713#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23713#false} is VALID [2018-11-23 12:28:40,953 INFO L273 TraceCheckUtils]: 71: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,953 INFO L273 TraceCheckUtils]: 72: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,954 INFO L273 TraceCheckUtils]: 73: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,954 INFO L273 TraceCheckUtils]: 74: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,954 INFO L273 TraceCheckUtils]: 75: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,954 INFO L273 TraceCheckUtils]: 76: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,954 INFO L273 TraceCheckUtils]: 77: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,954 INFO L273 TraceCheckUtils]: 78: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,955 INFO L273 TraceCheckUtils]: 79: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,955 INFO L273 TraceCheckUtils]: 80: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,955 INFO L273 TraceCheckUtils]: 81: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,955 INFO L273 TraceCheckUtils]: 82: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,955 INFO L273 TraceCheckUtils]: 83: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,955 INFO L273 TraceCheckUtils]: 84: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,955 INFO L273 TraceCheckUtils]: 85: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,956 INFO L273 TraceCheckUtils]: 86: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,956 INFO L273 TraceCheckUtils]: 87: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,956 INFO L273 TraceCheckUtils]: 88: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,956 INFO L273 TraceCheckUtils]: 89: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,956 INFO L273 TraceCheckUtils]: 90: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,956 INFO L273 TraceCheckUtils]: 91: Hoare triple {23713#false} assume !(~i~0 < 10000); {23713#false} is VALID [2018-11-23 12:28:40,956 INFO L273 TraceCheckUtils]: 92: Hoare triple {23713#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {23713#false} is VALID [2018-11-23 12:28:40,956 INFO L273 TraceCheckUtils]: 93: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:28:40,956 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23713#false} {23713#false} #70#return; {23713#false} is VALID [2018-11-23 12:28:40,956 INFO L273 TraceCheckUtils]: 95: Hoare triple {23713#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); {23713#false} is VALID [2018-11-23 12:28:40,957 INFO L256 TraceCheckUtils]: 96: Hoare triple {23713#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {23713#false} is VALID [2018-11-23 12:28:40,957 INFO L273 TraceCheckUtils]: 97: Hoare triple {23713#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23713#false} is VALID [2018-11-23 12:28:40,957 INFO L273 TraceCheckUtils]: 98: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,957 INFO L273 TraceCheckUtils]: 99: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,957 INFO L273 TraceCheckUtils]: 100: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,957 INFO L273 TraceCheckUtils]: 101: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,957 INFO L273 TraceCheckUtils]: 102: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,957 INFO L273 TraceCheckUtils]: 103: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,957 INFO L273 TraceCheckUtils]: 104: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,958 INFO L273 TraceCheckUtils]: 105: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,958 INFO L273 TraceCheckUtils]: 106: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,958 INFO L273 TraceCheckUtils]: 107: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,958 INFO L273 TraceCheckUtils]: 108: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,958 INFO L273 TraceCheckUtils]: 109: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,958 INFO L273 TraceCheckUtils]: 110: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,958 INFO L273 TraceCheckUtils]: 111: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,958 INFO L273 TraceCheckUtils]: 112: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,958 INFO L273 TraceCheckUtils]: 113: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,958 INFO L273 TraceCheckUtils]: 114: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,959 INFO L273 TraceCheckUtils]: 115: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,959 INFO L273 TraceCheckUtils]: 116: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,959 INFO L273 TraceCheckUtils]: 117: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,959 INFO L273 TraceCheckUtils]: 118: Hoare triple {23713#false} assume !(~i~0 < 10000); {23713#false} is VALID [2018-11-23 12:28:40,959 INFO L273 TraceCheckUtils]: 119: Hoare triple {23713#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {23713#false} is VALID [2018-11-23 12:28:40,959 INFO L273 TraceCheckUtils]: 120: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:28:40,959 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23713#false} {23713#false} #72#return; {23713#false} is VALID [2018-11-23 12:28:40,959 INFO L273 TraceCheckUtils]: 122: Hoare triple {23713#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; {23713#false} is VALID [2018-11-23 12:28:40,959 INFO L273 TraceCheckUtils]: 123: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,959 INFO L273 TraceCheckUtils]: 124: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,960 INFO L273 TraceCheckUtils]: 125: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,960 INFO L273 TraceCheckUtils]: 126: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,960 INFO L273 TraceCheckUtils]: 127: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,960 INFO L273 TraceCheckUtils]: 128: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,960 INFO L273 TraceCheckUtils]: 129: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,960 INFO L273 TraceCheckUtils]: 130: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,960 INFO L273 TraceCheckUtils]: 131: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,960 INFO L273 TraceCheckUtils]: 132: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,961 INFO L273 TraceCheckUtils]: 133: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,961 INFO L273 TraceCheckUtils]: 134: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,961 INFO L273 TraceCheckUtils]: 135: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,961 INFO L273 TraceCheckUtils]: 136: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,961 INFO L273 TraceCheckUtils]: 137: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,961 INFO L273 TraceCheckUtils]: 138: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,961 INFO L273 TraceCheckUtils]: 139: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:40,962 INFO L273 TraceCheckUtils]: 140: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:40,962 INFO L273 TraceCheckUtils]: 141: Hoare triple {23713#false} assume !(~i~2 < 9999); {23713#false} is VALID [2018-11-23 12:28:40,962 INFO L273 TraceCheckUtils]: 142: Hoare triple {23713#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:28:40,962 INFO L256 TraceCheckUtils]: 143: Hoare triple {23713#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {23713#false} is VALID [2018-11-23 12:28:40,962 INFO L273 TraceCheckUtils]: 144: Hoare triple {23713#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23713#false} is VALID [2018-11-23 12:28:40,962 INFO L273 TraceCheckUtils]: 145: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,963 INFO L273 TraceCheckUtils]: 146: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,963 INFO L273 TraceCheckUtils]: 147: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,963 INFO L273 TraceCheckUtils]: 148: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,963 INFO L273 TraceCheckUtils]: 149: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,963 INFO L273 TraceCheckUtils]: 150: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,963 INFO L273 TraceCheckUtils]: 151: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,964 INFO L273 TraceCheckUtils]: 152: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,964 INFO L273 TraceCheckUtils]: 153: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,964 INFO L273 TraceCheckUtils]: 154: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,964 INFO L273 TraceCheckUtils]: 155: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,964 INFO L273 TraceCheckUtils]: 156: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,964 INFO L273 TraceCheckUtils]: 157: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,964 INFO L273 TraceCheckUtils]: 158: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,965 INFO L273 TraceCheckUtils]: 159: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,965 INFO L273 TraceCheckUtils]: 160: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,965 INFO L273 TraceCheckUtils]: 161: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,965 INFO L273 TraceCheckUtils]: 162: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,965 INFO L273 TraceCheckUtils]: 163: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:40,965 INFO L273 TraceCheckUtils]: 164: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:40,966 INFO L273 TraceCheckUtils]: 165: Hoare triple {23713#false} assume !(~i~0 < 10000); {23713#false} is VALID [2018-11-23 12:28:40,966 INFO L273 TraceCheckUtils]: 166: Hoare triple {23713#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {23713#false} is VALID [2018-11-23 12:28:40,966 INFO L273 TraceCheckUtils]: 167: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:28:40,966 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23713#false} {23713#false} #74#return; {23713#false} is VALID [2018-11-23 12:28:40,966 INFO L273 TraceCheckUtils]: 169: Hoare triple {23713#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {23713#false} is VALID [2018-11-23 12:28:40,966 INFO L273 TraceCheckUtils]: 170: Hoare triple {23713#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {23713#false} is VALID [2018-11-23 12:28:40,966 INFO L273 TraceCheckUtils]: 171: Hoare triple {23713#false} assume !false; {23713#false} is VALID [2018-11-23 12:28:40,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:28:41,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:41,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:28:41,014 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:28:41,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:41,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:28:41,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:41,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:28:41,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:28:41,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:28:41,166 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2018-11-23 12:28:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:41,503 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-23 12:28:41,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:28:41,503 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:28:41,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:28:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:28:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:28:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:28:41,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 116 transitions. [2018-11-23 12:28:41,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:41,660 INFO L225 Difference]: With dead ends: 180 [2018-11-23 12:28:41,660 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 12:28:41,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:28:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 12:28:41,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-23 12:28:41,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:41,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-23 12:28:41,709 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-23 12:28:41,709 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-23 12:28:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:41,711 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:28:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:28:41,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:41,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:41,711 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-23 12:28:41,711 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-23 12:28:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:41,713 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:28:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:28:41,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:41,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:41,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:41,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 12:28:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-23 12:28:41,715 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2018-11-23 12:28:41,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:41,716 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-23 12:28:41,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:28:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:28:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 12:28:41,716 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:41,717 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:41,717 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:41,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:41,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1888810859, now seen corresponding path program 32 times [2018-11-23 12:28:41,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:41,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:41,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:41,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:41,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:43,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {24968#true} call ULTIMATE.init(); {24968#true} is VALID [2018-11-23 12:28:43,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {24968#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24968#true} is VALID [2018-11-23 12:28:43,133 INFO L273 TraceCheckUtils]: 2: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:28:43,133 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24968#true} {24968#true} #66#return; {24968#true} is VALID [2018-11-23 12:28:43,133 INFO L256 TraceCheckUtils]: 4: Hoare triple {24968#true} call #t~ret12 := main(); {24968#true} is VALID [2018-11-23 12:28:43,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {24968#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {24970#(= main_~i~1 0)} is VALID [2018-11-23 12:28:43,134 INFO L273 TraceCheckUtils]: 6: Hoare triple {24970#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24970#(= main_~i~1 0)} is VALID [2018-11-23 12:28:43,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {24970#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:43,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {24971#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:43,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {24971#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:43,136 INFO L273 TraceCheckUtils]: 10: Hoare triple {24972#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:43,136 INFO L273 TraceCheckUtils]: 11: Hoare triple {24972#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:43,137 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:43,137 INFO L273 TraceCheckUtils]: 13: Hoare triple {24973#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:43,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:43,138 INFO L273 TraceCheckUtils]: 15: Hoare triple {24974#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:43,139 INFO L273 TraceCheckUtils]: 16: Hoare triple {24975#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:43,139 INFO L273 TraceCheckUtils]: 17: Hoare triple {24975#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:43,140 INFO L273 TraceCheckUtils]: 18: Hoare triple {24976#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:43,141 INFO L273 TraceCheckUtils]: 19: Hoare triple {24976#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:43,141 INFO L273 TraceCheckUtils]: 20: Hoare triple {24977#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:43,142 INFO L273 TraceCheckUtils]: 21: Hoare triple {24977#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:43,142 INFO L273 TraceCheckUtils]: 22: Hoare triple {24978#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:43,143 INFO L273 TraceCheckUtils]: 23: Hoare triple {24978#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:43,143 INFO L273 TraceCheckUtils]: 24: Hoare triple {24979#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:43,144 INFO L273 TraceCheckUtils]: 25: Hoare triple {24979#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:43,145 INFO L273 TraceCheckUtils]: 26: Hoare triple {24980#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:43,145 INFO L273 TraceCheckUtils]: 27: Hoare triple {24980#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:43,146 INFO L273 TraceCheckUtils]: 28: Hoare triple {24981#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:43,146 INFO L273 TraceCheckUtils]: 29: Hoare triple {24981#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:43,147 INFO L273 TraceCheckUtils]: 30: Hoare triple {24982#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:43,148 INFO L273 TraceCheckUtils]: 31: Hoare triple {24982#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:43,148 INFO L273 TraceCheckUtils]: 32: Hoare triple {24983#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:43,149 INFO L273 TraceCheckUtils]: 33: Hoare triple {24983#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:43,149 INFO L273 TraceCheckUtils]: 34: Hoare triple {24984#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:43,150 INFO L273 TraceCheckUtils]: 35: Hoare triple {24984#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:43,150 INFO L273 TraceCheckUtils]: 36: Hoare triple {24985#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:43,151 INFO L273 TraceCheckUtils]: 37: Hoare triple {24985#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:43,152 INFO L273 TraceCheckUtils]: 38: Hoare triple {24986#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:43,152 INFO L273 TraceCheckUtils]: 39: Hoare triple {24986#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:43,153 INFO L273 TraceCheckUtils]: 40: Hoare triple {24987#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:43,153 INFO L273 TraceCheckUtils]: 41: Hoare triple {24987#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:43,154 INFO L273 TraceCheckUtils]: 42: Hoare triple {24988#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:43,155 INFO L273 TraceCheckUtils]: 43: Hoare triple {24988#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:43,155 INFO L273 TraceCheckUtils]: 44: Hoare triple {24989#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:43,156 INFO L273 TraceCheckUtils]: 45: Hoare triple {24989#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:43,156 INFO L273 TraceCheckUtils]: 46: Hoare triple {24990#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:43,157 INFO L273 TraceCheckUtils]: 47: Hoare triple {24990#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:43,157 INFO L273 TraceCheckUtils]: 48: Hoare triple {24991#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:43,158 INFO L273 TraceCheckUtils]: 49: Hoare triple {24991#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:43,158 INFO L273 TraceCheckUtils]: 50: Hoare triple {24992#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:43,159 INFO L273 TraceCheckUtils]: 51: Hoare triple {24992#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:43,160 INFO L273 TraceCheckUtils]: 52: Hoare triple {24993#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:43,160 INFO L273 TraceCheckUtils]: 53: Hoare triple {24993#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:43,161 INFO L273 TraceCheckUtils]: 54: Hoare triple {24994#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:43,161 INFO L273 TraceCheckUtils]: 55: Hoare triple {24994#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:43,162 INFO L273 TraceCheckUtils]: 56: Hoare triple {24995#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:43,163 INFO L273 TraceCheckUtils]: 57: Hoare triple {24995#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:43,163 INFO L273 TraceCheckUtils]: 58: Hoare triple {24996#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:43,164 INFO L273 TraceCheckUtils]: 59: Hoare triple {24996#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:43,164 INFO L273 TraceCheckUtils]: 60: Hoare triple {24997#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:43,165 INFO L273 TraceCheckUtils]: 61: Hoare triple {24997#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:43,165 INFO L273 TraceCheckUtils]: 62: Hoare triple {24998#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:43,166 INFO L273 TraceCheckUtils]: 63: Hoare triple {24998#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:43,167 INFO L273 TraceCheckUtils]: 64: Hoare triple {24999#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:43,167 INFO L273 TraceCheckUtils]: 65: Hoare triple {24999#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:43,168 INFO L273 TraceCheckUtils]: 66: Hoare triple {25000#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:43,168 INFO L273 TraceCheckUtils]: 67: Hoare triple {25000#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:43,169 INFO L273 TraceCheckUtils]: 68: Hoare triple {25001#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:43,170 INFO L273 TraceCheckUtils]: 69: Hoare triple {25001#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25002#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:43,170 INFO L273 TraceCheckUtils]: 70: Hoare triple {25002#(<= main_~i~1 32)} assume !(~i~1 < 10000); {24969#false} is VALID [2018-11-23 12:28:43,170 INFO L256 TraceCheckUtils]: 71: Hoare triple {24969#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {24968#true} is VALID [2018-11-23 12:28:43,171 INFO L273 TraceCheckUtils]: 72: Hoare triple {24968#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24968#true} is VALID [2018-11-23 12:28:43,171 INFO L273 TraceCheckUtils]: 73: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,171 INFO L273 TraceCheckUtils]: 74: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,171 INFO L273 TraceCheckUtils]: 75: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,171 INFO L273 TraceCheckUtils]: 76: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,172 INFO L273 TraceCheckUtils]: 77: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,172 INFO L273 TraceCheckUtils]: 78: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,172 INFO L273 TraceCheckUtils]: 79: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,172 INFO L273 TraceCheckUtils]: 80: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,172 INFO L273 TraceCheckUtils]: 81: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,172 INFO L273 TraceCheckUtils]: 82: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,173 INFO L273 TraceCheckUtils]: 83: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,173 INFO L273 TraceCheckUtils]: 84: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,173 INFO L273 TraceCheckUtils]: 85: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,173 INFO L273 TraceCheckUtils]: 86: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,173 INFO L273 TraceCheckUtils]: 87: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,173 INFO L273 TraceCheckUtils]: 88: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,174 INFO L273 TraceCheckUtils]: 89: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,174 INFO L273 TraceCheckUtils]: 90: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,174 INFO L273 TraceCheckUtils]: 91: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,174 INFO L273 TraceCheckUtils]: 92: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,174 INFO L273 TraceCheckUtils]: 93: Hoare triple {24968#true} assume !(~i~0 < 10000); {24968#true} is VALID [2018-11-23 12:28:43,174 INFO L273 TraceCheckUtils]: 94: Hoare triple {24968#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {24968#true} is VALID [2018-11-23 12:28:43,174 INFO L273 TraceCheckUtils]: 95: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:28:43,175 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24968#true} {24969#false} #70#return; {24969#false} is VALID [2018-11-23 12:28:43,175 INFO L273 TraceCheckUtils]: 97: Hoare triple {24969#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); {24969#false} is VALID [2018-11-23 12:28:43,175 INFO L256 TraceCheckUtils]: 98: Hoare triple {24969#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {24968#true} is VALID [2018-11-23 12:28:43,175 INFO L273 TraceCheckUtils]: 99: Hoare triple {24968#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24968#true} is VALID [2018-11-23 12:28:43,175 INFO L273 TraceCheckUtils]: 100: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,175 INFO L273 TraceCheckUtils]: 101: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,175 INFO L273 TraceCheckUtils]: 102: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,175 INFO L273 TraceCheckUtils]: 103: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,175 INFO L273 TraceCheckUtils]: 104: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,175 INFO L273 TraceCheckUtils]: 105: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,176 INFO L273 TraceCheckUtils]: 106: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,176 INFO L273 TraceCheckUtils]: 107: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,176 INFO L273 TraceCheckUtils]: 108: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,176 INFO L273 TraceCheckUtils]: 109: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,176 INFO L273 TraceCheckUtils]: 110: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,176 INFO L273 TraceCheckUtils]: 111: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,176 INFO L273 TraceCheckUtils]: 112: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,176 INFO L273 TraceCheckUtils]: 113: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,176 INFO L273 TraceCheckUtils]: 114: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,176 INFO L273 TraceCheckUtils]: 115: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,177 INFO L273 TraceCheckUtils]: 116: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,177 INFO L273 TraceCheckUtils]: 117: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,177 INFO L273 TraceCheckUtils]: 118: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,177 INFO L273 TraceCheckUtils]: 119: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,177 INFO L273 TraceCheckUtils]: 120: Hoare triple {24968#true} assume !(~i~0 < 10000); {24968#true} is VALID [2018-11-23 12:28:43,177 INFO L273 TraceCheckUtils]: 121: Hoare triple {24968#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {24968#true} is VALID [2018-11-23 12:28:43,177 INFO L273 TraceCheckUtils]: 122: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:28:43,177 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24968#true} {24969#false} #72#return; {24969#false} is VALID [2018-11-23 12:28:43,177 INFO L273 TraceCheckUtils]: 124: Hoare triple {24969#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; {24969#false} is VALID [2018-11-23 12:28:43,177 INFO L273 TraceCheckUtils]: 125: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,178 INFO L273 TraceCheckUtils]: 126: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,178 INFO L273 TraceCheckUtils]: 127: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,178 INFO L273 TraceCheckUtils]: 128: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,178 INFO L273 TraceCheckUtils]: 129: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,178 INFO L273 TraceCheckUtils]: 130: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,178 INFO L273 TraceCheckUtils]: 131: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,178 INFO L273 TraceCheckUtils]: 132: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,178 INFO L273 TraceCheckUtils]: 133: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,178 INFO L273 TraceCheckUtils]: 134: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,179 INFO L273 TraceCheckUtils]: 135: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,179 INFO L273 TraceCheckUtils]: 136: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,179 INFO L273 TraceCheckUtils]: 137: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,179 INFO L273 TraceCheckUtils]: 138: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,179 INFO L273 TraceCheckUtils]: 139: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,179 INFO L273 TraceCheckUtils]: 140: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,179 INFO L273 TraceCheckUtils]: 141: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,179 INFO L273 TraceCheckUtils]: 142: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,179 INFO L273 TraceCheckUtils]: 143: Hoare triple {24969#false} assume !(~i~2 < 9999); {24969#false} is VALID [2018-11-23 12:28:43,179 INFO L273 TraceCheckUtils]: 144: Hoare triple {24969#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:28:43,180 INFO L256 TraceCheckUtils]: 145: Hoare triple {24969#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {24968#true} is VALID [2018-11-23 12:28:43,180 INFO L273 TraceCheckUtils]: 146: Hoare triple {24968#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24968#true} is VALID [2018-11-23 12:28:43,180 INFO L273 TraceCheckUtils]: 147: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,180 INFO L273 TraceCheckUtils]: 148: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,180 INFO L273 TraceCheckUtils]: 149: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,180 INFO L273 TraceCheckUtils]: 150: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,180 INFO L273 TraceCheckUtils]: 151: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,180 INFO L273 TraceCheckUtils]: 152: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,180 INFO L273 TraceCheckUtils]: 153: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,180 INFO L273 TraceCheckUtils]: 154: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,181 INFO L273 TraceCheckUtils]: 155: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,181 INFO L273 TraceCheckUtils]: 156: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,181 INFO L273 TraceCheckUtils]: 157: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,181 INFO L273 TraceCheckUtils]: 158: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,181 INFO L273 TraceCheckUtils]: 159: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,181 INFO L273 TraceCheckUtils]: 160: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,181 INFO L273 TraceCheckUtils]: 161: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,181 INFO L273 TraceCheckUtils]: 162: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,181 INFO L273 TraceCheckUtils]: 163: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,181 INFO L273 TraceCheckUtils]: 164: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,182 INFO L273 TraceCheckUtils]: 165: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,182 INFO L273 TraceCheckUtils]: 166: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,182 INFO L273 TraceCheckUtils]: 167: Hoare triple {24968#true} assume !(~i~0 < 10000); {24968#true} is VALID [2018-11-23 12:28:43,182 INFO L273 TraceCheckUtils]: 168: Hoare triple {24968#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {24968#true} is VALID [2018-11-23 12:28:43,182 INFO L273 TraceCheckUtils]: 169: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:28:43,182 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24968#true} {24969#false} #74#return; {24969#false} is VALID [2018-11-23 12:28:43,182 INFO L273 TraceCheckUtils]: 171: Hoare triple {24969#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {24969#false} is VALID [2018-11-23 12:28:43,182 INFO L273 TraceCheckUtils]: 172: Hoare triple {24969#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {24969#false} is VALID [2018-11-23 12:28:43,182 INFO L273 TraceCheckUtils]: 173: Hoare triple {24969#false} assume !false; {24969#false} is VALID [2018-11-23 12:28:43,196 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:43,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:43,196 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:43,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:43,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:43,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:43,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:43,643 INFO L256 TraceCheckUtils]: 0: Hoare triple {24968#true} call ULTIMATE.init(); {24968#true} is VALID [2018-11-23 12:28:43,643 INFO L273 TraceCheckUtils]: 1: Hoare triple {24968#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24968#true} is VALID [2018-11-23 12:28:43,643 INFO L273 TraceCheckUtils]: 2: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:28:43,643 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24968#true} {24968#true} #66#return; {24968#true} is VALID [2018-11-23 12:28:43,644 INFO L256 TraceCheckUtils]: 4: Hoare triple {24968#true} call #t~ret12 := main(); {24968#true} is VALID [2018-11-23 12:28:43,644 INFO L273 TraceCheckUtils]: 5: Hoare triple {24968#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {25021#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:43,645 INFO L273 TraceCheckUtils]: 6: Hoare triple {25021#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25021#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:43,645 INFO L273 TraceCheckUtils]: 7: Hoare triple {25021#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:43,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {24971#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:43,646 INFO L273 TraceCheckUtils]: 9: Hoare triple {24971#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:43,646 INFO L273 TraceCheckUtils]: 10: Hoare triple {24972#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:43,647 INFO L273 TraceCheckUtils]: 11: Hoare triple {24972#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:43,647 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:43,647 INFO L273 TraceCheckUtils]: 13: Hoare triple {24973#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:43,648 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:43,648 INFO L273 TraceCheckUtils]: 15: Hoare triple {24974#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:43,649 INFO L273 TraceCheckUtils]: 16: Hoare triple {24975#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:43,650 INFO L273 TraceCheckUtils]: 17: Hoare triple {24975#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:43,650 INFO L273 TraceCheckUtils]: 18: Hoare triple {24976#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:43,651 INFO L273 TraceCheckUtils]: 19: Hoare triple {24976#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:43,651 INFO L273 TraceCheckUtils]: 20: Hoare triple {24977#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:43,652 INFO L273 TraceCheckUtils]: 21: Hoare triple {24977#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:43,653 INFO L273 TraceCheckUtils]: 22: Hoare triple {24978#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:43,653 INFO L273 TraceCheckUtils]: 23: Hoare triple {24978#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:43,654 INFO L273 TraceCheckUtils]: 24: Hoare triple {24979#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:43,655 INFO L273 TraceCheckUtils]: 25: Hoare triple {24979#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:43,655 INFO L273 TraceCheckUtils]: 26: Hoare triple {24980#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:43,656 INFO L273 TraceCheckUtils]: 27: Hoare triple {24980#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:43,656 INFO L273 TraceCheckUtils]: 28: Hoare triple {24981#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:43,657 INFO L273 TraceCheckUtils]: 29: Hoare triple {24981#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:43,657 INFO L273 TraceCheckUtils]: 30: Hoare triple {24982#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:43,658 INFO L273 TraceCheckUtils]: 31: Hoare triple {24982#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:43,659 INFO L273 TraceCheckUtils]: 32: Hoare triple {24983#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:43,659 INFO L273 TraceCheckUtils]: 33: Hoare triple {24983#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:43,660 INFO L273 TraceCheckUtils]: 34: Hoare triple {24984#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:43,660 INFO L273 TraceCheckUtils]: 35: Hoare triple {24984#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:43,661 INFO L273 TraceCheckUtils]: 36: Hoare triple {24985#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:43,662 INFO L273 TraceCheckUtils]: 37: Hoare triple {24985#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:43,662 INFO L273 TraceCheckUtils]: 38: Hoare triple {24986#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:43,663 INFO L273 TraceCheckUtils]: 39: Hoare triple {24986#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:43,663 INFO L273 TraceCheckUtils]: 40: Hoare triple {24987#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:43,664 INFO L273 TraceCheckUtils]: 41: Hoare triple {24987#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:43,665 INFO L273 TraceCheckUtils]: 42: Hoare triple {24988#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:43,665 INFO L273 TraceCheckUtils]: 43: Hoare triple {24988#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:43,666 INFO L273 TraceCheckUtils]: 44: Hoare triple {24989#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:43,667 INFO L273 TraceCheckUtils]: 45: Hoare triple {24989#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:43,667 INFO L273 TraceCheckUtils]: 46: Hoare triple {24990#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:43,668 INFO L273 TraceCheckUtils]: 47: Hoare triple {24990#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:43,668 INFO L273 TraceCheckUtils]: 48: Hoare triple {24991#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:43,669 INFO L273 TraceCheckUtils]: 49: Hoare triple {24991#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:43,670 INFO L273 TraceCheckUtils]: 50: Hoare triple {24992#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:43,670 INFO L273 TraceCheckUtils]: 51: Hoare triple {24992#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:43,671 INFO L273 TraceCheckUtils]: 52: Hoare triple {24993#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:43,672 INFO L273 TraceCheckUtils]: 53: Hoare triple {24993#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:43,672 INFO L273 TraceCheckUtils]: 54: Hoare triple {24994#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:43,673 INFO L273 TraceCheckUtils]: 55: Hoare triple {24994#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:43,673 INFO L273 TraceCheckUtils]: 56: Hoare triple {24995#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:43,674 INFO L273 TraceCheckUtils]: 57: Hoare triple {24995#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:43,675 INFO L273 TraceCheckUtils]: 58: Hoare triple {24996#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:43,675 INFO L273 TraceCheckUtils]: 59: Hoare triple {24996#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:43,676 INFO L273 TraceCheckUtils]: 60: Hoare triple {24997#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:43,677 INFO L273 TraceCheckUtils]: 61: Hoare triple {24997#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:43,677 INFO L273 TraceCheckUtils]: 62: Hoare triple {24998#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:43,678 INFO L273 TraceCheckUtils]: 63: Hoare triple {24998#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:43,678 INFO L273 TraceCheckUtils]: 64: Hoare triple {24999#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:43,679 INFO L273 TraceCheckUtils]: 65: Hoare triple {24999#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:43,680 INFO L273 TraceCheckUtils]: 66: Hoare triple {25000#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:43,680 INFO L273 TraceCheckUtils]: 67: Hoare triple {25000#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:43,681 INFO L273 TraceCheckUtils]: 68: Hoare triple {25001#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:43,681 INFO L273 TraceCheckUtils]: 69: Hoare triple {25001#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25002#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:43,682 INFO L273 TraceCheckUtils]: 70: Hoare triple {25002#(<= main_~i~1 32)} assume !(~i~1 < 10000); {24969#false} is VALID [2018-11-23 12:28:43,682 INFO L256 TraceCheckUtils]: 71: Hoare triple {24969#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {24969#false} is VALID [2018-11-23 12:28:43,683 INFO L273 TraceCheckUtils]: 72: Hoare triple {24969#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24969#false} is VALID [2018-11-23 12:28:43,683 INFO L273 TraceCheckUtils]: 73: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,683 INFO L273 TraceCheckUtils]: 74: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,683 INFO L273 TraceCheckUtils]: 75: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,683 INFO L273 TraceCheckUtils]: 76: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,683 INFO L273 TraceCheckUtils]: 77: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,684 INFO L273 TraceCheckUtils]: 78: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,684 INFO L273 TraceCheckUtils]: 79: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,684 INFO L273 TraceCheckUtils]: 80: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,684 INFO L273 TraceCheckUtils]: 81: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,684 INFO L273 TraceCheckUtils]: 82: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,684 INFO L273 TraceCheckUtils]: 83: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,685 INFO L273 TraceCheckUtils]: 84: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,685 INFO L273 TraceCheckUtils]: 85: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,685 INFO L273 TraceCheckUtils]: 86: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,685 INFO L273 TraceCheckUtils]: 87: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,685 INFO L273 TraceCheckUtils]: 88: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,685 INFO L273 TraceCheckUtils]: 89: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,686 INFO L273 TraceCheckUtils]: 90: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,686 INFO L273 TraceCheckUtils]: 91: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,686 INFO L273 TraceCheckUtils]: 92: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,686 INFO L273 TraceCheckUtils]: 93: Hoare triple {24969#false} assume !(~i~0 < 10000); {24969#false} is VALID [2018-11-23 12:28:43,686 INFO L273 TraceCheckUtils]: 94: Hoare triple {24969#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {24969#false} is VALID [2018-11-23 12:28:43,686 INFO L273 TraceCheckUtils]: 95: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:28:43,686 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24969#false} {24969#false} #70#return; {24969#false} is VALID [2018-11-23 12:28:43,687 INFO L273 TraceCheckUtils]: 97: Hoare triple {24969#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); {24969#false} is VALID [2018-11-23 12:28:43,687 INFO L256 TraceCheckUtils]: 98: Hoare triple {24969#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {24969#false} is VALID [2018-11-23 12:28:43,687 INFO L273 TraceCheckUtils]: 99: Hoare triple {24969#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24969#false} is VALID [2018-11-23 12:28:43,687 INFO L273 TraceCheckUtils]: 100: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,687 INFO L273 TraceCheckUtils]: 101: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,687 INFO L273 TraceCheckUtils]: 102: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,687 INFO L273 TraceCheckUtils]: 103: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,687 INFO L273 TraceCheckUtils]: 104: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,687 INFO L273 TraceCheckUtils]: 105: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,687 INFO L273 TraceCheckUtils]: 106: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,688 INFO L273 TraceCheckUtils]: 107: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,688 INFO L273 TraceCheckUtils]: 108: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,688 INFO L273 TraceCheckUtils]: 109: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,688 INFO L273 TraceCheckUtils]: 110: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,688 INFO L273 TraceCheckUtils]: 111: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,688 INFO L273 TraceCheckUtils]: 112: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,688 INFO L273 TraceCheckUtils]: 113: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,688 INFO L273 TraceCheckUtils]: 114: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,688 INFO L273 TraceCheckUtils]: 115: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,689 INFO L273 TraceCheckUtils]: 116: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,689 INFO L273 TraceCheckUtils]: 117: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,689 INFO L273 TraceCheckUtils]: 118: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,689 INFO L273 TraceCheckUtils]: 119: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,689 INFO L273 TraceCheckUtils]: 120: Hoare triple {24969#false} assume !(~i~0 < 10000); {24969#false} is VALID [2018-11-23 12:28:43,689 INFO L273 TraceCheckUtils]: 121: Hoare triple {24969#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {24969#false} is VALID [2018-11-23 12:28:43,689 INFO L273 TraceCheckUtils]: 122: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:28:43,689 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24969#false} {24969#false} #72#return; {24969#false} is VALID [2018-11-23 12:28:43,689 INFO L273 TraceCheckUtils]: 124: Hoare triple {24969#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; {24969#false} is VALID [2018-11-23 12:28:43,689 INFO L273 TraceCheckUtils]: 125: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,690 INFO L273 TraceCheckUtils]: 126: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,690 INFO L273 TraceCheckUtils]: 127: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,690 INFO L273 TraceCheckUtils]: 128: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,690 INFO L273 TraceCheckUtils]: 129: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,690 INFO L273 TraceCheckUtils]: 130: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,690 INFO L273 TraceCheckUtils]: 131: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,690 INFO L273 TraceCheckUtils]: 132: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,690 INFO L273 TraceCheckUtils]: 133: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,690 INFO L273 TraceCheckUtils]: 134: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,690 INFO L273 TraceCheckUtils]: 135: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,691 INFO L273 TraceCheckUtils]: 136: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,691 INFO L273 TraceCheckUtils]: 137: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,691 INFO L273 TraceCheckUtils]: 138: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,691 INFO L273 TraceCheckUtils]: 139: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,691 INFO L273 TraceCheckUtils]: 140: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,691 INFO L273 TraceCheckUtils]: 141: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,691 INFO L273 TraceCheckUtils]: 142: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,691 INFO L273 TraceCheckUtils]: 143: Hoare triple {24969#false} assume !(~i~2 < 9999); {24969#false} is VALID [2018-11-23 12:28:43,691 INFO L273 TraceCheckUtils]: 144: Hoare triple {24969#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:28:43,691 INFO L256 TraceCheckUtils]: 145: Hoare triple {24969#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {24969#false} is VALID [2018-11-23 12:28:43,692 INFO L273 TraceCheckUtils]: 146: Hoare triple {24969#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24969#false} is VALID [2018-11-23 12:28:43,692 INFO L273 TraceCheckUtils]: 147: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,692 INFO L273 TraceCheckUtils]: 148: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,692 INFO L273 TraceCheckUtils]: 149: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,692 INFO L273 TraceCheckUtils]: 150: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,692 INFO L273 TraceCheckUtils]: 151: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,692 INFO L273 TraceCheckUtils]: 152: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,692 INFO L273 TraceCheckUtils]: 153: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,692 INFO L273 TraceCheckUtils]: 154: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,692 INFO L273 TraceCheckUtils]: 155: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,693 INFO L273 TraceCheckUtils]: 156: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,693 INFO L273 TraceCheckUtils]: 157: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,693 INFO L273 TraceCheckUtils]: 158: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,693 INFO L273 TraceCheckUtils]: 159: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,693 INFO L273 TraceCheckUtils]: 160: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,693 INFO L273 TraceCheckUtils]: 161: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,693 INFO L273 TraceCheckUtils]: 162: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,693 INFO L273 TraceCheckUtils]: 163: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,693 INFO L273 TraceCheckUtils]: 164: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,694 INFO L273 TraceCheckUtils]: 165: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:43,694 INFO L273 TraceCheckUtils]: 166: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:43,694 INFO L273 TraceCheckUtils]: 167: Hoare triple {24969#false} assume !(~i~0 < 10000); {24969#false} is VALID [2018-11-23 12:28:43,694 INFO L273 TraceCheckUtils]: 168: Hoare triple {24969#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {24969#false} is VALID [2018-11-23 12:28:43,694 INFO L273 TraceCheckUtils]: 169: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:28:43,694 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24969#false} {24969#false} #74#return; {24969#false} is VALID [2018-11-23 12:28:43,694 INFO L273 TraceCheckUtils]: 171: Hoare triple {24969#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {24969#false} is VALID [2018-11-23 12:28:43,694 INFO L273 TraceCheckUtils]: 172: Hoare triple {24969#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {24969#false} is VALID [2018-11-23 12:28:43,694 INFO L273 TraceCheckUtils]: 173: Hoare triple {24969#false} assume !false; {24969#false} is VALID [2018-11-23 12:28:43,735 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:43,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:43,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:28:43,755 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:28:43,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:43,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:28:43,866 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:43,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:28:43,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:28:43,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:28:43,867 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2018-11-23 12:28:45,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:45,003 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2018-11-23 12:28:45,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:28:45,003 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:28:45,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:28:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:28:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:28:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:28:45,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 118 transitions. [2018-11-23 12:28:45,118 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:45,121 INFO L225 Difference]: With dead ends: 182 [2018-11-23 12:28:45,121 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:28:45,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:28:45,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:28:45,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-11-23 12:28:45,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:45,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 127 states. [2018-11-23 12:28:45,223 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 127 states. [2018-11-23 12:28:45,223 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 127 states. [2018-11-23 12:28:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:45,225 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:28:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:28:45,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:45,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:45,226 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 128 states. [2018-11-23 12:28:45,226 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 128 states. [2018-11-23 12:28:45,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:45,228 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:28:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:28:45,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:45,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:45,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:45,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 12:28:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-11-23 12:28:45,231 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2018-11-23 12:28:45,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:45,231 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-11-23 12:28:45,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:28:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:28:45,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-23 12:28:45,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:45,233 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:45,233 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:45,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:45,233 INFO L82 PathProgramCache]: Analyzing trace with hash -2135919753, now seen corresponding path program 33 times [2018-11-23 12:28:45,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:45,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:45,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:45,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:45,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:46,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {26241#true} call ULTIMATE.init(); {26241#true} is VALID [2018-11-23 12:28:46,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {26241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26241#true} is VALID [2018-11-23 12:28:46,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:46,356 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26241#true} {26241#true} #66#return; {26241#true} is VALID [2018-11-23 12:28:46,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {26241#true} call #t~ret12 := main(); {26241#true} is VALID [2018-11-23 12:28:46,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {26241#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26243#(= main_~i~1 0)} is VALID [2018-11-23 12:28:46,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {26243#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26243#(= main_~i~1 0)} is VALID [2018-11-23 12:28:46,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {26243#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26244#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:46,358 INFO L273 TraceCheckUtils]: 8: Hoare triple {26244#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26244#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:46,358 INFO L273 TraceCheckUtils]: 9: Hoare triple {26244#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26245#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:46,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {26245#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26245#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:46,360 INFO L273 TraceCheckUtils]: 11: Hoare triple {26245#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26246#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:46,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {26246#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26246#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:46,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {26246#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26247#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:46,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {26247#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26247#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:46,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {26247#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26248#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:46,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {26248#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26248#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:46,364 INFO L273 TraceCheckUtils]: 17: Hoare triple {26248#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26249#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:46,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {26249#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26249#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:46,365 INFO L273 TraceCheckUtils]: 19: Hoare triple {26249#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26250#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:46,365 INFO L273 TraceCheckUtils]: 20: Hoare triple {26250#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26250#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:46,366 INFO L273 TraceCheckUtils]: 21: Hoare triple {26250#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26251#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:46,367 INFO L273 TraceCheckUtils]: 22: Hoare triple {26251#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26251#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:46,367 INFO L273 TraceCheckUtils]: 23: Hoare triple {26251#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26252#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:46,368 INFO L273 TraceCheckUtils]: 24: Hoare triple {26252#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26252#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:46,369 INFO L273 TraceCheckUtils]: 25: Hoare triple {26252#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26253#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:46,369 INFO L273 TraceCheckUtils]: 26: Hoare triple {26253#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26253#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:46,370 INFO L273 TraceCheckUtils]: 27: Hoare triple {26253#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26254#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:46,370 INFO L273 TraceCheckUtils]: 28: Hoare triple {26254#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26254#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:46,371 INFO L273 TraceCheckUtils]: 29: Hoare triple {26254#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26255#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:46,372 INFO L273 TraceCheckUtils]: 30: Hoare triple {26255#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26255#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:46,372 INFO L273 TraceCheckUtils]: 31: Hoare triple {26255#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26256#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:46,373 INFO L273 TraceCheckUtils]: 32: Hoare triple {26256#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26256#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:46,374 INFO L273 TraceCheckUtils]: 33: Hoare triple {26256#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26257#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:46,374 INFO L273 TraceCheckUtils]: 34: Hoare triple {26257#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26257#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:46,375 INFO L273 TraceCheckUtils]: 35: Hoare triple {26257#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26258#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:46,376 INFO L273 TraceCheckUtils]: 36: Hoare triple {26258#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26258#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:46,376 INFO L273 TraceCheckUtils]: 37: Hoare triple {26258#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26259#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:46,377 INFO L273 TraceCheckUtils]: 38: Hoare triple {26259#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26259#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:46,378 INFO L273 TraceCheckUtils]: 39: Hoare triple {26259#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26260#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:46,378 INFO L273 TraceCheckUtils]: 40: Hoare triple {26260#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26260#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:46,379 INFO L273 TraceCheckUtils]: 41: Hoare triple {26260#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26261#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:46,379 INFO L273 TraceCheckUtils]: 42: Hoare triple {26261#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26261#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:46,380 INFO L273 TraceCheckUtils]: 43: Hoare triple {26261#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26262#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:46,381 INFO L273 TraceCheckUtils]: 44: Hoare triple {26262#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26262#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:46,381 INFO L273 TraceCheckUtils]: 45: Hoare triple {26262#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26263#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:46,382 INFO L273 TraceCheckUtils]: 46: Hoare triple {26263#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26263#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:46,383 INFO L273 TraceCheckUtils]: 47: Hoare triple {26263#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26264#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:46,383 INFO L273 TraceCheckUtils]: 48: Hoare triple {26264#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26264#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:46,384 INFO L273 TraceCheckUtils]: 49: Hoare triple {26264#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26265#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:46,384 INFO L273 TraceCheckUtils]: 50: Hoare triple {26265#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26265#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:46,385 INFO L273 TraceCheckUtils]: 51: Hoare triple {26265#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26266#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:46,386 INFO L273 TraceCheckUtils]: 52: Hoare triple {26266#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26266#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:46,386 INFO L273 TraceCheckUtils]: 53: Hoare triple {26266#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26267#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:46,387 INFO L273 TraceCheckUtils]: 54: Hoare triple {26267#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26267#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:46,388 INFO L273 TraceCheckUtils]: 55: Hoare triple {26267#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26268#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:46,388 INFO L273 TraceCheckUtils]: 56: Hoare triple {26268#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26268#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:46,389 INFO L273 TraceCheckUtils]: 57: Hoare triple {26268#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26269#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:46,389 INFO L273 TraceCheckUtils]: 58: Hoare triple {26269#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26269#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:46,390 INFO L273 TraceCheckUtils]: 59: Hoare triple {26269#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26270#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:46,391 INFO L273 TraceCheckUtils]: 60: Hoare triple {26270#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26270#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:46,391 INFO L273 TraceCheckUtils]: 61: Hoare triple {26270#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26271#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:46,392 INFO L273 TraceCheckUtils]: 62: Hoare triple {26271#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26271#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:46,393 INFO L273 TraceCheckUtils]: 63: Hoare triple {26271#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26272#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:46,393 INFO L273 TraceCheckUtils]: 64: Hoare triple {26272#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26272#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:46,394 INFO L273 TraceCheckUtils]: 65: Hoare triple {26272#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26273#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:46,394 INFO L273 TraceCheckUtils]: 66: Hoare triple {26273#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26273#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:46,395 INFO L273 TraceCheckUtils]: 67: Hoare triple {26273#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26274#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:46,396 INFO L273 TraceCheckUtils]: 68: Hoare triple {26274#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26274#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:46,396 INFO L273 TraceCheckUtils]: 69: Hoare triple {26274#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26275#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:46,397 INFO L273 TraceCheckUtils]: 70: Hoare triple {26275#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26275#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:46,398 INFO L273 TraceCheckUtils]: 71: Hoare triple {26275#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26276#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:46,398 INFO L273 TraceCheckUtils]: 72: Hoare triple {26276#(<= main_~i~1 33)} assume !(~i~1 < 10000); {26242#false} is VALID [2018-11-23 12:28:46,399 INFO L256 TraceCheckUtils]: 73: Hoare triple {26242#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:28:46,399 INFO L273 TraceCheckUtils]: 74: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26241#true} is VALID [2018-11-23 12:28:46,399 INFO L273 TraceCheckUtils]: 75: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,399 INFO L273 TraceCheckUtils]: 76: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,399 INFO L273 TraceCheckUtils]: 77: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,399 INFO L273 TraceCheckUtils]: 78: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,400 INFO L273 TraceCheckUtils]: 79: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,400 INFO L273 TraceCheckUtils]: 80: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,400 INFO L273 TraceCheckUtils]: 81: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,400 INFO L273 TraceCheckUtils]: 82: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,400 INFO L273 TraceCheckUtils]: 83: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,401 INFO L273 TraceCheckUtils]: 84: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,401 INFO L273 TraceCheckUtils]: 85: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,401 INFO L273 TraceCheckUtils]: 86: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,401 INFO L273 TraceCheckUtils]: 87: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,401 INFO L273 TraceCheckUtils]: 88: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,401 INFO L273 TraceCheckUtils]: 89: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,402 INFO L273 TraceCheckUtils]: 90: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,402 INFO L273 TraceCheckUtils]: 91: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,402 INFO L273 TraceCheckUtils]: 92: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,402 INFO L273 TraceCheckUtils]: 93: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,402 INFO L273 TraceCheckUtils]: 94: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,402 INFO L273 TraceCheckUtils]: 95: Hoare triple {26241#true} assume !(~i~0 < 10000); {26241#true} is VALID [2018-11-23 12:28:46,403 INFO L273 TraceCheckUtils]: 96: Hoare triple {26241#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:28:46,403 INFO L273 TraceCheckUtils]: 97: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:46,403 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26241#true} {26242#false} #70#return; {26242#false} is VALID [2018-11-23 12:28:46,403 INFO L273 TraceCheckUtils]: 99: Hoare triple {26242#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); {26242#false} is VALID [2018-11-23 12:28:46,403 INFO L256 TraceCheckUtils]: 100: Hoare triple {26242#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:28:46,403 INFO L273 TraceCheckUtils]: 101: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26241#true} is VALID [2018-11-23 12:28:46,403 INFO L273 TraceCheckUtils]: 102: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,403 INFO L273 TraceCheckUtils]: 103: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,403 INFO L273 TraceCheckUtils]: 104: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,403 INFO L273 TraceCheckUtils]: 105: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,404 INFO L273 TraceCheckUtils]: 106: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,404 INFO L273 TraceCheckUtils]: 107: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,404 INFO L273 TraceCheckUtils]: 108: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,404 INFO L273 TraceCheckUtils]: 109: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,404 INFO L273 TraceCheckUtils]: 110: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,404 INFO L273 TraceCheckUtils]: 111: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,404 INFO L273 TraceCheckUtils]: 112: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,404 INFO L273 TraceCheckUtils]: 113: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,404 INFO L273 TraceCheckUtils]: 114: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,404 INFO L273 TraceCheckUtils]: 115: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,405 INFO L273 TraceCheckUtils]: 116: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,405 INFO L273 TraceCheckUtils]: 117: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,405 INFO L273 TraceCheckUtils]: 118: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,405 INFO L273 TraceCheckUtils]: 119: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,405 INFO L273 TraceCheckUtils]: 120: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,405 INFO L273 TraceCheckUtils]: 121: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,405 INFO L273 TraceCheckUtils]: 122: Hoare triple {26241#true} assume !(~i~0 < 10000); {26241#true} is VALID [2018-11-23 12:28:46,405 INFO L273 TraceCheckUtils]: 123: Hoare triple {26241#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:28:46,405 INFO L273 TraceCheckUtils]: 124: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:46,405 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26241#true} {26242#false} #72#return; {26242#false} is VALID [2018-11-23 12:28:46,406 INFO L273 TraceCheckUtils]: 126: Hoare triple {26242#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; {26242#false} is VALID [2018-11-23 12:28:46,406 INFO L273 TraceCheckUtils]: 127: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,406 INFO L273 TraceCheckUtils]: 128: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,406 INFO L273 TraceCheckUtils]: 129: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,406 INFO L273 TraceCheckUtils]: 130: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,406 INFO L273 TraceCheckUtils]: 131: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,406 INFO L273 TraceCheckUtils]: 132: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,406 INFO L273 TraceCheckUtils]: 133: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,406 INFO L273 TraceCheckUtils]: 134: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,407 INFO L273 TraceCheckUtils]: 135: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,407 INFO L273 TraceCheckUtils]: 136: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,407 INFO L273 TraceCheckUtils]: 137: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,407 INFO L273 TraceCheckUtils]: 138: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,407 INFO L273 TraceCheckUtils]: 139: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,407 INFO L273 TraceCheckUtils]: 140: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,407 INFO L273 TraceCheckUtils]: 141: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,407 INFO L273 TraceCheckUtils]: 142: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,407 INFO L273 TraceCheckUtils]: 143: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,407 INFO L273 TraceCheckUtils]: 144: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,408 INFO L273 TraceCheckUtils]: 145: Hoare triple {26242#false} assume !(~i~2 < 9999); {26242#false} is VALID [2018-11-23 12:28:46,408 INFO L273 TraceCheckUtils]: 146: Hoare triple {26242#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:28:46,408 INFO L256 TraceCheckUtils]: 147: Hoare triple {26242#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:28:46,408 INFO L273 TraceCheckUtils]: 148: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26241#true} is VALID [2018-11-23 12:28:46,408 INFO L273 TraceCheckUtils]: 149: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,408 INFO L273 TraceCheckUtils]: 150: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,408 INFO L273 TraceCheckUtils]: 151: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,408 INFO L273 TraceCheckUtils]: 152: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,408 INFO L273 TraceCheckUtils]: 153: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,409 INFO L273 TraceCheckUtils]: 154: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,409 INFO L273 TraceCheckUtils]: 155: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,409 INFO L273 TraceCheckUtils]: 156: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,409 INFO L273 TraceCheckUtils]: 157: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,409 INFO L273 TraceCheckUtils]: 158: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,409 INFO L273 TraceCheckUtils]: 159: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,409 INFO L273 TraceCheckUtils]: 160: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,409 INFO L273 TraceCheckUtils]: 161: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,409 INFO L273 TraceCheckUtils]: 162: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,409 INFO L273 TraceCheckUtils]: 163: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,410 INFO L273 TraceCheckUtils]: 164: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,410 INFO L273 TraceCheckUtils]: 165: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,410 INFO L273 TraceCheckUtils]: 166: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,410 INFO L273 TraceCheckUtils]: 167: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,410 INFO L273 TraceCheckUtils]: 168: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,410 INFO L273 TraceCheckUtils]: 169: Hoare triple {26241#true} assume !(~i~0 < 10000); {26241#true} is VALID [2018-11-23 12:28:46,410 INFO L273 TraceCheckUtils]: 170: Hoare triple {26241#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:28:46,410 INFO L273 TraceCheckUtils]: 171: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:46,410 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26241#true} {26242#false} #74#return; {26242#false} is VALID [2018-11-23 12:28:46,410 INFO L273 TraceCheckUtils]: 173: Hoare triple {26242#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {26242#false} is VALID [2018-11-23 12:28:46,411 INFO L273 TraceCheckUtils]: 174: Hoare triple {26242#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {26242#false} is VALID [2018-11-23 12:28:46,411 INFO L273 TraceCheckUtils]: 175: Hoare triple {26242#false} assume !false; {26242#false} is VALID [2018-11-23 12:28:46,425 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:46,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:46,425 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:46,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:46,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 12:28:46,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:46,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:47,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {26241#true} call ULTIMATE.init(); {26241#true} is VALID [2018-11-23 12:28:47,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {26241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26241#true} is VALID [2018-11-23 12:28:47,295 INFO L273 TraceCheckUtils]: 2: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:47,295 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26241#true} {26241#true} #66#return; {26241#true} is VALID [2018-11-23 12:28:47,295 INFO L256 TraceCheckUtils]: 4: Hoare triple {26241#true} call #t~ret12 := main(); {26241#true} is VALID [2018-11-23 12:28:47,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {26241#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26241#true} is VALID [2018-11-23 12:28:47,295 INFO L273 TraceCheckUtils]: 6: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,296 INFO L273 TraceCheckUtils]: 13: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,296 INFO L273 TraceCheckUtils]: 14: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,297 INFO L273 TraceCheckUtils]: 15: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,297 INFO L273 TraceCheckUtils]: 16: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,297 INFO L273 TraceCheckUtils]: 17: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,297 INFO L273 TraceCheckUtils]: 18: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,297 INFO L273 TraceCheckUtils]: 19: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,297 INFO L273 TraceCheckUtils]: 21: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,298 INFO L273 TraceCheckUtils]: 25: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,298 INFO L273 TraceCheckUtils]: 27: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,298 INFO L273 TraceCheckUtils]: 28: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,298 INFO L273 TraceCheckUtils]: 29: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,298 INFO L273 TraceCheckUtils]: 30: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,298 INFO L273 TraceCheckUtils]: 31: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,298 INFO L273 TraceCheckUtils]: 32: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,298 INFO L273 TraceCheckUtils]: 33: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,298 INFO L273 TraceCheckUtils]: 34: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,299 INFO L273 TraceCheckUtils]: 35: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,299 INFO L273 TraceCheckUtils]: 36: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,299 INFO L273 TraceCheckUtils]: 37: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,299 INFO L273 TraceCheckUtils]: 38: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,299 INFO L273 TraceCheckUtils]: 39: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,299 INFO L273 TraceCheckUtils]: 40: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,299 INFO L273 TraceCheckUtils]: 41: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,299 INFO L273 TraceCheckUtils]: 42: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,299 INFO L273 TraceCheckUtils]: 43: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,300 INFO L273 TraceCheckUtils]: 44: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,300 INFO L273 TraceCheckUtils]: 45: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,300 INFO L273 TraceCheckUtils]: 46: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,300 INFO L273 TraceCheckUtils]: 47: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,300 INFO L273 TraceCheckUtils]: 48: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,300 INFO L273 TraceCheckUtils]: 49: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,300 INFO L273 TraceCheckUtils]: 50: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,300 INFO L273 TraceCheckUtils]: 51: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,300 INFO L273 TraceCheckUtils]: 52: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,300 INFO L273 TraceCheckUtils]: 53: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,301 INFO L273 TraceCheckUtils]: 54: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,301 INFO L273 TraceCheckUtils]: 55: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,301 INFO L273 TraceCheckUtils]: 56: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,301 INFO L273 TraceCheckUtils]: 57: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,301 INFO L273 TraceCheckUtils]: 58: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,301 INFO L273 TraceCheckUtils]: 59: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,301 INFO L273 TraceCheckUtils]: 60: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,301 INFO L273 TraceCheckUtils]: 61: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,301 INFO L273 TraceCheckUtils]: 62: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,301 INFO L273 TraceCheckUtils]: 63: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,302 INFO L273 TraceCheckUtils]: 64: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,302 INFO L273 TraceCheckUtils]: 65: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,302 INFO L273 TraceCheckUtils]: 66: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,302 INFO L273 TraceCheckUtils]: 67: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,302 INFO L273 TraceCheckUtils]: 68: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,302 INFO L273 TraceCheckUtils]: 69: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,302 INFO L273 TraceCheckUtils]: 70: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,302 INFO L273 TraceCheckUtils]: 71: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,302 INFO L273 TraceCheckUtils]: 72: Hoare triple {26241#true} assume !(~i~1 < 10000); {26241#true} is VALID [2018-11-23 12:28:47,302 INFO L256 TraceCheckUtils]: 73: Hoare triple {26241#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:28:47,303 INFO L273 TraceCheckUtils]: 74: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26241#true} is VALID [2018-11-23 12:28:47,303 INFO L273 TraceCheckUtils]: 75: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,303 INFO L273 TraceCheckUtils]: 76: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,303 INFO L273 TraceCheckUtils]: 77: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,303 INFO L273 TraceCheckUtils]: 78: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,303 INFO L273 TraceCheckUtils]: 79: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,303 INFO L273 TraceCheckUtils]: 80: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,303 INFO L273 TraceCheckUtils]: 81: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,303 INFO L273 TraceCheckUtils]: 82: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,304 INFO L273 TraceCheckUtils]: 83: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,304 INFO L273 TraceCheckUtils]: 84: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,304 INFO L273 TraceCheckUtils]: 85: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,304 INFO L273 TraceCheckUtils]: 86: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,304 INFO L273 TraceCheckUtils]: 87: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,304 INFO L273 TraceCheckUtils]: 88: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,304 INFO L273 TraceCheckUtils]: 89: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,304 INFO L273 TraceCheckUtils]: 90: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,304 INFO L273 TraceCheckUtils]: 91: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,304 INFO L273 TraceCheckUtils]: 92: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,305 INFO L273 TraceCheckUtils]: 93: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,305 INFO L273 TraceCheckUtils]: 94: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,305 INFO L273 TraceCheckUtils]: 95: Hoare triple {26241#true} assume !(~i~0 < 10000); {26241#true} is VALID [2018-11-23 12:28:47,305 INFO L273 TraceCheckUtils]: 96: Hoare triple {26241#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:28:47,305 INFO L273 TraceCheckUtils]: 97: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:47,305 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26241#true} {26241#true} #70#return; {26241#true} is VALID [2018-11-23 12:28:47,305 INFO L273 TraceCheckUtils]: 99: Hoare triple {26241#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); {26241#true} is VALID [2018-11-23 12:28:47,305 INFO L256 TraceCheckUtils]: 100: Hoare triple {26241#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:28:47,305 INFO L273 TraceCheckUtils]: 101: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26241#true} is VALID [2018-11-23 12:28:47,305 INFO L273 TraceCheckUtils]: 102: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,306 INFO L273 TraceCheckUtils]: 103: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,306 INFO L273 TraceCheckUtils]: 104: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,306 INFO L273 TraceCheckUtils]: 105: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,306 INFO L273 TraceCheckUtils]: 106: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,306 INFO L273 TraceCheckUtils]: 107: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,306 INFO L273 TraceCheckUtils]: 108: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,306 INFO L273 TraceCheckUtils]: 109: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,306 INFO L273 TraceCheckUtils]: 110: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,306 INFO L273 TraceCheckUtils]: 111: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,306 INFO L273 TraceCheckUtils]: 112: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 113: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 114: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 115: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 116: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 117: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 118: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 119: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 120: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 121: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 122: Hoare triple {26241#true} assume !(~i~0 < 10000); {26241#true} is VALID [2018-11-23 12:28:47,308 INFO L273 TraceCheckUtils]: 123: Hoare triple {26241#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:28:47,308 INFO L273 TraceCheckUtils]: 124: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:47,308 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26241#true} {26241#true} #72#return; {26241#true} is VALID [2018-11-23 12:28:47,309 INFO L273 TraceCheckUtils]: 126: Hoare triple {26241#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; {26658#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:47,309 INFO L273 TraceCheckUtils]: 127: Hoare triple {26658#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26658#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:47,311 INFO L273 TraceCheckUtils]: 128: Hoare triple {26658#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26665#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:47,311 INFO L273 TraceCheckUtils]: 129: Hoare triple {26665#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26665#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:47,311 INFO L273 TraceCheckUtils]: 130: Hoare triple {26665#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26672#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:47,312 INFO L273 TraceCheckUtils]: 131: Hoare triple {26672#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26672#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:47,313 INFO L273 TraceCheckUtils]: 132: Hoare triple {26672#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26679#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:47,313 INFO L273 TraceCheckUtils]: 133: Hoare triple {26679#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26679#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:47,313 INFO L273 TraceCheckUtils]: 134: Hoare triple {26679#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26686#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:47,314 INFO L273 TraceCheckUtils]: 135: Hoare triple {26686#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26686#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:47,314 INFO L273 TraceCheckUtils]: 136: Hoare triple {26686#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26693#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:47,315 INFO L273 TraceCheckUtils]: 137: Hoare triple {26693#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26693#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:47,315 INFO L273 TraceCheckUtils]: 138: Hoare triple {26693#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26700#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:47,316 INFO L273 TraceCheckUtils]: 139: Hoare triple {26700#(<= main_~i~2 6)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26700#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:47,317 INFO L273 TraceCheckUtils]: 140: Hoare triple {26700#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26707#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:47,317 INFO L273 TraceCheckUtils]: 141: Hoare triple {26707#(<= main_~i~2 7)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26707#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:47,318 INFO L273 TraceCheckUtils]: 142: Hoare triple {26707#(<= main_~i~2 7)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26714#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:47,318 INFO L273 TraceCheckUtils]: 143: Hoare triple {26714#(<= main_~i~2 8)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26714#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:47,319 INFO L273 TraceCheckUtils]: 144: Hoare triple {26714#(<= main_~i~2 8)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26721#(<= main_~i~2 9)} is VALID [2018-11-23 12:28:47,319 INFO L273 TraceCheckUtils]: 145: Hoare triple {26721#(<= main_~i~2 9)} assume !(~i~2 < 9999); {26242#false} is VALID [2018-11-23 12:28:47,320 INFO L273 TraceCheckUtils]: 146: Hoare triple {26242#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:28:47,320 INFO L256 TraceCheckUtils]: 147: Hoare triple {26242#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {26242#false} is VALID [2018-11-23 12:28:47,320 INFO L273 TraceCheckUtils]: 148: Hoare triple {26242#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26242#false} is VALID [2018-11-23 12:28:47,320 INFO L273 TraceCheckUtils]: 149: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,320 INFO L273 TraceCheckUtils]: 150: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,320 INFO L273 TraceCheckUtils]: 151: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,321 INFO L273 TraceCheckUtils]: 152: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,321 INFO L273 TraceCheckUtils]: 153: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,321 INFO L273 TraceCheckUtils]: 154: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,321 INFO L273 TraceCheckUtils]: 155: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,321 INFO L273 TraceCheckUtils]: 156: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,321 INFO L273 TraceCheckUtils]: 157: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,322 INFO L273 TraceCheckUtils]: 158: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,322 INFO L273 TraceCheckUtils]: 159: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,322 INFO L273 TraceCheckUtils]: 160: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,322 INFO L273 TraceCheckUtils]: 161: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,322 INFO L273 TraceCheckUtils]: 162: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,322 INFO L273 TraceCheckUtils]: 163: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,323 INFO L273 TraceCheckUtils]: 164: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,323 INFO L273 TraceCheckUtils]: 165: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,323 INFO L273 TraceCheckUtils]: 166: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,323 INFO L273 TraceCheckUtils]: 167: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,323 INFO L273 TraceCheckUtils]: 168: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,324 INFO L273 TraceCheckUtils]: 169: Hoare triple {26242#false} assume !(~i~0 < 10000); {26242#false} is VALID [2018-11-23 12:28:47,324 INFO L273 TraceCheckUtils]: 170: Hoare triple {26242#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {26242#false} is VALID [2018-11-23 12:28:47,324 INFO L273 TraceCheckUtils]: 171: Hoare triple {26242#false} assume true; {26242#false} is VALID [2018-11-23 12:28:47,324 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26242#false} {26242#false} #74#return; {26242#false} is VALID [2018-11-23 12:28:47,324 INFO L273 TraceCheckUtils]: 173: Hoare triple {26242#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {26242#false} is VALID [2018-11-23 12:28:47,324 INFO L273 TraceCheckUtils]: 174: Hoare triple {26242#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {26242#false} is VALID [2018-11-23 12:28:47,324 INFO L273 TraceCheckUtils]: 175: Hoare triple {26242#false} assume !false; {26242#false} is VALID [2018-11-23 12:28:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 450 proven. 81 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2018-11-23 12:28:47,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:47,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2018-11-23 12:28:47,357 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:28:47,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:47,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:28:47,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:47,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:28:47,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:28:47,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:28:47,489 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2018-11-23 12:28:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:48,737 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2018-11-23 12:28:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:28:48,737 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:28:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:28:48,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:28:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:28:48,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:28:48,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 141 transitions. [2018-11-23 12:28:48,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:48,877 INFO L225 Difference]: With dead ends: 187 [2018-11-23 12:28:48,878 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 12:28:48,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:28:48,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 12:28:49,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-23 12:28:49,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:49,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-23 12:28:49,250 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-23 12:28:49,250 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-23 12:28:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:49,252 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:28:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:28:49,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:49,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:49,253 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-23 12:28:49,253 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-23 12:28:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:49,255 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:28:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:28:49,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:49,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:49,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:49,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 12:28:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-11-23 12:28:49,257 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2018-11-23 12:28:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:49,257 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-11-23 12:28:49,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:28:49,257 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-23 12:28:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-23 12:28:49,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:49,258 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:49,258 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:49,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:49,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1391900713, now seen corresponding path program 34 times [2018-11-23 12:28:49,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:49,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:49,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:49,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:49,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:50,358 INFO L256 TraceCheckUtils]: 0: Hoare triple {27553#true} call ULTIMATE.init(); {27553#true} is VALID [2018-11-23 12:28:50,358 INFO L273 TraceCheckUtils]: 1: Hoare triple {27553#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27553#true} is VALID [2018-11-23 12:28:50,358 INFO L273 TraceCheckUtils]: 2: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:50,358 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27553#true} {27553#true} #66#return; {27553#true} is VALID [2018-11-23 12:28:50,358 INFO L256 TraceCheckUtils]: 4: Hoare triple {27553#true} call #t~ret12 := main(); {27553#true} is VALID [2018-11-23 12:28:50,359 INFO L273 TraceCheckUtils]: 5: Hoare triple {27553#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27555#(= main_~i~1 0)} is VALID [2018-11-23 12:28:50,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {27555#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27555#(= main_~i~1 0)} is VALID [2018-11-23 12:28:50,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {27555#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27556#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:50,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {27556#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27556#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:50,361 INFO L273 TraceCheckUtils]: 9: Hoare triple {27556#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27557#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:50,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {27557#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27557#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:50,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {27557#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27558#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:50,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {27558#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27558#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:50,363 INFO L273 TraceCheckUtils]: 13: Hoare triple {27558#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27559#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:50,364 INFO L273 TraceCheckUtils]: 14: Hoare triple {27559#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27559#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:50,364 INFO L273 TraceCheckUtils]: 15: Hoare triple {27559#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27560#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:50,365 INFO L273 TraceCheckUtils]: 16: Hoare triple {27560#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27560#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:50,366 INFO L273 TraceCheckUtils]: 17: Hoare triple {27560#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27561#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:50,366 INFO L273 TraceCheckUtils]: 18: Hoare triple {27561#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27561#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:50,367 INFO L273 TraceCheckUtils]: 19: Hoare triple {27561#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27562#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:50,367 INFO L273 TraceCheckUtils]: 20: Hoare triple {27562#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27562#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:50,368 INFO L273 TraceCheckUtils]: 21: Hoare triple {27562#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27563#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:50,368 INFO L273 TraceCheckUtils]: 22: Hoare triple {27563#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27563#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:50,369 INFO L273 TraceCheckUtils]: 23: Hoare triple {27563#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27564#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:50,370 INFO L273 TraceCheckUtils]: 24: Hoare triple {27564#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27564#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:50,370 INFO L273 TraceCheckUtils]: 25: Hoare triple {27564#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27565#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:50,371 INFO L273 TraceCheckUtils]: 26: Hoare triple {27565#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27565#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:50,371 INFO L273 TraceCheckUtils]: 27: Hoare triple {27565#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27566#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:50,372 INFO L273 TraceCheckUtils]: 28: Hoare triple {27566#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27566#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:50,373 INFO L273 TraceCheckUtils]: 29: Hoare triple {27566#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27567#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:50,373 INFO L273 TraceCheckUtils]: 30: Hoare triple {27567#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27567#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:50,374 INFO L273 TraceCheckUtils]: 31: Hoare triple {27567#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27568#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:50,374 INFO L273 TraceCheckUtils]: 32: Hoare triple {27568#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27568#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:50,375 INFO L273 TraceCheckUtils]: 33: Hoare triple {27568#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27569#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:50,375 INFO L273 TraceCheckUtils]: 34: Hoare triple {27569#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27569#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:50,376 INFO L273 TraceCheckUtils]: 35: Hoare triple {27569#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27570#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:50,377 INFO L273 TraceCheckUtils]: 36: Hoare triple {27570#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27570#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:50,377 INFO L273 TraceCheckUtils]: 37: Hoare triple {27570#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27571#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:50,378 INFO L273 TraceCheckUtils]: 38: Hoare triple {27571#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27571#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:50,378 INFO L273 TraceCheckUtils]: 39: Hoare triple {27571#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27572#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:50,379 INFO L273 TraceCheckUtils]: 40: Hoare triple {27572#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27572#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:50,380 INFO L273 TraceCheckUtils]: 41: Hoare triple {27572#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27573#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:50,380 INFO L273 TraceCheckUtils]: 42: Hoare triple {27573#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27573#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:50,381 INFO L273 TraceCheckUtils]: 43: Hoare triple {27573#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27574#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:50,381 INFO L273 TraceCheckUtils]: 44: Hoare triple {27574#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27574#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:50,382 INFO L273 TraceCheckUtils]: 45: Hoare triple {27574#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27575#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:50,382 INFO L273 TraceCheckUtils]: 46: Hoare triple {27575#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27575#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:50,383 INFO L273 TraceCheckUtils]: 47: Hoare triple {27575#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27576#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:50,384 INFO L273 TraceCheckUtils]: 48: Hoare triple {27576#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27576#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:50,384 INFO L273 TraceCheckUtils]: 49: Hoare triple {27576#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27577#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:50,385 INFO L273 TraceCheckUtils]: 50: Hoare triple {27577#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27577#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:50,386 INFO L273 TraceCheckUtils]: 51: Hoare triple {27577#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27578#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:50,386 INFO L273 TraceCheckUtils]: 52: Hoare triple {27578#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27578#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:50,387 INFO L273 TraceCheckUtils]: 53: Hoare triple {27578#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27579#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:50,388 INFO L273 TraceCheckUtils]: 54: Hoare triple {27579#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27579#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:50,388 INFO L273 TraceCheckUtils]: 55: Hoare triple {27579#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27580#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:50,389 INFO L273 TraceCheckUtils]: 56: Hoare triple {27580#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27580#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:50,390 INFO L273 TraceCheckUtils]: 57: Hoare triple {27580#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27581#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:50,390 INFO L273 TraceCheckUtils]: 58: Hoare triple {27581#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27581#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:50,391 INFO L273 TraceCheckUtils]: 59: Hoare triple {27581#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27582#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:50,391 INFO L273 TraceCheckUtils]: 60: Hoare triple {27582#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27582#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:50,392 INFO L273 TraceCheckUtils]: 61: Hoare triple {27582#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27583#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:50,393 INFO L273 TraceCheckUtils]: 62: Hoare triple {27583#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27583#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:50,393 INFO L273 TraceCheckUtils]: 63: Hoare triple {27583#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27584#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:50,394 INFO L273 TraceCheckUtils]: 64: Hoare triple {27584#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27584#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:50,395 INFO L273 TraceCheckUtils]: 65: Hoare triple {27584#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27585#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:50,395 INFO L273 TraceCheckUtils]: 66: Hoare triple {27585#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27585#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:50,396 INFO L273 TraceCheckUtils]: 67: Hoare triple {27585#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27586#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:50,396 INFO L273 TraceCheckUtils]: 68: Hoare triple {27586#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27586#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:50,397 INFO L273 TraceCheckUtils]: 69: Hoare triple {27586#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27587#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:50,398 INFO L273 TraceCheckUtils]: 70: Hoare triple {27587#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27587#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:50,398 INFO L273 TraceCheckUtils]: 71: Hoare triple {27587#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27588#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:50,399 INFO L273 TraceCheckUtils]: 72: Hoare triple {27588#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27588#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:50,400 INFO L273 TraceCheckUtils]: 73: Hoare triple {27588#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27589#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:50,400 INFO L273 TraceCheckUtils]: 74: Hoare triple {27589#(<= main_~i~1 34)} assume !(~i~1 < 10000); {27554#false} is VALID [2018-11-23 12:28:50,401 INFO L256 TraceCheckUtils]: 75: Hoare triple {27554#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:28:50,401 INFO L273 TraceCheckUtils]: 76: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27553#true} is VALID [2018-11-23 12:28:50,401 INFO L273 TraceCheckUtils]: 77: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,401 INFO L273 TraceCheckUtils]: 78: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,401 INFO L273 TraceCheckUtils]: 79: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,402 INFO L273 TraceCheckUtils]: 80: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,402 INFO L273 TraceCheckUtils]: 81: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,402 INFO L273 TraceCheckUtils]: 82: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,402 INFO L273 TraceCheckUtils]: 83: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,402 INFO L273 TraceCheckUtils]: 84: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,402 INFO L273 TraceCheckUtils]: 85: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,403 INFO L273 TraceCheckUtils]: 86: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,403 INFO L273 TraceCheckUtils]: 87: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,403 INFO L273 TraceCheckUtils]: 88: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,403 INFO L273 TraceCheckUtils]: 89: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,403 INFO L273 TraceCheckUtils]: 90: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,403 INFO L273 TraceCheckUtils]: 91: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,404 INFO L273 TraceCheckUtils]: 92: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,404 INFO L273 TraceCheckUtils]: 93: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,404 INFO L273 TraceCheckUtils]: 94: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,404 INFO L273 TraceCheckUtils]: 95: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,404 INFO L273 TraceCheckUtils]: 96: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,404 INFO L273 TraceCheckUtils]: 97: Hoare triple {27553#true} assume !(~i~0 < 10000); {27553#true} is VALID [2018-11-23 12:28:50,404 INFO L273 TraceCheckUtils]: 98: Hoare triple {27553#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:28:50,404 INFO L273 TraceCheckUtils]: 99: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:50,405 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27553#true} {27554#false} #70#return; {27554#false} is VALID [2018-11-23 12:28:50,405 INFO L273 TraceCheckUtils]: 101: Hoare triple {27554#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); {27554#false} is VALID [2018-11-23 12:28:50,405 INFO L256 TraceCheckUtils]: 102: Hoare triple {27554#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:28:50,405 INFO L273 TraceCheckUtils]: 103: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27553#true} is VALID [2018-11-23 12:28:50,405 INFO L273 TraceCheckUtils]: 104: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,405 INFO L273 TraceCheckUtils]: 105: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,405 INFO L273 TraceCheckUtils]: 106: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,405 INFO L273 TraceCheckUtils]: 107: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,405 INFO L273 TraceCheckUtils]: 108: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,406 INFO L273 TraceCheckUtils]: 109: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,406 INFO L273 TraceCheckUtils]: 110: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,406 INFO L273 TraceCheckUtils]: 111: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,406 INFO L273 TraceCheckUtils]: 112: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,406 INFO L273 TraceCheckUtils]: 113: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,406 INFO L273 TraceCheckUtils]: 114: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,406 INFO L273 TraceCheckUtils]: 115: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,406 INFO L273 TraceCheckUtils]: 116: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,406 INFO L273 TraceCheckUtils]: 117: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,406 INFO L273 TraceCheckUtils]: 118: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,407 INFO L273 TraceCheckUtils]: 119: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,407 INFO L273 TraceCheckUtils]: 120: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,407 INFO L273 TraceCheckUtils]: 121: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,407 INFO L273 TraceCheckUtils]: 122: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,407 INFO L273 TraceCheckUtils]: 123: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,407 INFO L273 TraceCheckUtils]: 124: Hoare triple {27553#true} assume !(~i~0 < 10000); {27553#true} is VALID [2018-11-23 12:28:50,407 INFO L273 TraceCheckUtils]: 125: Hoare triple {27553#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:28:50,407 INFO L273 TraceCheckUtils]: 126: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:50,407 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27553#true} {27554#false} #72#return; {27554#false} is VALID [2018-11-23 12:28:50,407 INFO L273 TraceCheckUtils]: 128: Hoare triple {27554#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; {27554#false} is VALID [2018-11-23 12:28:50,408 INFO L273 TraceCheckUtils]: 129: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,408 INFO L273 TraceCheckUtils]: 130: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,408 INFO L273 TraceCheckUtils]: 131: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,408 INFO L273 TraceCheckUtils]: 132: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,408 INFO L273 TraceCheckUtils]: 133: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,408 INFO L273 TraceCheckUtils]: 134: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,408 INFO L273 TraceCheckUtils]: 135: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,408 INFO L273 TraceCheckUtils]: 136: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,408 INFO L273 TraceCheckUtils]: 137: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,408 INFO L273 TraceCheckUtils]: 138: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,409 INFO L273 TraceCheckUtils]: 139: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,409 INFO L273 TraceCheckUtils]: 140: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,409 INFO L273 TraceCheckUtils]: 141: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,409 INFO L273 TraceCheckUtils]: 142: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,409 INFO L273 TraceCheckUtils]: 143: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,409 INFO L273 TraceCheckUtils]: 144: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,409 INFO L273 TraceCheckUtils]: 145: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,409 INFO L273 TraceCheckUtils]: 146: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,409 INFO L273 TraceCheckUtils]: 147: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,409 INFO L273 TraceCheckUtils]: 148: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,410 INFO L273 TraceCheckUtils]: 149: Hoare triple {27554#false} assume !(~i~2 < 9999); {27554#false} is VALID [2018-11-23 12:28:50,410 INFO L273 TraceCheckUtils]: 150: Hoare triple {27554#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:28:50,410 INFO L256 TraceCheckUtils]: 151: Hoare triple {27554#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:28:50,410 INFO L273 TraceCheckUtils]: 152: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27553#true} is VALID [2018-11-23 12:28:50,410 INFO L273 TraceCheckUtils]: 153: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,410 INFO L273 TraceCheckUtils]: 154: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,410 INFO L273 TraceCheckUtils]: 155: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,410 INFO L273 TraceCheckUtils]: 156: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,410 INFO L273 TraceCheckUtils]: 157: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,411 INFO L273 TraceCheckUtils]: 158: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,411 INFO L273 TraceCheckUtils]: 159: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,411 INFO L273 TraceCheckUtils]: 160: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,411 INFO L273 TraceCheckUtils]: 161: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,411 INFO L273 TraceCheckUtils]: 162: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,411 INFO L273 TraceCheckUtils]: 163: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,411 INFO L273 TraceCheckUtils]: 164: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,411 INFO L273 TraceCheckUtils]: 165: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,411 INFO L273 TraceCheckUtils]: 166: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,411 INFO L273 TraceCheckUtils]: 167: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,412 INFO L273 TraceCheckUtils]: 168: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,412 INFO L273 TraceCheckUtils]: 169: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,412 INFO L273 TraceCheckUtils]: 170: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,412 INFO L273 TraceCheckUtils]: 171: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,412 INFO L273 TraceCheckUtils]: 172: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,412 INFO L273 TraceCheckUtils]: 173: Hoare triple {27553#true} assume !(~i~0 < 10000); {27553#true} is VALID [2018-11-23 12:28:50,412 INFO L273 TraceCheckUtils]: 174: Hoare triple {27553#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:28:50,412 INFO L273 TraceCheckUtils]: 175: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:50,412 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27553#true} {27554#false} #74#return; {27554#false} is VALID [2018-11-23 12:28:50,412 INFO L273 TraceCheckUtils]: 177: Hoare triple {27554#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {27554#false} is VALID [2018-11-23 12:28:50,413 INFO L273 TraceCheckUtils]: 178: Hoare triple {27554#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {27554#false} is VALID [2018-11-23 12:28:50,413 INFO L273 TraceCheckUtils]: 179: Hoare triple {27554#false} assume !false; {27554#false} is VALID [2018-11-23 12:28:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2018-11-23 12:28:50,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28: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 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:50,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:50,527 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:50,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:50,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:50,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {27553#true} call ULTIMATE.init(); {27553#true} is VALID [2018-11-23 12:28:50,978 INFO L273 TraceCheckUtils]: 1: Hoare triple {27553#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27553#true} is VALID [2018-11-23 12:28:50,978 INFO L273 TraceCheckUtils]: 2: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:50,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27553#true} {27553#true} #66#return; {27553#true} is VALID [2018-11-23 12:28:50,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {27553#true} call #t~ret12 := main(); {27553#true} is VALID [2018-11-23 12:28:50,979 INFO L273 TraceCheckUtils]: 5: Hoare triple {27553#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27553#true} is VALID [2018-11-23 12:28:50,979 INFO L273 TraceCheckUtils]: 6: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,979 INFO L273 TraceCheckUtils]: 7: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,980 INFO L273 TraceCheckUtils]: 8: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,980 INFO L273 TraceCheckUtils]: 9: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,980 INFO L273 TraceCheckUtils]: 10: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,980 INFO L273 TraceCheckUtils]: 11: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,980 INFO L273 TraceCheckUtils]: 12: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,980 INFO L273 TraceCheckUtils]: 13: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,980 INFO L273 TraceCheckUtils]: 14: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,981 INFO L273 TraceCheckUtils]: 15: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,981 INFO L273 TraceCheckUtils]: 16: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,981 INFO L273 TraceCheckUtils]: 17: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,981 INFO L273 TraceCheckUtils]: 18: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,981 INFO L273 TraceCheckUtils]: 19: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,981 INFO L273 TraceCheckUtils]: 20: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,981 INFO L273 TraceCheckUtils]: 21: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,982 INFO L273 TraceCheckUtils]: 22: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,982 INFO L273 TraceCheckUtils]: 23: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,982 INFO L273 TraceCheckUtils]: 24: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,982 INFO L273 TraceCheckUtils]: 25: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,982 INFO L273 TraceCheckUtils]: 26: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,982 INFO L273 TraceCheckUtils]: 27: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,982 INFO L273 TraceCheckUtils]: 28: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,982 INFO L273 TraceCheckUtils]: 29: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,982 INFO L273 TraceCheckUtils]: 30: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,982 INFO L273 TraceCheckUtils]: 31: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,983 INFO L273 TraceCheckUtils]: 32: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,983 INFO L273 TraceCheckUtils]: 33: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,983 INFO L273 TraceCheckUtils]: 34: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,983 INFO L273 TraceCheckUtils]: 35: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,983 INFO L273 TraceCheckUtils]: 36: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,983 INFO L273 TraceCheckUtils]: 37: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,983 INFO L273 TraceCheckUtils]: 38: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,983 INFO L273 TraceCheckUtils]: 39: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,983 INFO L273 TraceCheckUtils]: 40: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,983 INFO L273 TraceCheckUtils]: 41: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,984 INFO L273 TraceCheckUtils]: 42: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,984 INFO L273 TraceCheckUtils]: 43: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,984 INFO L273 TraceCheckUtils]: 44: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,984 INFO L273 TraceCheckUtils]: 45: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,984 INFO L273 TraceCheckUtils]: 46: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,984 INFO L273 TraceCheckUtils]: 47: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,984 INFO L273 TraceCheckUtils]: 48: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,984 INFO L273 TraceCheckUtils]: 49: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,984 INFO L273 TraceCheckUtils]: 50: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,984 INFO L273 TraceCheckUtils]: 51: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,985 INFO L273 TraceCheckUtils]: 52: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,985 INFO L273 TraceCheckUtils]: 53: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,985 INFO L273 TraceCheckUtils]: 54: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,985 INFO L273 TraceCheckUtils]: 55: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,985 INFO L273 TraceCheckUtils]: 56: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,985 INFO L273 TraceCheckUtils]: 57: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,985 INFO L273 TraceCheckUtils]: 58: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,985 INFO L273 TraceCheckUtils]: 59: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,985 INFO L273 TraceCheckUtils]: 60: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,985 INFO L273 TraceCheckUtils]: 61: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,986 INFO L273 TraceCheckUtils]: 62: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,986 INFO L273 TraceCheckUtils]: 63: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,986 INFO L273 TraceCheckUtils]: 64: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,986 INFO L273 TraceCheckUtils]: 65: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,986 INFO L273 TraceCheckUtils]: 66: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,986 INFO L273 TraceCheckUtils]: 67: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,986 INFO L273 TraceCheckUtils]: 68: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,986 INFO L273 TraceCheckUtils]: 69: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,986 INFO L273 TraceCheckUtils]: 70: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,986 INFO L273 TraceCheckUtils]: 71: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,987 INFO L273 TraceCheckUtils]: 72: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,987 INFO L273 TraceCheckUtils]: 73: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,987 INFO L273 TraceCheckUtils]: 74: Hoare triple {27553#true} assume !(~i~1 < 10000); {27553#true} is VALID [2018-11-23 12:28:50,987 INFO L256 TraceCheckUtils]: 75: Hoare triple {27553#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:28:50,987 INFO L273 TraceCheckUtils]: 76: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27553#true} is VALID [2018-11-23 12:28:50,987 INFO L273 TraceCheckUtils]: 77: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,987 INFO L273 TraceCheckUtils]: 78: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,987 INFO L273 TraceCheckUtils]: 79: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,987 INFO L273 TraceCheckUtils]: 80: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,987 INFO L273 TraceCheckUtils]: 81: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,988 INFO L273 TraceCheckUtils]: 82: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,988 INFO L273 TraceCheckUtils]: 83: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,988 INFO L273 TraceCheckUtils]: 84: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,988 INFO L273 TraceCheckUtils]: 85: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,988 INFO L273 TraceCheckUtils]: 86: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,988 INFO L273 TraceCheckUtils]: 87: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,988 INFO L273 TraceCheckUtils]: 88: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,988 INFO L273 TraceCheckUtils]: 89: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,988 INFO L273 TraceCheckUtils]: 90: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,988 INFO L273 TraceCheckUtils]: 91: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,989 INFO L273 TraceCheckUtils]: 92: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,989 INFO L273 TraceCheckUtils]: 93: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,989 INFO L273 TraceCheckUtils]: 94: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,989 INFO L273 TraceCheckUtils]: 95: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,989 INFO L273 TraceCheckUtils]: 96: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,989 INFO L273 TraceCheckUtils]: 97: Hoare triple {27553#true} assume !(~i~0 < 10000); {27553#true} is VALID [2018-11-23 12:28:50,989 INFO L273 TraceCheckUtils]: 98: Hoare triple {27553#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:28:50,989 INFO L273 TraceCheckUtils]: 99: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:50,989 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27553#true} {27553#true} #70#return; {27553#true} is VALID [2018-11-23 12:28:50,989 INFO L273 TraceCheckUtils]: 101: Hoare triple {27553#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); {27553#true} is VALID [2018-11-23 12:28:50,990 INFO L256 TraceCheckUtils]: 102: Hoare triple {27553#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:28:50,990 INFO L273 TraceCheckUtils]: 103: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27553#true} is VALID [2018-11-23 12:28:50,990 INFO L273 TraceCheckUtils]: 104: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,990 INFO L273 TraceCheckUtils]: 105: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,990 INFO L273 TraceCheckUtils]: 106: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,990 INFO L273 TraceCheckUtils]: 107: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,990 INFO L273 TraceCheckUtils]: 108: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,990 INFO L273 TraceCheckUtils]: 109: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,990 INFO L273 TraceCheckUtils]: 110: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,991 INFO L273 TraceCheckUtils]: 111: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,991 INFO L273 TraceCheckUtils]: 112: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,991 INFO L273 TraceCheckUtils]: 113: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,991 INFO L273 TraceCheckUtils]: 114: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,991 INFO L273 TraceCheckUtils]: 115: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,991 INFO L273 TraceCheckUtils]: 116: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,991 INFO L273 TraceCheckUtils]: 117: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,991 INFO L273 TraceCheckUtils]: 118: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,991 INFO L273 TraceCheckUtils]: 119: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,991 INFO L273 TraceCheckUtils]: 120: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,992 INFO L273 TraceCheckUtils]: 121: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,992 INFO L273 TraceCheckUtils]: 122: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,992 INFO L273 TraceCheckUtils]: 123: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,992 INFO L273 TraceCheckUtils]: 124: Hoare triple {27553#true} assume !(~i~0 < 10000); {27553#true} is VALID [2018-11-23 12:28:50,992 INFO L273 TraceCheckUtils]: 125: Hoare triple {27553#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:28:50,992 INFO L273 TraceCheckUtils]: 126: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:50,992 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27553#true} {27553#true} #72#return; {27553#true} is VALID [2018-11-23 12:28:50,993 INFO L273 TraceCheckUtils]: 128: Hoare triple {27553#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; {27977#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:50,993 INFO L273 TraceCheckUtils]: 129: Hoare triple {27977#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27977#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:50,993 INFO L273 TraceCheckUtils]: 130: Hoare triple {27977#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27984#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:50,994 INFO L273 TraceCheckUtils]: 131: Hoare triple {27984#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27984#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:50,994 INFO L273 TraceCheckUtils]: 132: Hoare triple {27984#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27991#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:50,994 INFO L273 TraceCheckUtils]: 133: Hoare triple {27991#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27991#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:50,995 INFO L273 TraceCheckUtils]: 134: Hoare triple {27991#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27998#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:50,995 INFO L273 TraceCheckUtils]: 135: Hoare triple {27998#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27998#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:50,996 INFO L273 TraceCheckUtils]: 136: Hoare triple {27998#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28005#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:50,996 INFO L273 TraceCheckUtils]: 137: Hoare triple {28005#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28005#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:50,997 INFO L273 TraceCheckUtils]: 138: Hoare triple {28005#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28012#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:50,998 INFO L273 TraceCheckUtils]: 139: Hoare triple {28012#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28012#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:50,998 INFO L273 TraceCheckUtils]: 140: Hoare triple {28012#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28019#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:50,999 INFO L273 TraceCheckUtils]: 141: Hoare triple {28019#(<= main_~i~2 6)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28019#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:50,999 INFO L273 TraceCheckUtils]: 142: Hoare triple {28019#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28026#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:51,000 INFO L273 TraceCheckUtils]: 143: Hoare triple {28026#(<= main_~i~2 7)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28026#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:51,001 INFO L273 TraceCheckUtils]: 144: Hoare triple {28026#(<= main_~i~2 7)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28033#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:51,001 INFO L273 TraceCheckUtils]: 145: Hoare triple {28033#(<= main_~i~2 8)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28033#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:51,002 INFO L273 TraceCheckUtils]: 146: Hoare triple {28033#(<= main_~i~2 8)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28040#(<= main_~i~2 9)} is VALID [2018-11-23 12:28:51,002 INFO L273 TraceCheckUtils]: 147: Hoare triple {28040#(<= main_~i~2 9)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28040#(<= main_~i~2 9)} is VALID [2018-11-23 12:28:51,003 INFO L273 TraceCheckUtils]: 148: Hoare triple {28040#(<= main_~i~2 9)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28047#(<= main_~i~2 10)} is VALID [2018-11-23 12:28:51,003 INFO L273 TraceCheckUtils]: 149: Hoare triple {28047#(<= main_~i~2 10)} assume !(~i~2 < 9999); {27554#false} is VALID [2018-11-23 12:28:51,004 INFO L273 TraceCheckUtils]: 150: Hoare triple {27554#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:28:51,004 INFO L256 TraceCheckUtils]: 151: Hoare triple {27554#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {27554#false} is VALID [2018-11-23 12:28:51,004 INFO L273 TraceCheckUtils]: 152: Hoare triple {27554#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27554#false} is VALID [2018-11-23 12:28:51,004 INFO L273 TraceCheckUtils]: 153: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:51,004 INFO L273 TraceCheckUtils]: 154: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:51,004 INFO L273 TraceCheckUtils]: 155: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:51,005 INFO L273 TraceCheckUtils]: 156: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:51,005 INFO L273 TraceCheckUtils]: 157: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:51,005 INFO L273 TraceCheckUtils]: 158: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:51,005 INFO L273 TraceCheckUtils]: 159: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:51,005 INFO L273 TraceCheckUtils]: 160: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:51,005 INFO L273 TraceCheckUtils]: 161: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:51,006 INFO L273 TraceCheckUtils]: 162: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:51,006 INFO L273 TraceCheckUtils]: 163: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:51,006 INFO L273 TraceCheckUtils]: 164: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:51,006 INFO L273 TraceCheckUtils]: 165: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:51,006 INFO L273 TraceCheckUtils]: 166: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:51,006 INFO L273 TraceCheckUtils]: 167: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:51,007 INFO L273 TraceCheckUtils]: 168: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:51,007 INFO L273 TraceCheckUtils]: 169: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:51,007 INFO L273 TraceCheckUtils]: 170: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:51,007 INFO L273 TraceCheckUtils]: 171: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:51,007 INFO L273 TraceCheckUtils]: 172: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:51,007 INFO L273 TraceCheckUtils]: 173: Hoare triple {27554#false} assume !(~i~0 < 10000); {27554#false} is VALID [2018-11-23 12:28:51,007 INFO L273 TraceCheckUtils]: 174: Hoare triple {27554#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {27554#false} is VALID [2018-11-23 12:28:51,007 INFO L273 TraceCheckUtils]: 175: Hoare triple {27554#false} assume true; {27554#false} is VALID [2018-11-23 12:28:51,008 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27554#false} {27554#false} #74#return; {27554#false} is VALID [2018-11-23 12:28:51,008 INFO L273 TraceCheckUtils]: 177: Hoare triple {27554#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {27554#false} is VALID [2018-11-23 12:28:51,008 INFO L273 TraceCheckUtils]: 178: Hoare triple {27554#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {27554#false} is VALID [2018-11-23 12:28:51,008 INFO L273 TraceCheckUtils]: 179: Hoare triple {27554#false} assume !false; {27554#false} is VALID [2018-11-23 12:28:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 450 proven. 100 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2018-11-23 12:28:51,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:51,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2018-11-23 12:28:51,041 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:28:51,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:51,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:28:51,175 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:51,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:28:51,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:28:51,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:28:51,176 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2018-11-23 12:28:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:51,697 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-11-23 12:28:51,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:28:51,698 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:28:51,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:28:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:28:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:28:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:28:51,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 145 transitions. [2018-11-23 12:28:52,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:52,175 INFO L225 Difference]: With dead ends: 193 [2018-11-23 12:28:52,175 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 12:28:52,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:28:52,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 12:28:52,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-23 12:28:52,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:52,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 135 states. [2018-11-23 12:28:52,226 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 135 states. [2018-11-23 12:28:52,226 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 135 states. [2018-11-23 12:28:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:52,229 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:28:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:28:52,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:52,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:52,229 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 137 states. [2018-11-23 12:28:52,229 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 137 states. [2018-11-23 12:28:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:52,232 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:28:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:28:52,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:52,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:52,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:52,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 12:28:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-11-23 12:28:52,235 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2018-11-23 12:28:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:52,235 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-11-23 12:28:52,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:28:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-23 12:28:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 12:28:52,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:52,237 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 30, 30, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:52,237 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:52,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:52,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1808612553, now seen corresponding path program 35 times [2018-11-23 12:28:52,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:52,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:52,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:52,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:52,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:53,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {28902#true} call ULTIMATE.init(); {28902#true} is VALID [2018-11-23 12:28:53,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {28902#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28902#true} is VALID [2018-11-23 12:28:53,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:28:53,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28902#true} {28902#true} #66#return; {28902#true} is VALID [2018-11-23 12:28:53,021 INFO L256 TraceCheckUtils]: 4: Hoare triple {28902#true} call #t~ret12 := main(); {28902#true} is VALID [2018-11-23 12:28:53,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {28902#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {28904#(= main_~i~1 0)} is VALID [2018-11-23 12:28:53,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {28904#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28904#(= main_~i~1 0)} is VALID [2018-11-23 12:28:53,023 INFO L273 TraceCheckUtils]: 7: Hoare triple {28904#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28905#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:53,023 INFO L273 TraceCheckUtils]: 8: Hoare triple {28905#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28905#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:53,024 INFO L273 TraceCheckUtils]: 9: Hoare triple {28905#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28906#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:53,024 INFO L273 TraceCheckUtils]: 10: Hoare triple {28906#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28906#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:53,025 INFO L273 TraceCheckUtils]: 11: Hoare triple {28906#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28907#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:53,025 INFO L273 TraceCheckUtils]: 12: Hoare triple {28907#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28907#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:53,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {28907#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28908#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:53,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {28908#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28908#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:53,027 INFO L273 TraceCheckUtils]: 15: Hoare triple {28908#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28909#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:53,027 INFO L273 TraceCheckUtils]: 16: Hoare triple {28909#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28909#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:53,028 INFO L273 TraceCheckUtils]: 17: Hoare triple {28909#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28910#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:53,029 INFO L273 TraceCheckUtils]: 18: Hoare triple {28910#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28910#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:53,029 INFO L273 TraceCheckUtils]: 19: Hoare triple {28910#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28911#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:53,030 INFO L273 TraceCheckUtils]: 20: Hoare triple {28911#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28911#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:53,031 INFO L273 TraceCheckUtils]: 21: Hoare triple {28911#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28912#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:53,031 INFO L273 TraceCheckUtils]: 22: Hoare triple {28912#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28912#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:53,032 INFO L273 TraceCheckUtils]: 23: Hoare triple {28912#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28913#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:53,032 INFO L273 TraceCheckUtils]: 24: Hoare triple {28913#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28913#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:53,033 INFO L273 TraceCheckUtils]: 25: Hoare triple {28913#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28914#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:53,034 INFO L273 TraceCheckUtils]: 26: Hoare triple {28914#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28914#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:53,034 INFO L273 TraceCheckUtils]: 27: Hoare triple {28914#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28915#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:53,035 INFO L273 TraceCheckUtils]: 28: Hoare triple {28915#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28915#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:53,036 INFO L273 TraceCheckUtils]: 29: Hoare triple {28915#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28916#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:53,036 INFO L273 TraceCheckUtils]: 30: Hoare triple {28916#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28916#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:53,037 INFO L273 TraceCheckUtils]: 31: Hoare triple {28916#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28917#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:53,037 INFO L273 TraceCheckUtils]: 32: Hoare triple {28917#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28917#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:53,038 INFO L273 TraceCheckUtils]: 33: Hoare triple {28917#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28918#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:53,039 INFO L273 TraceCheckUtils]: 34: Hoare triple {28918#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28918#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:53,039 INFO L273 TraceCheckUtils]: 35: Hoare triple {28918#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28919#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:53,040 INFO L273 TraceCheckUtils]: 36: Hoare triple {28919#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28919#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:53,041 INFO L273 TraceCheckUtils]: 37: Hoare triple {28919#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28920#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:53,041 INFO L273 TraceCheckUtils]: 38: Hoare triple {28920#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28920#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:53,042 INFO L273 TraceCheckUtils]: 39: Hoare triple {28920#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28921#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:53,043 INFO L273 TraceCheckUtils]: 40: Hoare triple {28921#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28921#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:53,043 INFO L273 TraceCheckUtils]: 41: Hoare triple {28921#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28922#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:53,043 INFO L273 TraceCheckUtils]: 42: Hoare triple {28922#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28922#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:53,044 INFO L273 TraceCheckUtils]: 43: Hoare triple {28922#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28923#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:53,044 INFO L273 TraceCheckUtils]: 44: Hoare triple {28923#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28923#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:53,045 INFO L273 TraceCheckUtils]: 45: Hoare triple {28923#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28924#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:53,045 INFO L273 TraceCheckUtils]: 46: Hoare triple {28924#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28924#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:53,046 INFO L273 TraceCheckUtils]: 47: Hoare triple {28924#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28925#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:53,046 INFO L273 TraceCheckUtils]: 48: Hoare triple {28925#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28925#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:53,047 INFO L273 TraceCheckUtils]: 49: Hoare triple {28925#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28926#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:53,048 INFO L273 TraceCheckUtils]: 50: Hoare triple {28926#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28926#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:53,048 INFO L273 TraceCheckUtils]: 51: Hoare triple {28926#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28927#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:53,049 INFO L273 TraceCheckUtils]: 52: Hoare triple {28927#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28927#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:53,050 INFO L273 TraceCheckUtils]: 53: Hoare triple {28927#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28928#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:53,050 INFO L273 TraceCheckUtils]: 54: Hoare triple {28928#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28928#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:53,051 INFO L273 TraceCheckUtils]: 55: Hoare triple {28928#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28929#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:53,051 INFO L273 TraceCheckUtils]: 56: Hoare triple {28929#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28929#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:53,052 INFO L273 TraceCheckUtils]: 57: Hoare triple {28929#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28930#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:53,053 INFO L273 TraceCheckUtils]: 58: Hoare triple {28930#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28930#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:53,053 INFO L273 TraceCheckUtils]: 59: Hoare triple {28930#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28931#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:53,054 INFO L273 TraceCheckUtils]: 60: Hoare triple {28931#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28931#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:53,055 INFO L273 TraceCheckUtils]: 61: Hoare triple {28931#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28932#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:53,055 INFO L273 TraceCheckUtils]: 62: Hoare triple {28932#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28932#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:53,056 INFO L273 TraceCheckUtils]: 63: Hoare triple {28932#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28933#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:53,056 INFO L273 TraceCheckUtils]: 64: Hoare triple {28933#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28933#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:53,057 INFO L273 TraceCheckUtils]: 65: Hoare triple {28933#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28934#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:53,058 INFO L273 TraceCheckUtils]: 66: Hoare triple {28934#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28934#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:53,058 INFO L273 TraceCheckUtils]: 67: Hoare triple {28934#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28935#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:53,059 INFO L273 TraceCheckUtils]: 68: Hoare triple {28935#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28935#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:53,060 INFO L273 TraceCheckUtils]: 69: Hoare triple {28935#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28936#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:53,060 INFO L273 TraceCheckUtils]: 70: Hoare triple {28936#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28936#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:53,061 INFO L273 TraceCheckUtils]: 71: Hoare triple {28936#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28937#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:53,061 INFO L273 TraceCheckUtils]: 72: Hoare triple {28937#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28937#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:53,062 INFO L273 TraceCheckUtils]: 73: Hoare triple {28937#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28938#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:53,063 INFO L273 TraceCheckUtils]: 74: Hoare triple {28938#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28938#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:53,063 INFO L273 TraceCheckUtils]: 75: Hoare triple {28938#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28939#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:53,064 INFO L273 TraceCheckUtils]: 76: Hoare triple {28939#(<= main_~i~1 35)} assume !(~i~1 < 10000); {28903#false} is VALID [2018-11-23 12:28:53,064 INFO L256 TraceCheckUtils]: 77: Hoare triple {28903#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:28:53,064 INFO L273 TraceCheckUtils]: 78: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28902#true} is VALID [2018-11-23 12:28:53,065 INFO L273 TraceCheckUtils]: 79: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,065 INFO L273 TraceCheckUtils]: 80: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,065 INFO L273 TraceCheckUtils]: 81: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,065 INFO L273 TraceCheckUtils]: 82: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,065 INFO L273 TraceCheckUtils]: 83: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,066 INFO L273 TraceCheckUtils]: 84: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,066 INFO L273 TraceCheckUtils]: 85: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,066 INFO L273 TraceCheckUtils]: 86: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,066 INFO L273 TraceCheckUtils]: 87: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,066 INFO L273 TraceCheckUtils]: 88: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,066 INFO L273 TraceCheckUtils]: 89: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,067 INFO L273 TraceCheckUtils]: 90: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,067 INFO L273 TraceCheckUtils]: 91: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,067 INFO L273 TraceCheckUtils]: 92: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,067 INFO L273 TraceCheckUtils]: 93: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,067 INFO L273 TraceCheckUtils]: 94: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,067 INFO L273 TraceCheckUtils]: 95: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,067 INFO L273 TraceCheckUtils]: 96: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,067 INFO L273 TraceCheckUtils]: 97: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,068 INFO L273 TraceCheckUtils]: 98: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,068 INFO L273 TraceCheckUtils]: 99: Hoare triple {28902#true} assume !(~i~0 < 10000); {28902#true} is VALID [2018-11-23 12:28:53,068 INFO L273 TraceCheckUtils]: 100: Hoare triple {28902#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {28902#true} is VALID [2018-11-23 12:28:53,068 INFO L273 TraceCheckUtils]: 101: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:28:53,068 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28902#true} {28903#false} #70#return; {28903#false} is VALID [2018-11-23 12:28:53,068 INFO L273 TraceCheckUtils]: 103: Hoare triple {28903#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); {28903#false} is VALID [2018-11-23 12:28:53,068 INFO L256 TraceCheckUtils]: 104: Hoare triple {28903#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:28:53,068 INFO L273 TraceCheckUtils]: 105: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28902#true} is VALID [2018-11-23 12:28:53,068 INFO L273 TraceCheckUtils]: 106: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,069 INFO L273 TraceCheckUtils]: 107: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,069 INFO L273 TraceCheckUtils]: 108: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,069 INFO L273 TraceCheckUtils]: 109: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,069 INFO L273 TraceCheckUtils]: 110: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,069 INFO L273 TraceCheckUtils]: 111: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,069 INFO L273 TraceCheckUtils]: 112: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,069 INFO L273 TraceCheckUtils]: 113: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,069 INFO L273 TraceCheckUtils]: 114: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,069 INFO L273 TraceCheckUtils]: 115: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,069 INFO L273 TraceCheckUtils]: 116: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,070 INFO L273 TraceCheckUtils]: 117: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,070 INFO L273 TraceCheckUtils]: 118: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,070 INFO L273 TraceCheckUtils]: 119: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,070 INFO L273 TraceCheckUtils]: 120: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,070 INFO L273 TraceCheckUtils]: 121: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,070 INFO L273 TraceCheckUtils]: 122: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,070 INFO L273 TraceCheckUtils]: 123: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,070 INFO L273 TraceCheckUtils]: 124: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,070 INFO L273 TraceCheckUtils]: 125: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,070 INFO L273 TraceCheckUtils]: 126: Hoare triple {28902#true} assume !(~i~0 < 10000); {28902#true} is VALID [2018-11-23 12:28:53,071 INFO L273 TraceCheckUtils]: 127: Hoare triple {28902#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {28902#true} is VALID [2018-11-23 12:28:53,071 INFO L273 TraceCheckUtils]: 128: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:28:53,071 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28902#true} {28903#false} #72#return; {28903#false} is VALID [2018-11-23 12:28:53,071 INFO L273 TraceCheckUtils]: 130: Hoare triple {28903#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; {28903#false} is VALID [2018-11-23 12:28:53,071 INFO L273 TraceCheckUtils]: 131: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,071 INFO L273 TraceCheckUtils]: 132: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,071 INFO L273 TraceCheckUtils]: 133: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,071 INFO L273 TraceCheckUtils]: 134: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,071 INFO L273 TraceCheckUtils]: 135: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,071 INFO L273 TraceCheckUtils]: 136: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,072 INFO L273 TraceCheckUtils]: 137: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,072 INFO L273 TraceCheckUtils]: 138: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,072 INFO L273 TraceCheckUtils]: 139: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,072 INFO L273 TraceCheckUtils]: 140: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,072 INFO L273 TraceCheckUtils]: 141: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,072 INFO L273 TraceCheckUtils]: 142: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,072 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,072 INFO L273 TraceCheckUtils]: 144: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,072 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,073 INFO L273 TraceCheckUtils]: 146: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,073 INFO L273 TraceCheckUtils]: 147: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,073 INFO L273 TraceCheckUtils]: 148: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,073 INFO L273 TraceCheckUtils]: 149: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,073 INFO L273 TraceCheckUtils]: 150: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,073 INFO L273 TraceCheckUtils]: 151: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,073 INFO L273 TraceCheckUtils]: 152: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,073 INFO L273 TraceCheckUtils]: 153: Hoare triple {28903#false} assume !(~i~2 < 9999); {28903#false} is VALID [2018-11-23 12:28:53,073 INFO L273 TraceCheckUtils]: 154: Hoare triple {28903#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:28:53,073 INFO L256 TraceCheckUtils]: 155: Hoare triple {28903#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:28:53,074 INFO L273 TraceCheckUtils]: 156: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28902#true} is VALID [2018-11-23 12:28:53,074 INFO L273 TraceCheckUtils]: 157: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,074 INFO L273 TraceCheckUtils]: 158: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,074 INFO L273 TraceCheckUtils]: 159: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,074 INFO L273 TraceCheckUtils]: 160: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,074 INFO L273 TraceCheckUtils]: 161: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,074 INFO L273 TraceCheckUtils]: 162: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,074 INFO L273 TraceCheckUtils]: 163: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,074 INFO L273 TraceCheckUtils]: 164: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,074 INFO L273 TraceCheckUtils]: 165: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,075 INFO L273 TraceCheckUtils]: 166: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,075 INFO L273 TraceCheckUtils]: 167: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,075 INFO L273 TraceCheckUtils]: 168: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,075 INFO L273 TraceCheckUtils]: 169: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,075 INFO L273 TraceCheckUtils]: 170: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,075 INFO L273 TraceCheckUtils]: 171: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,075 INFO L273 TraceCheckUtils]: 172: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,075 INFO L273 TraceCheckUtils]: 173: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,075 INFO L273 TraceCheckUtils]: 174: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,076 INFO L273 TraceCheckUtils]: 175: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,076 INFO L273 TraceCheckUtils]: 176: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,076 INFO L273 TraceCheckUtils]: 177: Hoare triple {28902#true} assume !(~i~0 < 10000); {28902#true} is VALID [2018-11-23 12:28:53,076 INFO L273 TraceCheckUtils]: 178: Hoare triple {28902#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {28902#true} is VALID [2018-11-23 12:28:53,076 INFO L273 TraceCheckUtils]: 179: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:28:53,076 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28902#true} {28903#false} #74#return; {28903#false} is VALID [2018-11-23 12:28:53,076 INFO L273 TraceCheckUtils]: 181: Hoare triple {28903#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {28903#false} is VALID [2018-11-23 12:28:53,076 INFO L273 TraceCheckUtils]: 182: Hoare triple {28903#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {28903#false} is VALID [2018-11-23 12:28:53,076 INFO L273 TraceCheckUtils]: 183: Hoare triple {28903#false} assume !false; {28903#false} is VALID [2018-11-23 12:28:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2018-11-23 12:28:53,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:53,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53,100 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:29:52,653 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2018-11-23 12:29:52,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:52,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:53,164 INFO L256 TraceCheckUtils]: 0: Hoare triple {28902#true} call ULTIMATE.init(); {28902#true} is VALID [2018-11-23 12:29:53,164 INFO L273 TraceCheckUtils]: 1: Hoare triple {28902#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28902#true} is VALID [2018-11-23 12:29:53,164 INFO L273 TraceCheckUtils]: 2: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:29:53,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28902#true} {28902#true} #66#return; {28902#true} is VALID [2018-11-23 12:29:53,165 INFO L256 TraceCheckUtils]: 4: Hoare triple {28902#true} call #t~ret12 := main(); {28902#true} is VALID [2018-11-23 12:29:53,165 INFO L273 TraceCheckUtils]: 5: Hoare triple {28902#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {28902#true} is VALID [2018-11-23 12:29:53,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,166 INFO L273 TraceCheckUtils]: 13: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,166 INFO L273 TraceCheckUtils]: 14: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,166 INFO L273 TraceCheckUtils]: 15: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,166 INFO L273 TraceCheckUtils]: 17: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 18: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 20: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 21: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 22: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 23: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 24: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 25: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 26: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 27: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 28: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 29: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 30: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 31: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 32: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 33: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 34: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 35: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 36: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 37: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 38: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 39: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 40: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 41: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 42: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 43: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 44: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 45: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 46: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 47: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 48: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 49: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 50: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 51: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 52: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 53: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 54: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 55: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 56: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 57: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 58: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 59: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 60: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 61: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 62: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 63: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 64: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 65: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 66: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 67: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 68: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 69: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 70: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 71: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 72: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 73: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 74: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 75: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:29:53,173 INFO L273 TraceCheckUtils]: 76: Hoare triple {28902#true} assume !(~i~1 < 10000); {28902#true} is VALID [2018-11-23 12:29:53,173 INFO L256 TraceCheckUtils]: 77: Hoare triple {28902#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:29:53,173 INFO L273 TraceCheckUtils]: 78: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {29177#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:29:53,173 INFO L273 TraceCheckUtils]: 79: Hoare triple {29177#(<= mapavg_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29177#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:29:53,174 INFO L273 TraceCheckUtils]: 80: Hoare triple {29177#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29184#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:29:53,174 INFO L273 TraceCheckUtils]: 81: Hoare triple {29184#(<= mapavg_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29184#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:29:53,175 INFO L273 TraceCheckUtils]: 82: Hoare triple {29184#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29191#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:29:53,175 INFO L273 TraceCheckUtils]: 83: Hoare triple {29191#(<= mapavg_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29191#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:29:53,175 INFO L273 TraceCheckUtils]: 84: Hoare triple {29191#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29198#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:29:53,176 INFO L273 TraceCheckUtils]: 85: Hoare triple {29198#(<= mapavg_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29198#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:29:53,177 INFO L273 TraceCheckUtils]: 86: Hoare triple {29198#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29205#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:29:53,177 INFO L273 TraceCheckUtils]: 87: Hoare triple {29205#(<= mapavg_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29205#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:29:53,178 INFO L273 TraceCheckUtils]: 88: Hoare triple {29205#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29212#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:29:53,178 INFO L273 TraceCheckUtils]: 89: Hoare triple {29212#(<= mapavg_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29212#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:29:53,179 INFO L273 TraceCheckUtils]: 90: Hoare triple {29212#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29219#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:29:53,180 INFO L273 TraceCheckUtils]: 91: Hoare triple {29219#(<= mapavg_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29219#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:29:53,180 INFO L273 TraceCheckUtils]: 92: Hoare triple {29219#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29226#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:29:53,181 INFO L273 TraceCheckUtils]: 93: Hoare triple {29226#(<= mapavg_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29226#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:29:53,182 INFO L273 TraceCheckUtils]: 94: Hoare triple {29226#(<= mapavg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29233#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:29:53,182 INFO L273 TraceCheckUtils]: 95: Hoare triple {29233#(<= mapavg_~i~0 8)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29233#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:29:53,183 INFO L273 TraceCheckUtils]: 96: Hoare triple {29233#(<= mapavg_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29240#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:29:53,183 INFO L273 TraceCheckUtils]: 97: Hoare triple {29240#(<= mapavg_~i~0 9)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29240#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:29:53,184 INFO L273 TraceCheckUtils]: 98: Hoare triple {29240#(<= mapavg_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29247#(<= mapavg_~i~0 10)} is VALID [2018-11-23 12:29:53,185 INFO L273 TraceCheckUtils]: 99: Hoare triple {29247#(<= mapavg_~i~0 10)} assume !(~i~0 < 10000); {28903#false} is VALID [2018-11-23 12:29:53,185 INFO L273 TraceCheckUtils]: 100: Hoare triple {28903#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {28903#false} is VALID [2018-11-23 12:29:53,185 INFO L273 TraceCheckUtils]: 101: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:29:53,185 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28903#false} {28902#true} #70#return; {28903#false} is VALID [2018-11-23 12:29:53,185 INFO L273 TraceCheckUtils]: 103: Hoare triple {28903#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); {28903#false} is VALID [2018-11-23 12:29:53,186 INFO L256 TraceCheckUtils]: 104: Hoare triple {28903#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {28903#false} is VALID [2018-11-23 12:29:53,186 INFO L273 TraceCheckUtils]: 105: Hoare triple {28903#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28903#false} is VALID [2018-11-23 12:29:53,186 INFO L273 TraceCheckUtils]: 106: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,186 INFO L273 TraceCheckUtils]: 107: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,186 INFO L273 TraceCheckUtils]: 108: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,187 INFO L273 TraceCheckUtils]: 109: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,187 INFO L273 TraceCheckUtils]: 110: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,187 INFO L273 TraceCheckUtils]: 111: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,187 INFO L273 TraceCheckUtils]: 112: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,187 INFO L273 TraceCheckUtils]: 113: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,187 INFO L273 TraceCheckUtils]: 114: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,188 INFO L273 TraceCheckUtils]: 115: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,188 INFO L273 TraceCheckUtils]: 116: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,188 INFO L273 TraceCheckUtils]: 117: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,188 INFO L273 TraceCheckUtils]: 118: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,188 INFO L273 TraceCheckUtils]: 119: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,188 INFO L273 TraceCheckUtils]: 120: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,188 INFO L273 TraceCheckUtils]: 121: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,188 INFO L273 TraceCheckUtils]: 122: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,188 INFO L273 TraceCheckUtils]: 123: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,189 INFO L273 TraceCheckUtils]: 124: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,189 INFO L273 TraceCheckUtils]: 125: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,189 INFO L273 TraceCheckUtils]: 126: Hoare triple {28903#false} assume !(~i~0 < 10000); {28903#false} is VALID [2018-11-23 12:29:53,189 INFO L273 TraceCheckUtils]: 127: Hoare triple {28903#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {28903#false} is VALID [2018-11-23 12:29:53,189 INFO L273 TraceCheckUtils]: 128: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:29:53,189 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28903#false} {28903#false} #72#return; {28903#false} is VALID [2018-11-23 12:29:53,189 INFO L273 TraceCheckUtils]: 130: Hoare triple {28903#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; {28903#false} is VALID [2018-11-23 12:29:53,189 INFO L273 TraceCheckUtils]: 131: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:53,189 INFO L273 TraceCheckUtils]: 132: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:53,189 INFO L273 TraceCheckUtils]: 133: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 134: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 135: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 136: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 137: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 138: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 139: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 140: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 141: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 142: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 144: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 146: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 147: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 148: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 149: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 150: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 151: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 152: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 153: Hoare triple {28903#false} assume !(~i~2 < 9999); {28903#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 154: Hoare triple {28903#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:29:53,192 INFO L256 TraceCheckUtils]: 155: Hoare triple {28903#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {28903#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 156: Hoare triple {28903#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28903#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 157: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 158: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 159: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 160: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 161: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 162: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 163: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 164: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 165: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 166: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 167: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 168: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 169: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 170: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 171: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 172: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 173: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 174: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 175: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 176: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 177: Hoare triple {28903#false} assume !(~i~0 < 10000); {28903#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 178: Hoare triple {28903#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {28903#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 179: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:29:53,194 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28903#false} {28903#false} #74#return; {28903#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 181: Hoare triple {28903#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {28903#false} is VALID [2018-11-23 12:29:53,195 INFO L273 TraceCheckUtils]: 182: Hoare triple {28903#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {28903#false} is VALID [2018-11-23 12:29:53,195 INFO L273 TraceCheckUtils]: 183: Hoare triple {28903#false} assume !false; {28903#false} is VALID [2018-11-23 12:29:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 444 proven. 100 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2018-11-23 12:29:53,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:53,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2018-11-23 12:29:53,235 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:29:53,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:53,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:29:53,375 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:53,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:29:53,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:29:53,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:29:53,377 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2018-11-23 12:29:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:54,240 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2018-11-23 12:29:54,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:29:54,240 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:29:54,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:29:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:29:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:29:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:29:54,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 150 transitions. [2018-11-23 12:29:54,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:54,396 INFO L225 Difference]: With dead ends: 199 [2018-11-23 12:29:54,397 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 12:29:54,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:29:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 12:29:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-23 12:29:54,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:54,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 139 states. [2018-11-23 12:29:54,457 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 139 states. [2018-11-23 12:29:54,457 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 139 states. [2018-11-23 12:29:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:54,460 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:29:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:29:54,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:54,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:54,461 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 141 states. [2018-11-23 12:29:54,461 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 141 states. [2018-11-23 12:29:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:54,464 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:29:54,464 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:29:54,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:54,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:54,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:54,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 12:29:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2018-11-23 12:29:54,468 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2018-11-23 12:29:54,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:54,468 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2018-11-23 12:29:54,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:29:54,468 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:29:54,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-23 12:29:54,469 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:54,469 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 33, 33, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:54,470 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:54,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:54,470 INFO L82 PathProgramCache]: Analyzing trace with hash 822690679, now seen corresponding path program 36 times [2018-11-23 12:29:54,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:54,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:54,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:54,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:54,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:55,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {30287#true} call ULTIMATE.init(); {30287#true} is VALID [2018-11-23 12:29:55,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {30287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30287#true} is VALID [2018-11-23 12:29:55,355 INFO L273 TraceCheckUtils]: 2: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:29:55,356 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30287#true} {30287#true} #66#return; {30287#true} is VALID [2018-11-23 12:29:55,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {30287#true} call #t~ret12 := main(); {30287#true} is VALID [2018-11-23 12:29:55,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {30287#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30289#(= main_~i~1 0)} is VALID [2018-11-23 12:29:55,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {30289#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30289#(= main_~i~1 0)} is VALID [2018-11-23 12:29:55,358 INFO L273 TraceCheckUtils]: 7: Hoare triple {30289#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30290#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:55,358 INFO L273 TraceCheckUtils]: 8: Hoare triple {30290#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30290#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:55,358 INFO L273 TraceCheckUtils]: 9: Hoare triple {30290#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30291#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:55,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {30291#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30291#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:55,359 INFO L273 TraceCheckUtils]: 11: Hoare triple {30291#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30292#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:55,359 INFO L273 TraceCheckUtils]: 12: Hoare triple {30292#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30292#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:55,360 INFO L273 TraceCheckUtils]: 13: Hoare triple {30292#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30293#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:55,360 INFO L273 TraceCheckUtils]: 14: Hoare triple {30293#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30293#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:55,361 INFO L273 TraceCheckUtils]: 15: Hoare triple {30293#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30294#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:55,361 INFO L273 TraceCheckUtils]: 16: Hoare triple {30294#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30294#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:55,362 INFO L273 TraceCheckUtils]: 17: Hoare triple {30294#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30295#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:55,362 INFO L273 TraceCheckUtils]: 18: Hoare triple {30295#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30295#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:55,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {30295#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30296#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:55,364 INFO L273 TraceCheckUtils]: 20: Hoare triple {30296#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30296#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:55,364 INFO L273 TraceCheckUtils]: 21: Hoare triple {30296#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30297#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:55,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {30297#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30297#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:55,366 INFO L273 TraceCheckUtils]: 23: Hoare triple {30297#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30298#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:55,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {30298#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30298#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:55,367 INFO L273 TraceCheckUtils]: 25: Hoare triple {30298#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30299#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:55,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {30299#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30299#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:55,368 INFO L273 TraceCheckUtils]: 27: Hoare triple {30299#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30300#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:55,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {30300#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30300#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:55,369 INFO L273 TraceCheckUtils]: 29: Hoare triple {30300#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30301#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:55,370 INFO L273 TraceCheckUtils]: 30: Hoare triple {30301#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30301#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:55,370 INFO L273 TraceCheckUtils]: 31: Hoare triple {30301#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30302#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:55,371 INFO L273 TraceCheckUtils]: 32: Hoare triple {30302#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30302#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:55,372 INFO L273 TraceCheckUtils]: 33: Hoare triple {30302#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30303#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:55,372 INFO L273 TraceCheckUtils]: 34: Hoare triple {30303#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30303#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:55,373 INFO L273 TraceCheckUtils]: 35: Hoare triple {30303#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30304#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:55,373 INFO L273 TraceCheckUtils]: 36: Hoare triple {30304#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30304#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:55,374 INFO L273 TraceCheckUtils]: 37: Hoare triple {30304#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30305#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:55,375 INFO L273 TraceCheckUtils]: 38: Hoare triple {30305#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30305#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:55,375 INFO L273 TraceCheckUtils]: 39: Hoare triple {30305#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30306#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:55,376 INFO L273 TraceCheckUtils]: 40: Hoare triple {30306#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30306#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:55,377 INFO L273 TraceCheckUtils]: 41: Hoare triple {30306#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30307#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:55,377 INFO L273 TraceCheckUtils]: 42: Hoare triple {30307#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30307#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:55,378 INFO L273 TraceCheckUtils]: 43: Hoare triple {30307#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30308#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:55,378 INFO L273 TraceCheckUtils]: 44: Hoare triple {30308#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30308#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:55,379 INFO L273 TraceCheckUtils]: 45: Hoare triple {30308#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30309#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:55,380 INFO L273 TraceCheckUtils]: 46: Hoare triple {30309#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30309#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:55,380 INFO L273 TraceCheckUtils]: 47: Hoare triple {30309#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30310#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:55,381 INFO L273 TraceCheckUtils]: 48: Hoare triple {30310#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30310#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:55,382 INFO L273 TraceCheckUtils]: 49: Hoare triple {30310#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30311#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:55,382 INFO L273 TraceCheckUtils]: 50: Hoare triple {30311#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30311#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:55,383 INFO L273 TraceCheckUtils]: 51: Hoare triple {30311#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30312#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:55,383 INFO L273 TraceCheckUtils]: 52: Hoare triple {30312#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30312#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:55,384 INFO L273 TraceCheckUtils]: 53: Hoare triple {30312#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30313#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:55,385 INFO L273 TraceCheckUtils]: 54: Hoare triple {30313#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30313#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:55,385 INFO L273 TraceCheckUtils]: 55: Hoare triple {30313#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30314#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:55,386 INFO L273 TraceCheckUtils]: 56: Hoare triple {30314#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30314#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:55,387 INFO L273 TraceCheckUtils]: 57: Hoare triple {30314#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30315#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:55,387 INFO L273 TraceCheckUtils]: 58: Hoare triple {30315#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30315#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:55,388 INFO L273 TraceCheckUtils]: 59: Hoare triple {30315#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30316#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:55,389 INFO L273 TraceCheckUtils]: 60: Hoare triple {30316#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30316#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:55,389 INFO L273 TraceCheckUtils]: 61: Hoare triple {30316#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30317#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:55,390 INFO L273 TraceCheckUtils]: 62: Hoare triple {30317#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30317#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:55,390 INFO L273 TraceCheckUtils]: 63: Hoare triple {30317#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30318#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:55,391 INFO L273 TraceCheckUtils]: 64: Hoare triple {30318#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30318#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:55,392 INFO L273 TraceCheckUtils]: 65: Hoare triple {30318#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30319#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:55,392 INFO L273 TraceCheckUtils]: 66: Hoare triple {30319#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30319#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:55,393 INFO L273 TraceCheckUtils]: 67: Hoare triple {30319#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30320#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:55,394 INFO L273 TraceCheckUtils]: 68: Hoare triple {30320#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30320#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:55,394 INFO L273 TraceCheckUtils]: 69: Hoare triple {30320#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30321#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:55,395 INFO L273 TraceCheckUtils]: 70: Hoare triple {30321#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30321#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:55,395 INFO L273 TraceCheckUtils]: 71: Hoare triple {30321#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30322#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:55,396 INFO L273 TraceCheckUtils]: 72: Hoare triple {30322#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30322#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:55,397 INFO L273 TraceCheckUtils]: 73: Hoare triple {30322#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30323#(<= main_~i~1 34)} is VALID [2018-11-23 12:29:55,397 INFO L273 TraceCheckUtils]: 74: Hoare triple {30323#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30323#(<= main_~i~1 34)} is VALID [2018-11-23 12:29:55,398 INFO L273 TraceCheckUtils]: 75: Hoare triple {30323#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30324#(<= main_~i~1 35)} is VALID [2018-11-23 12:29:55,398 INFO L273 TraceCheckUtils]: 76: Hoare triple {30324#(<= main_~i~1 35)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30324#(<= main_~i~1 35)} is VALID [2018-11-23 12:29:55,399 INFO L273 TraceCheckUtils]: 77: Hoare triple {30324#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30325#(<= main_~i~1 36)} is VALID [2018-11-23 12:29:55,400 INFO L273 TraceCheckUtils]: 78: Hoare triple {30325#(<= main_~i~1 36)} assume !(~i~1 < 10000); {30288#false} is VALID [2018-11-23 12:29:55,400 INFO L256 TraceCheckUtils]: 79: Hoare triple {30288#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:29:55,400 INFO L273 TraceCheckUtils]: 80: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30287#true} is VALID [2018-11-23 12:29:55,400 INFO L273 TraceCheckUtils]: 81: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,401 INFO L273 TraceCheckUtils]: 82: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,401 INFO L273 TraceCheckUtils]: 83: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,401 INFO L273 TraceCheckUtils]: 84: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,401 INFO L273 TraceCheckUtils]: 85: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,401 INFO L273 TraceCheckUtils]: 86: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,402 INFO L273 TraceCheckUtils]: 87: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,402 INFO L273 TraceCheckUtils]: 88: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,402 INFO L273 TraceCheckUtils]: 89: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,402 INFO L273 TraceCheckUtils]: 90: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,402 INFO L273 TraceCheckUtils]: 91: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,402 INFO L273 TraceCheckUtils]: 92: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,403 INFO L273 TraceCheckUtils]: 93: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,403 INFO L273 TraceCheckUtils]: 94: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,403 INFO L273 TraceCheckUtils]: 95: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,403 INFO L273 TraceCheckUtils]: 96: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,403 INFO L273 TraceCheckUtils]: 97: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,403 INFO L273 TraceCheckUtils]: 98: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,403 INFO L273 TraceCheckUtils]: 99: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,403 INFO L273 TraceCheckUtils]: 100: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,403 INFO L273 TraceCheckUtils]: 101: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,404 INFO L273 TraceCheckUtils]: 102: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,404 INFO L273 TraceCheckUtils]: 103: Hoare triple {30287#true} assume !(~i~0 < 10000); {30287#true} is VALID [2018-11-23 12:29:55,404 INFO L273 TraceCheckUtils]: 104: Hoare triple {30287#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:29:55,404 INFO L273 TraceCheckUtils]: 105: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:29:55,404 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30287#true} {30288#false} #70#return; {30288#false} is VALID [2018-11-23 12:29:55,404 INFO L273 TraceCheckUtils]: 107: Hoare triple {30288#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); {30288#false} is VALID [2018-11-23 12:29:55,404 INFO L256 TraceCheckUtils]: 108: Hoare triple {30288#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:29:55,404 INFO L273 TraceCheckUtils]: 109: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30287#true} is VALID [2018-11-23 12:29:55,404 INFO L273 TraceCheckUtils]: 110: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,405 INFO L273 TraceCheckUtils]: 111: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,405 INFO L273 TraceCheckUtils]: 112: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,405 INFO L273 TraceCheckUtils]: 113: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,405 INFO L273 TraceCheckUtils]: 114: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,405 INFO L273 TraceCheckUtils]: 115: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,405 INFO L273 TraceCheckUtils]: 116: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,405 INFO L273 TraceCheckUtils]: 117: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,405 INFO L273 TraceCheckUtils]: 118: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,405 INFO L273 TraceCheckUtils]: 119: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,405 INFO L273 TraceCheckUtils]: 120: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,406 INFO L273 TraceCheckUtils]: 121: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,406 INFO L273 TraceCheckUtils]: 122: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,406 INFO L273 TraceCheckUtils]: 123: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,406 INFO L273 TraceCheckUtils]: 124: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,406 INFO L273 TraceCheckUtils]: 125: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,406 INFO L273 TraceCheckUtils]: 126: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,406 INFO L273 TraceCheckUtils]: 127: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,406 INFO L273 TraceCheckUtils]: 128: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,406 INFO L273 TraceCheckUtils]: 129: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,406 INFO L273 TraceCheckUtils]: 130: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,407 INFO L273 TraceCheckUtils]: 131: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,407 INFO L273 TraceCheckUtils]: 132: Hoare triple {30287#true} assume !(~i~0 < 10000); {30287#true} is VALID [2018-11-23 12:29:55,407 INFO L273 TraceCheckUtils]: 133: Hoare triple {30287#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:29:55,407 INFO L273 TraceCheckUtils]: 134: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:29:55,407 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30287#true} {30288#false} #72#return; {30288#false} is VALID [2018-11-23 12:29:55,407 INFO L273 TraceCheckUtils]: 136: Hoare triple {30288#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; {30288#false} is VALID [2018-11-23 12:29:55,407 INFO L273 TraceCheckUtils]: 137: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:29:55,407 INFO L273 TraceCheckUtils]: 138: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:29:55,407 INFO L273 TraceCheckUtils]: 139: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:29:55,407 INFO L273 TraceCheckUtils]: 140: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:29:55,408 INFO L273 TraceCheckUtils]: 141: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:29:55,408 INFO L273 TraceCheckUtils]: 142: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:29:55,408 INFO L273 TraceCheckUtils]: 143: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:29:55,408 INFO L273 TraceCheckUtils]: 144: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:29:55,408 INFO L273 TraceCheckUtils]: 145: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:29:55,408 INFO L273 TraceCheckUtils]: 146: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:29:55,408 INFO L273 TraceCheckUtils]: 147: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:29:55,408 INFO L273 TraceCheckUtils]: 148: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:29:55,408 INFO L273 TraceCheckUtils]: 149: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:29:55,409 INFO L273 TraceCheckUtils]: 150: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:29:55,409 INFO L273 TraceCheckUtils]: 151: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:29:55,409 INFO L273 TraceCheckUtils]: 152: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:29:55,409 INFO L273 TraceCheckUtils]: 153: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:29:55,409 INFO L273 TraceCheckUtils]: 154: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:29:55,409 INFO L273 TraceCheckUtils]: 155: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:29:55,409 INFO L273 TraceCheckUtils]: 156: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:29:55,409 INFO L273 TraceCheckUtils]: 157: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:29:55,409 INFO L273 TraceCheckUtils]: 158: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:29:55,409 INFO L273 TraceCheckUtils]: 159: Hoare triple {30288#false} assume !(~i~2 < 9999); {30288#false} is VALID [2018-11-23 12:29:55,410 INFO L273 TraceCheckUtils]: 160: Hoare triple {30288#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {30288#false} is VALID [2018-11-23 12:29:55,410 INFO L256 TraceCheckUtils]: 161: Hoare triple {30288#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:29:55,410 INFO L273 TraceCheckUtils]: 162: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30287#true} is VALID [2018-11-23 12:29:55,410 INFO L273 TraceCheckUtils]: 163: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,410 INFO L273 TraceCheckUtils]: 164: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,410 INFO L273 TraceCheckUtils]: 165: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,410 INFO L273 TraceCheckUtils]: 166: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,410 INFO L273 TraceCheckUtils]: 167: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,410 INFO L273 TraceCheckUtils]: 168: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,410 INFO L273 TraceCheckUtils]: 169: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,411 INFO L273 TraceCheckUtils]: 170: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,411 INFO L273 TraceCheckUtils]: 171: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,411 INFO L273 TraceCheckUtils]: 172: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,411 INFO L273 TraceCheckUtils]: 173: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,411 INFO L273 TraceCheckUtils]: 174: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,411 INFO L273 TraceCheckUtils]: 175: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,411 INFO L273 TraceCheckUtils]: 176: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,411 INFO L273 TraceCheckUtils]: 177: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,411 INFO L273 TraceCheckUtils]: 178: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,411 INFO L273 TraceCheckUtils]: 179: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,412 INFO L273 TraceCheckUtils]: 180: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,412 INFO L273 TraceCheckUtils]: 181: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,412 INFO L273 TraceCheckUtils]: 182: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,412 INFO L273 TraceCheckUtils]: 183: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:29:55,412 INFO L273 TraceCheckUtils]: 184: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:29:55,412 INFO L273 TraceCheckUtils]: 185: Hoare triple {30287#true} assume !(~i~0 < 10000); {30287#true} is VALID [2018-11-23 12:29:55,412 INFO L273 TraceCheckUtils]: 186: Hoare triple {30287#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:29:55,412 INFO L273 TraceCheckUtils]: 187: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:29:55,412 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30287#true} {30288#false} #74#return; {30288#false} is VALID [2018-11-23 12:29:55,412 INFO L273 TraceCheckUtils]: 189: Hoare triple {30288#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {30288#false} is VALID [2018-11-23 12:29:55,413 INFO L273 TraceCheckUtils]: 190: Hoare triple {30288#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {30288#false} is VALID [2018-11-23 12:29:55,413 INFO L273 TraceCheckUtils]: 191: Hoare triple {30288#false} assume !false; {30288#false} is VALID [2018-11-23 12:29:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2018-11-23 12:29:55,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:55,453 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:29:55,464 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:30:08,905 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-11-23 12:30:08,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:08,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:09,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {30287#true} call ULTIMATE.init(); {30287#true} is VALID [2018-11-23 12:30:09,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {30287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30287#true} is VALID [2018-11-23 12:30:09,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:09,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30287#true} {30287#true} #66#return; {30287#true} is VALID [2018-11-23 12:30:09,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {30287#true} call #t~ret12 := main(); {30287#true} is VALID [2018-11-23 12:30:09,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {30287#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30287#true} is VALID [2018-11-23 12:30:09,521 INFO L273 TraceCheckUtils]: 6: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,521 INFO L273 TraceCheckUtils]: 7: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,522 INFO L273 TraceCheckUtils]: 9: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,523 INFO L273 TraceCheckUtils]: 18: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,523 INFO L273 TraceCheckUtils]: 19: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,523 INFO L273 TraceCheckUtils]: 21: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,523 INFO L273 TraceCheckUtils]: 22: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,523 INFO L273 TraceCheckUtils]: 23: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,523 INFO L273 TraceCheckUtils]: 24: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,524 INFO L273 TraceCheckUtils]: 25: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,524 INFO L273 TraceCheckUtils]: 26: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,524 INFO L273 TraceCheckUtils]: 27: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,524 INFO L273 TraceCheckUtils]: 28: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,524 INFO L273 TraceCheckUtils]: 29: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,524 INFO L273 TraceCheckUtils]: 30: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,524 INFO L273 TraceCheckUtils]: 31: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,524 INFO L273 TraceCheckUtils]: 33: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,524 INFO L273 TraceCheckUtils]: 34: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,525 INFO L273 TraceCheckUtils]: 35: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,525 INFO L273 TraceCheckUtils]: 36: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,525 INFO L273 TraceCheckUtils]: 37: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,525 INFO L273 TraceCheckUtils]: 38: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,525 INFO L273 TraceCheckUtils]: 39: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,525 INFO L273 TraceCheckUtils]: 40: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,525 INFO L273 TraceCheckUtils]: 41: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,525 INFO L273 TraceCheckUtils]: 42: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,525 INFO L273 TraceCheckUtils]: 43: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,526 INFO L273 TraceCheckUtils]: 44: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,526 INFO L273 TraceCheckUtils]: 45: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,526 INFO L273 TraceCheckUtils]: 46: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,526 INFO L273 TraceCheckUtils]: 47: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,526 INFO L273 TraceCheckUtils]: 48: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,526 INFO L273 TraceCheckUtils]: 49: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,526 INFO L273 TraceCheckUtils]: 50: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,526 INFO L273 TraceCheckUtils]: 51: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,526 INFO L273 TraceCheckUtils]: 52: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,526 INFO L273 TraceCheckUtils]: 53: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,527 INFO L273 TraceCheckUtils]: 54: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,527 INFO L273 TraceCheckUtils]: 55: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,527 INFO L273 TraceCheckUtils]: 56: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,527 INFO L273 TraceCheckUtils]: 57: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,527 INFO L273 TraceCheckUtils]: 58: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,527 INFO L273 TraceCheckUtils]: 59: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,527 INFO L273 TraceCheckUtils]: 60: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,527 INFO L273 TraceCheckUtils]: 61: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,527 INFO L273 TraceCheckUtils]: 62: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,527 INFO L273 TraceCheckUtils]: 63: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,528 INFO L273 TraceCheckUtils]: 64: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,528 INFO L273 TraceCheckUtils]: 65: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,528 INFO L273 TraceCheckUtils]: 66: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,528 INFO L273 TraceCheckUtils]: 67: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,528 INFO L273 TraceCheckUtils]: 68: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,528 INFO L273 TraceCheckUtils]: 69: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,528 INFO L273 TraceCheckUtils]: 70: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,528 INFO L273 TraceCheckUtils]: 71: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,528 INFO L273 TraceCheckUtils]: 72: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,528 INFO L273 TraceCheckUtils]: 73: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,529 INFO L273 TraceCheckUtils]: 74: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,529 INFO L273 TraceCheckUtils]: 75: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,529 INFO L273 TraceCheckUtils]: 76: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:09,529 INFO L273 TraceCheckUtils]: 77: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:09,529 INFO L273 TraceCheckUtils]: 78: Hoare triple {30287#true} assume !(~i~1 < 10000); {30287#true} is VALID [2018-11-23 12:30:09,529 INFO L256 TraceCheckUtils]: 79: Hoare triple {30287#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:30:09,529 INFO L273 TraceCheckUtils]: 80: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30287#true} is VALID [2018-11-23 12:30:09,529 INFO L273 TraceCheckUtils]: 81: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,529 INFO L273 TraceCheckUtils]: 82: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,529 INFO L273 TraceCheckUtils]: 83: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,530 INFO L273 TraceCheckUtils]: 84: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,530 INFO L273 TraceCheckUtils]: 85: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,530 INFO L273 TraceCheckUtils]: 86: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,530 INFO L273 TraceCheckUtils]: 87: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,530 INFO L273 TraceCheckUtils]: 88: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,530 INFO L273 TraceCheckUtils]: 89: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,530 INFO L273 TraceCheckUtils]: 90: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,530 INFO L273 TraceCheckUtils]: 91: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,530 INFO L273 TraceCheckUtils]: 92: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,530 INFO L273 TraceCheckUtils]: 93: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,531 INFO L273 TraceCheckUtils]: 94: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,531 INFO L273 TraceCheckUtils]: 95: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,531 INFO L273 TraceCheckUtils]: 96: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,531 INFO L273 TraceCheckUtils]: 97: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,531 INFO L273 TraceCheckUtils]: 98: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,531 INFO L273 TraceCheckUtils]: 99: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,531 INFO L273 TraceCheckUtils]: 100: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,531 INFO L273 TraceCheckUtils]: 101: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,531 INFO L273 TraceCheckUtils]: 102: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,531 INFO L273 TraceCheckUtils]: 103: Hoare triple {30287#true} assume !(~i~0 < 10000); {30287#true} is VALID [2018-11-23 12:30:09,532 INFO L273 TraceCheckUtils]: 104: Hoare triple {30287#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:30:09,532 INFO L273 TraceCheckUtils]: 105: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:09,532 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30287#true} {30287#true} #70#return; {30287#true} is VALID [2018-11-23 12:30:09,532 INFO L273 TraceCheckUtils]: 107: Hoare triple {30287#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); {30287#true} is VALID [2018-11-23 12:30:09,532 INFO L256 TraceCheckUtils]: 108: Hoare triple {30287#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:30:09,532 INFO L273 TraceCheckUtils]: 109: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30287#true} is VALID [2018-11-23 12:30:09,532 INFO L273 TraceCheckUtils]: 110: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,532 INFO L273 TraceCheckUtils]: 111: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,532 INFO L273 TraceCheckUtils]: 112: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,532 INFO L273 TraceCheckUtils]: 113: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,533 INFO L273 TraceCheckUtils]: 114: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,533 INFO L273 TraceCheckUtils]: 115: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,533 INFO L273 TraceCheckUtils]: 116: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,533 INFO L273 TraceCheckUtils]: 117: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,533 INFO L273 TraceCheckUtils]: 118: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,533 INFO L273 TraceCheckUtils]: 119: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,533 INFO L273 TraceCheckUtils]: 120: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,533 INFO L273 TraceCheckUtils]: 121: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,533 INFO L273 TraceCheckUtils]: 122: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,534 INFO L273 TraceCheckUtils]: 123: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,534 INFO L273 TraceCheckUtils]: 124: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,534 INFO L273 TraceCheckUtils]: 125: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,534 INFO L273 TraceCheckUtils]: 126: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,534 INFO L273 TraceCheckUtils]: 127: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,534 INFO L273 TraceCheckUtils]: 128: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,534 INFO L273 TraceCheckUtils]: 129: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,534 INFO L273 TraceCheckUtils]: 130: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:09,534 INFO L273 TraceCheckUtils]: 131: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:09,534 INFO L273 TraceCheckUtils]: 132: Hoare triple {30287#true} assume !(~i~0 < 10000); {30287#true} is VALID [2018-11-23 12:30:09,535 INFO L273 TraceCheckUtils]: 133: Hoare triple {30287#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:30:09,535 INFO L273 TraceCheckUtils]: 134: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:09,535 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30287#true} {30287#true} #72#return; {30287#true} is VALID [2018-11-23 12:30:09,535 INFO L273 TraceCheckUtils]: 136: Hoare triple {30287#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; {30287#true} is VALID [2018-11-23 12:30:09,535 INFO L273 TraceCheckUtils]: 137: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:09,535 INFO L273 TraceCheckUtils]: 138: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:09,535 INFO L273 TraceCheckUtils]: 139: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:09,535 INFO L273 TraceCheckUtils]: 140: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:09,535 INFO L273 TraceCheckUtils]: 141: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:09,535 INFO L273 TraceCheckUtils]: 142: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:09,536 INFO L273 TraceCheckUtils]: 143: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:09,536 INFO L273 TraceCheckUtils]: 144: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:09,536 INFO L273 TraceCheckUtils]: 145: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:09,536 INFO L273 TraceCheckUtils]: 146: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:09,536 INFO L273 TraceCheckUtils]: 147: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:09,536 INFO L273 TraceCheckUtils]: 148: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:09,536 INFO L273 TraceCheckUtils]: 149: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:09,536 INFO L273 TraceCheckUtils]: 150: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:09,536 INFO L273 TraceCheckUtils]: 151: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:09,536 INFO L273 TraceCheckUtils]: 152: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:09,537 INFO L273 TraceCheckUtils]: 153: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:09,537 INFO L273 TraceCheckUtils]: 154: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:09,537 INFO L273 TraceCheckUtils]: 155: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:09,537 INFO L273 TraceCheckUtils]: 156: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:09,537 INFO L273 TraceCheckUtils]: 157: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:09,537 INFO L273 TraceCheckUtils]: 158: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:09,537 INFO L273 TraceCheckUtils]: 159: Hoare triple {30287#true} assume !(~i~2 < 9999); {30287#true} is VALID [2018-11-23 12:30:09,537 INFO L273 TraceCheckUtils]: 160: Hoare triple {30287#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {30287#true} is VALID [2018-11-23 12:30:09,537 INFO L256 TraceCheckUtils]: 161: Hoare triple {30287#true} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:30:09,538 INFO L273 TraceCheckUtils]: 162: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30815#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:30:09,538 INFO L273 TraceCheckUtils]: 163: Hoare triple {30815#(<= mapavg_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30815#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:30:09,539 INFO L273 TraceCheckUtils]: 164: Hoare triple {30815#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30822#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:30:09,539 INFO L273 TraceCheckUtils]: 165: Hoare triple {30822#(<= mapavg_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30822#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:30:09,540 INFO L273 TraceCheckUtils]: 166: Hoare triple {30822#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30829#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:30:09,540 INFO L273 TraceCheckUtils]: 167: Hoare triple {30829#(<= mapavg_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30829#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:30:09,540 INFO L273 TraceCheckUtils]: 168: Hoare triple {30829#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30836#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:30:09,541 INFO L273 TraceCheckUtils]: 169: Hoare triple {30836#(<= mapavg_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30836#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:30:09,541 INFO L273 TraceCheckUtils]: 170: Hoare triple {30836#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30843#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:30:09,541 INFO L273 TraceCheckUtils]: 171: Hoare triple {30843#(<= mapavg_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30843#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:30:09,542 INFO L273 TraceCheckUtils]: 172: Hoare triple {30843#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30850#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:30:09,542 INFO L273 TraceCheckUtils]: 173: Hoare triple {30850#(<= mapavg_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30850#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:30:09,543 INFO L273 TraceCheckUtils]: 174: Hoare triple {30850#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30857#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:30:09,544 INFO L273 TraceCheckUtils]: 175: Hoare triple {30857#(<= mapavg_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30857#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:30:09,544 INFO L273 TraceCheckUtils]: 176: Hoare triple {30857#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30864#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:30:09,545 INFO L273 TraceCheckUtils]: 177: Hoare triple {30864#(<= mapavg_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30864#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:30:09,546 INFO L273 TraceCheckUtils]: 178: Hoare triple {30864#(<= mapavg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30871#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:30:09,546 INFO L273 TraceCheckUtils]: 179: Hoare triple {30871#(<= mapavg_~i~0 8)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30871#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:30:09,547 INFO L273 TraceCheckUtils]: 180: Hoare triple {30871#(<= mapavg_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30878#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:30:09,547 INFO L273 TraceCheckUtils]: 181: Hoare triple {30878#(<= mapavg_~i~0 9)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30878#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:30:09,548 INFO L273 TraceCheckUtils]: 182: Hoare triple {30878#(<= mapavg_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30885#(<= mapavg_~i~0 10)} is VALID [2018-11-23 12:30:09,549 INFO L273 TraceCheckUtils]: 183: Hoare triple {30885#(<= mapavg_~i~0 10)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30885#(<= mapavg_~i~0 10)} is VALID [2018-11-23 12:30:09,549 INFO L273 TraceCheckUtils]: 184: Hoare triple {30885#(<= mapavg_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30892#(<= mapavg_~i~0 11)} is VALID [2018-11-23 12:30:09,550 INFO L273 TraceCheckUtils]: 185: Hoare triple {30892#(<= mapavg_~i~0 11)} assume !(~i~0 < 10000); {30288#false} is VALID [2018-11-23 12:30:09,550 INFO L273 TraceCheckUtils]: 186: Hoare triple {30288#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10000 then 1 + ~ret~0 / 10000 else ~ret~0 / 10000) % 4294967296 - 4294967296); {30288#false} is VALID [2018-11-23 12:30:09,550 INFO L273 TraceCheckUtils]: 187: Hoare triple {30288#false} assume true; {30288#false} is VALID [2018-11-23 12:30:09,551 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30288#false} {30287#true} #74#return; {30288#false} is VALID [2018-11-23 12:30:09,551 INFO L273 TraceCheckUtils]: 189: Hoare triple {30288#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {30288#false} is VALID [2018-11-23 12:30:09,551 INFO L273 TraceCheckUtils]: 190: Hoare triple {30288#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {30288#false} is VALID [2018-11-23 12:30:09,551 INFO L273 TraceCheckUtils]: 191: Hoare triple {30288#false} assume !false; {30288#false} is VALID [2018-11-23 12:30:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 536 proven. 121 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2018-11-23 12:30:09,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:09,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2018-11-23 12:30:09,590 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:30:09,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:09,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 12:30:09,732 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:30:09,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 12:30:09,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 12:30:09,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:30:09,734 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2018-11-23 12:30:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:11,224 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2018-11-23 12:30:11,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 12:30:11,224 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:30:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:30:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:30:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:30:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:30:11,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 154 transitions. [2018-11-23 12:30:11,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:11,394 INFO L225 Difference]: With dead ends: 205 [2018-11-23 12:30:11,394 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 12:30:11,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:30:11,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 12:30:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-23 12:30:11,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:11,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-23 12:30:11,451 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-23 12:30:11,452 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-23 12:30:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:11,454 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:30:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:30:11,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:11,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:11,455 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-23 12:30:11,455 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-23 12:30:11,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:11,457 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:30:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:30:11,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:11,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:11,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:11,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 12:30:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-11-23 12:30:11,459 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2018-11-23 12:30:11,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:11,459 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-11-23 12:30:11,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 12:30:11,460 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:30:11,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-23 12:30:11,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:11,460 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:11,461 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:11,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:11,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1844433335, now seen corresponding path program 37 times [2018-11-23 12:30:11,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:11,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:11,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:11,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:11,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat