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/mapavg4_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:27:09,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:27:09,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:27:09,595 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:27:09,597 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:27:09,598 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:27:09,602 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:27:09,604 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:27:09,607 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:27:09,608 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:27:09,609 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:27:09,610 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:27:09,610 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:27:09,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:27:09,616 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:27:09,617 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:27:09,618 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:27:09,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:27:09,631 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:27:09,633 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:27:09,637 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:27:09,638 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:27:09,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:27:09,643 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:27:09,643 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:27:09,646 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:27:09,649 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:27:09,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:27:09,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:27:09,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:27:09,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:27:09,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:27:09,654 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:27:09,654 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:27:09,657 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:27:09,659 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:27:09,659 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:27:09,683 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:27:09,683 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:27:09,684 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:27:09,684 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:27:09,685 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:27:09,685 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:27:09,685 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:27:09,686 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:27:09,686 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:27:09,686 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:27:09,686 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:27:09,687 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:27:09,687 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:27:09,687 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:27:09,687 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:27:09,687 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:27:09,687 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:27:09,688 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:27:09,688 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:27:09,688 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:27:09,688 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:27:09,688 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:27:09,689 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:27:09,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:27:09,689 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:27:09,689 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:27:09,689 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:27:09,690 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:27:09,690 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:27:09,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:27:09,690 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:27:09,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:27:09,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:27:09,770 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:27:09,772 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:27:09,772 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:27:09,773 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapavg4_true-unreach-call.i [2018-11-23 12:27:09,840 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f18e9d2/4dc5727f08df4f42af2e2d039a02cc27/FLAGc6682b49b [2018-11-23 12:27:10,242 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:27:10,242 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapavg4_true-unreach-call.i [2018-11-23 12:27:10,249 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f18e9d2/4dc5727f08df4f42af2e2d039a02cc27/FLAGc6682b49b [2018-11-23 12:27:10,622 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f18e9d2/4dc5727f08df4f42af2e2d039a02cc27 [2018-11-23 12:27:10,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:27:10,633 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:27:10,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:27:10,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:27:10,639 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:27:10,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:27:10" (1/1) ... [2018-11-23 12:27:10,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12cdc62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:10, skipping insertion in model container [2018-11-23 12:27:10,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:27:10" (1/1) ... [2018-11-23 12:27:10,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:27:10,687 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:27:10,936 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:27:10,948 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:27:10,979 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:27:11,001 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:27:11,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:11 WrapperNode [2018-11-23 12:27:11,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:27:11,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:27:11,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:27:11,003 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:27:11,012 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:27:11" (1/1) ... [2018-11-23 12:27:11,021 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:27:11" (1/1) ... [2018-11-23 12:27:11,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:27:11,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:27:11,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:27:11,029 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:27:11,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:11" (1/1) ... [2018-11-23 12:27:11,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:11" (1/1) ... [2018-11-23 12:27:11,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:11" (1/1) ... [2018-11-23 12:27:11,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:11" (1/1) ... [2018-11-23 12:27:11,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:11" (1/1) ... [2018-11-23 12:27:11,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:11" (1/1) ... [2018-11-23 12:27:11,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:11" (1/1) ... [2018-11-23 12:27:11,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:27:11,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:27:11,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:27:11,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:27:11,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:11" (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:27:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:27:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:27:11,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:27:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:27:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:27:11,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:27:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:27:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:27:11,207 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:27:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure mapavg [2018-11-23 12:27:11,207 INFO L138 BoogieDeclarations]: Found implementation of procedure mapavg [2018-11-23 12:27:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:27:11,901 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:27:11,902 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:27:11,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:11 BoogieIcfgContainer [2018-11-23 12:27:11,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:27:11,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:27:11,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:27:11,908 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:27:11,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:27:10" (1/3) ... [2018-11-23 12:27:11,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8933278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:27:11, skipping insertion in model container [2018-11-23 12:27:11,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:11" (2/3) ... [2018-11-23 12:27:11,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8933278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:27:11, skipping insertion in model container [2018-11-23 12:27:11,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:11" (3/3) ... [2018-11-23 12:27:11,915 INFO L112 eAbstractionObserver]: Analyzing ICFG mapavg4_true-unreach-call.i [2018-11-23 12:27:11,926 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:27:11,937 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:27:11,957 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:27:11,994 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:27:11,995 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:27:11,995 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:27:11,995 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:27:11,997 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:27:11,997 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:27:11,997 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:27:11,997 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:27:11,997 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:27:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:27:12,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:27:12,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:12,024 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:12,026 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:12,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:12,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1234592251, now seen corresponding path program 1 times [2018-11-23 12:27:12,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:12,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:12,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:12,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:12,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:12,233 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:27:12,236 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:12,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:12,237 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 12:27:12,238 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret12 := main(); {34#true} is VALID [2018-11-23 12:27:12,238 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34#true} is VALID [2018-11-23 12:27:12,239 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:27:12,239 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:12,239 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:12,240 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !(~i~0 < 100000); {34#true} is VALID [2018-11-23 12:27:12,240 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:27:12,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:12,241 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {34#true} {35#false} #70#return; {35#false} is VALID [2018-11-23 12:27:12,241 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:12,242 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:12,242 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:12,242 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !(~i~0 < 100000); {34#true} is VALID [2018-11-23 12:27:12,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {34#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:27:12,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:12,244 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #72#return; {35#false} is VALID [2018-11-23 12:27:12,244 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:12,245 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:27:12,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:27:12,245 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:12,246 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:12,246 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !(~i~0 < 100000); {34#true} is VALID [2018-11-23 12:27:12,246 INFO L273 TraceCheckUtils]: 26: Hoare triple {34#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:27:12,247 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:12,247 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #74#return; {35#false} is VALID [2018-11-23 12:27:12,247 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:12,248 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:12,248 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:27:12,254 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:12,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:12,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:27:12,263 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:27:12,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:12,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:27:12,403 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:12,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:27:12,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:27:12,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:27:12,415 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:27:12,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:12,679 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 12:27:12,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:27:12,680 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:27:12,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:27:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:27:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:27:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:27:12,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 12:27:12,952 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:12,963 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:27:12,963 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:27:12,967 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:12,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:27:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:27:13,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:13,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:13,026 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:13,026 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:13,032 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:27:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:27:13,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:13,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:13,034 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:13,034 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:13,039 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:27:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:27:13,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:13,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:13,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:13,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:27:13,046 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 12:27:13,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:13,047 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:27:13,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:27:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:27:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:27:13,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:13,049 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:13,049 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:13,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:13,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1054720325, now seen corresponding path program 1 times [2018-11-23 12:27:13,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:13,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:13,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:13,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:13,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:13,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2018-11-23 12:27:13,135 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:13,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:13,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #66#return; {198#true} is VALID [2018-11-23 12:27:13,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret12 := main(); {198#true} is VALID [2018-11-23 12:27:13,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {198#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:13,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= main_~i~1 0)} assume !(~i~1 < 100000); {199#false} is VALID [2018-11-23 12:27:13,142 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:13,142 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:13,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#true} assume !(~i~0 < 100000); {198#true} is VALID [2018-11-23 12:27:13,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:27:13,143 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:13,143 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {198#true} {199#false} #70#return; {199#false} is VALID [2018-11-23 12:27:13,144 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:13,144 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:13,144 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:13,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#true} assume !(~i~0 < 100000); {198#true} is VALID [2018-11-23 12:27:13,145 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:27:13,145 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:13,145 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {198#true} {199#false} #72#return; {199#false} is VALID [2018-11-23 12:27:13,146 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:13,146 INFO L273 TraceCheckUtils]: 21: Hoare triple {199#false} assume !(~i~2 < 99999); {199#false} is VALID [2018-11-23 12:27:13,146 INFO L273 TraceCheckUtils]: 22: Hoare triple {199#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:27:13,147 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:13,147 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:13,147 INFO L273 TraceCheckUtils]: 25: Hoare triple {198#true} assume !(~i~0 < 100000); {198#true} is VALID [2018-11-23 12:27:13,148 INFO L273 TraceCheckUtils]: 26: Hoare triple {198#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:27:13,148 INFO L273 TraceCheckUtils]: 27: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:13,148 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {198#true} {199#false} #74#return; {199#false} is VALID [2018-11-23 12:27:13,149 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:13,149 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:13,149 INFO L273 TraceCheckUtils]: 31: Hoare triple {199#false} assume !false; {199#false} is VALID [2018-11-23 12:27:13,152 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:13,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:13,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:27:13,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:27:13,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:13,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:27:13,208 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:13,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:27:13,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:27:13,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:27:13,209 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 12:27:13,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:13,788 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:27:13,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:27:13,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:27:13,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:27:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:13,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:27:13,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:27:13,963 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:13,965 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:27:13,965 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:27:13,966 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:13,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:27:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:27:14,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:14,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:27:14,004 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:27:14,005 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:27:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:14,008 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:27:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:27:14,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:14,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:14,010 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:27:14,010 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:27:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:14,013 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:27:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:27:14,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:14,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:14,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:14,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:27:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:27:14,017 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:27:14,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:14,018 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:27:14,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:27:14,018 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:27:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:27:14,020 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:14,020 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:14,020 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:14,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:14,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1286970653, now seen corresponding path program 1 times [2018-11-23 12:27:14,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:14,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:14,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:14,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:14,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:14,188 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:27:14,189 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:14,189 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:14,190 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:27:14,190 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret12 := main(); {362#true} is VALID [2018-11-23 12:27:14,190 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:27:14,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 100000);assume -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:14,191 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:14,191 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 100000); {362#true} is VALID [2018-11-23 12:27:14,191 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:14,192 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:14,193 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= mapavg_~i~0 0)} assume !(~i~0 < 100000); {363#false} is VALID [2018-11-23 12:27:14,193 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:14,193 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:14,193 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:27:14,194 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:14,194 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:14,194 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:14,195 INFO L273 TraceCheckUtils]: 18: Hoare triple {362#true} assume !(~i~0 < 100000); {362#true} is VALID [2018-11-23 12:27:14,195 INFO L273 TraceCheckUtils]: 19: Hoare triple {362#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:27:14,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:14,196 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {362#true} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:27:14,196 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:14,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 99999); {363#false} is VALID [2018-11-23 12:27:14,197 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:27:14,197 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:14,197 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:14,198 INFO L273 TraceCheckUtils]: 27: Hoare triple {362#true} assume !(~i~0 < 100000); {362#true} is VALID [2018-11-23 12:27:14,198 INFO L273 TraceCheckUtils]: 28: Hoare triple {362#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:27:14,198 INFO L273 TraceCheckUtils]: 29: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:14,199 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {362#true} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:27:14,199 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:14,199 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:14,200 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:27:14,202 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:14,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:14,203 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:14,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:14,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:14,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:27:14,686 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:14,687 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:14,687 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:27:14,687 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret12 := main(); {362#true} is VALID [2018-11-23 12:27:14,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:27:14,688 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 100000);assume -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:14,688 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:14,688 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 100000); {362#true} is VALID [2018-11-23 12:27:14,689 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:14,692 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:14,696 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(<= mapavg_~i~0 0)} assume !(~i~0 < 100000); {363#false} is VALID [2018-11-23 12:27:14,696 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:14,697 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:14,697 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:27:14,697 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:14,697 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:14,698 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:14,698 INFO L273 TraceCheckUtils]: 18: Hoare triple {363#false} assume !(~i~0 < 100000); {363#false} is VALID [2018-11-23 12:27:14,698 INFO L273 TraceCheckUtils]: 19: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:14,699 INFO L273 TraceCheckUtils]: 20: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:14,699 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {363#false} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:27:14,699 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:14,699 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 99999); {363#false} is VALID [2018-11-23 12:27:14,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:27:14,700 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:14,700 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:14,700 INFO L273 TraceCheckUtils]: 27: Hoare triple {363#false} assume !(~i~0 < 100000); {363#false} is VALID [2018-11-23 12:27:14,701 INFO L273 TraceCheckUtils]: 28: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:14,701 INFO L273 TraceCheckUtils]: 29: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:14,701 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {363#false} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:27:14,702 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:14,702 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:14,702 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:27:14,705 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:14,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:27:14,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:27:14,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:27:14,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:14,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:27:14,868 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:14,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:27:14,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:27:14,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:14,869 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2018-11-23 12:27:15,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:15,148 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:27:15,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:27:15,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:27:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:27:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:27:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:27:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:27:15,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:27:15,277 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:15,280 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:27:15,280 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:27:15,281 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:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:27:15,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:27:15,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:15,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:27:15,299 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:27:15,299 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:27:15,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:15,303 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:27:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:27:15,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:15,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:15,304 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:27:15,305 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:27:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:15,307 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:27:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:27:15,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:15,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:15,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:15,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:27:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:27:15,311 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2018-11-23 12:27:15,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:15,312 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:27:15,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:27:15,312 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:27:15,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:27:15,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:15,314 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:15,314 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:15,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:15,315 INFO L82 PathProgramCache]: Analyzing trace with hash -631694085, now seen corresponding path program 1 times [2018-11-23 12:27:15,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:15,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:15,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:15,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:15,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:15,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-23 12:27:15,441 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:15,441 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:15,442 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #66#return; {630#true} is VALID [2018-11-23 12:27:15,442 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret12 := main(); {630#true} is VALID [2018-11-23 12:27:15,442 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {630#true} is VALID [2018-11-23 12:27:15,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {630#true} assume !!(~i~1 < 100000);assume -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:15,442 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:15,443 INFO L273 TraceCheckUtils]: 8: Hoare triple {630#true} assume !(~i~1 < 100000); {630#true} is VALID [2018-11-23 12:27:15,443 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:15,443 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:15,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {630#true} assume !!(~i~0 < 100000);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:15,444 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:15,444 INFO L273 TraceCheckUtils]: 13: Hoare triple {630#true} assume !(~i~0 < 100000); {630#true} is VALID [2018-11-23 12:27:15,444 INFO L273 TraceCheckUtils]: 14: Hoare triple {630#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:27:15,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:15,445 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {630#true} {630#true} #70#return; {630#true} is VALID [2018-11-23 12:27:15,445 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:15,445 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:15,446 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:15,446 INFO L273 TraceCheckUtils]: 20: Hoare triple {630#true} assume !!(~i~0 < 100000);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:15,446 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:15,447 INFO L273 TraceCheckUtils]: 22: Hoare triple {630#true} assume !(~i~0 < 100000); {630#true} is VALID [2018-11-23 12:27:15,447 INFO L273 TraceCheckUtils]: 23: Hoare triple {630#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:27:15,447 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:15,447 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {630#true} {630#true} #72#return; {630#true} is VALID [2018-11-23 12:27:15,455 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:15,456 INFO L273 TraceCheckUtils]: 27: Hoare triple {632#(= main_~i~2 0)} assume !(~i~2 < 99999); {631#false} is VALID [2018-11-23 12:27:15,456 INFO L273 TraceCheckUtils]: 28: Hoare triple {631#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {631#false} is VALID [2018-11-23 12:27:15,457 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:15,457 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:15,457 INFO L273 TraceCheckUtils]: 31: Hoare triple {630#true} assume !!(~i~0 < 100000);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:15,458 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:15,458 INFO L273 TraceCheckUtils]: 33: Hoare triple {630#true} assume !(~i~0 < 100000); {630#true} is VALID [2018-11-23 12:27:15,458 INFO L273 TraceCheckUtils]: 34: Hoare triple {630#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:27:15,458 INFO L273 TraceCheckUtils]: 35: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:15,459 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {630#true} {631#false} #74#return; {631#false} is VALID [2018-11-23 12:27:15,459 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:15,459 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:15,459 INFO L273 TraceCheckUtils]: 39: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-23 12:27:15,462 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:15,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:15,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:27:15,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:27:15,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:15,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:27:15,538 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:15,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:27:15,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:27:15,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:27:15,539 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 12:27:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:15,703 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:27:15,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:27:15,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:27:15,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:27:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:27:15,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 12:27:15,809 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:15,812 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:27:15,812 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:27:15,813 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:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:27:15,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:27:15,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:15,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:27:15,823 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:27:15,824 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:27:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:15,828 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:27:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:27:15,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:15,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:15,829 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:27:15,829 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:27:15,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:15,832 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:27:15,832 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:27:15,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:15,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:15,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:15,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:15,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:27:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:27:15,835 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2018-11-23 12:27:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:15,836 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:27:15,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:27:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:27:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:27:15,838 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:15,838 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:15,838 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:15,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:15,838 INFO L82 PathProgramCache]: Analyzing trace with hash -490156423, now seen corresponding path program 1 times [2018-11-23 12:27:15,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:15,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:15,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:15,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:15,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:15,950 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:27:15,950 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:15,951 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:15,951 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:27:15,951 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret12 := main(); {799#true} is VALID [2018-11-23 12:27:15,952 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:15,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:15,954 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:15,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 100000); {800#false} is VALID [2018-11-23 12:27:15,954 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:15,955 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:15,955 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#true} assume !!(~i~0 < 100000);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:15,955 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:15,955 INFO L273 TraceCheckUtils]: 13: Hoare triple {799#true} assume !(~i~0 < 100000); {799#true} is VALID [2018-11-23 12:27:15,956 INFO L273 TraceCheckUtils]: 14: Hoare triple {799#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:27:15,956 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:15,956 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {799#true} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:27:15,957 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:15,957 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:15,957 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:15,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {799#true} assume !!(~i~0 < 100000);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:15,958 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:15,959 INFO L273 TraceCheckUtils]: 22: Hoare triple {799#true} assume !(~i~0 < 100000); {799#true} is VALID [2018-11-23 12:27:15,959 INFO L273 TraceCheckUtils]: 23: Hoare triple {799#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:27:15,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:15,960 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {799#true} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:27:15,960 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:15,960 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:15,961 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:15,961 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 99999); {800#false} is VALID [2018-11-23 12:27:15,961 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:27:15,962 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:15,962 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:15,962 INFO L273 TraceCheckUtils]: 33: Hoare triple {799#true} assume !!(~i~0 < 100000);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:15,962 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:15,963 INFO L273 TraceCheckUtils]: 35: Hoare triple {799#true} assume !(~i~0 < 100000); {799#true} is VALID [2018-11-23 12:27:15,963 INFO L273 TraceCheckUtils]: 36: Hoare triple {799#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:27:15,963 INFO L273 TraceCheckUtils]: 37: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:15,963 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {799#true} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:27:15,964 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:15,964 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:15,964 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:27:15,967 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:15,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:15,968 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:15,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:16,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:16,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:27:16,497 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:16,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:16,498 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:27:16,498 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret12 := main(); {799#true} is VALID [2018-11-23 12:27:16,499 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:16,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:16,501 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:16,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 100000); {800#false} is VALID [2018-11-23 12:27:16,502 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:16,502 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:16,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {800#false} assume !!(~i~0 < 100000);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:16,502 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:16,503 INFO L273 TraceCheckUtils]: 13: Hoare triple {800#false} assume !(~i~0 < 100000); {800#false} is VALID [2018-11-23 12:27:16,503 INFO L273 TraceCheckUtils]: 14: Hoare triple {800#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:27:16,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:27:16,504 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#false} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:27:16,505 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:16,505 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:16,505 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:16,506 INFO L273 TraceCheckUtils]: 20: Hoare triple {800#false} assume !!(~i~0 < 100000);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:16,506 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:16,506 INFO L273 TraceCheckUtils]: 22: Hoare triple {800#false} assume !(~i~0 < 100000); {800#false} is VALID [2018-11-23 12:27:16,506 INFO L273 TraceCheckUtils]: 23: Hoare triple {800#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:27:16,507 INFO L273 TraceCheckUtils]: 24: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:27:16,507 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {800#false} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:27:16,507 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:16,507 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:16,508 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:16,508 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 99999); {800#false} is VALID [2018-11-23 12:27:16,508 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:27:16,508 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:16,508 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:16,509 INFO L273 TraceCheckUtils]: 33: Hoare triple {800#false} assume !!(~i~0 < 100000);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:16,509 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:16,509 INFO L273 TraceCheckUtils]: 35: Hoare triple {800#false} assume !(~i~0 < 100000); {800#false} is VALID [2018-11-23 12:27:16,509 INFO L273 TraceCheckUtils]: 36: Hoare triple {800#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:27:16,509 INFO L273 TraceCheckUtils]: 37: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:27:16,510 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {800#false} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:27:16,510 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:16,510 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:16,511 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:27:16,514 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:16,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:16,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:27:16,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:27:16,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:16,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:27:16,605 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:16,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:27:16,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:27:16,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:27:16,607 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2018-11-23 12:27:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:16,806 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:27:16,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:27:16,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:27:16,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:27:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:27:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:27:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:27:16,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-23 12:27:16,953 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:16,954 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:27:16,956 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:27:16,957 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:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:27:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:27:17,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:17,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:27:17,012 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:27:17,012 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:27:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:17,015 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:27:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:27:17,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:17,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:17,016 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:27:17,016 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:27:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:17,023 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:27:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:27:17,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:17,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:17,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:17,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:27:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:27:17,026 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2018-11-23 12:27:17,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:17,027 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:27:17,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:27:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:27:17,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:27:17,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:17,031 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:17,034 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:17,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:17,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1271601755, now seen corresponding path program 2 times [2018-11-23 12:27:17,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:17,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:17,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:17,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:17,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:17,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:27:17,325 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:17,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:17,325 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:27:17,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret12 := main(); {1114#true} is VALID [2018-11-23 12:27:17,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:17,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:17,329 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:17,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:17,331 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:17,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 100000); {1115#false} is VALID [2018-11-23 12:27:17,331 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:17,332 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:17,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {1114#true} assume !!(~i~0 < 100000);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:17,332 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:17,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {1114#true} assume !(~i~0 < 100000); {1114#true} is VALID [2018-11-23 12:27:17,333 INFO L273 TraceCheckUtils]: 16: Hoare triple {1114#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:27:17,333 INFO L273 TraceCheckUtils]: 17: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:17,334 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1114#true} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:27:17,334 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:17,334 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:17,334 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:17,334 INFO L273 TraceCheckUtils]: 22: Hoare triple {1114#true} assume !!(~i~0 < 100000);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:17,335 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:17,335 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#true} assume !(~i~0 < 100000); {1114#true} is VALID [2018-11-23 12:27:17,335 INFO L273 TraceCheckUtils]: 25: Hoare triple {1114#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:27:17,335 INFO L273 TraceCheckUtils]: 26: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:17,336 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1114#true} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:27:17,336 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:17,336 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:17,336 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:17,336 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 99999); {1115#false} is VALID [2018-11-23 12:27:17,337 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:27:17,337 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:17,337 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:17,337 INFO L273 TraceCheckUtils]: 35: Hoare triple {1114#true} assume !!(~i~0 < 100000);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:17,337 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:17,338 INFO L273 TraceCheckUtils]: 37: Hoare triple {1114#true} assume !(~i~0 < 100000); {1114#true} is VALID [2018-11-23 12:27:17,338 INFO L273 TraceCheckUtils]: 38: Hoare triple {1114#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:27:17,338 INFO L273 TraceCheckUtils]: 39: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:17,338 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1114#true} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:27:17,338 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:17,339 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:17,339 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:27:17,341 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:17,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:17,342 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:17,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:17,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:17,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:17,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:17,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:27:17,574 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:17,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:17,575 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:27:17,575 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret12 := main(); {1114#true} is VALID [2018-11-23 12:27:17,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:17,578 INFO L273 TraceCheckUtils]: 6: Hoare triple {1137#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:17,578 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:17,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:17,581 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:17,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 100000); {1115#false} is VALID [2018-11-23 12:27:17,581 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:17,582 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:17,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {1115#false} assume !!(~i~0 < 100000);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:17,582 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:17,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {1115#false} assume !(~i~0 < 100000); {1115#false} is VALID [2018-11-23 12:27:17,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {1115#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:27:17,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:27:17,584 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1115#false} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:27:17,584 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:17,584 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:17,585 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:17,585 INFO L273 TraceCheckUtils]: 22: Hoare triple {1115#false} assume !!(~i~0 < 100000);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:17,585 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:17,586 INFO L273 TraceCheckUtils]: 24: Hoare triple {1115#false} assume !(~i~0 < 100000); {1115#false} is VALID [2018-11-23 12:27:17,586 INFO L273 TraceCheckUtils]: 25: Hoare triple {1115#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:27:17,586 INFO L273 TraceCheckUtils]: 26: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:27:17,587 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1115#false} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:27:17,587 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:17,587 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:17,587 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:17,587 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 99999); {1115#false} is VALID [2018-11-23 12:27:17,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:27:17,588 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:17,588 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:17,588 INFO L273 TraceCheckUtils]: 35: Hoare triple {1115#false} assume !!(~i~0 < 100000);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:17,588 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:17,589 INFO L273 TraceCheckUtils]: 37: Hoare triple {1115#false} assume !(~i~0 < 100000); {1115#false} is VALID [2018-11-23 12:27:17,589 INFO L273 TraceCheckUtils]: 38: Hoare triple {1115#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:27:17,589 INFO L273 TraceCheckUtils]: 39: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:27:17,589 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1115#false} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:27:17,590 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:17,590 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:17,590 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:27:17,592 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:17,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:17,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:27:17,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:27:17,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:17,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:27:17,683 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:17,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:27:17,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:27:17,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:27:17,684 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-23 12:27:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:17,917 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 12:27:17,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:27:17,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:27:17,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:27:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:27:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:27:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:27:17,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:27:18,031 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:18,033 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:27:18,033 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:27:18,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:27:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:27:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:27:18,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:18,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:27:18,117 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:27:18,117 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:27:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:18,119 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:27:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:27:18,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:18,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:18,120 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:27:18,120 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:27:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:18,122 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:27:18,122 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:27:18,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:18,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:18,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:18,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:27:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:27:18,125 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2018-11-23 12:27:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:18,125 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:27:18,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:27:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:27:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:27:18,127 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:18,127 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:18,127 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:18,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:18,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2104096189, now seen corresponding path program 3 times [2018-11-23 12:27:18,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:18,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:18,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:18,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:18,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:18,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:27:18,240 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:18,241 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:18,241 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:27:18,241 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret12 := main(); {1446#true} is VALID [2018-11-23 12:27:18,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:18,243 INFO L273 TraceCheckUtils]: 6: Hoare triple {1448#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:18,245 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:18,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {1449#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:18,247 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:18,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {1450#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:18,249 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:18,249 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#(<= main_~i~1 3)} assume !(~i~1 < 100000); {1447#false} is VALID [2018-11-23 12:27:18,250 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:18,250 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:18,250 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 100000);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:18,251 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:18,251 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 100000); {1446#true} is VALID [2018-11-23 12:27:18,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:18,251 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:18,252 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1447#false} #70#return; {1447#false} is VALID [2018-11-23 12:27:18,252 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:18,252 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:18,252 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:18,253 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 100000);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:18,253 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:18,253 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 100000); {1446#true} is VALID [2018-11-23 12:27:18,254 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:18,254 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:18,254 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1447#false} #72#return; {1447#false} is VALID [2018-11-23 12:27:18,254 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:18,255 INFO L273 TraceCheckUtils]: 31: Hoare triple {1447#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:18,255 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:18,255 INFO L273 TraceCheckUtils]: 33: Hoare triple {1447#false} assume !(~i~2 < 99999); {1447#false} is VALID [2018-11-23 12:27:18,255 INFO L273 TraceCheckUtils]: 34: Hoare triple {1447#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:27:18,256 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:18,256 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:18,256 INFO L273 TraceCheckUtils]: 37: Hoare triple {1446#true} assume !!(~i~0 < 100000);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:18,256 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:18,257 INFO L273 TraceCheckUtils]: 39: Hoare triple {1446#true} assume !(~i~0 < 100000); {1446#true} is VALID [2018-11-23 12:27:18,257 INFO L273 TraceCheckUtils]: 40: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:18,257 INFO L273 TraceCheckUtils]: 41: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:18,257 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1446#true} {1447#false} #74#return; {1447#false} is VALID [2018-11-23 12:27:18,258 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:18,258 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:18,258 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:27:18,261 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:18,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:18,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:18,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:18,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:27:18,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:18,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:18,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:27:18,933 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:18,933 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:18,934 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:27:18,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret12 := main(); {1446#true} is VALID [2018-11-23 12:27:18,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1446#true} is VALID [2018-11-23 12:27:18,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {1446#true} assume !!(~i~1 < 100000);assume -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:18,934 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:18,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {1446#true} assume !!(~i~1 < 100000);assume -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:18,935 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:18,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {1446#true} assume !!(~i~1 < 100000);assume -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:18,935 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:18,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {1446#true} assume !(~i~1 < 100000); {1446#true} is VALID [2018-11-23 12:27:18,935 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:18,936 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:18,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 100000);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:18,936 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:18,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 100000); {1446#true} is VALID [2018-11-23 12:27:18,936 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:18,936 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:18,937 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1446#true} #70#return; {1446#true} is VALID [2018-11-23 12:27:18,937 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:18,937 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:18,937 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:18,937 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 100000);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:18,938 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:18,938 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 100000); {1446#true} is VALID [2018-11-23 12:27:18,938 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:18,938 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:18,938 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1446#true} #72#return; {1446#true} is VALID [2018-11-23 12:27:18,938 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:18,939 INFO L273 TraceCheckUtils]: 31: Hoare triple {1446#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:18,939 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:18,939 INFO L273 TraceCheckUtils]: 33: Hoare triple {1446#true} assume !(~i~2 < 99999); {1446#true} is VALID [2018-11-23 12:27:18,939 INFO L273 TraceCheckUtils]: 34: Hoare triple {1446#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:27:18,939 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:18,940 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:18,940 INFO L273 TraceCheckUtils]: 37: Hoare triple {1563#(<= mapavg_~i~0 0)} assume !!(~i~0 < 100000);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:18,941 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:18,942 INFO L273 TraceCheckUtils]: 39: Hoare triple {1570#(<= mapavg_~i~0 1)} assume !(~i~0 < 100000); {1447#false} is VALID [2018-11-23 12:27:18,942 INFO L273 TraceCheckUtils]: 40: Hoare triple {1447#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1447#false} is VALID [2018-11-23 12:27:18,942 INFO L273 TraceCheckUtils]: 41: Hoare triple {1447#false} assume true; {1447#false} is VALID [2018-11-23 12:27:18,943 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1447#false} {1446#true} #74#return; {1447#false} is VALID [2018-11-23 12:27:18,943 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:18,943 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:18,943 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:27:18,946 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:18,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:18,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:27:18,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:27:18,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:18,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:27:19,087 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:19,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:27:19,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:27:19,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:19,089 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-23 12:27:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:19,479 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 12:27:19,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:27:19,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:27:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:27:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:27:19,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2018-11-23 12:27:19,684 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:19,687 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:27:19,687 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:27:19,688 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:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:27:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:27:19,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:19,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:27:19,709 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:27:19,709 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:27:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:19,712 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:27:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:27:19,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:19,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:19,713 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:27:19,713 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:27:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:19,716 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:27:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:27:19,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:19,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:19,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:19,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:27:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:27:19,719 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2018-11-23 12:27:19,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:19,719 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:27:19,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:27:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:27:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:27:19,720 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:19,720 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:19,721 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:19,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:19,721 INFO L82 PathProgramCache]: Analyzing trace with hash 780809725, now seen corresponding path program 4 times [2018-11-23 12:27:19,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:19,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:19,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:19,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:19,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:19,997 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:27:19,998 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:19,998 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:19,998 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:27:19,999 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 12:27:19,999 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:20,018 INFO L273 TraceCheckUtils]: 6: Hoare triple {1811#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:20,032 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:20,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:20,055 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:20,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:20,079 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:20,080 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:20,081 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:20,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 100000); {1810#false} is VALID [2018-11-23 12:27:20,085 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:20,085 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:20,085 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#true} assume !!(~i~0 < 100000);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:20,085 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:20,086 INFO L273 TraceCheckUtils]: 19: Hoare triple {1809#true} assume !!(~i~0 < 100000);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:20,086 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:20,086 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} assume !(~i~0 < 100000); {1809#true} is VALID [2018-11-23 12:27:20,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {1809#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:27:20,086 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:20,087 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1809#true} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:27:20,087 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:20,087 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:20,088 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:20,088 INFO L273 TraceCheckUtils]: 28: Hoare triple {1809#true} assume !!(~i~0 < 100000);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:20,088 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:20,088 INFO L273 TraceCheckUtils]: 30: Hoare triple {1809#true} assume !!(~i~0 < 100000);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:20,088 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:20,089 INFO L273 TraceCheckUtils]: 32: Hoare triple {1809#true} assume !(~i~0 < 100000); {1809#true} is VALID [2018-11-23 12:27:20,089 INFO L273 TraceCheckUtils]: 33: Hoare triple {1809#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:27:20,089 INFO L273 TraceCheckUtils]: 34: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:20,089 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1809#true} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:27:20,090 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:20,090 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,090 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:20,090 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 99999); {1810#false} is VALID [2018-11-23 12:27:20,091 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:27:20,091 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:20,091 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:20,091 INFO L273 TraceCheckUtils]: 43: Hoare triple {1809#true} assume !!(~i~0 < 100000);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:20,092 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:20,092 INFO L273 TraceCheckUtils]: 45: Hoare triple {1809#true} assume !!(~i~0 < 100000);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:20,092 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:20,092 INFO L273 TraceCheckUtils]: 47: Hoare triple {1809#true} assume !(~i~0 < 100000); {1809#true} is VALID [2018-11-23 12:27:20,093 INFO L273 TraceCheckUtils]: 48: Hoare triple {1809#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:27:20,093 INFO L273 TraceCheckUtils]: 49: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:20,093 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1809#true} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:27:20,093 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:20,093 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:20,093 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:27:20,097 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:20,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:20,097 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:20,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:20,159 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:20,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:20,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:20,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:27:20,463 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:20,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:20,464 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:27:20,464 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 12:27:20,466 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:20,466 INFO L273 TraceCheckUtils]: 6: Hoare triple {1834#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:20,467 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:20,467 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:20,468 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:20,468 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:20,469 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:20,469 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:20,475 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:20,475 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 100000); {1810#false} is VALID [2018-11-23 12:27:20,475 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:20,476 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:20,476 INFO L273 TraceCheckUtils]: 17: Hoare triple {1810#false} assume !!(~i~0 < 100000);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:20,476 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:20,476 INFO L273 TraceCheckUtils]: 19: Hoare triple {1810#false} assume !!(~i~0 < 100000);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:20,476 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:20,477 INFO L273 TraceCheckUtils]: 21: Hoare triple {1810#false} assume !(~i~0 < 100000); {1810#false} is VALID [2018-11-23 12:27:20,477 INFO L273 TraceCheckUtils]: 22: Hoare triple {1810#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:27:20,477 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:27:20,477 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1810#false} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:27:20,478 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:20,478 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:20,478 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:20,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {1810#false} assume !!(~i~0 < 100000);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:20,479 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:20,479 INFO L273 TraceCheckUtils]: 30: Hoare triple {1810#false} assume !!(~i~0 < 100000);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:20,479 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:20,479 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} assume !(~i~0 < 100000); {1810#false} is VALID [2018-11-23 12:27:20,480 INFO L273 TraceCheckUtils]: 33: Hoare triple {1810#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:27:20,480 INFO L273 TraceCheckUtils]: 34: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:27:20,480 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1810#false} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:27:20,480 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:20,481 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,481 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:20,481 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 99999); {1810#false} is VALID [2018-11-23 12:27:20,481 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:27:20,482 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:20,482 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:20,482 INFO L273 TraceCheckUtils]: 43: Hoare triple {1810#false} assume !!(~i~0 < 100000);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:20,482 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:20,482 INFO L273 TraceCheckUtils]: 45: Hoare triple {1810#false} assume !!(~i~0 < 100000);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:20,483 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:20,483 INFO L273 TraceCheckUtils]: 47: Hoare triple {1810#false} assume !(~i~0 < 100000); {1810#false} is VALID [2018-11-23 12:27:20,483 INFO L273 TraceCheckUtils]: 48: Hoare triple {1810#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:27:20,483 INFO L273 TraceCheckUtils]: 49: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:27:20,483 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1810#false} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:27:20,483 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:20,484 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:20,484 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:27:20,487 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:20,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:20,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:27:20,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:27:20,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:20,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:27:20,562 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:20,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:27:20,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:27:20,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:20,564 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 12:27:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:20,910 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:27:20,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:27:20,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:27:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:27:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:27:20,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2018-11-23 12:27:21,042 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:21,044 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:27:21,044 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:27:21,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:21,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:27:21,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:27:21,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:21,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:27:21,067 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:27:21,067 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:27:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:21,069 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:27:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:27:21,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:21,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:21,070 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:27:21,070 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:27:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:21,072 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:27:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:27:21,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:21,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:21,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:21,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:27:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:27:21,074 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2018-11-23 12:27:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:21,075 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:27:21,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:27:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:27:21,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:27:21,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:21,076 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:21,076 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:21,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:21,076 INFO L82 PathProgramCache]: Analyzing trace with hash 387956447, now seen corresponding path program 5 times [2018-11-23 12:27:21,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:21,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:21,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:21,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:21,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:21,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:27:21,312 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:21,312 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:21,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:27:21,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret12 := main(); {2206#true} is VALID [2018-11-23 12:27:21,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:21,317 INFO L273 TraceCheckUtils]: 6: Hoare triple {2208#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:21,318 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:21,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {2209#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:21,319 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:21,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {2210#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:21,320 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:21,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {2211#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:21,346 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:21,361 INFO L273 TraceCheckUtils]: 14: Hoare triple {2212#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:21,369 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:21,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {2213#(<= main_~i~1 5)} assume !(~i~1 < 100000); {2207#false} is VALID [2018-11-23 12:27:21,383 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:21,383 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:21,383 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#true} assume !!(~i~0 < 100000);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:21,383 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:21,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {2206#true} assume !!(~i~0 < 100000);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:21,384 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:21,384 INFO L273 TraceCheckUtils]: 23: Hoare triple {2206#true} assume !(~i~0 < 100000); {2206#true} is VALID [2018-11-23 12:27:21,384 INFO L273 TraceCheckUtils]: 24: Hoare triple {2206#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:27:21,384 INFO L273 TraceCheckUtils]: 25: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:21,384 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2206#true} {2207#false} #70#return; {2207#false} is VALID [2018-11-23 12:27:21,384 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:21,384 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:21,385 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:21,385 INFO L273 TraceCheckUtils]: 30: Hoare triple {2206#true} assume !!(~i~0 < 100000);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:21,385 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:21,385 INFO L273 TraceCheckUtils]: 32: Hoare triple {2206#true} assume !!(~i~0 < 100000);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:21,385 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:21,385 INFO L273 TraceCheckUtils]: 34: Hoare triple {2206#true} assume !(~i~0 < 100000); {2206#true} is VALID [2018-11-23 12:27:21,385 INFO L273 TraceCheckUtils]: 35: Hoare triple {2206#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:27:21,386 INFO L273 TraceCheckUtils]: 36: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:21,386 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2206#true} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:27:21,386 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:21,386 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:21,386 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:21,386 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 99999); {2207#false} is VALID [2018-11-23 12:27:21,386 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:27:21,386 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:21,387 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:21,387 INFO L273 TraceCheckUtils]: 45: Hoare triple {2206#true} assume !!(~i~0 < 100000);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:21,387 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:21,387 INFO L273 TraceCheckUtils]: 47: Hoare triple {2206#true} assume !!(~i~0 < 100000);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:21,387 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:21,387 INFO L273 TraceCheckUtils]: 49: Hoare triple {2206#true} assume !(~i~0 < 100000); {2206#true} is VALID [2018-11-23 12:27:21,387 INFO L273 TraceCheckUtils]: 50: Hoare triple {2206#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:27:21,388 INFO L273 TraceCheckUtils]: 51: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:21,388 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2206#true} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:27:21,388 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:21,388 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:21,388 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:27:21,390 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:21,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:21,390 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:21,399 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:21,455 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:27:21,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:21,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:21,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:27:21,613 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:21,614 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:21,614 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:27:21,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret12 := main(); {2206#true} is VALID [2018-11-23 12:27:21,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2206#true} is VALID [2018-11-23 12:27:21,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {2206#true} assume !!(~i~1 < 100000);assume -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:21,614 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:21,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {2206#true} assume !!(~i~1 < 100000);assume -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:21,614 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:21,615 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#true} assume !!(~i~1 < 100000);assume -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:21,615 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:21,615 INFO L273 TraceCheckUtils]: 12: Hoare triple {2206#true} assume !!(~i~1 < 100000);assume -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:21,615 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:21,615 INFO L273 TraceCheckUtils]: 14: Hoare triple {2206#true} assume !!(~i~1 < 100000);assume -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:21,615 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:21,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {2206#true} assume !(~i~1 < 100000); {2206#true} is VALID [2018-11-23 12:27:21,616 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:21,616 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:21,616 INFO L273 TraceCheckUtils]: 19: Hoare triple {2271#(<= mapavg_~i~0 0)} assume !!(~i~0 < 100000);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:21,617 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:21,617 INFO L273 TraceCheckUtils]: 21: Hoare triple {2278#(<= mapavg_~i~0 1)} assume !!(~i~0 < 100000);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:21,618 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:21,618 INFO L273 TraceCheckUtils]: 23: Hoare triple {2285#(<= mapavg_~i~0 2)} assume !(~i~0 < 100000); {2207#false} is VALID [2018-11-23 12:27:21,618 INFO L273 TraceCheckUtils]: 24: Hoare triple {2207#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:27:21,618 INFO L273 TraceCheckUtils]: 25: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:27:21,619 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2207#false} {2206#true} #70#return; {2207#false} is VALID [2018-11-23 12:27:21,619 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:21,619 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:21,619 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:21,620 INFO L273 TraceCheckUtils]: 30: Hoare triple {2207#false} assume !!(~i~0 < 100000);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:21,620 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:21,620 INFO L273 TraceCheckUtils]: 32: Hoare triple {2207#false} assume !!(~i~0 < 100000);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:21,620 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:21,620 INFO L273 TraceCheckUtils]: 34: Hoare triple {2207#false} assume !(~i~0 < 100000); {2207#false} is VALID [2018-11-23 12:27:21,621 INFO L273 TraceCheckUtils]: 35: Hoare triple {2207#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:27:21,621 INFO L273 TraceCheckUtils]: 36: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:27:21,621 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2207#false} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:27:21,621 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:21,622 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:21,622 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:21,622 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 99999); {2207#false} is VALID [2018-11-23 12:27:21,622 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:27:21,622 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:21,623 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:21,623 INFO L273 TraceCheckUtils]: 45: Hoare triple {2207#false} assume !!(~i~0 < 100000);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:21,623 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:21,623 INFO L273 TraceCheckUtils]: 47: Hoare triple {2207#false} assume !!(~i~0 < 100000);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:21,623 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:21,623 INFO L273 TraceCheckUtils]: 49: Hoare triple {2207#false} assume !(~i~0 < 100000); {2207#false} is VALID [2018-11-23 12:27:21,624 INFO L273 TraceCheckUtils]: 50: Hoare triple {2207#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:27:21,624 INFO L273 TraceCheckUtils]: 51: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:27:21,624 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2207#false} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:27:21,624 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:21,624 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:21,625 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:27:21,627 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:21,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:21,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 12:27:21,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:27:21,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:21,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:21,778 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:21,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:21,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:21,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:21,779 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-11-23 12:27:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:22,361 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-23 12:27:22,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:22,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:27:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:22,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:27:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:27:22,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 12:27:22,455 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:22,457 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:27:22,458 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:27:22,459 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:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:27:22,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 12:27:22,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:22,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 12:27:22,497 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 12:27:22,497 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 12:27:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:22,499 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:27:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:27:22,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:22,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:22,500 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 12:27:22,500 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 12:27:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:22,502 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:27:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:27:22,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:22,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:22,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:22,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:27:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 12:27:22,505 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2018-11-23 12:27:22,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:22,505 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 12:27:22,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:22,505 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:27:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:27:22,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:22,506 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:22,506 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:22,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:22,507 INFO L82 PathProgramCache]: Analyzing trace with hash -482079969, now seen corresponding path program 6 times [2018-11-23 12:27:22,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:22,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:22,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:22,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:22,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:22,798 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:27:22,798 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:22,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:22,799 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:27:22,799 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret12 := main(); {2635#true} is VALID [2018-11-23 12:27:22,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:22,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {2637#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:22,805 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:22,805 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:22,808 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:22,808 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:22,810 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:22,810 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:22,812 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:22,812 INFO L273 TraceCheckUtils]: 14: Hoare triple {2641#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:22,814 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:22,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {2642#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:22,816 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:22,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {2643#(<= main_~i~1 6)} assume !(~i~1 < 100000); {2636#false} is VALID [2018-11-23 12:27:22,816 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:22,816 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:22,817 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 100000);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:22,817 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:22,817 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 100000);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:22,817 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:22,817 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 100000);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:22,817 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:22,818 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 100000); {2635#true} is VALID [2018-11-23 12:27:22,818 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:22,818 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:22,818 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2636#false} #70#return; {2636#false} is VALID [2018-11-23 12:27:22,818 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:22,818 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:22,819 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:22,819 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 100000);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:22,819 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:22,819 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 100000);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:22,819 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:22,819 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 100000);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:22,819 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:22,819 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 100000); {2635#true} is VALID [2018-11-23 12:27:22,820 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:22,820 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:22,820 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2636#false} #72#return; {2636#false} is VALID [2018-11-23 12:27:22,820 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:22,820 INFO L273 TraceCheckUtils]: 45: Hoare triple {2636#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:22,820 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:22,820 INFO L273 TraceCheckUtils]: 47: Hoare triple {2636#false} assume !(~i~2 < 99999); {2636#false} is VALID [2018-11-23 12:27:22,820 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:27:22,821 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:22,821 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:22,821 INFO L273 TraceCheckUtils]: 51: Hoare triple {2635#true} assume !!(~i~0 < 100000);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:22,821 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:22,821 INFO L273 TraceCheckUtils]: 53: Hoare triple {2635#true} assume !!(~i~0 < 100000);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:22,821 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:22,821 INFO L273 TraceCheckUtils]: 55: Hoare triple {2635#true} assume !!(~i~0 < 100000);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:22,821 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:22,822 INFO L273 TraceCheckUtils]: 57: Hoare triple {2635#true} assume !(~i~0 < 100000); {2635#true} is VALID [2018-11-23 12:27:22,822 INFO L273 TraceCheckUtils]: 58: Hoare triple {2635#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:22,822 INFO L273 TraceCheckUtils]: 59: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:22,822 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2635#true} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:27:22,822 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:22,822 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:22,822 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:27:22,824 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:22,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:22,825 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:22,834 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:22,904 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:27:22,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:22,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:23,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:27:23,232 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:23,232 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:23,232 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:27:23,233 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret12 := main(); {2635#true} is VALID [2018-11-23 12:27:23,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2635#true} is VALID [2018-11-23 12:27:23,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -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:23,233 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:23,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -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:23,234 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:23,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -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:23,234 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:23,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -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:23,234 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:23,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -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:23,235 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:23,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -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:23,235 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:23,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {2635#true} assume !(~i~1 < 100000); {2635#true} is VALID [2018-11-23 12:27:23,235 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:23,235 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:23,236 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 100000);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:23,236 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:23,236 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 100000);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:23,236 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:23,236 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 100000);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:23,237 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:23,237 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 100000); {2635#true} is VALID [2018-11-23 12:27:23,237 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:23,237 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:23,237 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2635#true} #70#return; {2635#true} is VALID [2018-11-23 12:27:23,237 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:23,238 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:23,238 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:23,238 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 100000);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:23,238 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:23,238 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 100000);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:23,238 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:23,238 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 100000);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:23,239 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:23,239 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 100000); {2635#true} is VALID [2018-11-23 12:27:23,239 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:23,239 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:23,239 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2635#true} #72#return; {2635#true} is VALID [2018-11-23 12:27:23,240 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:23,241 INFO L273 TraceCheckUtils]: 45: Hoare triple {2779#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:23,241 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:23,243 INFO L273 TraceCheckUtils]: 47: Hoare triple {2786#(<= main_~i~2 1)} assume !(~i~2 < 99999); {2636#false} is VALID [2018-11-23 12:27:23,243 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:27:23,243 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:23,243 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:23,243 INFO L273 TraceCheckUtils]: 51: Hoare triple {2636#false} assume !!(~i~0 < 100000);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:23,243 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:23,243 INFO L273 TraceCheckUtils]: 53: Hoare triple {2636#false} assume !!(~i~0 < 100000);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:23,244 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:23,244 INFO L273 TraceCheckUtils]: 55: Hoare triple {2636#false} assume !!(~i~0 < 100000);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:23,244 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:23,244 INFO L273 TraceCheckUtils]: 57: Hoare triple {2636#false} assume !(~i~0 < 100000); {2636#false} is VALID [2018-11-23 12:27:23,244 INFO L273 TraceCheckUtils]: 58: Hoare triple {2636#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {2636#false} is VALID [2018-11-23 12:27:23,245 INFO L273 TraceCheckUtils]: 59: Hoare triple {2636#false} assume true; {2636#false} is VALID [2018-11-23 12:27:23,245 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2636#false} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:27:23,245 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:23,245 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:23,245 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:27:23,248 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:23,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:23,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:27:23,280 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:27:23,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:23,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:23,414 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:23,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:23,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:23,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:23,415 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-11-23 12:27:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:23,712 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:27:23,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:23,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:27:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:27:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:23,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:27:23,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:27:23,816 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:23,817 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:27:23,818 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:27:23,818 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:23,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:27:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:27:23,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:23,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:27:23,839 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:27:23,839 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:27:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:23,842 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:27:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:23,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:23,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:23,842 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:27:23,843 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:27:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:23,844 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:27:23,844 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:23,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:23,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:23,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:23,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:27:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 12:27:23,847 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2018-11-23 12:27:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:23,847 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 12:27:23,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:27:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:27:23,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:23,848 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:23,848 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:23,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:23,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1276959103, now seen corresponding path program 7 times [2018-11-23 12:27:23,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:23,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:23,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:23,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:23,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:24,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:27:24,134 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:24,134 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:24,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:27:24,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret12 := main(); {3111#true} is VALID [2018-11-23 12:27:24,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:24,136 INFO L273 TraceCheckUtils]: 6: Hoare triple {3113#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:24,137 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:24,137 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:24,138 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:24,139 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:24,139 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:24,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:24,141 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:24,141 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:24,142 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:24,143 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:24,143 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:24,144 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:24,145 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:24,145 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 100000); {3112#false} is VALID [2018-11-23 12:27:24,146 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:24,146 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:24,146 INFO L273 TraceCheckUtils]: 23: Hoare triple {3111#true} assume !!(~i~0 < 100000);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:24,146 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:24,147 INFO L273 TraceCheckUtils]: 25: Hoare triple {3111#true} assume !!(~i~0 < 100000);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:24,147 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:24,147 INFO L273 TraceCheckUtils]: 27: Hoare triple {3111#true} assume !!(~i~0 < 100000);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:24,147 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:24,147 INFO L273 TraceCheckUtils]: 29: Hoare triple {3111#true} assume !(~i~0 < 100000); {3111#true} is VALID [2018-11-23 12:27:24,148 INFO L273 TraceCheckUtils]: 30: Hoare triple {3111#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:27:24,148 INFO L273 TraceCheckUtils]: 31: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:24,148 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3111#true} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:27:24,148 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:24,148 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:24,149 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:24,149 INFO L273 TraceCheckUtils]: 36: Hoare triple {3111#true} assume !!(~i~0 < 100000);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:24,149 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:24,149 INFO L273 TraceCheckUtils]: 38: Hoare triple {3111#true} assume !!(~i~0 < 100000);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:24,150 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:24,150 INFO L273 TraceCheckUtils]: 40: Hoare triple {3111#true} assume !!(~i~0 < 100000);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:24,150 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:24,150 INFO L273 TraceCheckUtils]: 42: Hoare triple {3111#true} assume !(~i~0 < 100000); {3111#true} is VALID [2018-11-23 12:27:24,150 INFO L273 TraceCheckUtils]: 43: Hoare triple {3111#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:27:24,151 INFO L273 TraceCheckUtils]: 44: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:24,151 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3111#true} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:27:24,151 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:24,151 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:24,151 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:24,151 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:24,151 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:24,151 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 99999); {3112#false} is VALID [2018-11-23 12:27:24,152 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:27:24,152 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:24,152 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:24,152 INFO L273 TraceCheckUtils]: 55: Hoare triple {3111#true} assume !!(~i~0 < 100000);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:24,152 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:24,152 INFO L273 TraceCheckUtils]: 57: Hoare triple {3111#true} assume !!(~i~0 < 100000);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:24,152 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:24,152 INFO L273 TraceCheckUtils]: 59: Hoare triple {3111#true} assume !!(~i~0 < 100000);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:24,153 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:24,153 INFO L273 TraceCheckUtils]: 61: Hoare triple {3111#true} assume !(~i~0 < 100000); {3111#true} is VALID [2018-11-23 12:27:24,153 INFO L273 TraceCheckUtils]: 62: Hoare triple {3111#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:27:24,153 INFO L273 TraceCheckUtils]: 63: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:24,153 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3111#true} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:27:24,153 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:24,153 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:24,153 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:27:24,156 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:24,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:24,156 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:24,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:24,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:24,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:27:24,340 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:24,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:24,340 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:27:24,340 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret12 := main(); {3111#true} is VALID [2018-11-23 12:27:24,359 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:24,363 INFO L273 TraceCheckUtils]: 6: Hoare triple {3139#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:24,364 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:24,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:24,369 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:24,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:24,370 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:24,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:24,371 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:24,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:24,371 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:24,372 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:24,372 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:24,373 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:24,385 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:24,386 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 100000); {3112#false} is VALID [2018-11-23 12:27:24,386 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:24,386 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:24,386 INFO L273 TraceCheckUtils]: 23: Hoare triple {3112#false} assume !!(~i~0 < 100000);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:24,386 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:24,386 INFO L273 TraceCheckUtils]: 25: Hoare triple {3112#false} assume !!(~i~0 < 100000);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:24,386 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:24,387 INFO L273 TraceCheckUtils]: 27: Hoare triple {3112#false} assume !!(~i~0 < 100000);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:24,387 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:24,387 INFO L273 TraceCheckUtils]: 29: Hoare triple {3112#false} assume !(~i~0 < 100000); {3112#false} is VALID [2018-11-23 12:27:24,387 INFO L273 TraceCheckUtils]: 30: Hoare triple {3112#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:27:24,387 INFO L273 TraceCheckUtils]: 31: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:24,387 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3112#false} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:27:24,387 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:24,387 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:24,388 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:24,388 INFO L273 TraceCheckUtils]: 36: Hoare triple {3112#false} assume !!(~i~0 < 100000);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:24,388 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:24,388 INFO L273 TraceCheckUtils]: 38: Hoare triple {3112#false} assume !!(~i~0 < 100000);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:24,388 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:24,388 INFO L273 TraceCheckUtils]: 40: Hoare triple {3112#false} assume !!(~i~0 < 100000);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:24,388 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:24,388 INFO L273 TraceCheckUtils]: 42: Hoare triple {3112#false} assume !(~i~0 < 100000); {3112#false} is VALID [2018-11-23 12:27:24,388 INFO L273 TraceCheckUtils]: 43: Hoare triple {3112#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:27:24,389 INFO L273 TraceCheckUtils]: 44: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:24,389 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3112#false} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:27:24,389 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:24,389 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:24,389 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:24,389 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:24,389 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:24,389 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 99999); {3112#false} is VALID [2018-11-23 12:27:24,390 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:27:24,390 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:24,390 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:24,390 INFO L273 TraceCheckUtils]: 55: Hoare triple {3112#false} assume !!(~i~0 < 100000);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:24,390 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:24,390 INFO L273 TraceCheckUtils]: 57: Hoare triple {3112#false} assume !!(~i~0 < 100000);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:24,390 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:24,390 INFO L273 TraceCheckUtils]: 59: Hoare triple {3112#false} assume !!(~i~0 < 100000);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:24,391 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:24,391 INFO L273 TraceCheckUtils]: 61: Hoare triple {3112#false} assume !(~i~0 < 100000); {3112#false} is VALID [2018-11-23 12:27:24,391 INFO L273 TraceCheckUtils]: 62: Hoare triple {3112#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:27:24,391 INFO L273 TraceCheckUtils]: 63: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:24,391 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3112#false} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:27:24,391 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:24,391 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:24,391 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:27:24,393 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:24,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:24,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:27:24,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:27:24,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:24,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:24,468 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:24,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:24,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:24,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:24,469 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2018-11-23 12:27:24,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:24,703 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 12:27:24,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:27:24,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:27:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:27:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:27:24,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-23 12:27:24,774 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:24,776 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:27:24,776 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:27:24,777 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:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:27:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 12:27:24,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:24,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:24,804 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:24,804 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:24,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:24,806 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:27:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:27:24,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:24,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:24,807 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 12:27:24,807 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 12:27:24,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:24,808 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:27:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:27:24,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:24,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:24,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:24,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:27:24,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 12:27:24,811 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2018-11-23 12:27:24,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:24,811 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 12:27:24,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:24,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:27:24,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:24,812 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:24,813 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:24,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:24,813 INFO L82 PathProgramCache]: Analyzing trace with hash -266850591, now seen corresponding path program 8 times [2018-11-23 12:27:24,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:24,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:24,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:24,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:24,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:25,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:27:25,028 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:25,029 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:25,029 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:27:25,029 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret12 := main(); {3609#true} is VALID [2018-11-23 12:27:25,029 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:25,029 INFO L273 TraceCheckUtils]: 6: Hoare triple {3611#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:25,030 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:25,031 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:25,031 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:25,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:25,033 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:25,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:25,034 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:25,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:25,035 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:25,036 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:25,037 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:25,037 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:25,038 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:25,039 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:25,039 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:25,040 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 100000); {3610#false} is VALID [2018-11-23 12:27:25,040 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:25,041 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:25,041 INFO L273 TraceCheckUtils]: 25: Hoare triple {3609#true} assume !!(~i~0 < 100000);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:25,041 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:25,041 INFO L273 TraceCheckUtils]: 27: Hoare triple {3609#true} assume !!(~i~0 < 100000);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:25,041 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:25,042 INFO L273 TraceCheckUtils]: 29: Hoare triple {3609#true} assume !!(~i~0 < 100000);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:25,042 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:25,042 INFO L273 TraceCheckUtils]: 31: Hoare triple {3609#true} assume !(~i~0 < 100000); {3609#true} is VALID [2018-11-23 12:27:25,042 INFO L273 TraceCheckUtils]: 32: Hoare triple {3609#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:27:25,042 INFO L273 TraceCheckUtils]: 33: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:25,043 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3609#true} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:27:25,043 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:25,043 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:25,043 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:25,043 INFO L273 TraceCheckUtils]: 38: Hoare triple {3609#true} assume !!(~i~0 < 100000);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:25,043 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:25,044 INFO L273 TraceCheckUtils]: 40: Hoare triple {3609#true} assume !!(~i~0 < 100000);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:25,044 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:25,044 INFO L273 TraceCheckUtils]: 42: Hoare triple {3609#true} assume !!(~i~0 < 100000);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:25,044 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:25,044 INFO L273 TraceCheckUtils]: 44: Hoare triple {3609#true} assume !(~i~0 < 100000); {3609#true} is VALID [2018-11-23 12:27:25,044 INFO L273 TraceCheckUtils]: 45: Hoare triple {3609#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:27:25,044 INFO L273 TraceCheckUtils]: 46: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:25,045 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3609#true} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:27:25,045 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:25,045 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:25,045 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:25,045 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:25,045 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:25,046 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 99999); {3610#false} is VALID [2018-11-23 12:27:25,046 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:27:25,046 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:25,046 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:25,046 INFO L273 TraceCheckUtils]: 57: Hoare triple {3609#true} assume !!(~i~0 < 100000);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:25,046 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:25,046 INFO L273 TraceCheckUtils]: 59: Hoare triple {3609#true} assume !!(~i~0 < 100000);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:25,047 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:25,047 INFO L273 TraceCheckUtils]: 61: Hoare triple {3609#true} assume !!(~i~0 < 100000);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:25,047 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:25,047 INFO L273 TraceCheckUtils]: 63: Hoare triple {3609#true} assume !(~i~0 < 100000); {3609#true} is VALID [2018-11-23 12:27:25,047 INFO L273 TraceCheckUtils]: 64: Hoare triple {3609#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:27:25,047 INFO L273 TraceCheckUtils]: 65: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:25,047 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3609#true} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:27:25,047 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:25,048 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:25,048 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:27:25,050 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:25,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:25,050 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:25,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:25,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:25,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:25,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:25,283 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:27:25,284 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:25,284 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:25,284 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:27:25,285 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret12 := main(); {3609#true} is VALID [2018-11-23 12:27:25,285 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:25,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {3638#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:25,286 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:25,287 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:25,287 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:25,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:25,288 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:25,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:25,289 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:25,290 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:25,291 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:25,291 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:25,292 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:25,293 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:25,293 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:25,294 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:25,295 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:25,295 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 100000); {3610#false} is VALID [2018-11-23 12:27:25,296 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:25,296 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:25,296 INFO L273 TraceCheckUtils]: 25: Hoare triple {3610#false} assume !!(~i~0 < 100000);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:25,296 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:25,297 INFO L273 TraceCheckUtils]: 27: Hoare triple {3610#false} assume !!(~i~0 < 100000);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:25,297 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:25,297 INFO L273 TraceCheckUtils]: 29: Hoare triple {3610#false} assume !!(~i~0 < 100000);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:25,297 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:25,297 INFO L273 TraceCheckUtils]: 31: Hoare triple {3610#false} assume !(~i~0 < 100000); {3610#false} is VALID [2018-11-23 12:27:25,298 INFO L273 TraceCheckUtils]: 32: Hoare triple {3610#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:27:25,298 INFO L273 TraceCheckUtils]: 33: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:25,298 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3610#false} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:27:25,298 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:25,298 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:25,299 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:25,299 INFO L273 TraceCheckUtils]: 38: Hoare triple {3610#false} assume !!(~i~0 < 100000);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:25,299 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:25,299 INFO L273 TraceCheckUtils]: 40: Hoare triple {3610#false} assume !!(~i~0 < 100000);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:25,300 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:25,300 INFO L273 TraceCheckUtils]: 42: Hoare triple {3610#false} assume !!(~i~0 < 100000);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:25,300 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:25,300 INFO L273 TraceCheckUtils]: 44: Hoare triple {3610#false} assume !(~i~0 < 100000); {3610#false} is VALID [2018-11-23 12:27:25,300 INFO L273 TraceCheckUtils]: 45: Hoare triple {3610#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:27:25,300 INFO L273 TraceCheckUtils]: 46: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:25,300 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3610#false} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:27:25,300 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:25,301 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:25,301 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:25,301 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:25,301 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:25,301 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 99999); {3610#false} is VALID [2018-11-23 12:27:25,301 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:27:25,301 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:25,301 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:25,301 INFO L273 TraceCheckUtils]: 57: Hoare triple {3610#false} assume !!(~i~0 < 100000);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:25,302 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:25,302 INFO L273 TraceCheckUtils]: 59: Hoare triple {3610#false} assume !!(~i~0 < 100000);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:25,302 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:25,302 INFO L273 TraceCheckUtils]: 61: Hoare triple {3610#false} assume !!(~i~0 < 100000);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:25,302 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:25,302 INFO L273 TraceCheckUtils]: 63: Hoare triple {3610#false} assume !(~i~0 < 100000); {3610#false} is VALID [2018-11-23 12:27:25,302 INFO L273 TraceCheckUtils]: 64: Hoare triple {3610#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:27:25,302 INFO L273 TraceCheckUtils]: 65: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:25,303 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3610#false} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:27:25,303 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:25,303 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:25,303 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:27:25,305 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:25,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:25,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:27:25,326 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:27:25,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:25,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:27:25,386 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:25,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:27:25,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:27:25,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:27:25,387 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2018-11-23 12:27:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:25,573 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-23 12:27:25,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:25,573 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:27:25,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:27:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:27:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:27:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:27:25,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:27:25,662 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:25,664 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:27:25,664 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:27:25,665 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:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:27:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:27:25,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:25,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:25,687 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:25,687 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:25,689 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:27:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:27:25,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:25,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:25,690 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:27:25,690 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:27:25,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:25,692 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:27:25,693 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:27:25,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:25,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:25,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:25,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:25,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:27:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 12:27:25,695 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2018-11-23 12:27:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:25,696 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 12:27:25,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:27:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:27:25,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:27:25,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:25,697 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:25,697 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:25,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:25,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2104249405, now seen corresponding path program 9 times [2018-11-23 12:27:25,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:25,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:25,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:25,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:25,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:26,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:27:26,704 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:26,704 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:26,705 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:27:26,705 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret12 := main(); {4124#true} is VALID [2018-11-23 12:27:26,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:26,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {4126#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:26,707 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:26,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {4127#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:26,708 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:26,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {4128#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:26,709 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:26,710 INFO L273 TraceCheckUtils]: 12: Hoare triple {4129#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:26,711 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:26,711 INFO L273 TraceCheckUtils]: 14: Hoare triple {4130#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:26,712 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:26,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {4131#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:26,713 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:26,714 INFO L273 TraceCheckUtils]: 18: Hoare triple {4132#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:26,714 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:26,715 INFO L273 TraceCheckUtils]: 20: Hoare triple {4133#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:26,716 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:26,716 INFO L273 TraceCheckUtils]: 22: Hoare triple {4134#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:26,717 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:26,718 INFO L273 TraceCheckUtils]: 24: Hoare triple {4135#(<= main_~i~1 9)} assume !(~i~1 < 100000); {4125#false} is VALID [2018-11-23 12:27:26,718 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:26,718 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:26,718 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 100000);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:26,719 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:26,719 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 100000);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:26,719 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:26,719 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 100000);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:26,719 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:26,720 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 100000); {4124#true} is VALID [2018-11-23 12:27:26,720 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:26,720 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:26,720 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4125#false} #70#return; {4125#false} is VALID [2018-11-23 12:27:26,720 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:26,721 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:26,721 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:26,721 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 100000);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:26,721 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:26,721 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 100000);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:26,722 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:26,722 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 100000);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:26,722 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:26,722 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 100000); {4124#true} is VALID [2018-11-23 12:27:26,722 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:26,722 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:26,722 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4125#false} #72#return; {4125#false} is VALID [2018-11-23 12:27:26,722 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:26,722 INFO L273 TraceCheckUtils]: 51: Hoare triple {4125#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:26,723 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:26,723 INFO L273 TraceCheckUtils]: 53: Hoare triple {4125#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:26,723 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:26,723 INFO L273 TraceCheckUtils]: 55: Hoare triple {4125#false} assume !(~i~2 < 99999); {4125#false} is VALID [2018-11-23 12:27:26,723 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:27:26,723 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:26,723 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:26,723 INFO L273 TraceCheckUtils]: 59: Hoare triple {4124#true} assume !!(~i~0 < 100000);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:26,724 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:26,724 INFO L273 TraceCheckUtils]: 61: Hoare triple {4124#true} assume !!(~i~0 < 100000);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:26,724 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:26,724 INFO L273 TraceCheckUtils]: 63: Hoare triple {4124#true} assume !!(~i~0 < 100000);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:26,724 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:26,724 INFO L273 TraceCheckUtils]: 65: Hoare triple {4124#true} assume !(~i~0 < 100000); {4124#true} is VALID [2018-11-23 12:27:26,724 INFO L273 TraceCheckUtils]: 66: Hoare triple {4124#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:26,724 INFO L273 TraceCheckUtils]: 67: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:26,724 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4124#true} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:27:26,725 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:26,725 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:26,725 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:27:26,727 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:26,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:26,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:26,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:27:26,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:26,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:26,949 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:27:26,950 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:26,950 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:26,950 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:27:26,951 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret12 := main(); {4124#true} is VALID [2018-11-23 12:27:26,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4124#true} is VALID [2018-11-23 12:27:26,951 INFO L273 TraceCheckUtils]: 6: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -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:26,951 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:26,952 INFO L273 TraceCheckUtils]: 8: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -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:26,952 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:26,952 INFO L273 TraceCheckUtils]: 10: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -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:26,952 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:26,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -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:26,953 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:26,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -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:26,953 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:26,953 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -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:26,953 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:26,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -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:26,953 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:26,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -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:26,954 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:26,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -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:26,954 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:26,954 INFO L273 TraceCheckUtils]: 24: Hoare triple {4124#true} assume !(~i~1 < 100000); {4124#true} is VALID [2018-11-23 12:27:26,954 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:26,955 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:26,955 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 100000);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:26,955 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:26,955 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 100000);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:26,955 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:26,955 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 100000);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:26,956 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:26,956 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 100000); {4124#true} is VALID [2018-11-23 12:27:26,956 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:26,956 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:26,956 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4124#true} #70#return; {4124#true} is VALID [2018-11-23 12:27:26,956 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:26,957 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:26,957 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:26,957 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 100000);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:26,957 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:26,957 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 100000);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:26,957 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:26,958 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 100000);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:26,958 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:26,958 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 100000); {4124#true} is VALID [2018-11-23 12:27:26,958 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:26,958 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:26,958 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4124#true} #72#return; {4124#true} is VALID [2018-11-23 12:27:26,959 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:26,960 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:26,960 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:26,961 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:26,961 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:26,962 INFO L273 TraceCheckUtils]: 55: Hoare triple {4303#(<= main_~i~2 2)} assume !(~i~2 < 99999); {4125#false} is VALID [2018-11-23 12:27:26,962 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:27:26,962 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:26,962 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:26,962 INFO L273 TraceCheckUtils]: 59: Hoare triple {4125#false} assume !!(~i~0 < 100000);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:26,962 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:26,963 INFO L273 TraceCheckUtils]: 61: Hoare triple {4125#false} assume !!(~i~0 < 100000);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:26,963 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:26,963 INFO L273 TraceCheckUtils]: 63: Hoare triple {4125#false} assume !!(~i~0 < 100000);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:26,963 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:26,964 INFO L273 TraceCheckUtils]: 65: Hoare triple {4125#false} assume !(~i~0 < 100000); {4125#false} is VALID [2018-11-23 12:27:26,964 INFO L273 TraceCheckUtils]: 66: Hoare triple {4125#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {4125#false} is VALID [2018-11-23 12:27:26,964 INFO L273 TraceCheckUtils]: 67: Hoare triple {4125#false} assume true; {4125#false} is VALID [2018-11-23 12:27:26,964 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4125#false} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:27:26,965 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:26,965 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:26,965 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:27:26,970 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:26,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:26,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:27:26,990 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:27:26,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:26,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:27:27,079 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:27,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:27:27,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:27:27,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:27:27,080 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2018-11-23 12:27:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:27,543 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-23 12:27:27,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:27:27,544 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:27:27,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:27:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:27:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:27:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:27:27,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2018-11-23 12:27:27,639 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:27,641 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:27:27,641 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:27:27,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:27:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:27:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 12:27:27,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:27,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:27,670 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:27,670 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:27,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:27,672 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:27:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:27:27,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:27,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:27,673 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2018-11-23 12:27:27,673 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2018-11-23 12:27:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:27,674 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:27:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:27:27,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:27,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:27,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:27,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:27:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-23 12:27:27,677 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2018-11-23 12:27:27,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:27,678 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-23 12:27:27,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:27:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 12:27:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:27:27,679 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:27,679 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:27,680 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:27,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:27,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1485183197, now seen corresponding path program 10 times [2018-11-23 12:27:27,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:27,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:27,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:27,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:27,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:28,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:27:28,553 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:28,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:28,554 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:27:28,554 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret12 := main(); {4671#true} is VALID [2018-11-23 12:27:28,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:28,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {4673#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:28,556 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:28,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {4674#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:28,557 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:28,557 INFO L273 TraceCheckUtils]: 10: Hoare triple {4675#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:28,557 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:28,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {4676#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:28,558 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:28,558 INFO L273 TraceCheckUtils]: 14: Hoare triple {4677#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:28,559 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:28,560 INFO L273 TraceCheckUtils]: 16: Hoare triple {4678#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:28,560 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:28,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:28,562 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:28,562 INFO L273 TraceCheckUtils]: 20: Hoare triple {4680#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:28,563 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:28,563 INFO L273 TraceCheckUtils]: 22: Hoare triple {4681#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:28,564 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:28,565 INFO L273 TraceCheckUtils]: 24: Hoare triple {4682#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:28,566 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:28,566 INFO L273 TraceCheckUtils]: 26: Hoare triple {4683#(<= main_~i~1 10)} assume !(~i~1 < 100000); {4672#false} is VALID [2018-11-23 12:27:28,566 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:28,567 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:28,567 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 100000);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:28,567 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:28,567 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 100000);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:28,568 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:28,568 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 100000);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:28,568 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:28,568 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 100000); {4671#true} is VALID [2018-11-23 12:27:28,568 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:28,569 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:28,569 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4672#false} #70#return; {4672#false} is VALID [2018-11-23 12:27:28,569 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:28,569 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:28,569 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:28,570 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 100000);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:28,570 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:28,570 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 100000);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:28,570 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:28,571 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 100000);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:28,571 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:28,571 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 100000); {4671#true} is VALID [2018-11-23 12:27:28,571 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:28,571 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:28,571 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4672#false} #72#return; {4672#false} is VALID [2018-11-23 12:27:28,571 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:28,572 INFO L273 TraceCheckUtils]: 53: Hoare triple {4672#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:28,572 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:28,572 INFO L273 TraceCheckUtils]: 55: Hoare triple {4672#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:28,572 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:28,572 INFO L273 TraceCheckUtils]: 57: Hoare triple {4672#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:28,572 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:28,572 INFO L273 TraceCheckUtils]: 59: Hoare triple {4672#false} assume !(~i~2 < 99999); {4672#false} is VALID [2018-11-23 12:27:28,572 INFO L273 TraceCheckUtils]: 60: Hoare triple {4672#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:27:28,572 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:28,573 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:28,573 INFO L273 TraceCheckUtils]: 63: Hoare triple {4671#true} assume !!(~i~0 < 100000);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:28,573 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:28,573 INFO L273 TraceCheckUtils]: 65: Hoare triple {4671#true} assume !!(~i~0 < 100000);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:28,573 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:28,573 INFO L273 TraceCheckUtils]: 67: Hoare triple {4671#true} assume !!(~i~0 < 100000);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:28,573 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:28,573 INFO L273 TraceCheckUtils]: 69: Hoare triple {4671#true} assume !(~i~0 < 100000); {4671#true} is VALID [2018-11-23 12:27:28,574 INFO L273 TraceCheckUtils]: 70: Hoare triple {4671#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:28,574 INFO L273 TraceCheckUtils]: 71: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:28,574 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4671#true} {4672#false} #74#return; {4672#false} is VALID [2018-11-23 12:27:28,574 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:28,574 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:28,574 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:27:28,578 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:28,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:28,578 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:28,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:28,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:28,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:28,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:28,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:27:28,793 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:28,793 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:28,794 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:27:28,794 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret12 := main(); {4671#true} is VALID [2018-11-23 12:27:28,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4671#true} is VALID [2018-11-23 12:27:28,794 INFO L273 TraceCheckUtils]: 6: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -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:28,794 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:28,794 INFO L273 TraceCheckUtils]: 8: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -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:28,795 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:28,795 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -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:28,795 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:28,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -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:28,795 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:28,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -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:28,795 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:28,795 INFO L273 TraceCheckUtils]: 16: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -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:28,796 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:28,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -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:28,796 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:28,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -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:28,796 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:28,796 INFO L273 TraceCheckUtils]: 22: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -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:28,796 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:28,796 INFO L273 TraceCheckUtils]: 24: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -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:28,797 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:28,797 INFO L273 TraceCheckUtils]: 26: Hoare triple {4671#true} assume !(~i~1 < 100000); {4671#true} is VALID [2018-11-23 12:27:28,797 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:28,797 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:28,797 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 100000);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:28,797 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:28,797 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 100000);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:28,797 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:28,798 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 100000);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:28,798 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:28,798 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 100000); {4671#true} is VALID [2018-11-23 12:27:28,798 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:28,798 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:28,798 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4671#true} #70#return; {4671#true} is VALID [2018-11-23 12:27:28,798 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:28,798 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:28,798 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:28,799 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 100000);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:28,799 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:28,799 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 100000);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:28,799 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:28,799 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 100000);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:28,799 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:28,799 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 100000); {4671#true} is VALID [2018-11-23 12:27:28,799 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:28,800 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:28,800 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4671#true} #72#return; {4671#true} is VALID [2018-11-23 12:27:28,800 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:28,800 INFO L273 TraceCheckUtils]: 53: Hoare triple {4671#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:28,800 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:28,800 INFO L273 TraceCheckUtils]: 55: Hoare triple {4671#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:28,800 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:28,800 INFO L273 TraceCheckUtils]: 57: Hoare triple {4671#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:28,801 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:28,801 INFO L273 TraceCheckUtils]: 59: Hoare triple {4671#true} assume !(~i~2 < 99999); {4671#true} is VALID [2018-11-23 12:27:28,801 INFO L273 TraceCheckUtils]: 60: Hoare triple {4671#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:27:28,801 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:28,801 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:28,802 INFO L273 TraceCheckUtils]: 63: Hoare triple {4873#(<= mapavg_~i~0 0)} assume !!(~i~0 < 100000);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:28,802 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:28,803 INFO L273 TraceCheckUtils]: 65: Hoare triple {4880#(<= mapavg_~i~0 1)} assume !!(~i~0 < 100000);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:28,803 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:28,803 INFO L273 TraceCheckUtils]: 67: Hoare triple {4887#(<= mapavg_~i~0 2)} assume !!(~i~0 < 100000);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:28,804 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:28,804 INFO L273 TraceCheckUtils]: 69: Hoare triple {4894#(<= mapavg_~i~0 3)} assume !(~i~0 < 100000); {4672#false} is VALID [2018-11-23 12:27:28,804 INFO L273 TraceCheckUtils]: 70: Hoare triple {4672#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {4672#false} is VALID [2018-11-23 12:27:28,805 INFO L273 TraceCheckUtils]: 71: Hoare triple {4672#false} assume true; {4672#false} is VALID [2018-11-23 12:27:28,805 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4672#false} {4671#true} #74#return; {4672#false} is VALID [2018-11-23 12:27:28,805 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:28,805 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:28,805 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:27:28,809 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:28,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:28,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2018-11-23 12:27:28,829 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:27:28,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:28,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:27:29,058 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:29,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:27:29,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:27:29,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:29,060 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2018-11-23 12:27:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:29,540 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-11-23 12:27:29,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:27:29,541 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:27:29,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:27:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:27:29,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 12:27:30,037 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:30,038 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:27:30,038 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:27:30,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:27:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 12:27:30,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:30,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:30,062 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:30,062 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:30,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:30,063 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:27:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:27:30,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:30,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:30,064 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 12:27:30,064 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 12:27:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:30,066 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:27:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:27:30,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:30,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:30,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:30,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:27:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 12:27:30,068 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2018-11-23 12:27:30,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:30,068 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 12:27:30,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:27:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 12:27:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 12:27:30,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:30,071 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:30,071 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:30,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:30,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1828841827, now seen corresponding path program 11 times [2018-11-23 12:27:30,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:30,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:30,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:30,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:30,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:30,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:27:30,313 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:30,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:30,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:27:30,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret12 := main(); {5255#true} is VALID [2018-11-23 12:27:30,313 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:30,314 INFO L273 TraceCheckUtils]: 6: Hoare triple {5257#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:30,314 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:30,314 INFO L273 TraceCheckUtils]: 8: Hoare triple {5258#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:30,315 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:30,315 INFO L273 TraceCheckUtils]: 10: Hoare triple {5259#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:30,316 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:30,316 INFO L273 TraceCheckUtils]: 12: Hoare triple {5260#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:30,317 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:30,317 INFO L273 TraceCheckUtils]: 14: Hoare triple {5261#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:30,318 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:30,318 INFO L273 TraceCheckUtils]: 16: Hoare triple {5262#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:30,319 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:30,320 INFO L273 TraceCheckUtils]: 18: Hoare triple {5263#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:30,320 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:30,321 INFO L273 TraceCheckUtils]: 20: Hoare triple {5264#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:30,322 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:30,340 INFO L273 TraceCheckUtils]: 22: Hoare triple {5265#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:30,348 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:30,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {5266#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:30,350 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:30,350 INFO L273 TraceCheckUtils]: 26: Hoare triple {5267#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:30,350 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:30,351 INFO L273 TraceCheckUtils]: 28: Hoare triple {5268#(<= main_~i~1 11)} assume !(~i~1 < 100000); {5256#false} is VALID [2018-11-23 12:27:30,351 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:30,351 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:30,351 INFO L273 TraceCheckUtils]: 31: Hoare triple {5255#true} assume !!(~i~0 < 100000);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:30,351 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:30,351 INFO L273 TraceCheckUtils]: 33: Hoare triple {5255#true} assume !!(~i~0 < 100000);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:30,352 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:30,352 INFO L273 TraceCheckUtils]: 35: Hoare triple {5255#true} assume !!(~i~0 < 100000);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:30,352 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:30,352 INFO L273 TraceCheckUtils]: 37: Hoare triple {5255#true} assume !!(~i~0 < 100000);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:30,352 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:30,352 INFO L273 TraceCheckUtils]: 39: Hoare triple {5255#true} assume !(~i~0 < 100000); {5255#true} is VALID [2018-11-23 12:27:30,352 INFO L273 TraceCheckUtils]: 40: Hoare triple {5255#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:27:30,352 INFO L273 TraceCheckUtils]: 41: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:30,353 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5255#true} {5256#false} #70#return; {5256#false} is VALID [2018-11-23 12:27:30,353 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:30,353 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:30,353 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:30,353 INFO L273 TraceCheckUtils]: 46: Hoare triple {5255#true} assume !!(~i~0 < 100000);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:30,353 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:30,353 INFO L273 TraceCheckUtils]: 48: Hoare triple {5255#true} assume !!(~i~0 < 100000);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:30,353 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:30,353 INFO L273 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~i~0 < 100000);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:30,354 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:30,354 INFO L273 TraceCheckUtils]: 52: Hoare triple {5255#true} assume !!(~i~0 < 100000);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:30,354 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:30,354 INFO L273 TraceCheckUtils]: 54: Hoare triple {5255#true} assume !(~i~0 < 100000); {5255#true} is VALID [2018-11-23 12:27:30,354 INFO L273 TraceCheckUtils]: 55: Hoare triple {5255#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:27:30,354 INFO L273 TraceCheckUtils]: 56: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:30,354 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5255#true} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:27:30,354 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:30,355 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:30,355 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:30,355 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:30,355 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:30,355 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:30,355 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:30,355 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 99999); {5256#false} is VALID [2018-11-23 12:27:30,355 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:27:30,356 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:30,356 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:30,356 INFO L273 TraceCheckUtils]: 69: Hoare triple {5255#true} assume !!(~i~0 < 100000);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:30,356 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:30,356 INFO L273 TraceCheckUtils]: 71: Hoare triple {5255#true} assume !!(~i~0 < 100000);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:30,356 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:30,356 INFO L273 TraceCheckUtils]: 73: Hoare triple {5255#true} assume !!(~i~0 < 100000);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:30,356 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:30,356 INFO L273 TraceCheckUtils]: 75: Hoare triple {5255#true} assume !!(~i~0 < 100000);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:30,357 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:30,357 INFO L273 TraceCheckUtils]: 77: Hoare triple {5255#true} assume !(~i~0 < 100000); {5255#true} is VALID [2018-11-23 12:27:30,357 INFO L273 TraceCheckUtils]: 78: Hoare triple {5255#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:27:30,357 INFO L273 TraceCheckUtils]: 79: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:30,357 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5255#true} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:27:30,357 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:30,357 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:30,357 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:27:30,361 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:30,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:30,361 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:30,369 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:30,558 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 12:27:30,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:30,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:30,714 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:27:30,714 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:30,715 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:30,715 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:27:30,715 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret12 := main(); {5255#true} is VALID [2018-11-23 12:27:30,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5255#true} is VALID [2018-11-23 12:27:30,716 INFO L273 TraceCheckUtils]: 6: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -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:30,716 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:30,716 INFO L273 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -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:30,716 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:30,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -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:30,717 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:30,717 INFO L273 TraceCheckUtils]: 12: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -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:30,717 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:30,717 INFO L273 TraceCheckUtils]: 14: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -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:30,717 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:30,717 INFO L273 TraceCheckUtils]: 16: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -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:30,718 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:30,718 INFO L273 TraceCheckUtils]: 18: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -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:30,718 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:30,718 INFO L273 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -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:30,718 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:30,719 INFO L273 TraceCheckUtils]: 22: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -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:30,719 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:30,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -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:30,719 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:30,719 INFO L273 TraceCheckUtils]: 26: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -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:30,719 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:30,720 INFO L273 TraceCheckUtils]: 28: Hoare triple {5255#true} assume !(~i~1 < 100000); {5255#true} is VALID [2018-11-23 12:27:30,720 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:30,739 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:30,739 INFO L273 TraceCheckUtils]: 31: Hoare triple {5362#(<= mapavg_~i~0 0)} assume !!(~i~0 < 100000);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:30,740 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:30,740 INFO L273 TraceCheckUtils]: 33: Hoare triple {5369#(<= mapavg_~i~0 1)} assume !!(~i~0 < 100000);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:30,741 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:30,741 INFO L273 TraceCheckUtils]: 35: Hoare triple {5376#(<= mapavg_~i~0 2)} assume !!(~i~0 < 100000);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:30,741 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:30,742 INFO L273 TraceCheckUtils]: 37: Hoare triple {5383#(<= mapavg_~i~0 3)} assume !!(~i~0 < 100000);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:30,742 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:30,742 INFO L273 TraceCheckUtils]: 39: Hoare triple {5390#(<= mapavg_~i~0 4)} assume !(~i~0 < 100000); {5256#false} is VALID [2018-11-23 12:27:30,743 INFO L273 TraceCheckUtils]: 40: Hoare triple {5256#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:27:30,743 INFO L273 TraceCheckUtils]: 41: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:30,743 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5256#false} {5255#true} #70#return; {5256#false} is VALID [2018-11-23 12:27:30,743 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:30,743 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:30,743 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:30,744 INFO L273 TraceCheckUtils]: 46: Hoare triple {5256#false} assume !!(~i~0 < 100000);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:30,744 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:30,744 INFO L273 TraceCheckUtils]: 48: Hoare triple {5256#false} assume !!(~i~0 < 100000);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:30,744 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:30,744 INFO L273 TraceCheckUtils]: 50: Hoare triple {5256#false} assume !!(~i~0 < 100000);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:30,745 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:30,745 INFO L273 TraceCheckUtils]: 52: Hoare triple {5256#false} assume !!(~i~0 < 100000);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:30,745 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:30,745 INFO L273 TraceCheckUtils]: 54: Hoare triple {5256#false} assume !(~i~0 < 100000); {5256#false} is VALID [2018-11-23 12:27:30,746 INFO L273 TraceCheckUtils]: 55: Hoare triple {5256#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:27:30,746 INFO L273 TraceCheckUtils]: 56: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:30,746 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5256#false} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:27:30,746 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:30,746 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:30,746 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:30,746 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:30,746 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:30,747 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:30,747 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:30,747 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 99999); {5256#false} is VALID [2018-11-23 12:27:30,747 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:27:30,747 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:30,747 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:30,747 INFO L273 TraceCheckUtils]: 69: Hoare triple {5256#false} assume !!(~i~0 < 100000);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:30,747 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:30,748 INFO L273 TraceCheckUtils]: 71: Hoare triple {5256#false} assume !!(~i~0 < 100000);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:30,748 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:30,748 INFO L273 TraceCheckUtils]: 73: Hoare triple {5256#false} assume !!(~i~0 < 100000);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:30,748 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:30,748 INFO L273 TraceCheckUtils]: 75: Hoare triple {5256#false} assume !!(~i~0 < 100000);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:30,748 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:30,748 INFO L273 TraceCheckUtils]: 77: Hoare triple {5256#false} assume !(~i~0 < 100000); {5256#false} is VALID [2018-11-23 12:27:30,748 INFO L273 TraceCheckUtils]: 78: Hoare triple {5256#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:27:30,748 INFO L273 TraceCheckUtils]: 79: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:30,749 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5256#false} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:27:30,749 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:30,749 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:30,749 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:27:30,752 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:30,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:30,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-23 12:27:30,771 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:27:30,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:30,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:27:30,847 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:30,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:27:30,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:27:30,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:30,849 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2018-11-23 12:27:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:31,346 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-23 12:27:31,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:31,347 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:27:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:27:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:27:31,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2018-11-23 12:27:31,981 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:31,983 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:27:31,983 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:27:31,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:27:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 12:27:32,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:32,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:32,013 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:32,013 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,015 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:27:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:27:32,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:32,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:32,016 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 12:27:32,016 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 12:27:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,018 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:27:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:27:32,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:32,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:32,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:32,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:27:32,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 12:27:32,020 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2018-11-23 12:27:32,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:32,021 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 12:27:32,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:27:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 12:27:32,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:27:32,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:32,022 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:32,022 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:32,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:32,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1538721373, now seen corresponding path program 12 times [2018-11-23 12:27:32,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:32,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:32,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:32,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:32,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:32,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:27:32,667 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:32,668 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:32,668 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:27:32,668 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret12 := main(); {5888#true} is VALID [2018-11-23 12:27:32,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:32,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {5890#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:32,670 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:32,670 INFO L273 TraceCheckUtils]: 8: Hoare triple {5891#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:32,671 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:32,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {5892#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:32,671 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:32,672 INFO L273 TraceCheckUtils]: 12: Hoare triple {5893#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:32,673 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:32,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {5894#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:32,674 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:32,675 INFO L273 TraceCheckUtils]: 16: Hoare triple {5895#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:32,675 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:32,676 INFO L273 TraceCheckUtils]: 18: Hoare triple {5896#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:32,677 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:32,677 INFO L273 TraceCheckUtils]: 20: Hoare triple {5897#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:32,678 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:32,678 INFO L273 TraceCheckUtils]: 22: Hoare triple {5898#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:32,679 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:32,680 INFO L273 TraceCheckUtils]: 24: Hoare triple {5899#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:32,680 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:32,681 INFO L273 TraceCheckUtils]: 26: Hoare triple {5900#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:32,681 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:32,682 INFO L273 TraceCheckUtils]: 28: Hoare triple {5901#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:32,683 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:32,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {5902#(<= main_~i~1 12)} assume !(~i~1 < 100000); {5889#false} is VALID [2018-11-23 12:27:32,684 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:32,684 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:32,684 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:32,684 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:32,684 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:32,684 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:32,685 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:32,685 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:32,685 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:32,685 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:32,685 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:32,686 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:32,686 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 100000); {5888#true} is VALID [2018-11-23 12:27:32,686 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:32,686 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:32,686 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5889#false} #70#return; {5889#false} is VALID [2018-11-23 12:27:32,686 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:32,686 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:32,686 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:32,687 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:32,687 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:32,687 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:32,687 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:32,687 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:32,687 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:32,687 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:32,687 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:32,688 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:32,688 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:32,688 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 100000); {5888#true} is VALID [2018-11-23 12:27:32,688 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:32,688 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:32,688 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5889#false} #72#return; {5889#false} is VALID [2018-11-23 12:27:32,688 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:32,688 INFO L273 TraceCheckUtils]: 65: Hoare triple {5889#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:32,688 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:32,689 INFO L273 TraceCheckUtils]: 67: Hoare triple {5889#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:32,689 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:32,689 INFO L273 TraceCheckUtils]: 69: Hoare triple {5889#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:32,689 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:32,689 INFO L273 TraceCheckUtils]: 71: Hoare triple {5889#false} assume !(~i~2 < 99999); {5889#false} is VALID [2018-11-23 12:27:32,689 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:27:32,689 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:32,689 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:32,690 INFO L273 TraceCheckUtils]: 75: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:32,690 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:32,690 INFO L273 TraceCheckUtils]: 77: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:32,690 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:32,690 INFO L273 TraceCheckUtils]: 79: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:32,690 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:32,690 INFO L273 TraceCheckUtils]: 81: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:32,690 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:32,690 INFO L273 TraceCheckUtils]: 83: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:32,691 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:32,691 INFO L273 TraceCheckUtils]: 85: Hoare triple {5888#true} assume !(~i~0 < 100000); {5888#true} is VALID [2018-11-23 12:27:32,691 INFO L273 TraceCheckUtils]: 86: Hoare triple {5888#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:32,691 INFO L273 TraceCheckUtils]: 87: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:32,691 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5888#true} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:27:32,691 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:32,691 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:32,691 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:27:32,695 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:32,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:32,695 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:32,704 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:32,932 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:27:32,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:32,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:33,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:27:33,328 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:33,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:33,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:27:33,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret12 := main(); {5888#true} is VALID [2018-11-23 12:27:33,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5888#true} is VALID [2018-11-23 12:27:33,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -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:33,328 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:33,329 INFO L273 TraceCheckUtils]: 8: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -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:33,329 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:33,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -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:33,329 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:33,329 INFO L273 TraceCheckUtils]: 12: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -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:33,329 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:33,329 INFO L273 TraceCheckUtils]: 14: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -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:33,329 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:33,330 INFO L273 TraceCheckUtils]: 16: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -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:33,330 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:33,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -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:33,330 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:33,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -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:33,330 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:33,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -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:33,330 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:33,330 INFO L273 TraceCheckUtils]: 24: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -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:33,331 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:33,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -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:33,331 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:33,331 INFO L273 TraceCheckUtils]: 28: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -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:33,331 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:33,331 INFO L273 TraceCheckUtils]: 30: Hoare triple {5888#true} assume !(~i~1 < 100000); {5888#true} is VALID [2018-11-23 12:27:33,331 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:33,331 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:33,331 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:33,332 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:33,332 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:33,332 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:33,332 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:33,332 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:33,332 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:33,332 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:33,332 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:33,333 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:33,333 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 100000); {5888#true} is VALID [2018-11-23 12:27:33,333 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:33,333 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:33,333 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5888#true} #70#return; {5888#true} is VALID [2018-11-23 12:27:33,333 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:33,333 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:33,333 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:33,333 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:33,334 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:33,334 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:33,334 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:33,334 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:33,334 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:33,334 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:33,334 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:33,334 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 100000);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:33,335 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:33,335 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 100000); {5888#true} is VALID [2018-11-23 12:27:33,335 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:33,335 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:33,335 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5888#true} #72#return; {5888#true} is VALID [2018-11-23 12:27:33,336 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:33,336 INFO L273 TraceCheckUtils]: 65: Hoare triple {6098#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:33,336 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:33,337 INFO L273 TraceCheckUtils]: 67: Hoare triple {6105#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:33,337 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:33,338 INFO L273 TraceCheckUtils]: 69: Hoare triple {6112#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:33,338 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:33,339 INFO L273 TraceCheckUtils]: 71: Hoare triple {6119#(<= main_~i~2 3)} assume !(~i~2 < 99999); {5889#false} is VALID [2018-11-23 12:27:33,339 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:27:33,339 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:33,339 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:33,340 INFO L273 TraceCheckUtils]: 75: Hoare triple {5889#false} assume !!(~i~0 < 100000);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:33,340 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:33,340 INFO L273 TraceCheckUtils]: 77: Hoare triple {5889#false} assume !!(~i~0 < 100000);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:33,340 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:33,341 INFO L273 TraceCheckUtils]: 79: Hoare triple {5889#false} assume !!(~i~0 < 100000);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:33,341 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:33,341 INFO L273 TraceCheckUtils]: 81: Hoare triple {5889#false} assume !!(~i~0 < 100000);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:33,341 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:33,342 INFO L273 TraceCheckUtils]: 83: Hoare triple {5889#false} assume !!(~i~0 < 100000);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:33,342 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:33,342 INFO L273 TraceCheckUtils]: 85: Hoare triple {5889#false} assume !(~i~0 < 100000); {5889#false} is VALID [2018-11-23 12:27:33,342 INFO L273 TraceCheckUtils]: 86: Hoare triple {5889#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {5889#false} is VALID [2018-11-23 12:27:33,342 INFO L273 TraceCheckUtils]: 87: Hoare triple {5889#false} assume true; {5889#false} is VALID [2018-11-23 12:27:33,343 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5889#false} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:27:33,343 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:33,343 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:33,343 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:27:33,347 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:33,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:33,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-11-23 12:27:33,368 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:27:33,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:33,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:27:33,442 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:33,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:27:33,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:27:33,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:33,443 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2018-11-23 12:27:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:34,008 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-23 12:27:34,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:34,008 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:27:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:27:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:27:34,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 87 transitions. [2018-11-23 12:27:34,482 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:34,484 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:27:34,485 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:27:34,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:27:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:27:34,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:34,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:27:34,513 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:27:34,513 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:27:34,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:34,516 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:27:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:27:34,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:34,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:34,517 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:27:34,517 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:27:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:34,519 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:27:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:27:34,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:34,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:34,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:34,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:27:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 12:27:34,522 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2018-11-23 12:27:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:34,522 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 12:27:34,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:27:34,522 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:27:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:27:34,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:34,523 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:34,524 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:34,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:34,524 INFO L82 PathProgramCache]: Analyzing trace with hash 713900035, now seen corresponding path program 13 times [2018-11-23 12:27:34,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:34,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:34,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:34,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:34,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:36,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:27:36,167 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:36,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:36,167 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:27:36,168 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret12 := main(); {6568#true} is VALID [2018-11-23 12:27:36,168 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:36,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {6570#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:36,169 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:36,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:36,171 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:36,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:36,172 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:36,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:36,173 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:36,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:36,174 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:36,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:36,176 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:36,176 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:36,177 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:36,177 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:36,178 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:36,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:36,179 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:36,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:36,181 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:36,181 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:36,182 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:36,182 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:36,183 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:36,184 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:36,184 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:36,185 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 100000); {6569#false} is VALID [2018-11-23 12:27:36,185 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:36,185 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:36,186 INFO L273 TraceCheckUtils]: 35: Hoare triple {6568#true} assume !!(~i~0 < 100000);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:36,186 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:36,186 INFO L273 TraceCheckUtils]: 37: Hoare triple {6568#true} assume !!(~i~0 < 100000);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:36,186 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:36,186 INFO L273 TraceCheckUtils]: 39: Hoare triple {6568#true} assume !!(~i~0 < 100000);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:36,186 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:36,187 INFO L273 TraceCheckUtils]: 41: Hoare triple {6568#true} assume !!(~i~0 < 100000);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:36,187 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:36,187 INFO L273 TraceCheckUtils]: 43: Hoare triple {6568#true} assume !!(~i~0 < 100000);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:36,187 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:36,187 INFO L273 TraceCheckUtils]: 45: Hoare triple {6568#true} assume !(~i~0 < 100000); {6568#true} is VALID [2018-11-23 12:27:36,188 INFO L273 TraceCheckUtils]: 46: Hoare triple {6568#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:27:36,188 INFO L273 TraceCheckUtils]: 47: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:36,188 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6568#true} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:27:36,188 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:36,188 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:36,189 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:36,189 INFO L273 TraceCheckUtils]: 52: Hoare triple {6568#true} assume !!(~i~0 < 100000);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:36,189 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:36,189 INFO L273 TraceCheckUtils]: 54: Hoare triple {6568#true} assume !!(~i~0 < 100000);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:36,189 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:36,190 INFO L273 TraceCheckUtils]: 56: Hoare triple {6568#true} assume !!(~i~0 < 100000);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:36,190 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:36,190 INFO L273 TraceCheckUtils]: 58: Hoare triple {6568#true} assume !!(~i~0 < 100000);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:36,190 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:36,190 INFO L273 TraceCheckUtils]: 60: Hoare triple {6568#true} assume !!(~i~0 < 100000);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:36,190 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:36,191 INFO L273 TraceCheckUtils]: 62: Hoare triple {6568#true} assume !(~i~0 < 100000); {6568#true} is VALID [2018-11-23 12:27:36,191 INFO L273 TraceCheckUtils]: 63: Hoare triple {6568#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:27:36,191 INFO L273 TraceCheckUtils]: 64: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:36,191 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6568#true} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:27:36,191 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:36,191 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:36,191 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:36,191 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:36,192 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:36,192 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:36,192 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:36,192 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:36,192 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:36,192 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 99999); {6569#false} is VALID [2018-11-23 12:27:36,192 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:27:36,192 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:36,192 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:36,193 INFO L273 TraceCheckUtils]: 79: Hoare triple {6568#true} assume !!(~i~0 < 100000);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:36,193 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:36,193 INFO L273 TraceCheckUtils]: 81: Hoare triple {6568#true} assume !!(~i~0 < 100000);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:36,193 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:36,193 INFO L273 TraceCheckUtils]: 83: Hoare triple {6568#true} assume !!(~i~0 < 100000);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:36,193 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:36,193 INFO L273 TraceCheckUtils]: 85: Hoare triple {6568#true} assume !!(~i~0 < 100000);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:36,193 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:36,194 INFO L273 TraceCheckUtils]: 87: Hoare triple {6568#true} assume !!(~i~0 < 100000);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:36,194 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:36,194 INFO L273 TraceCheckUtils]: 89: Hoare triple {6568#true} assume !(~i~0 < 100000); {6568#true} is VALID [2018-11-23 12:27:36,194 INFO L273 TraceCheckUtils]: 90: Hoare triple {6568#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:27:36,194 INFO L273 TraceCheckUtils]: 91: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:36,194 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6568#true} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:27:36,194 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:36,194 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:36,194 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:27:36,199 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:36,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:36,199 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:36,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:36,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:36,649 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:27:36,650 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:36,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:36,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:27:36,651 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret12 := main(); {6568#true} is VALID [2018-11-23 12:27:36,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:36,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {6602#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:36,652 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:36,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:36,653 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:36,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:36,654 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:36,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:36,655 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:36,656 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:36,657 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:36,657 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:36,658 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:36,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:36,659 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:36,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:36,661 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:36,661 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:36,662 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:36,663 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:36,664 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:36,664 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:36,665 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:36,666 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:36,666 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:36,667 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:36,668 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:36,669 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 100000); {6569#false} is VALID [2018-11-23 12:27:36,669 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:36,669 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:36,669 INFO L273 TraceCheckUtils]: 35: Hoare triple {6569#false} assume !!(~i~0 < 100000);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:36,670 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:36,670 INFO L273 TraceCheckUtils]: 37: Hoare triple {6569#false} assume !!(~i~0 < 100000);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:36,670 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:36,670 INFO L273 TraceCheckUtils]: 39: Hoare triple {6569#false} assume !!(~i~0 < 100000);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:36,670 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:36,671 INFO L273 TraceCheckUtils]: 41: Hoare triple {6569#false} assume !!(~i~0 < 100000);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:36,671 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:36,671 INFO L273 TraceCheckUtils]: 43: Hoare triple {6569#false} assume !!(~i~0 < 100000);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:36,671 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:36,671 INFO L273 TraceCheckUtils]: 45: Hoare triple {6569#false} assume !(~i~0 < 100000); {6569#false} is VALID [2018-11-23 12:27:36,672 INFO L273 TraceCheckUtils]: 46: Hoare triple {6569#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:27:36,672 INFO L273 TraceCheckUtils]: 47: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:27:36,672 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6569#false} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:27:36,672 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:36,672 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:36,672 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:36,673 INFO L273 TraceCheckUtils]: 52: Hoare triple {6569#false} assume !!(~i~0 < 100000);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:36,673 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:36,673 INFO L273 TraceCheckUtils]: 54: Hoare triple {6569#false} assume !!(~i~0 < 100000);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:36,673 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:36,673 INFO L273 TraceCheckUtils]: 56: Hoare triple {6569#false} assume !!(~i~0 < 100000);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:36,673 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:36,673 INFO L273 TraceCheckUtils]: 58: Hoare triple {6569#false} assume !!(~i~0 < 100000);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:36,674 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:36,674 INFO L273 TraceCheckUtils]: 60: Hoare triple {6569#false} assume !!(~i~0 < 100000);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:36,674 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:36,674 INFO L273 TraceCheckUtils]: 62: Hoare triple {6569#false} assume !(~i~0 < 100000); {6569#false} is VALID [2018-11-23 12:27:36,674 INFO L273 TraceCheckUtils]: 63: Hoare triple {6569#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:27:36,674 INFO L273 TraceCheckUtils]: 64: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:27:36,675 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6569#false} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:27:36,675 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:36,675 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:36,675 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:36,675 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:36,675 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:36,675 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:36,676 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:36,676 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:36,676 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:36,676 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 99999); {6569#false} is VALID [2018-11-23 12:27:36,676 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:27:36,676 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:36,676 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:36,677 INFO L273 TraceCheckUtils]: 79: Hoare triple {6569#false} assume !!(~i~0 < 100000);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:36,677 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:36,677 INFO L273 TraceCheckUtils]: 81: Hoare triple {6569#false} assume !!(~i~0 < 100000);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:36,677 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:36,677 INFO L273 TraceCheckUtils]: 83: Hoare triple {6569#false} assume !!(~i~0 < 100000);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:36,677 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:36,677 INFO L273 TraceCheckUtils]: 85: Hoare triple {6569#false} assume !!(~i~0 < 100000);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:36,678 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:36,678 INFO L273 TraceCheckUtils]: 87: Hoare triple {6569#false} assume !!(~i~0 < 100000);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:36,678 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:36,678 INFO L273 TraceCheckUtils]: 89: Hoare triple {6569#false} assume !(~i~0 < 100000); {6569#false} is VALID [2018-11-23 12:27:36,678 INFO L273 TraceCheckUtils]: 90: Hoare triple {6569#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:27:36,678 INFO L273 TraceCheckUtils]: 91: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:27:36,679 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6569#false} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:27:36,679 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:36,679 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:36,679 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:27:36,688 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:36,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:36,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:27:36,707 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:27:36,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:36,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:27:36,800 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:36,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:27:36,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:27:36,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:36,802 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2018-11-23 12:27:37,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:37,511 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 12:27:37,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:27:37,511 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:27:37,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:27:37,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:27:37,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2018-11-23 12:27:38,134 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:38,136 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:27:38,136 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:27:38,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:27:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:27:38,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:38,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:27:38,251 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:27:38,251 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:27:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:38,253 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:27:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:27:38,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:38,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:38,254 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:27:38,255 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:27:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:38,257 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:27:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:27:38,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:38,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:38,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:38,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:27:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 12:27:38,260 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2018-11-23 12:27:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:38,260 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 12:27:38,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:27:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:27:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 12:27:38,262 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:38,262 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:38,262 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:38,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:38,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1350791579, now seen corresponding path program 14 times [2018-11-23 12:27:38,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:38,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:38,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:38,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:38,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:38,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:27:38,567 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:38,567 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:38,567 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:27:38,567 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret12 := main(); {7268#true} is VALID [2018-11-23 12:27:38,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:38,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {7270#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:38,569 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:38,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:38,570 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:38,571 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:38,571 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:38,572 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:38,573 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:38,573 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:38,574 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:38,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:38,575 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:38,575 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:38,576 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:38,577 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:38,577 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:38,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:38,579 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:38,579 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:38,580 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:38,580 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:38,581 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:38,582 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:38,582 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:38,583 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:38,583 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:38,584 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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:38,585 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:38,585 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 100000); {7269#false} is VALID [2018-11-23 12:27:38,586 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:38,586 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:38,586 INFO L273 TraceCheckUtils]: 37: Hoare triple {7268#true} assume !!(~i~0 < 100000);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:38,586 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:38,586 INFO L273 TraceCheckUtils]: 39: Hoare triple {7268#true} assume !!(~i~0 < 100000);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:38,586 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:38,587 INFO L273 TraceCheckUtils]: 41: Hoare triple {7268#true} assume !!(~i~0 < 100000);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:38,587 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:38,587 INFO L273 TraceCheckUtils]: 43: Hoare triple {7268#true} assume !!(~i~0 < 100000);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:38,587 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:38,587 INFO L273 TraceCheckUtils]: 45: Hoare triple {7268#true} assume !!(~i~0 < 100000);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:38,588 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:38,588 INFO L273 TraceCheckUtils]: 47: Hoare triple {7268#true} assume !(~i~0 < 100000); {7268#true} is VALID [2018-11-23 12:27:38,588 INFO L273 TraceCheckUtils]: 48: Hoare triple {7268#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:27:38,588 INFO L273 TraceCheckUtils]: 49: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:38,588 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7268#true} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:27:38,589 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:38,589 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:38,589 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:38,589 INFO L273 TraceCheckUtils]: 54: Hoare triple {7268#true} assume !!(~i~0 < 100000);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:38,589 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:38,590 INFO L273 TraceCheckUtils]: 56: Hoare triple {7268#true} assume !!(~i~0 < 100000);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:38,590 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:38,590 INFO L273 TraceCheckUtils]: 58: Hoare triple {7268#true} assume !!(~i~0 < 100000);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:38,590 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:38,590 INFO L273 TraceCheckUtils]: 60: Hoare triple {7268#true} assume !!(~i~0 < 100000);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:38,590 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:38,591 INFO L273 TraceCheckUtils]: 62: Hoare triple {7268#true} assume !!(~i~0 < 100000);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:38,591 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:38,591 INFO L273 TraceCheckUtils]: 64: Hoare triple {7268#true} assume !(~i~0 < 100000); {7268#true} is VALID [2018-11-23 12:27:38,591 INFO L273 TraceCheckUtils]: 65: Hoare triple {7268#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:27:38,591 INFO L273 TraceCheckUtils]: 66: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:38,591 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7268#true} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:27:38,591 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:38,592 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:38,592 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:38,592 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:38,592 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:38,592 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:38,592 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:38,592 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:38,592 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:38,592 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 99999); {7269#false} is VALID [2018-11-23 12:27:38,593 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:27:38,593 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:38,593 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:38,593 INFO L273 TraceCheckUtils]: 81: Hoare triple {7268#true} assume !!(~i~0 < 100000);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:38,593 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:38,593 INFO L273 TraceCheckUtils]: 83: Hoare triple {7268#true} assume !!(~i~0 < 100000);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:38,594 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:38,594 INFO L273 TraceCheckUtils]: 85: Hoare triple {7268#true} assume !!(~i~0 < 100000);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:38,594 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:38,594 INFO L273 TraceCheckUtils]: 87: Hoare triple {7268#true} assume !!(~i~0 < 100000);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:38,594 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:38,594 INFO L273 TraceCheckUtils]: 89: Hoare triple {7268#true} assume !!(~i~0 < 100000);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:38,595 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:38,595 INFO L273 TraceCheckUtils]: 91: Hoare triple {7268#true} assume !(~i~0 < 100000); {7268#true} is VALID [2018-11-23 12:27:38,595 INFO L273 TraceCheckUtils]: 92: Hoare triple {7268#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:27:38,595 INFO L273 TraceCheckUtils]: 93: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:38,595 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7268#true} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:27:38,595 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:38,596 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:38,596 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:27:38,601 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:38,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:38,602 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:38,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:38,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:38,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:38,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:38,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:27:38,873 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:38,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:38,874 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:27:38,874 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret12 := main(); {7268#true} is VALID [2018-11-23 12:27:38,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:38,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {7303#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:38,876 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:38,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:38,877 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:38,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:38,877 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:38,878 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:38,879 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:38,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:38,880 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:38,881 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:38,881 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:38,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:38,883 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:38,883 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:38,884 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:38,884 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:38,885 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:38,886 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:38,886 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:38,887 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:38,888 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:38,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:38,889 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:38,890 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:38,890 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:38,891 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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:38,892 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:38,892 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 100000); {7269#false} is VALID [2018-11-23 12:27:38,892 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:38,893 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:38,893 INFO L273 TraceCheckUtils]: 37: Hoare triple {7269#false} assume !!(~i~0 < 100000);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:38,893 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:38,893 INFO L273 TraceCheckUtils]: 39: Hoare triple {7269#false} assume !!(~i~0 < 100000);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:38,894 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:38,894 INFO L273 TraceCheckUtils]: 41: Hoare triple {7269#false} assume !!(~i~0 < 100000);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:38,894 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:38,894 INFO L273 TraceCheckUtils]: 43: Hoare triple {7269#false} assume !!(~i~0 < 100000);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:38,894 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:38,895 INFO L273 TraceCheckUtils]: 45: Hoare triple {7269#false} assume !!(~i~0 < 100000);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:38,895 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:38,895 INFO L273 TraceCheckUtils]: 47: Hoare triple {7269#false} assume !(~i~0 < 100000); {7269#false} is VALID [2018-11-23 12:27:38,895 INFO L273 TraceCheckUtils]: 48: Hoare triple {7269#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:27:38,895 INFO L273 TraceCheckUtils]: 49: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:27:38,896 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7269#false} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:27:38,896 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:38,896 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:38,896 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:38,896 INFO L273 TraceCheckUtils]: 54: Hoare triple {7269#false} assume !!(~i~0 < 100000);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:38,896 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:38,897 INFO L273 TraceCheckUtils]: 56: Hoare triple {7269#false} assume !!(~i~0 < 100000);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:38,897 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:38,897 INFO L273 TraceCheckUtils]: 58: Hoare triple {7269#false} assume !!(~i~0 < 100000);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:38,897 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:38,897 INFO L273 TraceCheckUtils]: 60: Hoare triple {7269#false} assume !!(~i~0 < 100000);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:38,897 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:38,897 INFO L273 TraceCheckUtils]: 62: Hoare triple {7269#false} assume !!(~i~0 < 100000);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:38,897 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:38,897 INFO L273 TraceCheckUtils]: 64: Hoare triple {7269#false} assume !(~i~0 < 100000); {7269#false} is VALID [2018-11-23 12:27:38,898 INFO L273 TraceCheckUtils]: 65: Hoare triple {7269#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:27:38,898 INFO L273 TraceCheckUtils]: 66: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:27:38,898 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7269#false} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:27:38,898 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:38,898 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:38,898 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:38,898 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:38,898 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:38,899 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:38,899 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:38,899 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:38,899 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:38,899 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 99999); {7269#false} is VALID [2018-11-23 12:27:38,899 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:27:38,899 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:38,899 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:38,900 INFO L273 TraceCheckUtils]: 81: Hoare triple {7269#false} assume !!(~i~0 < 100000);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:38,900 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:38,900 INFO L273 TraceCheckUtils]: 83: Hoare triple {7269#false} assume !!(~i~0 < 100000);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:38,900 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:38,900 INFO L273 TraceCheckUtils]: 85: Hoare triple {7269#false} assume !!(~i~0 < 100000);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:38,900 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:38,900 INFO L273 TraceCheckUtils]: 87: Hoare triple {7269#false} assume !!(~i~0 < 100000);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:38,900 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:38,900 INFO L273 TraceCheckUtils]: 89: Hoare triple {7269#false} assume !!(~i~0 < 100000);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:38,901 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:38,901 INFO L273 TraceCheckUtils]: 91: Hoare triple {7269#false} assume !(~i~0 < 100000); {7269#false} is VALID [2018-11-23 12:27:38,901 INFO L273 TraceCheckUtils]: 92: Hoare triple {7269#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:27:38,901 INFO L273 TraceCheckUtils]: 93: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:27:38,901 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7269#false} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:27:38,901 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:38,901 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:38,901 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:27:38,906 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:38,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:38,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:27:38,925 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:27:38,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:38,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:27:38,990 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:38,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:27:38,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:27:38,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:27:38,991 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2018-11-23 12:27:39,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:39,421 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 12:27:39,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:27:39,421 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:27:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:39,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:27:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:27:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:27:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:27:39,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2018-11-23 12:27:39,839 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:39,841 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:27:39,841 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:27:39,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:27:39,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:27:39,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 12:27:39,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:39,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 12:27:39,875 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 12:27:39,876 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 12:27:39,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:39,878 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:27:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:27:39,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:39,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:39,879 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 12:27:39,879 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 12:27:39,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:39,881 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:27:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:27:39,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:39,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:39,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:39,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:27:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 12:27:39,884 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2018-11-23 12:27:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:39,884 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 12:27:39,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:27:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 12:27:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:27:39,885 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:39,885 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:39,885 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:39,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:39,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1244541881, now seen corresponding path program 15 times [2018-11-23 12:27:39,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:39,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:39,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:39,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:39,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:40,237 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:27:40,237 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:40,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:40,238 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:27:40,238 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret12 := main(); {7985#true} is VALID [2018-11-23 12:27:40,238 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:40,239 INFO L273 TraceCheckUtils]: 6: Hoare triple {7987#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:40,240 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:40,240 INFO L273 TraceCheckUtils]: 8: Hoare triple {7988#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:40,241 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:40,241 INFO L273 TraceCheckUtils]: 10: Hoare triple {7989#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:40,241 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:40,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {7990#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:40,242 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:40,243 INFO L273 TraceCheckUtils]: 14: Hoare triple {7991#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:40,244 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:40,244 INFO L273 TraceCheckUtils]: 16: Hoare triple {7992#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:40,245 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:40,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {7993#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:40,246 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:40,247 INFO L273 TraceCheckUtils]: 20: Hoare triple {7994#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:40,247 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:40,248 INFO L273 TraceCheckUtils]: 22: Hoare triple {7995#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:40,249 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:40,249 INFO L273 TraceCheckUtils]: 24: Hoare triple {7996#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:40,250 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:40,251 INFO L273 TraceCheckUtils]: 26: Hoare triple {7997#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:40,251 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:40,252 INFO L273 TraceCheckUtils]: 28: Hoare triple {7998#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:40,253 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:40,253 INFO L273 TraceCheckUtils]: 30: Hoare triple {7999#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:40,254 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:40,254 INFO L273 TraceCheckUtils]: 32: Hoare triple {8000#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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:40,255 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:40,256 INFO L273 TraceCheckUtils]: 34: Hoare triple {8001#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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:40,256 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:40,257 INFO L273 TraceCheckUtils]: 36: Hoare triple {8002#(<= main_~i~1 15)} assume !(~i~1 < 100000); {7986#false} is VALID [2018-11-23 12:27:40,257 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:40,258 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:40,258 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,258 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:40,258 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,258 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:40,259 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,259 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:40,259 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,259 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:40,259 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,260 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:40,260 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 100000); {7985#true} is VALID [2018-11-23 12:27:40,260 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:40,260 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:40,260 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7986#false} #70#return; {7986#false} is VALID [2018-11-23 12:27:40,260 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:40,260 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:40,261 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:40,261 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,261 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:40,261 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,261 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:40,261 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,261 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:40,261 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,262 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:40,262 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,262 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:40,262 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 100000); {7985#true} is VALID [2018-11-23 12:27:40,262 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:40,262 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:40,262 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7986#false} #72#return; {7986#false} is VALID [2018-11-23 12:27:40,262 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:40,262 INFO L273 TraceCheckUtils]: 71: Hoare triple {7986#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,263 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:40,263 INFO L273 TraceCheckUtils]: 73: Hoare triple {7986#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,263 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:40,263 INFO L273 TraceCheckUtils]: 75: Hoare triple {7986#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,263 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:40,263 INFO L273 TraceCheckUtils]: 77: Hoare triple {7986#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,263 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:40,263 INFO L273 TraceCheckUtils]: 79: Hoare triple {7986#false} assume !(~i~2 < 99999); {7986#false} is VALID [2018-11-23 12:27:40,264 INFO L273 TraceCheckUtils]: 80: Hoare triple {7986#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:27:40,264 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:40,264 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:40,264 INFO L273 TraceCheckUtils]: 83: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,264 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:40,264 INFO L273 TraceCheckUtils]: 85: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,264 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:40,264 INFO L273 TraceCheckUtils]: 87: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,264 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:40,265 INFO L273 TraceCheckUtils]: 89: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,265 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:40,265 INFO L273 TraceCheckUtils]: 91: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,265 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:40,265 INFO L273 TraceCheckUtils]: 93: Hoare triple {7985#true} assume !(~i~0 < 100000); {7985#true} is VALID [2018-11-23 12:27:40,265 INFO L273 TraceCheckUtils]: 94: Hoare triple {7985#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:40,265 INFO L273 TraceCheckUtils]: 95: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:40,265 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7985#true} {7986#false} #74#return; {7986#false} is VALID [2018-11-23 12:27:40,266 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:40,266 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:40,266 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:27:40,270 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:40,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:40,271 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:40,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:40,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:27:40,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:40,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:40,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:27:40,542 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:40,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:40,543 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:27:40,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret12 := main(); {7985#true} is VALID [2018-11-23 12:27:40,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7985#true} is VALID [2018-11-23 12:27:40,543 INFO L273 TraceCheckUtils]: 6: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -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:40,543 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:40,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -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:40,544 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:40,544 INFO L273 TraceCheckUtils]: 10: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -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:40,544 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:40,544 INFO L273 TraceCheckUtils]: 12: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -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:40,545 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:40,545 INFO L273 TraceCheckUtils]: 14: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -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:40,545 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:40,545 INFO L273 TraceCheckUtils]: 16: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -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:40,545 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:40,545 INFO L273 TraceCheckUtils]: 18: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -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:40,545 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:40,545 INFO L273 TraceCheckUtils]: 20: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -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:40,545 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:40,546 INFO L273 TraceCheckUtils]: 22: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -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:40,546 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:40,546 INFO L273 TraceCheckUtils]: 24: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -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:40,546 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:40,546 INFO L273 TraceCheckUtils]: 26: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -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:40,546 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:40,546 INFO L273 TraceCheckUtils]: 28: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -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:40,546 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:40,547 INFO L273 TraceCheckUtils]: 30: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -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:40,547 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:40,547 INFO L273 TraceCheckUtils]: 32: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -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:40,547 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:40,547 INFO L273 TraceCheckUtils]: 34: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -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:40,547 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:40,547 INFO L273 TraceCheckUtils]: 36: Hoare triple {7985#true} assume !(~i~1 < 100000); {7985#true} is VALID [2018-11-23 12:27:40,547 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:40,547 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:40,548 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,548 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:40,548 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,548 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:40,548 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,548 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:40,548 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,548 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:40,549 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,549 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:40,549 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 100000); {7985#true} is VALID [2018-11-23 12:27:40,549 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:40,549 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:40,549 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7985#true} #70#return; {7985#true} is VALID [2018-11-23 12:27:40,549 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:40,549 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:40,550 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:40,550 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,550 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:40,550 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,550 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:40,550 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,550 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:40,550 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,550 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:40,551 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 100000);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:40,551 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:40,551 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 100000); {7985#true} is VALID [2018-11-23 12:27:40,551 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:40,551 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:40,551 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7985#true} #72#return; {7985#true} is VALID [2018-11-23 12:27:40,551 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:40,551 INFO L273 TraceCheckUtils]: 71: Hoare triple {7985#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,552 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:40,552 INFO L273 TraceCheckUtils]: 73: Hoare triple {7985#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,552 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:40,552 INFO L273 TraceCheckUtils]: 75: Hoare triple {7985#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,552 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:40,552 INFO L273 TraceCheckUtils]: 77: Hoare triple {7985#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,552 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:40,552 INFO L273 TraceCheckUtils]: 79: Hoare triple {7985#true} assume !(~i~2 < 99999); {7985#true} is VALID [2018-11-23 12:27:40,552 INFO L273 TraceCheckUtils]: 80: Hoare triple {7985#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:27:40,553 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:40,553 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:40,553 INFO L273 TraceCheckUtils]: 83: Hoare triple {8252#(<= mapavg_~i~0 0)} assume !!(~i~0 < 100000);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:40,554 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:40,554 INFO L273 TraceCheckUtils]: 85: Hoare triple {8259#(<= mapavg_~i~0 1)} assume !!(~i~0 < 100000);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:40,555 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:40,555 INFO L273 TraceCheckUtils]: 87: Hoare triple {8266#(<= mapavg_~i~0 2)} assume !!(~i~0 < 100000);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:40,555 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:40,556 INFO L273 TraceCheckUtils]: 89: Hoare triple {8273#(<= mapavg_~i~0 3)} assume !!(~i~0 < 100000);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:40,556 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:40,556 INFO L273 TraceCheckUtils]: 91: Hoare triple {8280#(<= mapavg_~i~0 4)} assume !!(~i~0 < 100000);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:40,557 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:40,558 INFO L273 TraceCheckUtils]: 93: Hoare triple {8287#(<= mapavg_~i~0 5)} assume !(~i~0 < 100000); {7986#false} is VALID [2018-11-23 12:27:40,558 INFO L273 TraceCheckUtils]: 94: Hoare triple {7986#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {7986#false} is VALID [2018-11-23 12:27:40,558 INFO L273 TraceCheckUtils]: 95: Hoare triple {7986#false} assume true; {7986#false} is VALID [2018-11-23 12:27:40,558 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7986#false} {7985#true} #74#return; {7986#false} is VALID [2018-11-23 12:27:40,559 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:40,559 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:40,559 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:27:40,563 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:40,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:40,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2018-11-23 12:27:40,583 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:27:40,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:40,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:27:40,666 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:40,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:27:40,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:27:40,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:40,668 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2018-11-23 12:27:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:41,017 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-23 12:27:41,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:27:41,018 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:27:41,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:27:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:27:41,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 100 transitions. [2018-11-23 12:27:41,165 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:41,168 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:27:41,168 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:27:41,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:41,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:27:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:27:41,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:41,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 12:27:41,194 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 12:27:41,194 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 12:27:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:41,196 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:27:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:27:41,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:41,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:41,197 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 12:27:41,197 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 12:27:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:41,198 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:27:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:27:41,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:41,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:41,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:41,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:27:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 12:27:41,201 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2018-11-23 12:27:41,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:41,201 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 12:27:41,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:27:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 12:27:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:27:41,203 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:41,203 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:41,203 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:41,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:41,203 INFO L82 PathProgramCache]: Analyzing trace with hash -261735289, now seen corresponding path program 16 times [2018-11-23 12:27:41,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:41,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:41,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:41,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:41,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:41,652 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:27:41,652 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:41,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:41,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:27:41,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret12 := main(); {8737#true} is VALID [2018-11-23 12:27:41,653 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:41,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {8739#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:41,653 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:41,654 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:41,654 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:41,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:41,655 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:41,655 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:41,656 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:41,656 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:41,657 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:41,658 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:41,658 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:41,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:41,660 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:41,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:41,661 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:41,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:41,662 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:41,663 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:41,664 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:41,664 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:41,665 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:41,665 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:41,666 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:41,667 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:41,667 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:41,668 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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:41,669 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:41,669 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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:41,670 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:41,670 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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:41,671 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:41,672 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 100000); {8738#false} is VALID [2018-11-23 12:27:41,672 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:41,672 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:41,673 INFO L273 TraceCheckUtils]: 41: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,673 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:41,673 INFO L273 TraceCheckUtils]: 43: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,673 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:41,673 INFO L273 TraceCheckUtils]: 45: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,674 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:41,674 INFO L273 TraceCheckUtils]: 47: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,674 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:41,674 INFO L273 TraceCheckUtils]: 49: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,674 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:41,675 INFO L273 TraceCheckUtils]: 51: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,675 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:41,675 INFO L273 TraceCheckUtils]: 53: Hoare triple {8737#true} assume !(~i~0 < 100000); {8737#true} is VALID [2018-11-23 12:27:41,675 INFO L273 TraceCheckUtils]: 54: Hoare triple {8737#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:27:41,675 INFO L273 TraceCheckUtils]: 55: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:41,676 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8737#true} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:27:41,676 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:41,676 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:41,676 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:41,676 INFO L273 TraceCheckUtils]: 60: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,676 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:41,676 INFO L273 TraceCheckUtils]: 62: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,676 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:41,677 INFO L273 TraceCheckUtils]: 64: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,677 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:41,677 INFO L273 TraceCheckUtils]: 66: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,677 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:41,677 INFO L273 TraceCheckUtils]: 68: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,677 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:41,677 INFO L273 TraceCheckUtils]: 70: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,677 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:41,677 INFO L273 TraceCheckUtils]: 72: Hoare triple {8737#true} assume !(~i~0 < 100000); {8737#true} is VALID [2018-11-23 12:27:41,678 INFO L273 TraceCheckUtils]: 73: Hoare triple {8737#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:27:41,678 INFO L273 TraceCheckUtils]: 74: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:41,678 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8737#true} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:27:41,678 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:41,678 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:41,678 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:41,678 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:41,678 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:41,678 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:41,679 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:41,679 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:41,679 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:41,679 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 99999); {8738#false} is VALID [2018-11-23 12:27:41,679 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:27:41,679 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:41,679 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:41,679 INFO L273 TraceCheckUtils]: 89: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,679 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:41,680 INFO L273 TraceCheckUtils]: 91: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,680 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:41,680 INFO L273 TraceCheckUtils]: 93: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,680 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:41,680 INFO L273 TraceCheckUtils]: 95: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,680 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:41,680 INFO L273 TraceCheckUtils]: 97: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,680 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:41,681 INFO L273 TraceCheckUtils]: 99: Hoare triple {8737#true} assume !!(~i~0 < 100000);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:41,681 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:41,681 INFO L273 TraceCheckUtils]: 101: Hoare triple {8737#true} assume !(~i~0 < 100000); {8737#true} is VALID [2018-11-23 12:27:41,681 INFO L273 TraceCheckUtils]: 102: Hoare triple {8737#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:27:41,681 INFO L273 TraceCheckUtils]: 103: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:41,681 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8737#true} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:27:41,681 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:41,681 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:41,681 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:27:41,687 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:41,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:41,687 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:41,697 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:41,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:41,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:41,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:41,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:27:41,990 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:41,990 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:41,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:27:41,991 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret12 := main(); {8737#true} is VALID [2018-11-23 12:27:41,991 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:41,992 INFO L273 TraceCheckUtils]: 6: Hoare triple {8774#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:41,992 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:41,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:41,993 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:41,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:41,994 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:41,994 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:41,995 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:41,995 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:41,996 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:41,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:41,997 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:41,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:41,999 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:41,999 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:42,000 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:42,000 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:42,001 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:42,002 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:42,002 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:42,003 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:42,004 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:42,004 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:42,005 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:42,005 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:42,006 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:42,007 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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:42,007 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:42,008 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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:42,008 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:42,009 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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:42,010 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:42,010 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 100000); {8738#false} is VALID [2018-11-23 12:27:42,011 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:42,011 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:42,011 INFO L273 TraceCheckUtils]: 41: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,011 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:42,011 INFO L273 TraceCheckUtils]: 43: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,012 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:42,012 INFO L273 TraceCheckUtils]: 45: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,012 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:42,012 INFO L273 TraceCheckUtils]: 47: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,012 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:42,012 INFO L273 TraceCheckUtils]: 49: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,013 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:42,013 INFO L273 TraceCheckUtils]: 51: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,013 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:42,013 INFO L273 TraceCheckUtils]: 53: Hoare triple {8738#false} assume !(~i~0 < 100000); {8738#false} is VALID [2018-11-23 12:27:42,013 INFO L273 TraceCheckUtils]: 54: Hoare triple {8738#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:27:42,013 INFO L273 TraceCheckUtils]: 55: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:27:42,013 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8738#false} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:27:42,013 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:42,013 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:42,014 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:42,014 INFO L273 TraceCheckUtils]: 60: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,014 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:42,014 INFO L273 TraceCheckUtils]: 62: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,014 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:42,014 INFO L273 TraceCheckUtils]: 64: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,014 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:42,014 INFO L273 TraceCheckUtils]: 66: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,015 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:42,015 INFO L273 TraceCheckUtils]: 68: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,015 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:42,015 INFO L273 TraceCheckUtils]: 70: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,015 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:42,015 INFO L273 TraceCheckUtils]: 72: Hoare triple {8738#false} assume !(~i~0 < 100000); {8738#false} is VALID [2018-11-23 12:27:42,015 INFO L273 TraceCheckUtils]: 73: Hoare triple {8738#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:27:42,015 INFO L273 TraceCheckUtils]: 74: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:27:42,015 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8738#false} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:27:42,016 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:42,016 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:42,016 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:42,016 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:42,016 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:42,016 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:42,016 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:42,016 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:42,016 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:42,017 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 99999); {8738#false} is VALID [2018-11-23 12:27:42,017 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:27:42,017 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:42,017 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:42,017 INFO L273 TraceCheckUtils]: 89: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,017 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:42,017 INFO L273 TraceCheckUtils]: 91: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,017 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:42,018 INFO L273 TraceCheckUtils]: 93: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,018 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:42,018 INFO L273 TraceCheckUtils]: 95: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,018 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:42,018 INFO L273 TraceCheckUtils]: 97: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,018 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:42,018 INFO L273 TraceCheckUtils]: 99: Hoare triple {8738#false} assume !!(~i~0 < 100000);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:42,018 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:42,018 INFO L273 TraceCheckUtils]: 101: Hoare triple {8738#false} assume !(~i~0 < 100000); {8738#false} is VALID [2018-11-23 12:27:42,019 INFO L273 TraceCheckUtils]: 102: Hoare triple {8738#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:27:42,019 INFO L273 TraceCheckUtils]: 103: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:27:42,019 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8738#false} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:27:42,019 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:42,019 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:42,019 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:27:42,024 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:42,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:42,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:27:42,046 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:27:42,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:42,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:27:42,117 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:42,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:27:42,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:27:42,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:27:42,118 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2018-11-23 12:27:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:42,619 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-23 12:27:42,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:42,619 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:27:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:27:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:27:42,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:27:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:27:42,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 86 transitions. [2018-11-23 12:27:42,817 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:42,819 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:27:42,819 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:27:42,820 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:42,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:27:42,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 12:27:42,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:42,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 12:27:42,846 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 12:27:42,846 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 12:27:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:42,847 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:27:42,847 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:27:42,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:42,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:42,848 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 12:27:42,848 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 12:27:42,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:42,849 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:27:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:27:42,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:42,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:42,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:42,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:27:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 12:27:42,852 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2018-11-23 12:27:42,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:42,852 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 12:27:42,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:27:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:27:42,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 12:27:42,853 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:42,853 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:42,854 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:42,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:42,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1057421335, now seen corresponding path program 17 times [2018-11-23 12:27:42,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:42,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:42,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:42,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:42,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:43,564 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:27:43,565 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:43,565 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:43,565 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:27:43,565 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret12 := main(); {9519#true} is VALID [2018-11-23 12:27:43,566 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:43,566 INFO L273 TraceCheckUtils]: 6: Hoare triple {9521#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:43,567 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:43,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {9522#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:43,568 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:43,568 INFO L273 TraceCheckUtils]: 10: Hoare triple {9523#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:43,568 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:43,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {9524#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:43,569 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:43,570 INFO L273 TraceCheckUtils]: 14: Hoare triple {9525#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:43,570 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:43,571 INFO L273 TraceCheckUtils]: 16: Hoare triple {9526#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:43,572 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:43,572 INFO L273 TraceCheckUtils]: 18: Hoare triple {9527#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:43,573 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:43,573 INFO L273 TraceCheckUtils]: 20: Hoare triple {9528#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:43,574 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:43,575 INFO L273 TraceCheckUtils]: 22: Hoare triple {9529#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:43,576 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:43,576 INFO L273 TraceCheckUtils]: 24: Hoare triple {9530#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:43,577 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:43,577 INFO L273 TraceCheckUtils]: 26: Hoare triple {9531#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:43,578 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:43,581 INFO L273 TraceCheckUtils]: 28: Hoare triple {9532#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:43,581 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:43,582 INFO L273 TraceCheckUtils]: 30: Hoare triple {9533#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:43,582 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:43,582 INFO L273 TraceCheckUtils]: 32: Hoare triple {9534#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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:43,583 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:43,583 INFO L273 TraceCheckUtils]: 34: Hoare triple {9535#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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:43,583 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:43,584 INFO L273 TraceCheckUtils]: 36: Hoare triple {9536#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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:43,584 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:43,585 INFO L273 TraceCheckUtils]: 38: Hoare triple {9537#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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:43,585 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:43,585 INFO L273 TraceCheckUtils]: 40: Hoare triple {9538#(<= main_~i~1 17)} assume !(~i~1 < 100000); {9520#false} is VALID [2018-11-23 12:27:43,586 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:43,586 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:43,586 INFO L273 TraceCheckUtils]: 43: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,586 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:43,587 INFO L273 TraceCheckUtils]: 45: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,587 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:43,587 INFO L273 TraceCheckUtils]: 47: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,587 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:43,587 INFO L273 TraceCheckUtils]: 49: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,588 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:43,588 INFO L273 TraceCheckUtils]: 51: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,588 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:43,588 INFO L273 TraceCheckUtils]: 53: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,588 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:43,589 INFO L273 TraceCheckUtils]: 55: Hoare triple {9519#true} assume !(~i~0 < 100000); {9519#true} is VALID [2018-11-23 12:27:43,589 INFO L273 TraceCheckUtils]: 56: Hoare triple {9519#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:27:43,589 INFO L273 TraceCheckUtils]: 57: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:43,589 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9519#true} {9520#false} #70#return; {9520#false} is VALID [2018-11-23 12:27:43,589 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:43,589 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:43,590 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:43,590 INFO L273 TraceCheckUtils]: 62: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,590 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:43,590 INFO L273 TraceCheckUtils]: 64: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,590 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:43,590 INFO L273 TraceCheckUtils]: 66: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,590 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:43,590 INFO L273 TraceCheckUtils]: 68: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,590 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:43,591 INFO L273 TraceCheckUtils]: 70: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,591 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:43,591 INFO L273 TraceCheckUtils]: 72: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,591 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:43,591 INFO L273 TraceCheckUtils]: 74: Hoare triple {9519#true} assume !(~i~0 < 100000); {9519#true} is VALID [2018-11-23 12:27:43,591 INFO L273 TraceCheckUtils]: 75: Hoare triple {9519#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:27:43,591 INFO L273 TraceCheckUtils]: 76: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:43,591 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9519#true} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:27:43,591 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:43,592 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:43,592 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:43,592 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:43,592 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:43,592 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:43,592 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:43,592 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:43,592 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:43,592 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 99999); {9520#false} is VALID [2018-11-23 12:27:43,593 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:27:43,593 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:43,593 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:43,593 INFO L273 TraceCheckUtils]: 91: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,593 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:43,593 INFO L273 TraceCheckUtils]: 93: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,593 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:43,593 INFO L273 TraceCheckUtils]: 95: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,594 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:43,594 INFO L273 TraceCheckUtils]: 97: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,594 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:43,594 INFO L273 TraceCheckUtils]: 99: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,594 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:43,594 INFO L273 TraceCheckUtils]: 101: Hoare triple {9519#true} assume !!(~i~0 < 100000);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:43,594 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:43,594 INFO L273 TraceCheckUtils]: 103: Hoare triple {9519#true} assume !(~i~0 < 100000); {9519#true} is VALID [2018-11-23 12:27:43,594 INFO L273 TraceCheckUtils]: 104: Hoare triple {9519#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:27:43,595 INFO L273 TraceCheckUtils]: 105: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:43,595 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9519#true} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:27:43,595 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:43,595 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:43,595 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:27:43,600 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:43,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:43,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:43,609 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:44,497 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-23 12:27:44,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:44,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:44,859 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:27:44,860 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:44,860 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:44,860 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:27:44,861 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret12 := main(); {9519#true} is VALID [2018-11-23 12:27:44,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9519#true} is VALID [2018-11-23 12:27:44,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,861 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:44,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,862 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:44,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,863 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:44,863 INFO L273 TraceCheckUtils]: 12: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,863 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:44,863 INFO L273 TraceCheckUtils]: 14: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,863 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:44,863 INFO L273 TraceCheckUtils]: 16: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,864 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:44,864 INFO L273 TraceCheckUtils]: 18: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,864 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:44,864 INFO L273 TraceCheckUtils]: 20: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,864 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:44,865 INFO L273 TraceCheckUtils]: 22: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,865 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:44,865 INFO L273 TraceCheckUtils]: 24: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,865 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:44,865 INFO L273 TraceCheckUtils]: 26: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,865 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:44,866 INFO L273 TraceCheckUtils]: 28: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,866 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:44,866 INFO L273 TraceCheckUtils]: 30: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,866 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:44,866 INFO L273 TraceCheckUtils]: 32: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,866 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:44,867 INFO L273 TraceCheckUtils]: 34: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,867 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:44,867 INFO L273 TraceCheckUtils]: 36: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,867 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:44,867 INFO L273 TraceCheckUtils]: 38: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -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:44,867 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:44,868 INFO L273 TraceCheckUtils]: 40: Hoare triple {9519#true} assume !(~i~1 < 100000); {9519#true} is VALID [2018-11-23 12:27:44,868 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:44,890 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:44,893 INFO L273 TraceCheckUtils]: 43: Hoare triple {9668#(<= mapavg_~i~0 0)} assume !!(~i~0 < 100000);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:44,894 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:44,894 INFO L273 TraceCheckUtils]: 45: Hoare triple {9675#(<= mapavg_~i~0 1)} assume !!(~i~0 < 100000);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:44,894 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:44,895 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= mapavg_~i~0 2)} assume !!(~i~0 < 100000);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:44,895 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:44,896 INFO L273 TraceCheckUtils]: 49: Hoare triple {9689#(<= mapavg_~i~0 3)} assume !!(~i~0 < 100000);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:44,896 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:44,896 INFO L273 TraceCheckUtils]: 51: Hoare triple {9696#(<= mapavg_~i~0 4)} assume !!(~i~0 < 100000);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:44,897 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:44,897 INFO L273 TraceCheckUtils]: 53: Hoare triple {9703#(<= mapavg_~i~0 5)} assume !!(~i~0 < 100000);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:44,898 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:44,899 INFO L273 TraceCheckUtils]: 55: Hoare triple {9710#(<= mapavg_~i~0 6)} assume !(~i~0 < 100000); {9520#false} is VALID [2018-11-23 12:27:44,899 INFO L273 TraceCheckUtils]: 56: Hoare triple {9520#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:27:44,899 INFO L273 TraceCheckUtils]: 57: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:27:44,899 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9520#false} {9519#true} #70#return; {9520#false} is VALID [2018-11-23 12:27:44,900 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:44,900 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:44,900 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:44,900 INFO L273 TraceCheckUtils]: 62: Hoare triple {9520#false} assume !!(~i~0 < 100000);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:44,900 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:44,901 INFO L273 TraceCheckUtils]: 64: Hoare triple {9520#false} assume !!(~i~0 < 100000);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:44,901 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:44,901 INFO L273 TraceCheckUtils]: 66: Hoare triple {9520#false} assume !!(~i~0 < 100000);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:44,901 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:44,901 INFO L273 TraceCheckUtils]: 68: Hoare triple {9520#false} assume !!(~i~0 < 100000);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:44,902 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:44,902 INFO L273 TraceCheckUtils]: 70: Hoare triple {9520#false} assume !!(~i~0 < 100000);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:44,902 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:44,902 INFO L273 TraceCheckUtils]: 72: Hoare triple {9520#false} assume !!(~i~0 < 100000);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:44,902 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:44,903 INFO L273 TraceCheckUtils]: 74: Hoare triple {9520#false} assume !(~i~0 < 100000); {9520#false} is VALID [2018-11-23 12:27:44,903 INFO L273 TraceCheckUtils]: 75: Hoare triple {9520#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:27:44,903 INFO L273 TraceCheckUtils]: 76: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:27:44,903 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9520#false} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:27:44,903 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:44,904 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:44,904 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:44,904 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:44,904 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:44,904 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:44,904 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:44,904 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:44,904 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:44,905 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 99999); {9520#false} is VALID [2018-11-23 12:27:44,905 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:27:44,905 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:44,905 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:44,905 INFO L273 TraceCheckUtils]: 91: Hoare triple {9520#false} assume !!(~i~0 < 100000);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:44,905 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:44,905 INFO L273 TraceCheckUtils]: 93: Hoare triple {9520#false} assume !!(~i~0 < 100000);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:44,905 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:44,905 INFO L273 TraceCheckUtils]: 95: Hoare triple {9520#false} assume !!(~i~0 < 100000);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:44,906 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:44,906 INFO L273 TraceCheckUtils]: 97: Hoare triple {9520#false} assume !!(~i~0 < 100000);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:44,906 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:44,906 INFO L273 TraceCheckUtils]: 99: Hoare triple {9520#false} assume !!(~i~0 < 100000);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:44,906 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:44,906 INFO L273 TraceCheckUtils]: 101: Hoare triple {9520#false} assume !!(~i~0 < 100000);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:44,906 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:44,906 INFO L273 TraceCheckUtils]: 103: Hoare triple {9520#false} assume !(~i~0 < 100000); {9520#false} is VALID [2018-11-23 12:27:44,906 INFO L273 TraceCheckUtils]: 104: Hoare triple {9520#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:27:44,907 INFO L273 TraceCheckUtils]: 105: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:27:44,907 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9520#false} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:27:44,907 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:44,907 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:44,907 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:27:44,912 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:44,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:44,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-23 12:27:44,933 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:27:44,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:44,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:27:45,033 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:45,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:27:45,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:27:45,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:27:45,034 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2018-11-23 12:27:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:45,975 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-11-23 12:27:45,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:27:45,976 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:27:45,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:27:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:27:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:27:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:27:45,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 106 transitions. [2018-11-23 12:27:46,098 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:46,100 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:27:46,100 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:27:46,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:27:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:27:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 12:27:46,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:46,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 12:27:46,196 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 12:27:46,196 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 12:27:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:46,198 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:27:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:27:46,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:46,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:46,200 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 12:27:46,200 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 12:27:46,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:46,201 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:27:46,202 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:27:46,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:46,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:46,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:46,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:46,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:27:46,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 12:27:46,204 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2018-11-23 12:27:46,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:46,204 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 12:27:46,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:27:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:27:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:27:46,206 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:46,206 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:46,206 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:46,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:46,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1308787753, now seen corresponding path program 18 times [2018-11-23 12:27:46,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:46,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:46,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:46,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:46,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:47,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:27:47,116 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:47,117 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:47,117 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:27:47,117 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret12 := main(); {10337#true} is VALID [2018-11-23 12:27:47,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:47,118 INFO L273 TraceCheckUtils]: 6: Hoare triple {10339#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:47,119 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:47,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {10340#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:47,120 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:47,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {10341#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:47,120 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:47,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {10342#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:47,121 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:47,121 INFO L273 TraceCheckUtils]: 14: Hoare triple {10343#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:47,122 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:47,122 INFO L273 TraceCheckUtils]: 16: Hoare triple {10344#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:47,123 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:47,124 INFO L273 TraceCheckUtils]: 18: Hoare triple {10345#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:47,124 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:47,125 INFO L273 TraceCheckUtils]: 20: Hoare triple {10346#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:47,128 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:47,128 INFO L273 TraceCheckUtils]: 22: Hoare triple {10347#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:47,130 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:47,131 INFO L273 TraceCheckUtils]: 24: Hoare triple {10348#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:47,131 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:47,132 INFO L273 TraceCheckUtils]: 26: Hoare triple {10349#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:47,132 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:47,132 INFO L273 TraceCheckUtils]: 28: Hoare triple {10350#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:47,133 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:47,133 INFO L273 TraceCheckUtils]: 30: Hoare triple {10351#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:47,134 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:47,134 INFO L273 TraceCheckUtils]: 32: Hoare triple {10352#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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:47,138 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:47,139 INFO L273 TraceCheckUtils]: 34: Hoare triple {10353#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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:47,139 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:47,140 INFO L273 TraceCheckUtils]: 36: Hoare triple {10354#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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:47,140 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:47,140 INFO L273 TraceCheckUtils]: 38: Hoare triple {10355#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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:47,141 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:47,141 INFO L273 TraceCheckUtils]: 40: Hoare triple {10356#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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:47,142 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:47,142 INFO L273 TraceCheckUtils]: 42: Hoare triple {10357#(<= main_~i~1 18)} assume !(~i~1 < 100000); {10338#false} is VALID [2018-11-23 12:27:47,142 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:47,143 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:47,143 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,143 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:47,143 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,143 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:47,144 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,144 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:47,144 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,144 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:47,144 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,145 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:47,145 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,145 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:47,145 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,145 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:47,145 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 100000); {10337#true} is VALID [2018-11-23 12:27:47,145 INFO L273 TraceCheckUtils]: 60: Hoare triple {10337#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:47,146 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:47,146 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10338#false} #70#return; {10338#false} is VALID [2018-11-23 12:27:47,146 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:47,146 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:47,146 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:47,146 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,146 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:47,146 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,146 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:47,147 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,147 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:47,147 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,147 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:47,147 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,147 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:47,147 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,147 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:47,147 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,148 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:47,148 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 100000); {10337#true} is VALID [2018-11-23 12:27:47,148 INFO L273 TraceCheckUtils]: 81: Hoare triple {10337#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:47,148 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:47,148 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10338#false} #72#return; {10338#false} is VALID [2018-11-23 12:27:47,148 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:47,148 INFO L273 TraceCheckUtils]: 85: Hoare triple {10338#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:47,148 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:47,148 INFO L273 TraceCheckUtils]: 87: Hoare triple {10338#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:47,149 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:47,149 INFO L273 TraceCheckUtils]: 89: Hoare triple {10338#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:47,149 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:47,149 INFO L273 TraceCheckUtils]: 91: Hoare triple {10338#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:47,149 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:47,149 INFO L273 TraceCheckUtils]: 93: Hoare triple {10338#false} assume !(~i~2 < 99999); {10338#false} is VALID [2018-11-23 12:27:47,149 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:27:47,149 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:47,150 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:47,150 INFO L273 TraceCheckUtils]: 97: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,150 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:47,150 INFO L273 TraceCheckUtils]: 99: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,150 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:47,150 INFO L273 TraceCheckUtils]: 101: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,150 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:47,150 INFO L273 TraceCheckUtils]: 103: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,150 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:47,151 INFO L273 TraceCheckUtils]: 105: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,151 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:47,151 INFO L273 TraceCheckUtils]: 107: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,151 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:47,151 INFO L273 TraceCheckUtils]: 109: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,151 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:47,151 INFO L273 TraceCheckUtils]: 111: Hoare triple {10337#true} assume !(~i~0 < 100000); {10337#true} is VALID [2018-11-23 12:27:47,151 INFO L273 TraceCheckUtils]: 112: Hoare triple {10337#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:47,151 INFO L273 TraceCheckUtils]: 113: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:47,152 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10337#true} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:27:47,152 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:47,152 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:47,152 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:27:47,158 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:47,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:47,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:47,169 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:47,574 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:27:47,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:47,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:47,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:27:47,767 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:47,767 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:47,767 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:27:47,768 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret12 := main(); {10337#true} is VALID [2018-11-23 12:27:47,768 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10337#true} is VALID [2018-11-23 12:27:47,768 INFO L273 TraceCheckUtils]: 6: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,768 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:47,768 INFO L273 TraceCheckUtils]: 8: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,768 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:47,769 INFO L273 TraceCheckUtils]: 10: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,769 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:47,769 INFO L273 TraceCheckUtils]: 12: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,769 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:47,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,769 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:47,769 INFO L273 TraceCheckUtils]: 16: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,769 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:47,769 INFO L273 TraceCheckUtils]: 18: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,770 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:47,770 INFO L273 TraceCheckUtils]: 20: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,770 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:47,770 INFO L273 TraceCheckUtils]: 22: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,770 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:47,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,770 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:47,770 INFO L273 TraceCheckUtils]: 26: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,770 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:47,771 INFO L273 TraceCheckUtils]: 28: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,771 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:47,771 INFO L273 TraceCheckUtils]: 30: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,771 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:47,771 INFO L273 TraceCheckUtils]: 32: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,771 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:47,771 INFO L273 TraceCheckUtils]: 34: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,771 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:47,771 INFO L273 TraceCheckUtils]: 36: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,772 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:47,772 INFO L273 TraceCheckUtils]: 38: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,772 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:47,772 INFO L273 TraceCheckUtils]: 40: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -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:47,772 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:47,772 INFO L273 TraceCheckUtils]: 42: Hoare triple {10337#true} assume !(~i~1 < 100000); {10337#true} is VALID [2018-11-23 12:27:47,772 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:47,772 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:47,772 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,773 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:47,773 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,773 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:47,773 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,773 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:47,773 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,773 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:47,773 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,773 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:47,774 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,774 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:47,774 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,774 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:47,774 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 100000); {10337#true} is VALID [2018-11-23 12:27:47,774 INFO L273 TraceCheckUtils]: 60: Hoare triple {10337#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:47,774 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:47,774 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10337#true} #70#return; {10337#true} is VALID [2018-11-23 12:27:47,775 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:47,775 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:47,775 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:47,775 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,775 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:47,775 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,775 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:47,775 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,775 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:47,776 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,776 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:47,776 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,776 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:47,776 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,776 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:47,776 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 100000);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:47,776 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:47,776 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 100000); {10337#true} is VALID [2018-11-23 12:27:47,777 INFO L273 TraceCheckUtils]: 81: Hoare triple {10337#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:47,777 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:47,777 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10337#true} #72#return; {10337#true} is VALID [2018-11-23 12:27:47,777 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:47,778 INFO L273 TraceCheckUtils]: 85: Hoare triple {10613#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:47,778 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:47,778 INFO L273 TraceCheckUtils]: 87: Hoare triple {10620#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:47,779 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:47,779 INFO L273 TraceCheckUtils]: 89: Hoare triple {10627#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:47,780 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:47,780 INFO L273 TraceCheckUtils]: 91: Hoare triple {10634#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:47,780 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:47,781 INFO L273 TraceCheckUtils]: 93: Hoare triple {10641#(<= main_~i~2 4)} assume !(~i~2 < 99999); {10338#false} is VALID [2018-11-23 12:27:47,781 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:27:47,781 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:47,781 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:47,781 INFO L273 TraceCheckUtils]: 97: Hoare triple {10338#false} assume !!(~i~0 < 100000);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:47,782 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:47,782 INFO L273 TraceCheckUtils]: 99: Hoare triple {10338#false} assume !!(~i~0 < 100000);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:47,782 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:47,782 INFO L273 TraceCheckUtils]: 101: Hoare triple {10338#false} assume !!(~i~0 < 100000);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:47,782 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:47,783 INFO L273 TraceCheckUtils]: 103: Hoare triple {10338#false} assume !!(~i~0 < 100000);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:47,783 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:47,783 INFO L273 TraceCheckUtils]: 105: Hoare triple {10338#false} assume !!(~i~0 < 100000);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:47,783 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:47,783 INFO L273 TraceCheckUtils]: 107: Hoare triple {10338#false} assume !!(~i~0 < 100000);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:47,783 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:47,783 INFO L273 TraceCheckUtils]: 109: Hoare triple {10338#false} assume !!(~i~0 < 100000);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:47,784 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:47,784 INFO L273 TraceCheckUtils]: 111: Hoare triple {10338#false} assume !(~i~0 < 100000); {10338#false} is VALID [2018-11-23 12:27:47,784 INFO L273 TraceCheckUtils]: 112: Hoare triple {10338#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {10338#false} is VALID [2018-11-23 12:27:47,784 INFO L273 TraceCheckUtils]: 113: Hoare triple {10338#false} assume true; {10338#false} is VALID [2018-11-23 12:27:47,784 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10338#false} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:27:47,784 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:47,784 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:47,784 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:27:47,790 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:47,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:47,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2018-11-23 12:27:47,812 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:27:47,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:47,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:27:47,902 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:47,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:27:47,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:27:47,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:47,903 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2018-11-23 12:27:48,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:48,815 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-11-23 12:27:48,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:27:48,815 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:27:48,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:27:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:27:48,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 101 transitions. [2018-11-23 12:27:49,126 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:49,128 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:27:49,128 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 12:27:49,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 12:27:49,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-23 12:27:49,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:49,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 85 states. [2018-11-23 12:27:49,157 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 85 states. [2018-11-23 12:27:49,157 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 85 states. [2018-11-23 12:27:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:49,160 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:27:49,160 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:27:49,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:49,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:49,161 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 87 states. [2018-11-23 12:27:49,161 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 87 states. [2018-11-23 12:27:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:49,162 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:27:49,162 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:27:49,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:49,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:49,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:49,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:27:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-23 12:27:49,164 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2018-11-23 12:27:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:49,164 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-23 12:27:49,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:27:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-23 12:27:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 12:27:49,165 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:49,165 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:49,165 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:49,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:49,166 INFO L82 PathProgramCache]: Analyzing trace with hash -242984311, now seen corresponding path program 19 times [2018-11-23 12:27:49,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:49,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:49,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:49,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:49,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:50,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:27:50,570 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:50,570 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:50,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:27:50,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret12 := main(); {11201#true} is VALID [2018-11-23 12:27:50,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:50,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {11203#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:50,572 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:50,572 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:50,573 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:50,573 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:50,574 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:50,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:50,575 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:50,576 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:50,577 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:50,577 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:50,578 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:50,579 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:50,579 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:50,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:50,580 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:50,581 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:50,582 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:50,582 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:50,583 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:50,584 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:50,584 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:50,585 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:50,586 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:50,586 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:50,587 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:50,587 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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:50,588 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:50,589 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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:50,589 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:50,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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:50,591 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:50,591 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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:50,592 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:50,592 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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:50,593 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:50,594 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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:50,594 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:50,595 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 100000); {11202#false} is VALID [2018-11-23 12:27:50,595 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:50,595 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:50,596 INFO L273 TraceCheckUtils]: 47: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,596 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:50,596 INFO L273 TraceCheckUtils]: 49: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,596 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:50,596 INFO L273 TraceCheckUtils]: 51: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,597 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:50,597 INFO L273 TraceCheckUtils]: 53: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,597 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:50,597 INFO L273 TraceCheckUtils]: 55: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,597 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:50,598 INFO L273 TraceCheckUtils]: 57: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,598 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:50,598 INFO L273 TraceCheckUtils]: 59: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,598 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:50,598 INFO L273 TraceCheckUtils]: 61: Hoare triple {11201#true} assume !(~i~0 < 100000); {11201#true} is VALID [2018-11-23 12:27:50,599 INFO L273 TraceCheckUtils]: 62: Hoare triple {11201#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:27:50,599 INFO L273 TraceCheckUtils]: 63: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:50,599 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11201#true} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:27:50,599 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:50,599 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:50,600 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:50,600 INFO L273 TraceCheckUtils]: 68: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,600 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:50,600 INFO L273 TraceCheckUtils]: 70: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,600 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:50,600 INFO L273 TraceCheckUtils]: 72: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,600 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:50,600 INFO L273 TraceCheckUtils]: 74: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,600 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:50,601 INFO L273 TraceCheckUtils]: 76: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,601 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:50,601 INFO L273 TraceCheckUtils]: 78: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,601 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:50,601 INFO L273 TraceCheckUtils]: 80: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,601 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:50,601 INFO L273 TraceCheckUtils]: 82: Hoare triple {11201#true} assume !(~i~0 < 100000); {11201#true} is VALID [2018-11-23 12:27:50,601 INFO L273 TraceCheckUtils]: 83: Hoare triple {11201#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:27:50,601 INFO L273 TraceCheckUtils]: 84: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:50,602 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11201#true} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:27:50,602 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:50,602 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:50,602 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:50,602 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:50,602 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:50,602 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:50,602 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:50,602 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:50,603 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:50,603 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:50,603 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:50,603 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 99999); {11202#false} is VALID [2018-11-23 12:27:50,603 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:27:50,603 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:50,603 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:50,603 INFO L273 TraceCheckUtils]: 101: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,603 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:50,604 INFO L273 TraceCheckUtils]: 103: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,604 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:50,604 INFO L273 TraceCheckUtils]: 105: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,604 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:50,604 INFO L273 TraceCheckUtils]: 107: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,604 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:50,604 INFO L273 TraceCheckUtils]: 109: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,604 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:50,604 INFO L273 TraceCheckUtils]: 111: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,605 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:50,605 INFO L273 TraceCheckUtils]: 113: Hoare triple {11201#true} assume !!(~i~0 < 100000);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:50,605 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:50,605 INFO L273 TraceCheckUtils]: 115: Hoare triple {11201#true} assume !(~i~0 < 100000); {11201#true} is VALID [2018-11-23 12:27:50,605 INFO L273 TraceCheckUtils]: 116: Hoare triple {11201#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:27:50,605 INFO L273 TraceCheckUtils]: 117: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:50,605 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11201#true} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:27:50,605 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:50,606 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:50,606 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:27:50,612 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:50,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:50,613 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:50,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:50,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:51,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:27:51,006 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:51,007 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:51,007 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:27:51,007 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret12 := main(); {11201#true} is VALID [2018-11-23 12:27:51,008 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:51,008 INFO L273 TraceCheckUtils]: 6: Hoare triple {11241#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:51,009 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:51,009 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:51,010 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:51,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:51,010 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:51,011 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:51,012 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:51,012 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:51,013 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:51,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:51,014 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:51,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:51,015 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:51,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:51,017 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:51,017 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:51,018 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:51,019 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:51,019 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:51,020 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:51,021 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:51,021 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:51,022 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:51,022 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:51,023 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:51,024 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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:51,024 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:51,025 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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:51,026 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:51,026 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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:51,027 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:51,027 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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:51,028 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:51,029 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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:51,029 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:51,030 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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:51,031 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:51,031 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 100000); {11202#false} is VALID [2018-11-23 12:27:51,032 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:51,032 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:51,032 INFO L273 TraceCheckUtils]: 47: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,032 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:51,032 INFO L273 TraceCheckUtils]: 49: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,033 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:51,033 INFO L273 TraceCheckUtils]: 51: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,033 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:51,033 INFO L273 TraceCheckUtils]: 53: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,033 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:51,034 INFO L273 TraceCheckUtils]: 55: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,034 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:51,034 INFO L273 TraceCheckUtils]: 57: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,034 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:51,034 INFO L273 TraceCheckUtils]: 59: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,035 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:51,035 INFO L273 TraceCheckUtils]: 61: Hoare triple {11202#false} assume !(~i~0 < 100000); {11202#false} is VALID [2018-11-23 12:27:51,035 INFO L273 TraceCheckUtils]: 62: Hoare triple {11202#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:27:51,035 INFO L273 TraceCheckUtils]: 63: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:27:51,035 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11202#false} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:27:51,035 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:51,036 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:51,036 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:51,036 INFO L273 TraceCheckUtils]: 68: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,036 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:51,036 INFO L273 TraceCheckUtils]: 70: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,036 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:51,036 INFO L273 TraceCheckUtils]: 72: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,036 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:51,036 INFO L273 TraceCheckUtils]: 74: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,037 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:51,037 INFO L273 TraceCheckUtils]: 76: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,037 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:51,037 INFO L273 TraceCheckUtils]: 78: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,037 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:51,037 INFO L273 TraceCheckUtils]: 80: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,037 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:51,037 INFO L273 TraceCheckUtils]: 82: Hoare triple {11202#false} assume !(~i~0 < 100000); {11202#false} is VALID [2018-11-23 12:27:51,037 INFO L273 TraceCheckUtils]: 83: Hoare triple {11202#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:27:51,038 INFO L273 TraceCheckUtils]: 84: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:27:51,038 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11202#false} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:27:51,038 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:51,038 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,038 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:51,038 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,038 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:51,038 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,038 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:51,039 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,039 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:51,039 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,039 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:51,039 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 99999); {11202#false} is VALID [2018-11-23 12:27:51,039 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:27:51,039 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:51,039 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:51,039 INFO L273 TraceCheckUtils]: 101: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,040 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:51,040 INFO L273 TraceCheckUtils]: 103: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,040 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:51,040 INFO L273 TraceCheckUtils]: 105: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,040 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:51,040 INFO L273 TraceCheckUtils]: 107: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,040 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:51,040 INFO L273 TraceCheckUtils]: 109: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,040 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:51,041 INFO L273 TraceCheckUtils]: 111: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,041 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:51,041 INFO L273 TraceCheckUtils]: 113: Hoare triple {11202#false} assume !!(~i~0 < 100000);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:51,041 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:51,041 INFO L273 TraceCheckUtils]: 115: Hoare triple {11202#false} assume !(~i~0 < 100000); {11202#false} is VALID [2018-11-23 12:27:51,041 INFO L273 TraceCheckUtils]: 116: Hoare triple {11202#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:27:51,041 INFO L273 TraceCheckUtils]: 117: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:27:51,041 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11202#false} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:27:51,041 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:51,042 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:51,042 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:27:51,049 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:51,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:51,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:27:51,068 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:27:51,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:51,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:27:51,144 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:51,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:27:51,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:27:51,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:27:51,145 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2018-11-23 12:27:51,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:51,760 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-23 12:27:51,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:27:51,760 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:27:51,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:27:51,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:27:51,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:27:51,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:27:51,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 92 transitions. [2018-11-23 12:27:51,924 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:51,926 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:27:51,926 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:27:51,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:27:51,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:27:51,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 12:27:51,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:51,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 12:27:51,957 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 12:27:51,958 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 12:27:51,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:51,959 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:27:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:27:51,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:51,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:51,960 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 12:27:51,960 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 12:27:51,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:51,961 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:27:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:27:51,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:51,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:51,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:51,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:27:51,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-23 12:27:51,964 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2018-11-23 12:27:51,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:51,964 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-23 12:27:51,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:27:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:27:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:27:51,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:51,965 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:51,966 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:51,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:51,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1110011285, now seen corresponding path program 20 times [2018-11-23 12:27:51,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:51,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:51,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:51,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:51,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:52,701 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:27:52,702 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:52,702 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:52,702 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:27:52,702 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret12 := main(); {12084#true} is VALID [2018-11-23 12:27:52,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:52,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {12086#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:52,703 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:52,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:52,705 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:52,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:52,706 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:52,707 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:52,707 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:52,708 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:52,709 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:52,709 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:52,710 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:52,710 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:52,711 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:52,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:52,712 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:52,713 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:52,714 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:52,714 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:52,715 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:52,715 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:52,716 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:52,717 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:52,717 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:52,718 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:52,719 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:52,719 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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:52,720 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:52,720 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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:52,721 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:52,722 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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:52,722 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:52,723 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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:52,724 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:52,724 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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:52,725 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:52,726 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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:52,726 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:52,727 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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:52,728 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:52,728 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 100000); {12085#false} is VALID [2018-11-23 12:27:52,729 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:52,729 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:52,729 INFO L273 TraceCheckUtils]: 49: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,729 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:52,729 INFO L273 TraceCheckUtils]: 51: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,730 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:52,730 INFO L273 TraceCheckUtils]: 53: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,730 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:52,730 INFO L273 TraceCheckUtils]: 55: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,730 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:52,731 INFO L273 TraceCheckUtils]: 57: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,731 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:52,731 INFO L273 TraceCheckUtils]: 59: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,731 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:52,731 INFO L273 TraceCheckUtils]: 61: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,731 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:52,732 INFO L273 TraceCheckUtils]: 63: Hoare triple {12084#true} assume !(~i~0 < 100000); {12084#true} is VALID [2018-11-23 12:27:52,732 INFO L273 TraceCheckUtils]: 64: Hoare triple {12084#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:27:52,732 INFO L273 TraceCheckUtils]: 65: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:52,732 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12084#true} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:27:52,732 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:52,733 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:52,733 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:52,733 INFO L273 TraceCheckUtils]: 70: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,733 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:52,733 INFO L273 TraceCheckUtils]: 72: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,734 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:52,734 INFO L273 TraceCheckUtils]: 74: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,734 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:52,734 INFO L273 TraceCheckUtils]: 76: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,734 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:52,734 INFO L273 TraceCheckUtils]: 78: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,735 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:52,735 INFO L273 TraceCheckUtils]: 80: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,735 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:52,735 INFO L273 TraceCheckUtils]: 82: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,736 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:52,736 INFO L273 TraceCheckUtils]: 84: Hoare triple {12084#true} assume !(~i~0 < 100000); {12084#true} is VALID [2018-11-23 12:27:52,736 INFO L273 TraceCheckUtils]: 85: Hoare triple {12084#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:27:52,736 INFO L273 TraceCheckUtils]: 86: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:52,736 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12084#true} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:27:52,737 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:52,737 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:52,737 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:52,737 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:52,737 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:52,738 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:52,738 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:52,738 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:52,738 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:52,739 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:52,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:52,739 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 99999); {12085#false} is VALID [2018-11-23 12:27:52,739 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:27:52,739 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:52,740 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:52,740 INFO L273 TraceCheckUtils]: 103: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,740 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:52,740 INFO L273 TraceCheckUtils]: 105: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,740 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:52,741 INFO L273 TraceCheckUtils]: 107: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,741 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:52,741 INFO L273 TraceCheckUtils]: 109: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,741 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:52,741 INFO L273 TraceCheckUtils]: 111: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,742 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:52,742 INFO L273 TraceCheckUtils]: 113: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,742 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:52,742 INFO L273 TraceCheckUtils]: 115: Hoare triple {12084#true} assume !!(~i~0 < 100000);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:52,743 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:52,743 INFO L273 TraceCheckUtils]: 117: Hoare triple {12084#true} assume !(~i~0 < 100000); {12084#true} is VALID [2018-11-23 12:27:52,743 INFO L273 TraceCheckUtils]: 118: Hoare triple {12084#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:27:52,743 INFO L273 TraceCheckUtils]: 119: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:52,743 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12084#true} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:27:52,744 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:52,744 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:52,744 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:27:52,758 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:52,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:52,758 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:52,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:52,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:52,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:52,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:53,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:27:53,435 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:53,435 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:53,436 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:27:53,436 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret12 := main(); {12084#true} is VALID [2018-11-23 12:27:53,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:53,437 INFO L273 TraceCheckUtils]: 6: Hoare triple {12125#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:53,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {12125#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:53,439 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:53,440 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:53,441 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:53,441 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:53,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:53,444 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:53,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:53,447 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:53,448 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:53,449 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:53,450 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:53,451 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:53,452 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:53,453 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:53,454 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:53,455 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:53,456 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:53,457 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:53,458 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:53,459 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:53,460 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:53,461 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:53,462 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:53,464 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:53,466 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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:53,466 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:53,469 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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:53,469 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:53,471 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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:53,471 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:53,474 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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:53,474 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:53,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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:53,476 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:53,478 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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:53,478 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:53,480 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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:53,480 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:53,482 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 100000); {12085#false} is VALID [2018-11-23 12:27:53,482 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:53,482 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:53,482 INFO L273 TraceCheckUtils]: 49: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,482 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:53,482 INFO L273 TraceCheckUtils]: 51: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,483 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:53,483 INFO L273 TraceCheckUtils]: 53: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,483 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:53,483 INFO L273 TraceCheckUtils]: 55: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,483 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:53,483 INFO L273 TraceCheckUtils]: 57: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,483 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:53,484 INFO L273 TraceCheckUtils]: 59: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,484 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:53,484 INFO L273 TraceCheckUtils]: 61: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,484 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:53,484 INFO L273 TraceCheckUtils]: 63: Hoare triple {12085#false} assume !(~i~0 < 100000); {12085#false} is VALID [2018-11-23 12:27:53,484 INFO L273 TraceCheckUtils]: 64: Hoare triple {12085#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:27:53,484 INFO L273 TraceCheckUtils]: 65: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:27:53,485 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12085#false} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:27:53,485 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:53,485 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:53,485 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:53,485 INFO L273 TraceCheckUtils]: 70: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,485 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:53,485 INFO L273 TraceCheckUtils]: 72: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,486 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:53,486 INFO L273 TraceCheckUtils]: 74: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,486 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:53,486 INFO L273 TraceCheckUtils]: 76: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,486 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:53,486 INFO L273 TraceCheckUtils]: 78: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,486 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:53,487 INFO L273 TraceCheckUtils]: 80: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,487 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:53,487 INFO L273 TraceCheckUtils]: 82: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,487 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:53,487 INFO L273 TraceCheckUtils]: 84: Hoare triple {12085#false} assume !(~i~0 < 100000); {12085#false} is VALID [2018-11-23 12:27:53,487 INFO L273 TraceCheckUtils]: 85: Hoare triple {12085#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:27:53,487 INFO L273 TraceCheckUtils]: 86: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:27:53,488 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12085#false} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:27:53,488 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:53,488 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:53,488 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:53,488 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:53,488 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:53,488 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:53,489 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:53,489 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:53,489 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:53,489 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:53,489 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:53,489 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 99999); {12085#false} is VALID [2018-11-23 12:27:53,489 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:27:53,490 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:53,490 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:53,490 INFO L273 TraceCheckUtils]: 103: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,490 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:53,490 INFO L273 TraceCheckUtils]: 105: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,490 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:53,490 INFO L273 TraceCheckUtils]: 107: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,491 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:53,491 INFO L273 TraceCheckUtils]: 109: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,491 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:53,491 INFO L273 TraceCheckUtils]: 111: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,491 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:53,491 INFO L273 TraceCheckUtils]: 113: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,491 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:53,492 INFO L273 TraceCheckUtils]: 115: Hoare triple {12085#false} assume !!(~i~0 < 100000);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:53,492 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:53,492 INFO L273 TraceCheckUtils]: 117: Hoare triple {12085#false} assume !(~i~0 < 100000); {12085#false} is VALID [2018-11-23 12:27:53,492 INFO L273 TraceCheckUtils]: 118: Hoare triple {12085#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:27:53,492 INFO L273 TraceCheckUtils]: 119: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:27:53,492 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12085#false} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:27:53,492 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:53,493 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:53,493 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:27:53,526 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:53,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:53,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:27:53,548 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:27:53,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:53,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:27:53,669 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:53,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:27:53,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:27:53,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:53,670 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2018-11-23 12:27:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:54,168 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-23 12:27:54,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:27:54,168 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:27:54,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:27:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:27:54,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 94 transitions. [2018-11-23 12:27:54,310 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:54,312 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:27:54,313 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:27:54,313 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:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:27:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 12:27:54,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:54,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 12:27:54,344 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 12:27:54,344 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 12:27:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:54,346 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:27:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:27:54,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:54,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:54,347 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 12:27:54,347 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 12:27:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:54,348 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:27:54,349 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:27:54,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:54,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:54,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:54,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:27:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-23 12:27:54,351 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-23 12:27:54,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:54,351 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-23 12:27:54,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:27:54,352 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-23 12:27:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:27:54,352 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:54,353 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:54,353 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:54,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:54,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1099277875, now seen corresponding path program 21 times [2018-11-23 12:27:54,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:54,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:54,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:54,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:54,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:54,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:27:54,947 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:54,947 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:54,947 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:27:54,948 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret12 := main(); {12984#true} is VALID [2018-11-23 12:27:54,948 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:54,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {12986#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:54,949 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:54,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {12987#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:54,950 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:54,950 INFO L273 TraceCheckUtils]: 10: Hoare triple {12988#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:54,951 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:54,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {12989#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:54,952 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:54,952 INFO L273 TraceCheckUtils]: 14: Hoare triple {12990#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:54,953 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:54,954 INFO L273 TraceCheckUtils]: 16: Hoare triple {12991#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:54,954 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:54,955 INFO L273 TraceCheckUtils]: 18: Hoare triple {12992#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:54,955 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:54,956 INFO L273 TraceCheckUtils]: 20: Hoare triple {12993#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:54,957 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:54,957 INFO L273 TraceCheckUtils]: 22: Hoare triple {12994#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:54,958 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:54,958 INFO L273 TraceCheckUtils]: 24: Hoare triple {12995#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:54,959 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:54,959 INFO L273 TraceCheckUtils]: 26: Hoare triple {12996#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:54,960 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:54,961 INFO L273 TraceCheckUtils]: 28: Hoare triple {12997#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:54,961 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:54,962 INFO L273 TraceCheckUtils]: 30: Hoare triple {12998#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:54,963 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:54,963 INFO L273 TraceCheckUtils]: 32: Hoare triple {12999#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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:54,964 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:54,964 INFO L273 TraceCheckUtils]: 34: Hoare triple {13000#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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:54,965 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:54,966 INFO L273 TraceCheckUtils]: 36: Hoare triple {13001#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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:54,966 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:54,967 INFO L273 TraceCheckUtils]: 38: Hoare triple {13002#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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:54,968 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:54,968 INFO L273 TraceCheckUtils]: 40: Hoare triple {13003#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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:54,969 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:54,969 INFO L273 TraceCheckUtils]: 42: Hoare triple {13004#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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:54,970 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:54,971 INFO L273 TraceCheckUtils]: 44: Hoare triple {13005#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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:54,971 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:54,972 INFO L273 TraceCheckUtils]: 46: Hoare triple {13006#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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:54,973 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:54,973 INFO L273 TraceCheckUtils]: 48: Hoare triple {13007#(<= main_~i~1 21)} assume !(~i~1 < 100000); {12985#false} is VALID [2018-11-23 12:27:54,973 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:54,974 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:54,974 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,974 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:54,974 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,975 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:54,975 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,975 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:54,975 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,976 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:54,976 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,976 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:54,976 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,977 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:54,977 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,977 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:54,977 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 100000); {12984#true} is VALID [2018-11-23 12:27:54,977 INFO L273 TraceCheckUtils]: 66: Hoare triple {12984#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:27:54,977 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:54,978 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12985#false} #70#return; {12985#false} is VALID [2018-11-23 12:27:54,978 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:54,978 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:54,978 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:54,978 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,978 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:54,979 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,979 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:54,979 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,979 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:54,979 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,979 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:54,980 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,980 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:54,980 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,980 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:54,980 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,980 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:54,980 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 100000); {12984#true} is VALID [2018-11-23 12:27:54,981 INFO L273 TraceCheckUtils]: 87: Hoare triple {12984#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:27:54,981 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:54,981 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12985#false} #72#return; {12985#false} is VALID [2018-11-23 12:27:54,981 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:54,981 INFO L273 TraceCheckUtils]: 91: Hoare triple {12985#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:54,981 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:54,981 INFO L273 TraceCheckUtils]: 93: Hoare triple {12985#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:54,982 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:54,982 INFO L273 TraceCheckUtils]: 95: Hoare triple {12985#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:54,982 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:54,982 INFO L273 TraceCheckUtils]: 97: Hoare triple {12985#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:54,982 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:54,982 INFO L273 TraceCheckUtils]: 99: Hoare triple {12985#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:54,983 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:54,983 INFO L273 TraceCheckUtils]: 101: Hoare triple {12985#false} assume !(~i~2 < 99999); {12985#false} is VALID [2018-11-23 12:27:54,983 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:27:54,983 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:54,983 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:54,983 INFO L273 TraceCheckUtils]: 105: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,983 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:54,984 INFO L273 TraceCheckUtils]: 107: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,984 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:54,984 INFO L273 TraceCheckUtils]: 109: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,984 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:54,984 INFO L273 TraceCheckUtils]: 111: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,984 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:54,985 INFO L273 TraceCheckUtils]: 113: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,985 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:54,985 INFO L273 TraceCheckUtils]: 115: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,985 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:54,985 INFO L273 TraceCheckUtils]: 117: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:54,985 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:54,985 INFO L273 TraceCheckUtils]: 119: Hoare triple {12984#true} assume !(~i~0 < 100000); {12984#true} is VALID [2018-11-23 12:27:54,986 INFO L273 TraceCheckUtils]: 120: Hoare triple {12984#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:27:54,986 INFO L273 TraceCheckUtils]: 121: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:54,986 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12984#true} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:27:54,986 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:54,986 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:54,986 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:27:54,993 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:54,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:54,994 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:55,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:55,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:27:55,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:55,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:55,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:27:55,281 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:55,281 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:55,282 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:27:55,282 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret12 := main(); {12984#true} is VALID [2018-11-23 12:27:55,282 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12984#true} is VALID [2018-11-23 12:27:55,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,282 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:55,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,283 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:55,283 INFO L273 TraceCheckUtils]: 10: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,283 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:55,283 INFO L273 TraceCheckUtils]: 12: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,283 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:55,283 INFO L273 TraceCheckUtils]: 14: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,283 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:55,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,284 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:55,284 INFO L273 TraceCheckUtils]: 18: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,284 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:55,284 INFO L273 TraceCheckUtils]: 20: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,284 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:55,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,284 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:55,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,284 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:55,285 INFO L273 TraceCheckUtils]: 26: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,285 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:55,285 INFO L273 TraceCheckUtils]: 28: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,285 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:55,285 INFO L273 TraceCheckUtils]: 30: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,285 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:55,286 INFO L273 TraceCheckUtils]: 32: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,286 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:55,286 INFO L273 TraceCheckUtils]: 34: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,286 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:55,286 INFO L273 TraceCheckUtils]: 36: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,286 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:55,286 INFO L273 TraceCheckUtils]: 38: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,287 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:55,287 INFO L273 TraceCheckUtils]: 40: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,287 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:55,287 INFO L273 TraceCheckUtils]: 42: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,287 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:55,287 INFO L273 TraceCheckUtils]: 44: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,287 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:55,288 INFO L273 TraceCheckUtils]: 46: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -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:55,288 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:55,288 INFO L273 TraceCheckUtils]: 48: Hoare triple {12984#true} assume !(~i~1 < 100000); {12984#true} is VALID [2018-11-23 12:27:55,288 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:55,288 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:55,288 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:55,288 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:55,288 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:55,289 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:55,289 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:55,289 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:55,289 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:55,289 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:55,289 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:55,289 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:55,289 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:55,289 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:55,289 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:55,290 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:55,290 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 100000); {12984#true} is VALID [2018-11-23 12:27:55,290 INFO L273 TraceCheckUtils]: 66: Hoare triple {12984#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:27:55,290 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:55,290 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12984#true} #70#return; {12984#true} is VALID [2018-11-23 12:27:55,290 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:55,290 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:55,290 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:55,290 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:55,291 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:55,291 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:55,291 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:55,291 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:55,291 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:55,291 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:55,291 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:55,291 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:55,291 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:55,292 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:55,292 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:55,292 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 100000);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:55,292 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:55,292 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 100000); {12984#true} is VALID [2018-11-23 12:27:55,292 INFO L273 TraceCheckUtils]: 87: Hoare triple {12984#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:27:55,292 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:55,292 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12984#true} #72#return; {12984#true} is VALID [2018-11-23 12:27:55,293 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:55,293 INFO L273 TraceCheckUtils]: 91: Hoare triple {13281#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:55,294 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:55,294 INFO L273 TraceCheckUtils]: 93: Hoare triple {13288#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:55,294 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:55,295 INFO L273 TraceCheckUtils]: 95: Hoare triple {13295#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:55,295 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:55,295 INFO L273 TraceCheckUtils]: 97: Hoare triple {13302#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:55,296 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:55,296 INFO L273 TraceCheckUtils]: 99: Hoare triple {13309#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:55,297 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:55,297 INFO L273 TraceCheckUtils]: 101: Hoare triple {13316#(<= main_~i~2 5)} assume !(~i~2 < 99999); {12985#false} is VALID [2018-11-23 12:27:55,297 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:27:55,297 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:55,297 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:55,298 INFO L273 TraceCheckUtils]: 105: Hoare triple {12985#false} assume !!(~i~0 < 100000);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:55,298 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:55,298 INFO L273 TraceCheckUtils]: 107: Hoare triple {12985#false} assume !!(~i~0 < 100000);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:55,298 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:55,298 INFO L273 TraceCheckUtils]: 109: Hoare triple {12985#false} assume !!(~i~0 < 100000);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:55,298 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:55,299 INFO L273 TraceCheckUtils]: 111: Hoare triple {12985#false} assume !!(~i~0 < 100000);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:55,299 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:55,299 INFO L273 TraceCheckUtils]: 113: Hoare triple {12985#false} assume !!(~i~0 < 100000);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:55,299 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:55,299 INFO L273 TraceCheckUtils]: 115: Hoare triple {12985#false} assume !!(~i~0 < 100000);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:55,299 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:55,300 INFO L273 TraceCheckUtils]: 117: Hoare triple {12985#false} assume !!(~i~0 < 100000);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:55,300 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:55,300 INFO L273 TraceCheckUtils]: 119: Hoare triple {12985#false} assume !(~i~0 < 100000); {12985#false} is VALID [2018-11-23 12:27:55,300 INFO L273 TraceCheckUtils]: 120: Hoare triple {12985#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {12985#false} is VALID [2018-11-23 12:27:55,300 INFO L273 TraceCheckUtils]: 121: Hoare triple {12985#false} assume true; {12985#false} is VALID [2018-11-23 12:27:55,300 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12985#false} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:27:55,301 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:55,301 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:55,301 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:27:55,307 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:55,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:55,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2018-11-23 12:27:55,326 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:27:55,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:55,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:27:55,430 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:55,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:27:55,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:27:55,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:27:55,431 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2018-11-23 12:27:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:56,029 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-11-23 12:27:56,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:27:56,030 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:27:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:56,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:27:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:27:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:27:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:27:56,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 109 transitions. [2018-11-23 12:27:56,151 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:56,153 INFO L225 Difference]: With dead ends: 135 [2018-11-23 12:27:56,153 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:27:56,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:27:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:27:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-23 12:27:56,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:56,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 93 states. [2018-11-23 12:27:56,198 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 93 states. [2018-11-23 12:27:56,198 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 93 states. [2018-11-23 12:27:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:56,200 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:27:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:27:56,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:56,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:56,201 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 95 states. [2018-11-23 12:27:56,201 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 95 states. [2018-11-23 12:27:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:56,203 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:27:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:27:56,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:56,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:56,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:56,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 12:27:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-11-23 12:27:56,206 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2018-11-23 12:27:56,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:56,206 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-11-23 12:27:56,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:27:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-23 12:27:56,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:27:56,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:56,207 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:56,207 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:56,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:56,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1514657069, now seen corresponding path program 22 times [2018-11-23 12:27:56,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:56,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:56,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:56,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:56,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:56,687 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:27:56,687 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:56,688 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:56,688 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:27:56,688 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret12 := main(); {13919#true} is VALID [2018-11-23 12:27:56,688 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:56,689 INFO L273 TraceCheckUtils]: 6: Hoare triple {13921#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:56,689 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:56,690 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:56,690 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:56,690 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:56,691 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:56,691 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:56,692 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:56,692 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:56,693 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:56,693 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:56,694 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:56,695 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:56,695 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:56,696 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:56,697 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:56,697 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:56,698 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:56,698 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:56,699 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:56,700 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:56,700 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:56,701 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:56,702 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:56,702 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:56,703 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:56,703 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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:56,704 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:56,705 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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:56,705 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:56,706 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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:56,707 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:56,707 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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:56,708 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:56,708 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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:56,709 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:56,710 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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:56,710 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:56,711 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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:56,712 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:56,712 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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:56,713 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:56,713 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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:56,715 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:56,716 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 100000); {13920#false} is VALID [2018-11-23 12:27:56,716 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:56,716 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:56,716 INFO L273 TraceCheckUtils]: 53: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,717 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:56,717 INFO L273 TraceCheckUtils]: 55: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,717 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:56,717 INFO L273 TraceCheckUtils]: 57: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,717 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:56,717 INFO L273 TraceCheckUtils]: 59: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,718 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:56,718 INFO L273 TraceCheckUtils]: 61: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,718 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:56,718 INFO L273 TraceCheckUtils]: 63: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,718 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:56,718 INFO L273 TraceCheckUtils]: 65: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,718 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:56,719 INFO L273 TraceCheckUtils]: 67: Hoare triple {13919#true} assume !(~i~0 < 100000); {13919#true} is VALID [2018-11-23 12:27:56,719 INFO L273 TraceCheckUtils]: 68: Hoare triple {13919#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:27:56,719 INFO L273 TraceCheckUtils]: 69: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:56,719 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13919#true} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:27:56,719 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:56,719 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:56,719 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:56,719 INFO L273 TraceCheckUtils]: 74: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,719 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:56,720 INFO L273 TraceCheckUtils]: 76: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,720 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:56,720 INFO L273 TraceCheckUtils]: 78: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,720 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:56,720 INFO L273 TraceCheckUtils]: 80: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,720 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:56,720 INFO L273 TraceCheckUtils]: 82: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,720 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:56,720 INFO L273 TraceCheckUtils]: 84: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,721 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:56,721 INFO L273 TraceCheckUtils]: 86: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,721 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:56,721 INFO L273 TraceCheckUtils]: 88: Hoare triple {13919#true} assume !(~i~0 < 100000); {13919#true} is VALID [2018-11-23 12:27:56,721 INFO L273 TraceCheckUtils]: 89: Hoare triple {13919#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:27:56,721 INFO L273 TraceCheckUtils]: 90: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:56,721 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13919#true} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:27:56,721 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:56,721 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:56,722 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:56,722 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:56,722 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:56,722 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:56,722 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:56,722 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:56,722 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:56,722 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:56,722 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:56,722 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:56,723 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:56,723 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 99999); {13920#false} is VALID [2018-11-23 12:27:56,723 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:27:56,723 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:56,723 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:56,723 INFO L273 TraceCheckUtils]: 109: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,723 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:56,723 INFO L273 TraceCheckUtils]: 111: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,723 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:56,724 INFO L273 TraceCheckUtils]: 113: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,724 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:56,724 INFO L273 TraceCheckUtils]: 115: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,724 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:56,724 INFO L273 TraceCheckUtils]: 117: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,724 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:56,724 INFO L273 TraceCheckUtils]: 119: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,724 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:56,724 INFO L273 TraceCheckUtils]: 121: Hoare triple {13919#true} assume !!(~i~0 < 100000);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:56,725 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:56,725 INFO L273 TraceCheckUtils]: 123: Hoare triple {13919#true} assume !(~i~0 < 100000); {13919#true} is VALID [2018-11-23 12:27:56,725 INFO L273 TraceCheckUtils]: 124: Hoare triple {13919#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:27:56,725 INFO L273 TraceCheckUtils]: 125: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:56,725 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13919#true} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:27:56,725 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:56,725 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:56,725 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:27:56,733 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:56,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:56,733 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:56,742 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:56,813 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:56,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:56,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:57,101 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:27:57,101 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:57,101 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:57,102 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:27:57,102 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret12 := main(); {13919#true} is VALID [2018-11-23 12:27:57,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:57,103 INFO L273 TraceCheckUtils]: 6: Hoare triple {13962#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:57,103 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:57,104 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:57,104 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:57,104 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:57,105 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:57,106 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:57,106 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:57,107 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:57,108 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:57,108 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:57,109 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:57,109 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:57,110 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:57,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:57,111 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:57,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:57,112 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:57,113 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:57,114 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:57,114 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:57,115 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:57,116 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:57,116 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:57,117 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:57,118 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:57,118 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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:57,119 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:57,119 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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:57,120 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:57,121 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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:57,121 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:57,122 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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:57,123 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:57,123 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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:57,124 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:57,124 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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:57,125 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:57,126 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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:57,126 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:57,127 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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:57,128 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:57,128 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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:57,129 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:57,129 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 100000); {13920#false} is VALID [2018-11-23 12:27:57,130 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:57,130 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:57,130 INFO L273 TraceCheckUtils]: 53: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,130 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:57,130 INFO L273 TraceCheckUtils]: 55: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,131 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:57,131 INFO L273 TraceCheckUtils]: 57: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,131 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:57,131 INFO L273 TraceCheckUtils]: 59: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,131 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:57,132 INFO L273 TraceCheckUtils]: 61: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,132 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:57,132 INFO L273 TraceCheckUtils]: 63: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,132 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:57,132 INFO L273 TraceCheckUtils]: 65: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,133 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:57,133 INFO L273 TraceCheckUtils]: 67: Hoare triple {13920#false} assume !(~i~0 < 100000); {13920#false} is VALID [2018-11-23 12:27:57,133 INFO L273 TraceCheckUtils]: 68: Hoare triple {13920#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:27:57,133 INFO L273 TraceCheckUtils]: 69: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:27:57,133 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13920#false} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:27:57,133 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:57,133 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:57,133 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:57,134 INFO L273 TraceCheckUtils]: 74: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,134 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:57,134 INFO L273 TraceCheckUtils]: 76: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,134 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:57,134 INFO L273 TraceCheckUtils]: 78: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,134 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:57,134 INFO L273 TraceCheckUtils]: 80: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,134 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:57,134 INFO L273 TraceCheckUtils]: 82: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,135 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:57,135 INFO L273 TraceCheckUtils]: 84: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,135 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:57,135 INFO L273 TraceCheckUtils]: 86: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,135 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:57,135 INFO L273 TraceCheckUtils]: 88: Hoare triple {13920#false} assume !(~i~0 < 100000); {13920#false} is VALID [2018-11-23 12:27:57,135 INFO L273 TraceCheckUtils]: 89: Hoare triple {13920#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:27:57,135 INFO L273 TraceCheckUtils]: 90: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:27:57,135 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13920#false} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:27:57,136 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:57,136 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:57,136 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:57,136 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:57,136 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:57,136 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:57,136 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:57,136 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:57,136 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:57,136 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:57,137 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:57,137 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:57,137 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:57,137 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 99999); {13920#false} is VALID [2018-11-23 12:27:57,137 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:27:57,137 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:57,137 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:57,137 INFO L273 TraceCheckUtils]: 109: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,137 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:57,138 INFO L273 TraceCheckUtils]: 111: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,138 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:57,138 INFO L273 TraceCheckUtils]: 113: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,138 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:57,138 INFO L273 TraceCheckUtils]: 115: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,138 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:57,138 INFO L273 TraceCheckUtils]: 117: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,138 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:57,138 INFO L273 TraceCheckUtils]: 119: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,139 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:57,139 INFO L273 TraceCheckUtils]: 121: Hoare triple {13920#false} assume !!(~i~0 < 100000);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:57,139 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:57,139 INFO L273 TraceCheckUtils]: 123: Hoare triple {13920#false} assume !(~i~0 < 100000); {13920#false} is VALID [2018-11-23 12:27:57,139 INFO L273 TraceCheckUtils]: 124: Hoare triple {13920#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:27:57,139 INFO L273 TraceCheckUtils]: 125: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:27:57,139 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13920#false} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:27:57,139 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:57,139 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:57,140 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:27:57,149 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:57,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:57,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:27:57,168 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:27:57,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:57,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:27:57,352 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:57,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:27:57,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:27:57,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:57,354 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2018-11-23 12:27:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:58,301 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 12:27:58,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:27:58,301 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:27:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:27:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:27:58,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 98 transitions. [2018-11-23 12:27:58,399 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:58,401 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:27:58,401 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:27:58,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:27:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-23 12:27:58,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:58,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-23 12:27:58,460 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-23 12:27:58,460 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-23 12:27:58,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:58,462 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:27:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:27:58,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:58,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:58,463 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-23 12:27:58,463 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-23 12:27:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:58,465 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:27:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:27:58,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:58,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:58,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:58,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:27:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-23 12:27:58,468 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2018-11-23 12:27:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:58,468 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-23 12:27:58,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:27:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:27:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 12:27:58,469 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:58,469 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:58,469 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:58,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:58,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1289554703, now seen corresponding path program 23 times [2018-11-23 12:27:58,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:58,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:58,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:58,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:58,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:59,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:27:59,583 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:59,583 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:27:59,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:27:59,584 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret12 := main(); {14872#true} is VALID [2018-11-23 12:27:59,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);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:59,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {14874#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -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:59,589 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:59,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {14875#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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:59,589 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:59,590 INFO L273 TraceCheckUtils]: 10: Hoare triple {14876#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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:59,590 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:59,590 INFO L273 TraceCheckUtils]: 12: Hoare triple {14877#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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:59,591 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:59,592 INFO L273 TraceCheckUtils]: 14: Hoare triple {14878#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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:59,592 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:59,593 INFO L273 TraceCheckUtils]: 16: Hoare triple {14879#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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:59,593 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:59,594 INFO L273 TraceCheckUtils]: 18: Hoare triple {14880#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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:59,595 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:59,595 INFO L273 TraceCheckUtils]: 20: Hoare triple {14881#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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:59,596 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:59,596 INFO L273 TraceCheckUtils]: 22: Hoare triple {14882#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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:59,597 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:59,598 INFO L273 TraceCheckUtils]: 24: Hoare triple {14883#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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:59,598 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:59,599 INFO L273 TraceCheckUtils]: 26: Hoare triple {14884#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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:59,600 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:59,600 INFO L273 TraceCheckUtils]: 28: Hoare triple {14885#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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:59,601 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:59,601 INFO L273 TraceCheckUtils]: 30: Hoare triple {14886#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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:59,602 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:59,603 INFO L273 TraceCheckUtils]: 32: Hoare triple {14887#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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:59,603 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:59,604 INFO L273 TraceCheckUtils]: 34: Hoare triple {14888#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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:59,604 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:59,605 INFO L273 TraceCheckUtils]: 36: Hoare triple {14889#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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:59,606 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:59,606 INFO L273 TraceCheckUtils]: 38: Hoare triple {14890#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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:59,607 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:59,607 INFO L273 TraceCheckUtils]: 40: Hoare triple {14891#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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:59,608 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:59,609 INFO L273 TraceCheckUtils]: 42: Hoare triple {14892#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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:59,609 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:59,610 INFO L273 TraceCheckUtils]: 44: Hoare triple {14893#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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:59,611 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:59,611 INFO L273 TraceCheckUtils]: 46: Hoare triple {14894#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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:59,612 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:59,612 INFO L273 TraceCheckUtils]: 48: Hoare triple {14895#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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:59,613 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:59,614 INFO L273 TraceCheckUtils]: 50: Hoare triple {14896#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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:59,614 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:59,615 INFO L273 TraceCheckUtils]: 52: Hoare triple {14897#(<= main_~i~1 23)} assume !(~i~1 < 100000); {14873#false} is VALID [2018-11-23 12:27:59,615 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:59,615 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:59,616 INFO L273 TraceCheckUtils]: 55: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,616 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:59,616 INFO L273 TraceCheckUtils]: 57: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,616 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:59,616 INFO L273 TraceCheckUtils]: 59: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,617 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:59,617 INFO L273 TraceCheckUtils]: 61: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,617 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:59,617 INFO L273 TraceCheckUtils]: 63: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,617 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:59,618 INFO L273 TraceCheckUtils]: 65: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,618 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:59,618 INFO L273 TraceCheckUtils]: 67: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,618 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:59,618 INFO L273 TraceCheckUtils]: 69: Hoare triple {14872#true} assume !(~i~0 < 100000); {14872#true} is VALID [2018-11-23 12:27:59,618 INFO L273 TraceCheckUtils]: 70: Hoare triple {14872#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:27:59,618 INFO L273 TraceCheckUtils]: 71: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:27:59,618 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14872#true} {14873#false} #70#return; {14873#false} is VALID [2018-11-23 12:27:59,618 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:59,619 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:59,619 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:59,619 INFO L273 TraceCheckUtils]: 76: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,619 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:59,619 INFO L273 TraceCheckUtils]: 78: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,619 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:59,619 INFO L273 TraceCheckUtils]: 80: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,619 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:59,619 INFO L273 TraceCheckUtils]: 82: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,619 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:59,620 INFO L273 TraceCheckUtils]: 84: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,620 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:59,620 INFO L273 TraceCheckUtils]: 86: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,620 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:59,620 INFO L273 TraceCheckUtils]: 88: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,620 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:59,620 INFO L273 TraceCheckUtils]: 90: Hoare triple {14872#true} assume !(~i~0 < 100000); {14872#true} is VALID [2018-11-23 12:27:59,620 INFO L273 TraceCheckUtils]: 91: Hoare triple {14872#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:27:59,620 INFO L273 TraceCheckUtils]: 92: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:27:59,621 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14872#true} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:27:59,621 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:59,621 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,621 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:59,621 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,621 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:59,621 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,621 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:59,621 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,622 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:59,622 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,622 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:59,622 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,622 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:59,622 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 99999); {14873#false} is VALID [2018-11-23 12:27:59,622 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:27:59,622 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:59,622 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:59,623 INFO L273 TraceCheckUtils]: 111: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,623 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:59,623 INFO L273 TraceCheckUtils]: 113: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,623 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:59,623 INFO L273 TraceCheckUtils]: 115: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,623 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:59,623 INFO L273 TraceCheckUtils]: 117: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,623 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:59,623 INFO L273 TraceCheckUtils]: 119: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,624 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:59,624 INFO L273 TraceCheckUtils]: 121: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,624 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:59,624 INFO L273 TraceCheckUtils]: 123: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:59,624 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:59,624 INFO L273 TraceCheckUtils]: 125: Hoare triple {14872#true} assume !(~i~0 < 100000); {14872#true} is VALID [2018-11-23 12:27:59,624 INFO L273 TraceCheckUtils]: 126: Hoare triple {14872#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:27:59,624 INFO L273 TraceCheckUtils]: 127: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:27:59,624 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14872#true} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:27:59,624 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:59,625 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:59,625 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:27:59,639 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:59,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:59,639 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:59,649 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:28:02,303 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-23 12:28:02,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:02,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:03,013 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:28:03,014 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:28:03,014 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:28:03,014 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:28:03,014 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret12 := main(); {14872#true} is VALID [2018-11-23 12:28:03,014 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14872#true} is VALID [2018-11-23 12:28:03,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,015 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:28:03,015 INFO L273 TraceCheckUtils]: 8: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,015 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:28:03,015 INFO L273 TraceCheckUtils]: 10: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,016 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:28:03,016 INFO L273 TraceCheckUtils]: 12: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,016 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:28:03,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,016 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:28:03,016 INFO L273 TraceCheckUtils]: 16: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,016 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:28:03,016 INFO L273 TraceCheckUtils]: 18: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,017 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:28:03,017 INFO L273 TraceCheckUtils]: 20: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,017 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:28:03,017 INFO L273 TraceCheckUtils]: 22: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,017 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:28:03,017 INFO L273 TraceCheckUtils]: 24: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,017 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:28:03,017 INFO L273 TraceCheckUtils]: 26: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,017 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:28:03,018 INFO L273 TraceCheckUtils]: 28: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,018 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:28:03,018 INFO L273 TraceCheckUtils]: 30: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,018 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:28:03,018 INFO L273 TraceCheckUtils]: 32: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,018 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:28:03,018 INFO L273 TraceCheckUtils]: 34: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,018 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:28:03,018 INFO L273 TraceCheckUtils]: 36: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,019 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:28:03,019 INFO L273 TraceCheckUtils]: 38: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,019 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:28:03,019 INFO L273 TraceCheckUtils]: 40: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,019 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:28:03,019 INFO L273 TraceCheckUtils]: 42: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,019 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:28:03,019 INFO L273 TraceCheckUtils]: 44: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,019 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:28:03,020 INFO L273 TraceCheckUtils]: 46: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,020 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:28:03,020 INFO L273 TraceCheckUtils]: 48: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,020 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:28:03,020 INFO L273 TraceCheckUtils]: 50: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -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:28:03,020 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:28:03,020 INFO L273 TraceCheckUtils]: 52: Hoare triple {14872#true} assume !(~i~1 < 100000); {14872#true} is VALID [2018-11-23 12:28:03,020 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:28:03,020 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:28:03,021 INFO L273 TraceCheckUtils]: 55: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:28:03,021 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:28:03,021 INFO L273 TraceCheckUtils]: 57: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:28:03,021 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:28:03,021 INFO L273 TraceCheckUtils]: 59: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:28:03,021 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:28:03,021 INFO L273 TraceCheckUtils]: 61: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:28:03,021 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:28:03,021 INFO L273 TraceCheckUtils]: 63: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:28:03,021 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:28:03,022 INFO L273 TraceCheckUtils]: 65: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:28:03,022 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:28:03,022 INFO L273 TraceCheckUtils]: 67: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:28:03,022 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:28:03,022 INFO L273 TraceCheckUtils]: 69: Hoare triple {14872#true} assume !(~i~0 < 100000); {14872#true} is VALID [2018-11-23 12:28:03,022 INFO L273 TraceCheckUtils]: 70: Hoare triple {14872#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:28:03,022 INFO L273 TraceCheckUtils]: 71: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:28:03,022 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14872#true} {14872#true} #70#return; {14872#true} is VALID [2018-11-23 12:28:03,022 INFO L273 TraceCheckUtils]: 73: Hoare triple {14872#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); {14872#true} is VALID [2018-11-23 12:28:03,023 INFO L256 TraceCheckUtils]: 74: Hoare triple {14872#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:28:03,023 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:28:03,023 INFO L273 TraceCheckUtils]: 76: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:28:03,023 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:28:03,023 INFO L273 TraceCheckUtils]: 78: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:28:03,023 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:28:03,023 INFO L273 TraceCheckUtils]: 80: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:28:03,023 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:28:03,023 INFO L273 TraceCheckUtils]: 82: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:28:03,024 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:28:03,024 INFO L273 TraceCheckUtils]: 84: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:28:03,024 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:28:03,024 INFO L273 TraceCheckUtils]: 86: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:28:03,024 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:28:03,024 INFO L273 TraceCheckUtils]: 88: Hoare triple {14872#true} assume !!(~i~0 < 100000);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:28:03,024 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:28:03,024 INFO L273 TraceCheckUtils]: 90: Hoare triple {14872#true} assume !(~i~0 < 100000); {14872#true} is VALID [2018-11-23 12:28:03,024 INFO L273 TraceCheckUtils]: 91: Hoare triple {14872#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:28:03,025 INFO L273 TraceCheckUtils]: 92: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:28:03,025 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14872#true} {14872#true} #72#return; {14872#true} is VALID [2018-11-23 12:28:03,026 INFO L273 TraceCheckUtils]: 94: Hoare triple {14872#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; {15183#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:03,028 INFO L273 TraceCheckUtils]: 95: Hoare triple {15183#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15183#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:03,029 INFO L273 TraceCheckUtils]: 96: Hoare triple {15183#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15190#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:03,030 INFO L273 TraceCheckUtils]: 97: Hoare triple {15190#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15190#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:03,030 INFO L273 TraceCheckUtils]: 98: Hoare triple {15190#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15197#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:03,030 INFO L273 TraceCheckUtils]: 99: Hoare triple {15197#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15197#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:03,031 INFO L273 TraceCheckUtils]: 100: Hoare triple {15197#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15204#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:03,031 INFO L273 TraceCheckUtils]: 101: Hoare triple {15204#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15204#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:03,032 INFO L273 TraceCheckUtils]: 102: Hoare triple {15204#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15211#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:03,033 INFO L273 TraceCheckUtils]: 103: Hoare triple {15211#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15211#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:03,033 INFO L273 TraceCheckUtils]: 104: Hoare triple {15211#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15218#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:03,034 INFO L273 TraceCheckUtils]: 105: Hoare triple {15218#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15218#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:03,034 INFO L273 TraceCheckUtils]: 106: Hoare triple {15218#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15225#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:03,035 INFO L273 TraceCheckUtils]: 107: Hoare triple {15225#(<= main_~i~2 6)} assume !(~i~2 < 99999); {14873#false} is VALID [2018-11-23 12:28:03,035 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:28:03,036 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:28:03,036 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:28:03,036 INFO L273 TraceCheckUtils]: 111: Hoare triple {14873#false} assume !!(~i~0 < 100000);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:28:03,036 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:28:03,036 INFO L273 TraceCheckUtils]: 113: Hoare triple {14873#false} assume !!(~i~0 < 100000);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:28:03,037 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:28:03,037 INFO L273 TraceCheckUtils]: 115: Hoare triple {14873#false} assume !!(~i~0 < 100000);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:28:03,037 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:28:03,037 INFO L273 TraceCheckUtils]: 117: Hoare triple {14873#false} assume !!(~i~0 < 100000);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:28:03,037 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:28:03,037 INFO L273 TraceCheckUtils]: 119: Hoare triple {14873#false} assume !!(~i~0 < 100000);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:28:03,038 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:28:03,038 INFO L273 TraceCheckUtils]: 121: Hoare triple {14873#false} assume !!(~i~0 < 100000);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:28:03,038 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:28:03,038 INFO L273 TraceCheckUtils]: 123: Hoare triple {14873#false} assume !!(~i~0 < 100000);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:28:03,038 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:28:03,038 INFO L273 TraceCheckUtils]: 125: Hoare triple {14873#false} assume !(~i~0 < 100000); {14873#false} is VALID [2018-11-23 12:28:03,038 INFO L273 TraceCheckUtils]: 126: Hoare triple {14873#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:28:03,039 INFO L273 TraceCheckUtils]: 127: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:28:03,039 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14873#false} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:28:03,039 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:28:03,039 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:28:03,039 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:28:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 234 proven. 36 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2018-11-23 12:28:03,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:03,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 9] total 33 [2018-11-23 12:28:03,068 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 132 [2018-11-23 12:28:03,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:03,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:28:03,173 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:03,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:28:03,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:28:03,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=696, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:28:03,174 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 33 states. [2018-11-23 12:28:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:04,267 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2018-11-23 12:28:04,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:28:04,267 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 132 [2018-11-23 12:28:04,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:28:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 115 transitions. [2018-11-23 12:28:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:28:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 115 transitions. [2018-11-23 12:28:04,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 115 transitions. [2018-11-23 12:28:04,708 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:04,710 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:28:04,710 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:28:04,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=360, Invalid=696, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:28:04,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:28:05,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-23 12:28:05,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:05,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2018-11-23 12:28:05,186 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2018-11-23 12:28:05,186 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2018-11-23 12:28:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:05,189 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:28:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:28:05,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:05,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:05,190 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2018-11-23 12:28:05,190 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2018-11-23 12:28:05,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:05,192 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:28:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:28:05,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:05,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:05,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:05,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 12:28:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-11-23 12:28:05,195 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2018-11-23 12:28:05,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:05,196 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-11-23 12:28:05,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:28:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-23 12:28:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 12:28:05,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:05,197 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 21, 21, 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,197 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:05,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:05,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2124845969, now seen corresponding path program 24 times [2018-11-23 12:28:05,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:05,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:05,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:05,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:05,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:05,999 INFO L256 TraceCheckUtils]: 0: Hoare triple {15861#true} call ULTIMATE.init(); {15861#true} is VALID [2018-11-23 12:28:06,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {15861#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15861#true} is VALID [2018-11-23 12:28:06,000 INFO L273 TraceCheckUtils]: 2: Hoare triple {15861#true} assume true; {15861#true} is VALID [2018-11-23 12:28:06,000 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15861#true} {15861#true} #66#return; {15861#true} is VALID [2018-11-23 12:28:06,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {15861#true} call #t~ret12 := main(); {15861#true} is VALID [2018-11-23 12:28:06,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {15861#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15863#(= main_~i~1 0)} is VALID [2018-11-23 12:28:06,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {15863#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15863#(= main_~i~1 0)} is VALID [2018-11-23 12:28:06,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {15863#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15864#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:06,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {15864#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -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 1)} is VALID [2018-11-23 12:28:06,003 INFO L273 TraceCheckUtils]: 9: Hoare triple {15864#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15865#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:06,003 INFO L273 TraceCheckUtils]: 10: Hoare triple {15865#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -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 2)} is VALID [2018-11-23 12:28:06,004 INFO L273 TraceCheckUtils]: 11: Hoare triple {15865#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15866#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:06,004 INFO L273 TraceCheckUtils]: 12: Hoare triple {15866#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -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 3)} is VALID [2018-11-23 12:28:06,005 INFO L273 TraceCheckUtils]: 13: Hoare triple {15866#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15867#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:06,006 INFO L273 TraceCheckUtils]: 14: Hoare triple {15867#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -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 4)} is VALID [2018-11-23 12:28:06,006 INFO L273 TraceCheckUtils]: 15: Hoare triple {15867#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15868#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:06,007 INFO L273 TraceCheckUtils]: 16: Hoare triple {15868#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -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 5)} is VALID [2018-11-23 12:28:06,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {15868#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15869#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:06,008 INFO L273 TraceCheckUtils]: 18: Hoare triple {15869#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -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 6)} is VALID [2018-11-23 12:28:06,009 INFO L273 TraceCheckUtils]: 19: Hoare triple {15869#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15870#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:06,010 INFO L273 TraceCheckUtils]: 20: Hoare triple {15870#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -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 7)} is VALID [2018-11-23 12:28:06,010 INFO L273 TraceCheckUtils]: 21: Hoare triple {15870#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15871#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:06,011 INFO L273 TraceCheckUtils]: 22: Hoare triple {15871#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -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 8)} is VALID [2018-11-23 12:28:06,031 INFO L273 TraceCheckUtils]: 23: Hoare triple {15871#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15872#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:06,046 INFO L273 TraceCheckUtils]: 24: Hoare triple {15872#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -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 9)} is VALID [2018-11-23 12:28:06,055 INFO L273 TraceCheckUtils]: 25: Hoare triple {15872#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15873#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:06,061 INFO L273 TraceCheckUtils]: 26: Hoare triple {15873#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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 10)} is VALID [2018-11-23 12:28:06,062 INFO L273 TraceCheckUtils]: 27: Hoare triple {15873#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15874#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:06,062 INFO L273 TraceCheckUtils]: 28: Hoare triple {15874#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -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 11)} is VALID [2018-11-23 12:28:06,062 INFO L273 TraceCheckUtils]: 29: Hoare triple {15874#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15875#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:06,063 INFO L273 TraceCheckUtils]: 30: Hoare triple {15875#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:06,063 INFO L273 TraceCheckUtils]: 31: Hoare triple {15875#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15876#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:06,063 INFO L273 TraceCheckUtils]: 32: Hoare triple {15876#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:06,064 INFO L273 TraceCheckUtils]: 33: Hoare triple {15876#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15877#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:06,064 INFO L273 TraceCheckUtils]: 34: Hoare triple {15877#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:06,065 INFO L273 TraceCheckUtils]: 35: Hoare triple {15877#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15878#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:06,065 INFO L273 TraceCheckUtils]: 36: Hoare triple {15878#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:06,066 INFO L273 TraceCheckUtils]: 37: Hoare triple {15878#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15879#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:06,066 INFO L273 TraceCheckUtils]: 38: Hoare triple {15879#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:06,067 INFO L273 TraceCheckUtils]: 39: Hoare triple {15879#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15880#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:06,068 INFO L273 TraceCheckUtils]: 40: Hoare triple {15880#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:06,068 INFO L273 TraceCheckUtils]: 41: Hoare triple {15880#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15881#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:06,069 INFO L273 TraceCheckUtils]: 42: Hoare triple {15881#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:06,069 INFO L273 TraceCheckUtils]: 43: Hoare triple {15881#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15882#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:06,070 INFO L273 TraceCheckUtils]: 44: Hoare triple {15882#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:06,071 INFO L273 TraceCheckUtils]: 45: Hoare triple {15882#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15883#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:06,071 INFO L273 TraceCheckUtils]: 46: Hoare triple {15883#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:06,072 INFO L273 TraceCheckUtils]: 47: Hoare triple {15883#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15884#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:06,073 INFO L273 TraceCheckUtils]: 48: Hoare triple {15884#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:06,073 INFO L273 TraceCheckUtils]: 49: Hoare triple {15884#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15885#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:06,074 INFO L273 TraceCheckUtils]: 50: Hoare triple {15885#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:06,075 INFO L273 TraceCheckUtils]: 51: Hoare triple {15885#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15886#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:06,075 INFO L273 TraceCheckUtils]: 52: Hoare triple {15886#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:06,076 INFO L273 TraceCheckUtils]: 53: Hoare triple {15886#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15887#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:06,076 INFO L273 TraceCheckUtils]: 54: Hoare triple {15887#(<= main_~i~1 24)} assume !(~i~1 < 100000); {15862#false} is VALID [2018-11-23 12:28:06,077 INFO L256 TraceCheckUtils]: 55: Hoare triple {15862#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {15861#true} is VALID [2018-11-23 12:28:06,077 INFO L273 TraceCheckUtils]: 56: Hoare triple {15861#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15861#true} is VALID [2018-11-23 12:28:06,077 INFO L273 TraceCheckUtils]: 57: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,077 INFO L273 TraceCheckUtils]: 58: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,077 INFO L273 TraceCheckUtils]: 59: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,078 INFO L273 TraceCheckUtils]: 60: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,078 INFO L273 TraceCheckUtils]: 61: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,078 INFO L273 TraceCheckUtils]: 62: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,078 INFO L273 TraceCheckUtils]: 63: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,078 INFO L273 TraceCheckUtils]: 64: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,079 INFO L273 TraceCheckUtils]: 65: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,079 INFO L273 TraceCheckUtils]: 66: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,079 INFO L273 TraceCheckUtils]: 67: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,079 INFO L273 TraceCheckUtils]: 68: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,079 INFO L273 TraceCheckUtils]: 69: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,079 INFO L273 TraceCheckUtils]: 70: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,080 INFO L273 TraceCheckUtils]: 71: Hoare triple {15861#true} assume !(~i~0 < 100000); {15861#true} is VALID [2018-11-23 12:28:06,080 INFO L273 TraceCheckUtils]: 72: Hoare triple {15861#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {15861#true} is VALID [2018-11-23 12:28:06,080 INFO L273 TraceCheckUtils]: 73: Hoare triple {15861#true} assume true; {15861#true} is VALID [2018-11-23 12:28:06,080 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {15861#true} {15862#false} #70#return; {15862#false} is VALID [2018-11-23 12:28:06,080 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#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); {15862#false} is VALID [2018-11-23 12:28:06,080 INFO L256 TraceCheckUtils]: 76: Hoare triple {15862#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {15861#true} is VALID [2018-11-23 12:28:06,080 INFO L273 TraceCheckUtils]: 77: Hoare triple {15861#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15861#true} is VALID [2018-11-23 12:28:06,080 INFO L273 TraceCheckUtils]: 78: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,081 INFO L273 TraceCheckUtils]: 79: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,081 INFO L273 TraceCheckUtils]: 80: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,081 INFO L273 TraceCheckUtils]: 81: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,081 INFO L273 TraceCheckUtils]: 82: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,081 INFO L273 TraceCheckUtils]: 83: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,081 INFO L273 TraceCheckUtils]: 84: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,081 INFO L273 TraceCheckUtils]: 85: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,081 INFO L273 TraceCheckUtils]: 86: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,081 INFO L273 TraceCheckUtils]: 87: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,081 INFO L273 TraceCheckUtils]: 88: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,082 INFO L273 TraceCheckUtils]: 89: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,082 INFO L273 TraceCheckUtils]: 90: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,082 INFO L273 TraceCheckUtils]: 91: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,082 INFO L273 TraceCheckUtils]: 92: Hoare triple {15861#true} assume !(~i~0 < 100000); {15861#true} is VALID [2018-11-23 12:28:06,082 INFO L273 TraceCheckUtils]: 93: Hoare triple {15861#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {15861#true} is VALID [2018-11-23 12:28:06,082 INFO L273 TraceCheckUtils]: 94: Hoare triple {15861#true} assume true; {15861#true} is VALID [2018-11-23 12:28:06,082 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {15861#true} {15862#false} #72#return; {15862#false} is VALID [2018-11-23 12:28:06,082 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#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; {15862#false} is VALID [2018-11-23 12:28:06,082 INFO L273 TraceCheckUtils]: 97: Hoare triple {15862#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15862#false} is VALID [2018-11-23 12:28:06,083 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15862#false} is VALID [2018-11-23 12:28:06,083 INFO L273 TraceCheckUtils]: 99: Hoare triple {15862#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15862#false} is VALID [2018-11-23 12:28:06,083 INFO L273 TraceCheckUtils]: 100: Hoare triple {15862#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15862#false} is VALID [2018-11-23 12:28:06,083 INFO L273 TraceCheckUtils]: 101: Hoare triple {15862#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15862#false} is VALID [2018-11-23 12:28:06,083 INFO L273 TraceCheckUtils]: 102: Hoare triple {15862#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15862#false} is VALID [2018-11-23 12:28:06,083 INFO L273 TraceCheckUtils]: 103: Hoare triple {15862#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15862#false} is VALID [2018-11-23 12:28:06,083 INFO L273 TraceCheckUtils]: 104: Hoare triple {15862#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15862#false} is VALID [2018-11-23 12:28:06,083 INFO L273 TraceCheckUtils]: 105: Hoare triple {15862#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15862#false} is VALID [2018-11-23 12:28:06,083 INFO L273 TraceCheckUtils]: 106: Hoare triple {15862#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15862#false} is VALID [2018-11-23 12:28:06,083 INFO L273 TraceCheckUtils]: 107: Hoare triple {15862#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15862#false} is VALID [2018-11-23 12:28:06,084 INFO L273 TraceCheckUtils]: 108: Hoare triple {15862#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15862#false} is VALID [2018-11-23 12:28:06,084 INFO L273 TraceCheckUtils]: 109: Hoare triple {15862#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15862#false} is VALID [2018-11-23 12:28:06,084 INFO L273 TraceCheckUtils]: 110: Hoare triple {15862#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15862#false} is VALID [2018-11-23 12:28:06,084 INFO L273 TraceCheckUtils]: 111: Hoare triple {15862#false} assume !(~i~2 < 99999); {15862#false} is VALID [2018-11-23 12:28:06,084 INFO L273 TraceCheckUtils]: 112: Hoare triple {15862#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {15862#false} is VALID [2018-11-23 12:28:06,084 INFO L256 TraceCheckUtils]: 113: Hoare triple {15862#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {15861#true} is VALID [2018-11-23 12:28:06,084 INFO L273 TraceCheckUtils]: 114: Hoare triple {15861#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15861#true} is VALID [2018-11-23 12:28:06,084 INFO L273 TraceCheckUtils]: 115: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,084 INFO L273 TraceCheckUtils]: 116: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,085 INFO L273 TraceCheckUtils]: 117: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,085 INFO L273 TraceCheckUtils]: 118: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,085 INFO L273 TraceCheckUtils]: 119: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,085 INFO L273 TraceCheckUtils]: 120: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,085 INFO L273 TraceCheckUtils]: 121: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,085 INFO L273 TraceCheckUtils]: 122: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,085 INFO L273 TraceCheckUtils]: 123: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,085 INFO L273 TraceCheckUtils]: 124: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,085 INFO L273 TraceCheckUtils]: 125: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,086 INFO L273 TraceCheckUtils]: 126: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,086 INFO L273 TraceCheckUtils]: 127: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:06,086 INFO L273 TraceCheckUtils]: 128: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:06,086 INFO L273 TraceCheckUtils]: 129: Hoare triple {15861#true} assume !(~i~0 < 100000); {15861#true} is VALID [2018-11-23 12:28:06,086 INFO L273 TraceCheckUtils]: 130: Hoare triple {15861#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {15861#true} is VALID [2018-11-23 12:28:06,086 INFO L273 TraceCheckUtils]: 131: Hoare triple {15861#true} assume true; {15861#true} is VALID [2018-11-23 12:28:06,086 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {15861#true} {15862#false} #74#return; {15862#false} is VALID [2018-11-23 12:28:06,086 INFO L273 TraceCheckUtils]: 133: Hoare triple {15862#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {15862#false} is VALID [2018-11-23 12:28:06,086 INFO L273 TraceCheckUtils]: 134: Hoare triple {15862#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {15862#false} is VALID [2018-11-23 12:28:06,087 INFO L273 TraceCheckUtils]: 135: Hoare triple {15862#false} assume !false; {15862#false} is VALID [2018-11-23 12:28:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2018-11-23 12:28:06,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:06,097 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:28:06,105 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:06,449 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-23 12:28:06,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:06,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:07,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {15861#true} call ULTIMATE.init(); {15861#true} is VALID [2018-11-23 12:28:07,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {15861#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15861#true} is VALID [2018-11-23 12:28:07,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {15861#true} assume true; {15861#true} is VALID [2018-11-23 12:28:07,692 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15861#true} {15861#true} #66#return; {15861#true} is VALID [2018-11-23 12:28:07,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {15861#true} call #t~ret12 := main(); {15861#true} is VALID [2018-11-23 12:28:07,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {15861#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15861#true} is VALID [2018-11-23 12:28:07,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,693 INFO L273 TraceCheckUtils]: 7: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,693 INFO L273 TraceCheckUtils]: 8: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,693 INFO L273 TraceCheckUtils]: 11: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,693 INFO L273 TraceCheckUtils]: 12: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,693 INFO L273 TraceCheckUtils]: 13: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,693 INFO L273 TraceCheckUtils]: 14: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,694 INFO L273 TraceCheckUtils]: 15: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,694 INFO L273 TraceCheckUtils]: 16: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,694 INFO L273 TraceCheckUtils]: 17: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,694 INFO L273 TraceCheckUtils]: 18: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,694 INFO L273 TraceCheckUtils]: 19: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,694 INFO L273 TraceCheckUtils]: 20: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,694 INFO L273 TraceCheckUtils]: 21: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,694 INFO L273 TraceCheckUtils]: 22: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,695 INFO L273 TraceCheckUtils]: 25: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,695 INFO L273 TraceCheckUtils]: 26: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,695 INFO L273 TraceCheckUtils]: 27: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,695 INFO L273 TraceCheckUtils]: 28: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,695 INFO L273 TraceCheckUtils]: 29: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,695 INFO L273 TraceCheckUtils]: 30: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,695 INFO L273 TraceCheckUtils]: 31: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,695 INFO L273 TraceCheckUtils]: 32: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,696 INFO L273 TraceCheckUtils]: 33: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,696 INFO L273 TraceCheckUtils]: 34: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,696 INFO L273 TraceCheckUtils]: 35: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,696 INFO L273 TraceCheckUtils]: 36: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,696 INFO L273 TraceCheckUtils]: 37: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,696 INFO L273 TraceCheckUtils]: 38: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,696 INFO L273 TraceCheckUtils]: 39: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,696 INFO L273 TraceCheckUtils]: 40: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,696 INFO L273 TraceCheckUtils]: 41: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,696 INFO L273 TraceCheckUtils]: 42: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,697 INFO L273 TraceCheckUtils]: 43: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,697 INFO L273 TraceCheckUtils]: 44: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,697 INFO L273 TraceCheckUtils]: 45: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,697 INFO L273 TraceCheckUtils]: 46: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,697 INFO L273 TraceCheckUtils]: 47: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,697 INFO L273 TraceCheckUtils]: 48: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,697 INFO L273 TraceCheckUtils]: 49: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,697 INFO L273 TraceCheckUtils]: 50: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,697 INFO L273 TraceCheckUtils]: 51: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,698 INFO L273 TraceCheckUtils]: 52: Hoare triple {15861#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15861#true} is VALID [2018-11-23 12:28:07,698 INFO L273 TraceCheckUtils]: 53: Hoare triple {15861#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15861#true} is VALID [2018-11-23 12:28:07,698 INFO L273 TraceCheckUtils]: 54: Hoare triple {15861#true} assume !(~i~1 < 100000); {15861#true} is VALID [2018-11-23 12:28:07,698 INFO L256 TraceCheckUtils]: 55: Hoare triple {15861#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {15861#true} is VALID [2018-11-23 12:28:07,698 INFO L273 TraceCheckUtils]: 56: Hoare triple {15861#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15861#true} is VALID [2018-11-23 12:28:07,698 INFO L273 TraceCheckUtils]: 57: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:07,698 INFO L273 TraceCheckUtils]: 58: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:07,698 INFO L273 TraceCheckUtils]: 59: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:07,698 INFO L273 TraceCheckUtils]: 60: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:07,698 INFO L273 TraceCheckUtils]: 61: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:07,699 INFO L273 TraceCheckUtils]: 62: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:07,699 INFO L273 TraceCheckUtils]: 63: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:07,699 INFO L273 TraceCheckUtils]: 64: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:07,699 INFO L273 TraceCheckUtils]: 65: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:07,699 INFO L273 TraceCheckUtils]: 66: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:07,699 INFO L273 TraceCheckUtils]: 67: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:07,699 INFO L273 TraceCheckUtils]: 68: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:07,699 INFO L273 TraceCheckUtils]: 69: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:07,699 INFO L273 TraceCheckUtils]: 70: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:07,700 INFO L273 TraceCheckUtils]: 71: Hoare triple {15861#true} assume !(~i~0 < 100000); {15861#true} is VALID [2018-11-23 12:28:07,700 INFO L273 TraceCheckUtils]: 72: Hoare triple {15861#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {15861#true} is VALID [2018-11-23 12:28:07,700 INFO L273 TraceCheckUtils]: 73: Hoare triple {15861#true} assume true; {15861#true} is VALID [2018-11-23 12:28:07,700 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {15861#true} {15861#true} #70#return; {15861#true} is VALID [2018-11-23 12:28:07,700 INFO L273 TraceCheckUtils]: 75: Hoare triple {15861#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); {15861#true} is VALID [2018-11-23 12:28:07,700 INFO L256 TraceCheckUtils]: 76: Hoare triple {15861#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {15861#true} is VALID [2018-11-23 12:28:07,700 INFO L273 TraceCheckUtils]: 77: Hoare triple {15861#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15861#true} is VALID [2018-11-23 12:28:07,701 INFO L273 TraceCheckUtils]: 78: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:07,701 INFO L273 TraceCheckUtils]: 79: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:07,701 INFO L273 TraceCheckUtils]: 80: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:07,701 INFO L273 TraceCheckUtils]: 81: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:07,701 INFO L273 TraceCheckUtils]: 82: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:07,701 INFO L273 TraceCheckUtils]: 83: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:07,701 INFO L273 TraceCheckUtils]: 84: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:07,702 INFO L273 TraceCheckUtils]: 85: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:07,702 INFO L273 TraceCheckUtils]: 86: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:07,702 INFO L273 TraceCheckUtils]: 87: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:07,702 INFO L273 TraceCheckUtils]: 88: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:07,702 INFO L273 TraceCheckUtils]: 89: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:07,702 INFO L273 TraceCheckUtils]: 90: Hoare triple {15861#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15861#true} is VALID [2018-11-23 12:28:07,702 INFO L273 TraceCheckUtils]: 91: Hoare triple {15861#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15861#true} is VALID [2018-11-23 12:28:07,703 INFO L273 TraceCheckUtils]: 92: Hoare triple {15861#true} assume !(~i~0 < 100000); {15861#true} is VALID [2018-11-23 12:28:07,703 INFO L273 TraceCheckUtils]: 93: Hoare triple {15861#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {15861#true} is VALID [2018-11-23 12:28:07,703 INFO L273 TraceCheckUtils]: 94: Hoare triple {15861#true} assume true; {15861#true} is VALID [2018-11-23 12:28:07,703 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {15861#true} {15861#true} #72#return; {15861#true} is VALID [2018-11-23 12:28:07,703 INFO L273 TraceCheckUtils]: 96: Hoare triple {15861#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; {15861#true} is VALID [2018-11-23 12:28:07,703 INFO L273 TraceCheckUtils]: 97: Hoare triple {15861#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15861#true} is VALID [2018-11-23 12:28:07,703 INFO L273 TraceCheckUtils]: 98: Hoare triple {15861#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15861#true} is VALID [2018-11-23 12:28:07,703 INFO L273 TraceCheckUtils]: 99: Hoare triple {15861#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15861#true} is VALID [2018-11-23 12:28:07,704 INFO L273 TraceCheckUtils]: 100: Hoare triple {15861#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15861#true} is VALID [2018-11-23 12:28:07,704 INFO L273 TraceCheckUtils]: 101: Hoare triple {15861#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15861#true} is VALID [2018-11-23 12:28:07,704 INFO L273 TraceCheckUtils]: 102: Hoare triple {15861#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15861#true} is VALID [2018-11-23 12:28:07,704 INFO L273 TraceCheckUtils]: 103: Hoare triple {15861#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15861#true} is VALID [2018-11-23 12:28:07,704 INFO L273 TraceCheckUtils]: 104: Hoare triple {15861#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15861#true} is VALID [2018-11-23 12:28:07,704 INFO L273 TraceCheckUtils]: 105: Hoare triple {15861#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15861#true} is VALID [2018-11-23 12:28:07,704 INFO L273 TraceCheckUtils]: 106: Hoare triple {15861#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15861#true} is VALID [2018-11-23 12:28:07,704 INFO L273 TraceCheckUtils]: 107: Hoare triple {15861#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15861#true} is VALID [2018-11-23 12:28:07,704 INFO L273 TraceCheckUtils]: 108: Hoare triple {15861#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15861#true} is VALID [2018-11-23 12:28:07,705 INFO L273 TraceCheckUtils]: 109: Hoare triple {15861#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15861#true} is VALID [2018-11-23 12:28:07,705 INFO L273 TraceCheckUtils]: 110: Hoare triple {15861#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15861#true} is VALID [2018-11-23 12:28:07,705 INFO L273 TraceCheckUtils]: 111: Hoare triple {15861#true} assume !(~i~2 < 99999); {15861#true} is VALID [2018-11-23 12:28:07,705 INFO L273 TraceCheckUtils]: 112: Hoare triple {15861#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {15861#true} is VALID [2018-11-23 12:28:07,705 INFO L256 TraceCheckUtils]: 113: Hoare triple {15861#true} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {15861#true} is VALID [2018-11-23 12:28:07,705 INFO L273 TraceCheckUtils]: 114: Hoare triple {15861#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16233#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:07,706 INFO L273 TraceCheckUtils]: 115: Hoare triple {16233#(<= mapavg_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16233#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:07,706 INFO L273 TraceCheckUtils]: 116: Hoare triple {16233#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16240#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:07,707 INFO L273 TraceCheckUtils]: 117: Hoare triple {16240#(<= mapavg_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16240#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:07,707 INFO L273 TraceCheckUtils]: 118: Hoare triple {16240#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16247#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:07,707 INFO L273 TraceCheckUtils]: 119: Hoare triple {16247#(<= mapavg_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16247#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:07,708 INFO L273 TraceCheckUtils]: 120: Hoare triple {16247#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16254#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:07,708 INFO L273 TraceCheckUtils]: 121: Hoare triple {16254#(<= mapavg_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16254#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:07,708 INFO L273 TraceCheckUtils]: 122: Hoare triple {16254#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16261#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:07,709 INFO L273 TraceCheckUtils]: 123: Hoare triple {16261#(<= mapavg_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16261#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:07,709 INFO L273 TraceCheckUtils]: 124: Hoare triple {16261#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16268#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:07,710 INFO L273 TraceCheckUtils]: 125: Hoare triple {16268#(<= mapavg_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16268#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:07,711 INFO L273 TraceCheckUtils]: 126: Hoare triple {16268#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16275#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:07,711 INFO L273 TraceCheckUtils]: 127: Hoare triple {16275#(<= mapavg_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16275#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:07,712 INFO L273 TraceCheckUtils]: 128: Hoare triple {16275#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16282#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:07,712 INFO L273 TraceCheckUtils]: 129: Hoare triple {16282#(<= mapavg_~i~0 7)} assume !(~i~0 < 100000); {15862#false} is VALID [2018-11-23 12:28:07,713 INFO L273 TraceCheckUtils]: 130: Hoare triple {15862#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {15862#false} is VALID [2018-11-23 12:28:07,713 INFO L273 TraceCheckUtils]: 131: Hoare triple {15862#false} assume true; {15862#false} is VALID [2018-11-23 12:28:07,713 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {15862#false} {15861#true} #74#return; {15862#false} is VALID [2018-11-23 12:28:07,713 INFO L273 TraceCheckUtils]: 133: Hoare triple {15862#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {15862#false} is VALID [2018-11-23 12:28:07,713 INFO L273 TraceCheckUtils]: 134: Hoare triple {15862#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {15862#false} is VALID [2018-11-23 12:28:07,714 INFO L273 TraceCheckUtils]: 135: Hoare triple {15862#false} assume !false; {15862#false} is VALID [2018-11-23 12:28:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 232 proven. 49 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2018-11-23 12:28:07,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:07,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 10] total 35 [2018-11-23 12:28:07,743 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 136 [2018-11-23 12:28:07,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:07,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:28:08,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:08,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:28:08,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:28:08,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:28:08,326 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 35 states. [2018-11-23 12:28:09,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:09,300 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-11-23 12:28:09,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:28:09,300 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 136 [2018-11-23 12:28:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:28:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2018-11-23 12:28:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:28:09,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2018-11-23 12:28:09,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 122 transitions. [2018-11-23 12:28:09,423 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:09,426 INFO L225 Difference]: With dead ends: 149 [2018-11-23 12:28:09,426 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 12:28:09,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:28:09,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 12:28:09,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-23 12:28:09,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:09,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 103 states. [2018-11-23 12:28:09,476 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 103 states. [2018-11-23 12:28:09,476 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 103 states. [2018-11-23 12:28:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:09,478 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:28:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:28:09,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:09,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:09,479 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 105 states. [2018-11-23 12:28:09,479 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 105 states. [2018-11-23 12:28:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:09,481 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:28:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:28:09,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:09,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:09,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:09,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 12:28:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-11-23 12:28:09,483 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 136 [2018-11-23 12:28:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:09,484 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-11-23 12:28:09,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:28:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 12:28:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-23 12:28:09,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:09,485 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:09,485 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:09,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1912835409, now seen corresponding path program 25 times [2018-11-23 12:28:09,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:09,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:09,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:09,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:09,996 INFO L256 TraceCheckUtils]: 0: Hoare triple {16887#true} call ULTIMATE.init(); {16887#true} is VALID [2018-11-23 12:28:09,997 INFO L273 TraceCheckUtils]: 1: Hoare triple {16887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16887#true} is VALID [2018-11-23 12:28:09,997 INFO L273 TraceCheckUtils]: 2: Hoare triple {16887#true} assume true; {16887#true} is VALID [2018-11-23 12:28:09,997 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16887#true} {16887#true} #66#return; {16887#true} is VALID [2018-11-23 12:28:09,997 INFO L256 TraceCheckUtils]: 4: Hoare triple {16887#true} call #t~ret12 := main(); {16887#true} is VALID [2018-11-23 12:28:09,998 INFO L273 TraceCheckUtils]: 5: Hoare triple {16887#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16889#(= main_~i~1 0)} is VALID [2018-11-23 12:28:09,998 INFO L273 TraceCheckUtils]: 6: Hoare triple {16889#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16889#(= main_~i~1 0)} is VALID [2018-11-23 12:28:09,999 INFO L273 TraceCheckUtils]: 7: Hoare triple {16889#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16890#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:09,999 INFO L273 TraceCheckUtils]: 8: Hoare triple {16890#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16890#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:09,999 INFO L273 TraceCheckUtils]: 9: Hoare triple {16890#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16891#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:10,000 INFO L273 TraceCheckUtils]: 10: Hoare triple {16891#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16891#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:10,000 INFO L273 TraceCheckUtils]: 11: Hoare triple {16891#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16892#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:10,000 INFO L273 TraceCheckUtils]: 12: Hoare triple {16892#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16892#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:10,001 INFO L273 TraceCheckUtils]: 13: Hoare triple {16892#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16893#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:10,001 INFO L273 TraceCheckUtils]: 14: Hoare triple {16893#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16893#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:10,002 INFO L273 TraceCheckUtils]: 15: Hoare triple {16893#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16894#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:10,002 INFO L273 TraceCheckUtils]: 16: Hoare triple {16894#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16894#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:10,003 INFO L273 TraceCheckUtils]: 17: Hoare triple {16894#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16895#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:10,004 INFO L273 TraceCheckUtils]: 18: Hoare triple {16895#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16895#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:10,004 INFO L273 TraceCheckUtils]: 19: Hoare triple {16895#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16896#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:10,005 INFO L273 TraceCheckUtils]: 20: Hoare triple {16896#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16896#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:10,005 INFO L273 TraceCheckUtils]: 21: Hoare triple {16896#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16897#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:10,006 INFO L273 TraceCheckUtils]: 22: Hoare triple {16897#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16897#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:10,007 INFO L273 TraceCheckUtils]: 23: Hoare triple {16897#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16898#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:10,007 INFO L273 TraceCheckUtils]: 24: Hoare triple {16898#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16898#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:10,008 INFO L273 TraceCheckUtils]: 25: Hoare triple {16898#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16899#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:10,008 INFO L273 TraceCheckUtils]: 26: Hoare triple {16899#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16899#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:10,009 INFO L273 TraceCheckUtils]: 27: Hoare triple {16899#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16900#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:10,009 INFO L273 TraceCheckUtils]: 28: Hoare triple {16900#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16900#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:10,010 INFO L273 TraceCheckUtils]: 29: Hoare triple {16900#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16901#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:10,010 INFO L273 TraceCheckUtils]: 30: Hoare triple {16901#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:10,011 INFO L273 TraceCheckUtils]: 31: Hoare triple {16901#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16902#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:10,012 INFO L273 TraceCheckUtils]: 32: Hoare triple {16902#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:10,012 INFO L273 TraceCheckUtils]: 33: Hoare triple {16902#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16903#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:10,013 INFO L273 TraceCheckUtils]: 34: Hoare triple {16903#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:10,013 INFO L273 TraceCheckUtils]: 35: Hoare triple {16903#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16904#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:10,014 INFO L273 TraceCheckUtils]: 36: Hoare triple {16904#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:10,015 INFO L273 TraceCheckUtils]: 37: Hoare triple {16904#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16905#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:10,015 INFO L273 TraceCheckUtils]: 38: Hoare triple {16905#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:10,016 INFO L273 TraceCheckUtils]: 39: Hoare triple {16905#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16906#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:10,016 INFO L273 TraceCheckUtils]: 40: Hoare triple {16906#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:10,017 INFO L273 TraceCheckUtils]: 41: Hoare triple {16906#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16907#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:10,017 INFO L273 TraceCheckUtils]: 42: Hoare triple {16907#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:10,018 INFO L273 TraceCheckUtils]: 43: Hoare triple {16907#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16908#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:10,019 INFO L273 TraceCheckUtils]: 44: Hoare triple {16908#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:10,019 INFO L273 TraceCheckUtils]: 45: Hoare triple {16908#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16909#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:10,020 INFO L273 TraceCheckUtils]: 46: Hoare triple {16909#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:10,020 INFO L273 TraceCheckUtils]: 47: Hoare triple {16909#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16910#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:10,021 INFO L273 TraceCheckUtils]: 48: Hoare triple {16910#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:10,022 INFO L273 TraceCheckUtils]: 49: Hoare triple {16910#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16911#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:10,022 INFO L273 TraceCheckUtils]: 50: Hoare triple {16911#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:10,023 INFO L273 TraceCheckUtils]: 51: Hoare triple {16911#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16912#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:10,023 INFO L273 TraceCheckUtils]: 52: Hoare triple {16912#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:10,024 INFO L273 TraceCheckUtils]: 53: Hoare triple {16912#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16913#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:10,024 INFO L273 TraceCheckUtils]: 54: Hoare triple {16913#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:28:10,025 INFO L273 TraceCheckUtils]: 55: Hoare triple {16913#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16914#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:10,026 INFO L273 TraceCheckUtils]: 56: Hoare triple {16914#(<= main_~i~1 25)} assume !(~i~1 < 100000); {16888#false} is VALID [2018-11-23 12:28:10,026 INFO L256 TraceCheckUtils]: 57: Hoare triple {16888#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {16887#true} is VALID [2018-11-23 12:28:10,026 INFO L273 TraceCheckUtils]: 58: Hoare triple {16887#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16887#true} is VALID [2018-11-23 12:28:10,026 INFO L273 TraceCheckUtils]: 59: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,026 INFO L273 TraceCheckUtils]: 60: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,027 INFO L273 TraceCheckUtils]: 61: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,027 INFO L273 TraceCheckUtils]: 62: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,027 INFO L273 TraceCheckUtils]: 63: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,027 INFO L273 TraceCheckUtils]: 64: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,027 INFO L273 TraceCheckUtils]: 65: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,028 INFO L273 TraceCheckUtils]: 66: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,028 INFO L273 TraceCheckUtils]: 67: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,028 INFO L273 TraceCheckUtils]: 68: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,028 INFO L273 TraceCheckUtils]: 69: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,028 INFO L273 TraceCheckUtils]: 70: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,028 INFO L273 TraceCheckUtils]: 71: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,029 INFO L273 TraceCheckUtils]: 72: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,029 INFO L273 TraceCheckUtils]: 73: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,029 INFO L273 TraceCheckUtils]: 74: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,029 INFO L273 TraceCheckUtils]: 75: Hoare triple {16887#true} assume !(~i~0 < 100000); {16887#true} is VALID [2018-11-23 12:28:10,029 INFO L273 TraceCheckUtils]: 76: Hoare triple {16887#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {16887#true} is VALID [2018-11-23 12:28:10,029 INFO L273 TraceCheckUtils]: 77: Hoare triple {16887#true} assume true; {16887#true} is VALID [2018-11-23 12:28:10,030 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16887#true} {16888#false} #70#return; {16888#false} is VALID [2018-11-23 12:28:10,030 INFO L273 TraceCheckUtils]: 79: Hoare triple {16888#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); {16888#false} is VALID [2018-11-23 12:28:10,030 INFO L256 TraceCheckUtils]: 80: Hoare triple {16888#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {16887#true} is VALID [2018-11-23 12:28:10,030 INFO L273 TraceCheckUtils]: 81: Hoare triple {16887#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16887#true} is VALID [2018-11-23 12:28:10,030 INFO L273 TraceCheckUtils]: 82: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,030 INFO L273 TraceCheckUtils]: 83: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,031 INFO L273 TraceCheckUtils]: 84: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,031 INFO L273 TraceCheckUtils]: 85: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,031 INFO L273 TraceCheckUtils]: 86: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,031 INFO L273 TraceCheckUtils]: 87: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,031 INFO L273 TraceCheckUtils]: 88: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,031 INFO L273 TraceCheckUtils]: 89: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,031 INFO L273 TraceCheckUtils]: 90: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,031 INFO L273 TraceCheckUtils]: 91: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,031 INFO L273 TraceCheckUtils]: 92: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,031 INFO L273 TraceCheckUtils]: 93: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,032 INFO L273 TraceCheckUtils]: 94: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,032 INFO L273 TraceCheckUtils]: 95: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,032 INFO L273 TraceCheckUtils]: 96: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,032 INFO L273 TraceCheckUtils]: 97: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,032 INFO L273 TraceCheckUtils]: 98: Hoare triple {16887#true} assume !(~i~0 < 100000); {16887#true} is VALID [2018-11-23 12:28:10,032 INFO L273 TraceCheckUtils]: 99: Hoare triple {16887#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {16887#true} is VALID [2018-11-23 12:28:10,032 INFO L273 TraceCheckUtils]: 100: Hoare triple {16887#true} assume true; {16887#true} is VALID [2018-11-23 12:28:10,032 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16887#true} {16888#false} #72#return; {16888#false} is VALID [2018-11-23 12:28:10,032 INFO L273 TraceCheckUtils]: 102: Hoare triple {16888#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; {16888#false} is VALID [2018-11-23 12:28:10,033 INFO L273 TraceCheckUtils]: 103: Hoare triple {16888#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16888#false} is VALID [2018-11-23 12:28:10,033 INFO L273 TraceCheckUtils]: 104: Hoare triple {16888#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16888#false} is VALID [2018-11-23 12:28:10,033 INFO L273 TraceCheckUtils]: 105: Hoare triple {16888#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16888#false} is VALID [2018-11-23 12:28:10,033 INFO L273 TraceCheckUtils]: 106: Hoare triple {16888#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16888#false} is VALID [2018-11-23 12:28:10,033 INFO L273 TraceCheckUtils]: 107: Hoare triple {16888#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16888#false} is VALID [2018-11-23 12:28:10,033 INFO L273 TraceCheckUtils]: 108: Hoare triple {16888#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16888#false} is VALID [2018-11-23 12:28:10,033 INFO L273 TraceCheckUtils]: 109: Hoare triple {16888#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16888#false} is VALID [2018-11-23 12:28:10,033 INFO L273 TraceCheckUtils]: 110: Hoare triple {16888#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16888#false} is VALID [2018-11-23 12:28:10,033 INFO L273 TraceCheckUtils]: 111: Hoare triple {16888#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16888#false} is VALID [2018-11-23 12:28:10,034 INFO L273 TraceCheckUtils]: 112: Hoare triple {16888#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16888#false} is VALID [2018-11-23 12:28:10,034 INFO L273 TraceCheckUtils]: 113: Hoare triple {16888#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16888#false} is VALID [2018-11-23 12:28:10,034 INFO L273 TraceCheckUtils]: 114: Hoare triple {16888#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16888#false} is VALID [2018-11-23 12:28:10,034 INFO L273 TraceCheckUtils]: 115: Hoare triple {16888#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16888#false} is VALID [2018-11-23 12:28:10,034 INFO L273 TraceCheckUtils]: 116: Hoare triple {16888#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16888#false} is VALID [2018-11-23 12:28:10,034 INFO L273 TraceCheckUtils]: 117: Hoare triple {16888#false} assume !(~i~2 < 99999); {16888#false} is VALID [2018-11-23 12:28:10,034 INFO L273 TraceCheckUtils]: 118: Hoare triple {16888#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {16888#false} is VALID [2018-11-23 12:28:10,034 INFO L256 TraceCheckUtils]: 119: Hoare triple {16888#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {16887#true} is VALID [2018-11-23 12:28:10,034 INFO L273 TraceCheckUtils]: 120: Hoare triple {16887#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16887#true} is VALID [2018-11-23 12:28:10,034 INFO L273 TraceCheckUtils]: 121: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,035 INFO L273 TraceCheckUtils]: 122: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,035 INFO L273 TraceCheckUtils]: 123: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,035 INFO L273 TraceCheckUtils]: 124: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,035 INFO L273 TraceCheckUtils]: 125: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,035 INFO L273 TraceCheckUtils]: 126: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,035 INFO L273 TraceCheckUtils]: 127: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,035 INFO L273 TraceCheckUtils]: 128: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,035 INFO L273 TraceCheckUtils]: 129: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,035 INFO L273 TraceCheckUtils]: 130: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,035 INFO L273 TraceCheckUtils]: 131: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,036 INFO L273 TraceCheckUtils]: 132: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,036 INFO L273 TraceCheckUtils]: 133: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,036 INFO L273 TraceCheckUtils]: 134: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,036 INFO L273 TraceCheckUtils]: 135: Hoare triple {16887#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16887#true} is VALID [2018-11-23 12:28:10,036 INFO L273 TraceCheckUtils]: 136: Hoare triple {16887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16887#true} is VALID [2018-11-23 12:28:10,036 INFO L273 TraceCheckUtils]: 137: Hoare triple {16887#true} assume !(~i~0 < 100000); {16887#true} is VALID [2018-11-23 12:28:10,036 INFO L273 TraceCheckUtils]: 138: Hoare triple {16887#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {16887#true} is VALID [2018-11-23 12:28:10,036 INFO L273 TraceCheckUtils]: 139: Hoare triple {16887#true} assume true; {16887#true} is VALID [2018-11-23 12:28:10,036 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16887#true} {16888#false} #74#return; {16888#false} is VALID [2018-11-23 12:28:10,037 INFO L273 TraceCheckUtils]: 141: Hoare triple {16888#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {16888#false} is VALID [2018-11-23 12:28:10,037 INFO L273 TraceCheckUtils]: 142: Hoare triple {16888#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {16888#false} is VALID [2018-11-23 12:28:10,037 INFO L273 TraceCheckUtils]: 143: Hoare triple {16888#false} assume !false; {16888#false} is VALID [2018-11-23 12:28:10,046 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:10,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:10,046 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:10,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:10,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:10,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {16887#true} call ULTIMATE.init(); {16887#true} is VALID [2018-11-23 12:28:10,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {16887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16887#true} is VALID [2018-11-23 12:28:10,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {16887#true} assume true; {16887#true} is VALID [2018-11-23 12:28:10,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16887#true} {16887#true} #66#return; {16887#true} is VALID [2018-11-23 12:28:10,397 INFO L256 TraceCheckUtils]: 4: Hoare triple {16887#true} call #t~ret12 := main(); {16887#true} is VALID [2018-11-23 12:28:10,398 INFO L273 TraceCheckUtils]: 5: Hoare triple {16887#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16933#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:10,398 INFO L273 TraceCheckUtils]: 6: Hoare triple {16933#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16933#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:10,399 INFO L273 TraceCheckUtils]: 7: Hoare triple {16933#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16890#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:10,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {16890#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16890#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:10,399 INFO L273 TraceCheckUtils]: 9: Hoare triple {16890#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16891#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:10,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {16891#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16891#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:10,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {16891#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16892#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:10,400 INFO L273 TraceCheckUtils]: 12: Hoare triple {16892#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16892#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:10,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {16892#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16893#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:10,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {16893#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16893#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:10,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {16893#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16894#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:10,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {16894#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16894#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:10,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {16894#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16895#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:10,404 INFO L273 TraceCheckUtils]: 18: Hoare triple {16895#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16895#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:10,404 INFO L273 TraceCheckUtils]: 19: Hoare triple {16895#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16896#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:10,405 INFO L273 TraceCheckUtils]: 20: Hoare triple {16896#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16896#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:10,406 INFO L273 TraceCheckUtils]: 21: Hoare triple {16896#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16897#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:10,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {16897#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16897#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:10,407 INFO L273 TraceCheckUtils]: 23: Hoare triple {16897#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16898#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:10,407 INFO L273 TraceCheckUtils]: 24: Hoare triple {16898#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16898#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:10,408 INFO L273 TraceCheckUtils]: 25: Hoare triple {16898#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16899#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:10,409 INFO L273 TraceCheckUtils]: 26: Hoare triple {16899#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16899#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:10,409 INFO L273 TraceCheckUtils]: 27: Hoare triple {16899#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16900#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:10,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {16900#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16900#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:10,411 INFO L273 TraceCheckUtils]: 29: Hoare triple {16900#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16901#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:10,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {16901#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:10,412 INFO L273 TraceCheckUtils]: 31: Hoare triple {16901#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16902#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:10,412 INFO L273 TraceCheckUtils]: 32: Hoare triple {16902#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:10,413 INFO L273 TraceCheckUtils]: 33: Hoare triple {16902#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16903#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:10,414 INFO L273 TraceCheckUtils]: 34: Hoare triple {16903#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:10,414 INFO L273 TraceCheckUtils]: 35: Hoare triple {16903#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16904#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:10,415 INFO L273 TraceCheckUtils]: 36: Hoare triple {16904#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:10,415 INFO L273 TraceCheckUtils]: 37: Hoare triple {16904#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16905#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:10,416 INFO L273 TraceCheckUtils]: 38: Hoare triple {16905#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:10,417 INFO L273 TraceCheckUtils]: 39: Hoare triple {16905#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16906#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:10,417 INFO L273 TraceCheckUtils]: 40: Hoare triple {16906#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:10,418 INFO L273 TraceCheckUtils]: 41: Hoare triple {16906#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16907#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:10,418 INFO L273 TraceCheckUtils]: 42: Hoare triple {16907#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:10,419 INFO L273 TraceCheckUtils]: 43: Hoare triple {16907#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16908#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:10,420 INFO L273 TraceCheckUtils]: 44: Hoare triple {16908#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:10,420 INFO L273 TraceCheckUtils]: 45: Hoare triple {16908#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16909#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:10,421 INFO L273 TraceCheckUtils]: 46: Hoare triple {16909#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:10,422 INFO L273 TraceCheckUtils]: 47: Hoare triple {16909#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16910#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:10,422 INFO L273 TraceCheckUtils]: 48: Hoare triple {16910#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:10,423 INFO L273 TraceCheckUtils]: 49: Hoare triple {16910#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16911#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:10,423 INFO L273 TraceCheckUtils]: 50: Hoare triple {16911#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:10,424 INFO L273 TraceCheckUtils]: 51: Hoare triple {16911#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16912#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:10,425 INFO L273 TraceCheckUtils]: 52: Hoare triple {16912#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:10,425 INFO L273 TraceCheckUtils]: 53: Hoare triple {16912#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16913#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:10,426 INFO L273 TraceCheckUtils]: 54: Hoare triple {16913#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:28:10,427 INFO L273 TraceCheckUtils]: 55: Hoare triple {16913#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16914#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:10,427 INFO L273 TraceCheckUtils]: 56: Hoare triple {16914#(<= main_~i~1 25)} assume !(~i~1 < 100000); {16888#false} is VALID [2018-11-23 12:28:10,427 INFO L256 TraceCheckUtils]: 57: Hoare triple {16888#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {16888#false} is VALID [2018-11-23 12:28:10,428 INFO L273 TraceCheckUtils]: 58: Hoare triple {16888#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16888#false} is VALID [2018-11-23 12:28:10,428 INFO L273 TraceCheckUtils]: 59: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,428 INFO L273 TraceCheckUtils]: 60: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,428 INFO L273 TraceCheckUtils]: 61: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,428 INFO L273 TraceCheckUtils]: 62: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,429 INFO L273 TraceCheckUtils]: 63: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,429 INFO L273 TraceCheckUtils]: 64: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,429 INFO L273 TraceCheckUtils]: 65: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,429 INFO L273 TraceCheckUtils]: 66: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,429 INFO L273 TraceCheckUtils]: 67: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,429 INFO L273 TraceCheckUtils]: 68: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,430 INFO L273 TraceCheckUtils]: 69: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,430 INFO L273 TraceCheckUtils]: 70: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,430 INFO L273 TraceCheckUtils]: 71: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,430 INFO L273 TraceCheckUtils]: 72: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,430 INFO L273 TraceCheckUtils]: 73: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,430 INFO L273 TraceCheckUtils]: 74: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,430 INFO L273 TraceCheckUtils]: 75: Hoare triple {16888#false} assume !(~i~0 < 100000); {16888#false} is VALID [2018-11-23 12:28:10,430 INFO L273 TraceCheckUtils]: 76: Hoare triple {16888#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {16888#false} is VALID [2018-11-23 12:28:10,431 INFO L273 TraceCheckUtils]: 77: Hoare triple {16888#false} assume true; {16888#false} is VALID [2018-11-23 12:28:10,431 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16888#false} {16888#false} #70#return; {16888#false} is VALID [2018-11-23 12:28:10,431 INFO L273 TraceCheckUtils]: 79: Hoare triple {16888#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); {16888#false} is VALID [2018-11-23 12:28:10,431 INFO L256 TraceCheckUtils]: 80: Hoare triple {16888#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {16888#false} is VALID [2018-11-23 12:28:10,431 INFO L273 TraceCheckUtils]: 81: Hoare triple {16888#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16888#false} is VALID [2018-11-23 12:28:10,431 INFO L273 TraceCheckUtils]: 82: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,431 INFO L273 TraceCheckUtils]: 83: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,431 INFO L273 TraceCheckUtils]: 84: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,431 INFO L273 TraceCheckUtils]: 85: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,432 INFO L273 TraceCheckUtils]: 86: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,432 INFO L273 TraceCheckUtils]: 87: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,432 INFO L273 TraceCheckUtils]: 88: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,432 INFO L273 TraceCheckUtils]: 89: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,432 INFO L273 TraceCheckUtils]: 90: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,432 INFO L273 TraceCheckUtils]: 91: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,432 INFO L273 TraceCheckUtils]: 92: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,432 INFO L273 TraceCheckUtils]: 93: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,432 INFO L273 TraceCheckUtils]: 94: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,432 INFO L273 TraceCheckUtils]: 95: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,433 INFO L273 TraceCheckUtils]: 96: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,433 INFO L273 TraceCheckUtils]: 97: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,433 INFO L273 TraceCheckUtils]: 98: Hoare triple {16888#false} assume !(~i~0 < 100000); {16888#false} is VALID [2018-11-23 12:28:10,433 INFO L273 TraceCheckUtils]: 99: Hoare triple {16888#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {16888#false} is VALID [2018-11-23 12:28:10,433 INFO L273 TraceCheckUtils]: 100: Hoare triple {16888#false} assume true; {16888#false} is VALID [2018-11-23 12:28:10,433 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16888#false} {16888#false} #72#return; {16888#false} is VALID [2018-11-23 12:28:10,433 INFO L273 TraceCheckUtils]: 102: Hoare triple {16888#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; {16888#false} is VALID [2018-11-23 12:28:10,433 INFO L273 TraceCheckUtils]: 103: Hoare triple {16888#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16888#false} is VALID [2018-11-23 12:28:10,433 INFO L273 TraceCheckUtils]: 104: Hoare triple {16888#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16888#false} is VALID [2018-11-23 12:28:10,434 INFO L273 TraceCheckUtils]: 105: Hoare triple {16888#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16888#false} is VALID [2018-11-23 12:28:10,434 INFO L273 TraceCheckUtils]: 106: Hoare triple {16888#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16888#false} is VALID [2018-11-23 12:28:10,434 INFO L273 TraceCheckUtils]: 107: Hoare triple {16888#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16888#false} is VALID [2018-11-23 12:28:10,434 INFO L273 TraceCheckUtils]: 108: Hoare triple {16888#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16888#false} is VALID [2018-11-23 12:28:10,434 INFO L273 TraceCheckUtils]: 109: Hoare triple {16888#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16888#false} is VALID [2018-11-23 12:28:10,434 INFO L273 TraceCheckUtils]: 110: Hoare triple {16888#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16888#false} is VALID [2018-11-23 12:28:10,434 INFO L273 TraceCheckUtils]: 111: Hoare triple {16888#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16888#false} is VALID [2018-11-23 12:28:10,434 INFO L273 TraceCheckUtils]: 112: Hoare triple {16888#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16888#false} is VALID [2018-11-23 12:28:10,434 INFO L273 TraceCheckUtils]: 113: Hoare triple {16888#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16888#false} is VALID [2018-11-23 12:28:10,434 INFO L273 TraceCheckUtils]: 114: Hoare triple {16888#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16888#false} is VALID [2018-11-23 12:28:10,435 INFO L273 TraceCheckUtils]: 115: Hoare triple {16888#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16888#false} is VALID [2018-11-23 12:28:10,435 INFO L273 TraceCheckUtils]: 116: Hoare triple {16888#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16888#false} is VALID [2018-11-23 12:28:10,435 INFO L273 TraceCheckUtils]: 117: Hoare triple {16888#false} assume !(~i~2 < 99999); {16888#false} is VALID [2018-11-23 12:28:10,435 INFO L273 TraceCheckUtils]: 118: Hoare triple {16888#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {16888#false} is VALID [2018-11-23 12:28:10,435 INFO L256 TraceCheckUtils]: 119: Hoare triple {16888#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {16888#false} is VALID [2018-11-23 12:28:10,435 INFO L273 TraceCheckUtils]: 120: Hoare triple {16888#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16888#false} is VALID [2018-11-23 12:28:10,435 INFO L273 TraceCheckUtils]: 121: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,435 INFO L273 TraceCheckUtils]: 122: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,435 INFO L273 TraceCheckUtils]: 123: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,436 INFO L273 TraceCheckUtils]: 124: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,436 INFO L273 TraceCheckUtils]: 125: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,436 INFO L273 TraceCheckUtils]: 126: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,436 INFO L273 TraceCheckUtils]: 127: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,436 INFO L273 TraceCheckUtils]: 128: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,436 INFO L273 TraceCheckUtils]: 129: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,436 INFO L273 TraceCheckUtils]: 130: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,436 INFO L273 TraceCheckUtils]: 131: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,436 INFO L273 TraceCheckUtils]: 132: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,436 INFO L273 TraceCheckUtils]: 133: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,437 INFO L273 TraceCheckUtils]: 134: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,437 INFO L273 TraceCheckUtils]: 135: Hoare triple {16888#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16888#false} is VALID [2018-11-23 12:28:10,437 INFO L273 TraceCheckUtils]: 136: Hoare triple {16888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16888#false} is VALID [2018-11-23 12:28:10,437 INFO L273 TraceCheckUtils]: 137: Hoare triple {16888#false} assume !(~i~0 < 100000); {16888#false} is VALID [2018-11-23 12:28:10,437 INFO L273 TraceCheckUtils]: 138: Hoare triple {16888#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {16888#false} is VALID [2018-11-23 12:28:10,437 INFO L273 TraceCheckUtils]: 139: Hoare triple {16888#false} assume true; {16888#false} is VALID [2018-11-23 12:28:10,437 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16888#false} {16888#false} #74#return; {16888#false} is VALID [2018-11-23 12:28:10,437 INFO L273 TraceCheckUtils]: 141: Hoare triple {16888#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {16888#false} is VALID [2018-11-23 12:28:10,437 INFO L273 TraceCheckUtils]: 142: Hoare triple {16888#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {16888#false} is VALID [2018-11-23 12:28:10,438 INFO L273 TraceCheckUtils]: 143: Hoare triple {16888#false} assume !false; {16888#false} is VALID [2018-11-23 12:28:10,448 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:10,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:10,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:28:10,468 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:28:10,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:10,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:28:10,560 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:10,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:28:10,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:28:10,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:28:10,562 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2018-11-23 12:28:11,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:11,157 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-23 12:28:11,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:28:11,157 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:28:11,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:28:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:28:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:28:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:28:11,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 104 transitions. [2018-11-23 12:28:11,259 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:11,261 INFO L225 Difference]: With dead ends: 152 [2018-11-23 12:28:11,261 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:28:11,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:28:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:28:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-23 12:28:11,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:11,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 105 states. [2018-11-23 12:28:11,296 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 105 states. [2018-11-23 12:28:11,296 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 105 states. [2018-11-23 12:28:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:11,298 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:28:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:28:11,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:11,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:11,299 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 106 states. [2018-11-23 12:28:11,299 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 106 states. [2018-11-23 12:28:11,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:11,301 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:28:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:28:11,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:11,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:11,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:11,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:11,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 12:28:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-23 12:28:11,304 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2018-11-23 12:28:11,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:11,304 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-23 12:28:11,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:28:11,305 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:28:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 12:28:11,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:11,306 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:11,306 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:11,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:11,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1736133359, now seen corresponding path program 26 times [2018-11-23 12:28:11,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:11,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:11,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:11,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:11,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:12,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {17941#true} call ULTIMATE.init(); {17941#true} is VALID [2018-11-23 12:28:12,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {17941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17941#true} is VALID [2018-11-23 12:28:12,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {17941#true} assume true; {17941#true} is VALID [2018-11-23 12:28:12,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17941#true} {17941#true} #66#return; {17941#true} is VALID [2018-11-23 12:28:12,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {17941#true} call #t~ret12 := main(); {17941#true} is VALID [2018-11-23 12:28:12,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {17941#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17943#(= main_~i~1 0)} is VALID [2018-11-23 12:28:12,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {17943#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17943#(= main_~i~1 0)} is VALID [2018-11-23 12:28:12,108 INFO L273 TraceCheckUtils]: 7: Hoare triple {17943#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17944#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:12,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {17944#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17944#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:12,109 INFO L273 TraceCheckUtils]: 9: Hoare triple {17944#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17945#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:12,109 INFO L273 TraceCheckUtils]: 10: Hoare triple {17945#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17945#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:12,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {17945#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17946#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:12,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {17946#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17946#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:12,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {17946#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17947#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:12,112 INFO L273 TraceCheckUtils]: 14: Hoare triple {17947#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17947#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:12,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {17947#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17948#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:12,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {17948#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17948#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:12,114 INFO L273 TraceCheckUtils]: 17: Hoare triple {17948#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17949#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:12,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {17949#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17949#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:12,115 INFO L273 TraceCheckUtils]: 19: Hoare triple {17949#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17950#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:12,116 INFO L273 TraceCheckUtils]: 20: Hoare triple {17950#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17950#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:12,117 INFO L273 TraceCheckUtils]: 21: Hoare triple {17950#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17951#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:12,117 INFO L273 TraceCheckUtils]: 22: Hoare triple {17951#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17951#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:12,118 INFO L273 TraceCheckUtils]: 23: Hoare triple {17951#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17952#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:12,119 INFO L273 TraceCheckUtils]: 24: Hoare triple {17952#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17952#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:12,119 INFO L273 TraceCheckUtils]: 25: Hoare triple {17952#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17953#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:12,120 INFO L273 TraceCheckUtils]: 26: Hoare triple {17953#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17953#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:12,121 INFO L273 TraceCheckUtils]: 27: Hoare triple {17953#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17954#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:12,122 INFO L273 TraceCheckUtils]: 28: Hoare triple {17954#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17954#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:12,122 INFO L273 TraceCheckUtils]: 29: Hoare triple {17954#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17955#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:12,123 INFO L273 TraceCheckUtils]: 30: Hoare triple {17955#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:12,124 INFO L273 TraceCheckUtils]: 31: Hoare triple {17955#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17956#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:12,124 INFO L273 TraceCheckUtils]: 32: Hoare triple {17956#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:12,125 INFO L273 TraceCheckUtils]: 33: Hoare triple {17956#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17957#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:12,126 INFO L273 TraceCheckUtils]: 34: Hoare triple {17957#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:12,127 INFO L273 TraceCheckUtils]: 35: Hoare triple {17957#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17958#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:12,127 INFO L273 TraceCheckUtils]: 36: Hoare triple {17958#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:12,128 INFO L273 TraceCheckUtils]: 37: Hoare triple {17958#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17959#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:12,129 INFO L273 TraceCheckUtils]: 38: Hoare triple {17959#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:12,130 INFO L273 TraceCheckUtils]: 39: Hoare triple {17959#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17960#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:12,130 INFO L273 TraceCheckUtils]: 40: Hoare triple {17960#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:12,131 INFO L273 TraceCheckUtils]: 41: Hoare triple {17960#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17961#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:12,132 INFO L273 TraceCheckUtils]: 42: Hoare triple {17961#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:12,132 INFO L273 TraceCheckUtils]: 43: Hoare triple {17961#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17962#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:12,133 INFO L273 TraceCheckUtils]: 44: Hoare triple {17962#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:12,134 INFO L273 TraceCheckUtils]: 45: Hoare triple {17962#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17963#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:12,134 INFO L273 TraceCheckUtils]: 46: Hoare triple {17963#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:12,135 INFO L273 TraceCheckUtils]: 47: Hoare triple {17963#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17964#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:12,136 INFO L273 TraceCheckUtils]: 48: Hoare triple {17964#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:12,137 INFO L273 TraceCheckUtils]: 49: Hoare triple {17964#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17965#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:12,137 INFO L273 TraceCheckUtils]: 50: Hoare triple {17965#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:12,138 INFO L273 TraceCheckUtils]: 51: Hoare triple {17965#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17966#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:12,139 INFO L273 TraceCheckUtils]: 52: Hoare triple {17966#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:12,140 INFO L273 TraceCheckUtils]: 53: Hoare triple {17966#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17967#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:12,140 INFO L273 TraceCheckUtils]: 54: Hoare triple {17967#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:28:12,141 INFO L273 TraceCheckUtils]: 55: Hoare triple {17967#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17968#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:12,142 INFO L273 TraceCheckUtils]: 56: Hoare triple {17968#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -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 25)} is VALID [2018-11-23 12:28:12,142 INFO L273 TraceCheckUtils]: 57: Hoare triple {17968#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17969#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:12,143 INFO L273 TraceCheckUtils]: 58: Hoare triple {17969#(<= main_~i~1 26)} assume !(~i~1 < 100000); {17942#false} is VALID [2018-11-23 12:28:12,144 INFO L256 TraceCheckUtils]: 59: Hoare triple {17942#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {17941#true} is VALID [2018-11-23 12:28:12,144 INFO L273 TraceCheckUtils]: 60: Hoare triple {17941#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17941#true} is VALID [2018-11-23 12:28:12,144 INFO L273 TraceCheckUtils]: 61: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,144 INFO L273 TraceCheckUtils]: 62: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,144 INFO L273 TraceCheckUtils]: 63: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,145 INFO L273 TraceCheckUtils]: 64: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,145 INFO L273 TraceCheckUtils]: 65: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,145 INFO L273 TraceCheckUtils]: 66: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,145 INFO L273 TraceCheckUtils]: 67: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,145 INFO L273 TraceCheckUtils]: 68: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,146 INFO L273 TraceCheckUtils]: 69: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,146 INFO L273 TraceCheckUtils]: 70: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,146 INFO L273 TraceCheckUtils]: 71: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,146 INFO L273 TraceCheckUtils]: 72: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,146 INFO L273 TraceCheckUtils]: 73: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,146 INFO L273 TraceCheckUtils]: 74: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,146 INFO L273 TraceCheckUtils]: 75: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,147 INFO L273 TraceCheckUtils]: 76: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,147 INFO L273 TraceCheckUtils]: 77: Hoare triple {17941#true} assume !(~i~0 < 100000); {17941#true} is VALID [2018-11-23 12:28:12,147 INFO L273 TraceCheckUtils]: 78: Hoare triple {17941#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {17941#true} is VALID [2018-11-23 12:28:12,147 INFO L273 TraceCheckUtils]: 79: Hoare triple {17941#true} assume true; {17941#true} is VALID [2018-11-23 12:28:12,147 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17941#true} {17942#false} #70#return; {17942#false} is VALID [2018-11-23 12:28:12,147 INFO L273 TraceCheckUtils]: 81: Hoare triple {17942#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); {17942#false} is VALID [2018-11-23 12:28:12,147 INFO L256 TraceCheckUtils]: 82: Hoare triple {17942#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {17941#true} is VALID [2018-11-23 12:28:12,148 INFO L273 TraceCheckUtils]: 83: Hoare triple {17941#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17941#true} is VALID [2018-11-23 12:28:12,148 INFO L273 TraceCheckUtils]: 84: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,148 INFO L273 TraceCheckUtils]: 85: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,148 INFO L273 TraceCheckUtils]: 86: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,148 INFO L273 TraceCheckUtils]: 87: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,148 INFO L273 TraceCheckUtils]: 88: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,148 INFO L273 TraceCheckUtils]: 89: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,149 INFO L273 TraceCheckUtils]: 90: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,149 INFO L273 TraceCheckUtils]: 91: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,149 INFO L273 TraceCheckUtils]: 92: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,149 INFO L273 TraceCheckUtils]: 93: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,149 INFO L273 TraceCheckUtils]: 94: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,149 INFO L273 TraceCheckUtils]: 95: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,149 INFO L273 TraceCheckUtils]: 96: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,149 INFO L273 TraceCheckUtils]: 97: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,150 INFO L273 TraceCheckUtils]: 98: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,150 INFO L273 TraceCheckUtils]: 99: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,150 INFO L273 TraceCheckUtils]: 100: Hoare triple {17941#true} assume !(~i~0 < 100000); {17941#true} is VALID [2018-11-23 12:28:12,150 INFO L273 TraceCheckUtils]: 101: Hoare triple {17941#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {17941#true} is VALID [2018-11-23 12:28:12,150 INFO L273 TraceCheckUtils]: 102: Hoare triple {17941#true} assume true; {17941#true} is VALID [2018-11-23 12:28:12,150 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17941#true} {17942#false} #72#return; {17942#false} is VALID [2018-11-23 12:28:12,150 INFO L273 TraceCheckUtils]: 104: Hoare triple {17942#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; {17942#false} is VALID [2018-11-23 12:28:12,151 INFO L273 TraceCheckUtils]: 105: Hoare triple {17942#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17942#false} is VALID [2018-11-23 12:28:12,151 INFO L273 TraceCheckUtils]: 106: Hoare triple {17942#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17942#false} is VALID [2018-11-23 12:28:12,151 INFO L273 TraceCheckUtils]: 107: Hoare triple {17942#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17942#false} is VALID [2018-11-23 12:28:12,151 INFO L273 TraceCheckUtils]: 108: Hoare triple {17942#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17942#false} is VALID [2018-11-23 12:28:12,151 INFO L273 TraceCheckUtils]: 109: Hoare triple {17942#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17942#false} is VALID [2018-11-23 12:28:12,151 INFO L273 TraceCheckUtils]: 110: Hoare triple {17942#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17942#false} is VALID [2018-11-23 12:28:12,151 INFO L273 TraceCheckUtils]: 111: Hoare triple {17942#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17942#false} is VALID [2018-11-23 12:28:12,152 INFO L273 TraceCheckUtils]: 112: Hoare triple {17942#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17942#false} is VALID [2018-11-23 12:28:12,152 INFO L273 TraceCheckUtils]: 113: Hoare triple {17942#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17942#false} is VALID [2018-11-23 12:28:12,152 INFO L273 TraceCheckUtils]: 114: Hoare triple {17942#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17942#false} is VALID [2018-11-23 12:28:12,152 INFO L273 TraceCheckUtils]: 115: Hoare triple {17942#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17942#false} is VALID [2018-11-23 12:28:12,152 INFO L273 TraceCheckUtils]: 116: Hoare triple {17942#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17942#false} is VALID [2018-11-23 12:28:12,152 INFO L273 TraceCheckUtils]: 117: Hoare triple {17942#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17942#false} is VALID [2018-11-23 12:28:12,152 INFO L273 TraceCheckUtils]: 118: Hoare triple {17942#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17942#false} is VALID [2018-11-23 12:28:12,153 INFO L273 TraceCheckUtils]: 119: Hoare triple {17942#false} assume !(~i~2 < 99999); {17942#false} is VALID [2018-11-23 12:28:12,153 INFO L273 TraceCheckUtils]: 120: Hoare triple {17942#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {17942#false} is VALID [2018-11-23 12:28:12,153 INFO L256 TraceCheckUtils]: 121: Hoare triple {17942#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {17941#true} is VALID [2018-11-23 12:28:12,153 INFO L273 TraceCheckUtils]: 122: Hoare triple {17941#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17941#true} is VALID [2018-11-23 12:28:12,153 INFO L273 TraceCheckUtils]: 123: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,153 INFO L273 TraceCheckUtils]: 124: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,153 INFO L273 TraceCheckUtils]: 125: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,154 INFO L273 TraceCheckUtils]: 126: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,154 INFO L273 TraceCheckUtils]: 127: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,154 INFO L273 TraceCheckUtils]: 128: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,154 INFO L273 TraceCheckUtils]: 129: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,154 INFO L273 TraceCheckUtils]: 130: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,154 INFO L273 TraceCheckUtils]: 131: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,154 INFO L273 TraceCheckUtils]: 132: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,154 INFO L273 TraceCheckUtils]: 133: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,155 INFO L273 TraceCheckUtils]: 134: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,155 INFO L273 TraceCheckUtils]: 135: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,155 INFO L273 TraceCheckUtils]: 136: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,155 INFO L273 TraceCheckUtils]: 137: Hoare triple {17941#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17941#true} is VALID [2018-11-23 12:28:12,155 INFO L273 TraceCheckUtils]: 138: Hoare triple {17941#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17941#true} is VALID [2018-11-23 12:28:12,155 INFO L273 TraceCheckUtils]: 139: Hoare triple {17941#true} assume !(~i~0 < 100000); {17941#true} is VALID [2018-11-23 12:28:12,155 INFO L273 TraceCheckUtils]: 140: Hoare triple {17941#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {17941#true} is VALID [2018-11-23 12:28:12,156 INFO L273 TraceCheckUtils]: 141: Hoare triple {17941#true} assume true; {17941#true} is VALID [2018-11-23 12:28:12,156 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17941#true} {17942#false} #74#return; {17942#false} is VALID [2018-11-23 12:28:12,177 INFO L273 TraceCheckUtils]: 143: Hoare triple {17942#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {17942#false} is VALID [2018-11-23 12:28:12,177 INFO L273 TraceCheckUtils]: 144: Hoare triple {17942#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {17942#false} is VALID [2018-11-23 12:28:12,177 INFO L273 TraceCheckUtils]: 145: Hoare triple {17942#false} assume !false; {17942#false} is VALID [2018-11-23 12:28:12,190 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:12,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:12,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:12,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:12,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:12,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:12,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:12,559 INFO L256 TraceCheckUtils]: 0: Hoare triple {17941#true} call ULTIMATE.init(); {17941#true} is VALID [2018-11-23 12:28:12,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {17941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17941#true} is VALID [2018-11-23 12:28:12,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {17941#true} assume true; {17941#true} is VALID [2018-11-23 12:28:12,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17941#true} {17941#true} #66#return; {17941#true} is VALID [2018-11-23 12:28:12,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {17941#true} call #t~ret12 := main(); {17941#true} is VALID [2018-11-23 12:28:12,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {17941#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17988#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:12,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {17988#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17988#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:12,561 INFO L273 TraceCheckUtils]: 7: Hoare triple {17988#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17944#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:12,562 INFO L273 TraceCheckUtils]: 8: Hoare triple {17944#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17944#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:12,562 INFO L273 TraceCheckUtils]: 9: Hoare triple {17944#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17945#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:12,562 INFO L273 TraceCheckUtils]: 10: Hoare triple {17945#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17945#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:12,563 INFO L273 TraceCheckUtils]: 11: Hoare triple {17945#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17946#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:12,563 INFO L273 TraceCheckUtils]: 12: Hoare triple {17946#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17946#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:12,564 INFO L273 TraceCheckUtils]: 13: Hoare triple {17946#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17947#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:12,565 INFO L273 TraceCheckUtils]: 14: Hoare triple {17947#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17947#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:12,565 INFO L273 TraceCheckUtils]: 15: Hoare triple {17947#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17948#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:12,566 INFO L273 TraceCheckUtils]: 16: Hoare triple {17948#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17948#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:12,567 INFO L273 TraceCheckUtils]: 17: Hoare triple {17948#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17949#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:12,567 INFO L273 TraceCheckUtils]: 18: Hoare triple {17949#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17949#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:12,568 INFO L273 TraceCheckUtils]: 19: Hoare triple {17949#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17950#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:12,568 INFO L273 TraceCheckUtils]: 20: Hoare triple {17950#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17950#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:12,569 INFO L273 TraceCheckUtils]: 21: Hoare triple {17950#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17951#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:12,570 INFO L273 TraceCheckUtils]: 22: Hoare triple {17951#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17951#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:12,570 INFO L273 TraceCheckUtils]: 23: Hoare triple {17951#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17952#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:12,571 INFO L273 TraceCheckUtils]: 24: Hoare triple {17952#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17952#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:12,571 INFO L273 TraceCheckUtils]: 25: Hoare triple {17952#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17953#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:12,572 INFO L273 TraceCheckUtils]: 26: Hoare triple {17953#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17953#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:12,573 INFO L273 TraceCheckUtils]: 27: Hoare triple {17953#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17954#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:12,573 INFO L273 TraceCheckUtils]: 28: Hoare triple {17954#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17954#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:12,574 INFO L273 TraceCheckUtils]: 29: Hoare triple {17954#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17955#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:12,574 INFO L273 TraceCheckUtils]: 30: Hoare triple {17955#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:12,575 INFO L273 TraceCheckUtils]: 31: Hoare triple {17955#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17956#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:12,576 INFO L273 TraceCheckUtils]: 32: Hoare triple {17956#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:12,576 INFO L273 TraceCheckUtils]: 33: Hoare triple {17956#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17957#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:12,577 INFO L273 TraceCheckUtils]: 34: Hoare triple {17957#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:12,578 INFO L273 TraceCheckUtils]: 35: Hoare triple {17957#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17958#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:12,578 INFO L273 TraceCheckUtils]: 36: Hoare triple {17958#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:12,579 INFO L273 TraceCheckUtils]: 37: Hoare triple {17958#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17959#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:12,579 INFO L273 TraceCheckUtils]: 38: Hoare triple {17959#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:12,580 INFO L273 TraceCheckUtils]: 39: Hoare triple {17959#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17960#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:12,585 INFO L273 TraceCheckUtils]: 40: Hoare triple {17960#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:12,586 INFO L273 TraceCheckUtils]: 41: Hoare triple {17960#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17961#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:12,586 INFO L273 TraceCheckUtils]: 42: Hoare triple {17961#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:12,587 INFO L273 TraceCheckUtils]: 43: Hoare triple {17961#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17962#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:12,587 INFO L273 TraceCheckUtils]: 44: Hoare triple {17962#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:12,588 INFO L273 TraceCheckUtils]: 45: Hoare triple {17962#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17963#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:12,588 INFO L273 TraceCheckUtils]: 46: Hoare triple {17963#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:12,588 INFO L273 TraceCheckUtils]: 47: Hoare triple {17963#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17964#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:12,589 INFO L273 TraceCheckUtils]: 48: Hoare triple {17964#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:12,589 INFO L273 TraceCheckUtils]: 49: Hoare triple {17964#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17965#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:12,589 INFO L273 TraceCheckUtils]: 50: Hoare triple {17965#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:12,590 INFO L273 TraceCheckUtils]: 51: Hoare triple {17965#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17966#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:12,591 INFO L273 TraceCheckUtils]: 52: Hoare triple {17966#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:12,591 INFO L273 TraceCheckUtils]: 53: Hoare triple {17966#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17967#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:12,592 INFO L273 TraceCheckUtils]: 54: Hoare triple {17967#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:28:12,593 INFO L273 TraceCheckUtils]: 55: Hoare triple {17967#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17968#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:12,593 INFO L273 TraceCheckUtils]: 56: Hoare triple {17968#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -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 25)} is VALID [2018-11-23 12:28:12,594 INFO L273 TraceCheckUtils]: 57: Hoare triple {17968#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17969#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:12,595 INFO L273 TraceCheckUtils]: 58: Hoare triple {17969#(<= main_~i~1 26)} assume !(~i~1 < 100000); {17942#false} is VALID [2018-11-23 12:28:12,595 INFO L256 TraceCheckUtils]: 59: Hoare triple {17942#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {17942#false} is VALID [2018-11-23 12:28:12,595 INFO L273 TraceCheckUtils]: 60: Hoare triple {17942#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17942#false} is VALID [2018-11-23 12:28:12,595 INFO L273 TraceCheckUtils]: 61: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,595 INFO L273 TraceCheckUtils]: 62: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,596 INFO L273 TraceCheckUtils]: 63: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,596 INFO L273 TraceCheckUtils]: 64: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,596 INFO L273 TraceCheckUtils]: 65: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,596 INFO L273 TraceCheckUtils]: 66: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,596 INFO L273 TraceCheckUtils]: 67: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,596 INFO L273 TraceCheckUtils]: 68: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,597 INFO L273 TraceCheckUtils]: 69: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,597 INFO L273 TraceCheckUtils]: 70: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,597 INFO L273 TraceCheckUtils]: 71: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,597 INFO L273 TraceCheckUtils]: 72: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,597 INFO L273 TraceCheckUtils]: 73: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,598 INFO L273 TraceCheckUtils]: 74: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,598 INFO L273 TraceCheckUtils]: 75: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,598 INFO L273 TraceCheckUtils]: 76: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,598 INFO L273 TraceCheckUtils]: 77: Hoare triple {17942#false} assume !(~i~0 < 100000); {17942#false} is VALID [2018-11-23 12:28:12,598 INFO L273 TraceCheckUtils]: 78: Hoare triple {17942#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {17942#false} is VALID [2018-11-23 12:28:12,598 INFO L273 TraceCheckUtils]: 79: Hoare triple {17942#false} assume true; {17942#false} is VALID [2018-11-23 12:28:12,599 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17942#false} {17942#false} #70#return; {17942#false} is VALID [2018-11-23 12:28:12,599 INFO L273 TraceCheckUtils]: 81: Hoare triple {17942#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); {17942#false} is VALID [2018-11-23 12:28:12,599 INFO L256 TraceCheckUtils]: 82: Hoare triple {17942#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {17942#false} is VALID [2018-11-23 12:28:12,599 INFO L273 TraceCheckUtils]: 83: Hoare triple {17942#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17942#false} is VALID [2018-11-23 12:28:12,599 INFO L273 TraceCheckUtils]: 84: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,599 INFO L273 TraceCheckUtils]: 85: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,599 INFO L273 TraceCheckUtils]: 86: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,600 INFO L273 TraceCheckUtils]: 87: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,600 INFO L273 TraceCheckUtils]: 88: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,600 INFO L273 TraceCheckUtils]: 89: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,600 INFO L273 TraceCheckUtils]: 90: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,600 INFO L273 TraceCheckUtils]: 91: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,600 INFO L273 TraceCheckUtils]: 92: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,600 INFO L273 TraceCheckUtils]: 93: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,600 INFO L273 TraceCheckUtils]: 94: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,600 INFO L273 TraceCheckUtils]: 95: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,600 INFO L273 TraceCheckUtils]: 96: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,601 INFO L273 TraceCheckUtils]: 97: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,601 INFO L273 TraceCheckUtils]: 98: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,601 INFO L273 TraceCheckUtils]: 99: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,601 INFO L273 TraceCheckUtils]: 100: Hoare triple {17942#false} assume !(~i~0 < 100000); {17942#false} is VALID [2018-11-23 12:28:12,601 INFO L273 TraceCheckUtils]: 101: Hoare triple {17942#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {17942#false} is VALID [2018-11-23 12:28:12,601 INFO L273 TraceCheckUtils]: 102: Hoare triple {17942#false} assume true; {17942#false} is VALID [2018-11-23 12:28:12,601 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17942#false} {17942#false} #72#return; {17942#false} is VALID [2018-11-23 12:28:12,601 INFO L273 TraceCheckUtils]: 104: Hoare triple {17942#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; {17942#false} is VALID [2018-11-23 12:28:12,601 INFO L273 TraceCheckUtils]: 105: Hoare triple {17942#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17942#false} is VALID [2018-11-23 12:28:12,602 INFO L273 TraceCheckUtils]: 106: Hoare triple {17942#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17942#false} is VALID [2018-11-23 12:28:12,602 INFO L273 TraceCheckUtils]: 107: Hoare triple {17942#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17942#false} is VALID [2018-11-23 12:28:12,602 INFO L273 TraceCheckUtils]: 108: Hoare triple {17942#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17942#false} is VALID [2018-11-23 12:28:12,602 INFO L273 TraceCheckUtils]: 109: Hoare triple {17942#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17942#false} is VALID [2018-11-23 12:28:12,602 INFO L273 TraceCheckUtils]: 110: Hoare triple {17942#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17942#false} is VALID [2018-11-23 12:28:12,602 INFO L273 TraceCheckUtils]: 111: Hoare triple {17942#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17942#false} is VALID [2018-11-23 12:28:12,602 INFO L273 TraceCheckUtils]: 112: Hoare triple {17942#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17942#false} is VALID [2018-11-23 12:28:12,602 INFO L273 TraceCheckUtils]: 113: Hoare triple {17942#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17942#false} is VALID [2018-11-23 12:28:12,602 INFO L273 TraceCheckUtils]: 114: Hoare triple {17942#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17942#false} is VALID [2018-11-23 12:28:12,602 INFO L273 TraceCheckUtils]: 115: Hoare triple {17942#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17942#false} is VALID [2018-11-23 12:28:12,603 INFO L273 TraceCheckUtils]: 116: Hoare triple {17942#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17942#false} is VALID [2018-11-23 12:28:12,603 INFO L273 TraceCheckUtils]: 117: Hoare triple {17942#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17942#false} is VALID [2018-11-23 12:28:12,603 INFO L273 TraceCheckUtils]: 118: Hoare triple {17942#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17942#false} is VALID [2018-11-23 12:28:12,603 INFO L273 TraceCheckUtils]: 119: Hoare triple {17942#false} assume !(~i~2 < 99999); {17942#false} is VALID [2018-11-23 12:28:12,603 INFO L273 TraceCheckUtils]: 120: Hoare triple {17942#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {17942#false} is VALID [2018-11-23 12:28:12,603 INFO L256 TraceCheckUtils]: 121: Hoare triple {17942#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {17942#false} is VALID [2018-11-23 12:28:12,603 INFO L273 TraceCheckUtils]: 122: Hoare triple {17942#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17942#false} is VALID [2018-11-23 12:28:12,603 INFO L273 TraceCheckUtils]: 123: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,603 INFO L273 TraceCheckUtils]: 124: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,604 INFO L273 TraceCheckUtils]: 125: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,604 INFO L273 TraceCheckUtils]: 126: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,604 INFO L273 TraceCheckUtils]: 127: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,604 INFO L273 TraceCheckUtils]: 128: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,604 INFO L273 TraceCheckUtils]: 129: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,604 INFO L273 TraceCheckUtils]: 130: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,604 INFO L273 TraceCheckUtils]: 131: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,604 INFO L273 TraceCheckUtils]: 132: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,604 INFO L273 TraceCheckUtils]: 133: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,604 INFO L273 TraceCheckUtils]: 134: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,605 INFO L273 TraceCheckUtils]: 135: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,605 INFO L273 TraceCheckUtils]: 136: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,605 INFO L273 TraceCheckUtils]: 137: Hoare triple {17942#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17942#false} is VALID [2018-11-23 12:28:12,605 INFO L273 TraceCheckUtils]: 138: Hoare triple {17942#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17942#false} is VALID [2018-11-23 12:28:12,605 INFO L273 TraceCheckUtils]: 139: Hoare triple {17942#false} assume !(~i~0 < 100000); {17942#false} is VALID [2018-11-23 12:28:12,605 INFO L273 TraceCheckUtils]: 140: Hoare triple {17942#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {17942#false} is VALID [2018-11-23 12:28:12,605 INFO L273 TraceCheckUtils]: 141: Hoare triple {17942#false} assume true; {17942#false} is VALID [2018-11-23 12:28:12,605 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17942#false} {17942#false} #74#return; {17942#false} is VALID [2018-11-23 12:28:12,605 INFO L273 TraceCheckUtils]: 143: Hoare triple {17942#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {17942#false} is VALID [2018-11-23 12:28:12,606 INFO L273 TraceCheckUtils]: 144: Hoare triple {17942#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {17942#false} is VALID [2018-11-23 12:28:12,606 INFO L273 TraceCheckUtils]: 145: Hoare triple {17942#false} assume !false; {17942#false} is VALID [2018-11-23 12:28:12,616 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:12,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:12,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:28:12,635 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:28:12,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:12,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:28:12,729 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:12,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:28:12,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:28:12,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:28:12,731 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2018-11-23 12:28:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:13,487 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-11-23 12:28:13,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:28:13,487 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:28:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:28:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:28:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:28:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:28:13,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 106 transitions. [2018-11-23 12:28:13,653 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:13,655 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:28:13,655 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:28:13,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:28:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:28:13,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-23 12:28:13,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:13,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-23 12:28:13,706 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-23 12:28:13,706 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-23 12:28:13,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:13,708 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:28:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:28:13,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:13,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:13,709 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-23 12:28:13,709 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-23 12:28:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:13,710 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:28:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:28:13,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:13,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:13,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:13,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:28:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-23 12:28:13,713 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2018-11-23 12:28:13,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:13,713 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-23 12:28:13,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:28:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:28:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:28:13,714 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:13,715 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:13,715 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:13,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:13,715 INFO L82 PathProgramCache]: Analyzing trace with hash 570812147, now seen corresponding path program 27 times [2018-11-23 12:28:13,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:13,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:13,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:13,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:13,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:14,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {19012#true} call ULTIMATE.init(); {19012#true} is VALID [2018-11-23 12:28:14,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {19012#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19012#true} is VALID [2018-11-23 12:28:14,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {19012#true} assume true; {19012#true} is VALID [2018-11-23 12:28:14,461 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19012#true} {19012#true} #66#return; {19012#true} is VALID [2018-11-23 12:28:14,461 INFO L256 TraceCheckUtils]: 4: Hoare triple {19012#true} call #t~ret12 := main(); {19012#true} is VALID [2018-11-23 12:28:14,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {19012#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19014#(= main_~i~1 0)} is VALID [2018-11-23 12:28:14,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {19014#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19014#(= main_~i~1 0)} is VALID [2018-11-23 12:28:14,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {19014#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19015#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:14,463 INFO L273 TraceCheckUtils]: 8: Hoare triple {19015#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19015#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:14,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {19015#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19016#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:14,464 INFO L273 TraceCheckUtils]: 10: Hoare triple {19016#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19016#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:14,465 INFO L273 TraceCheckUtils]: 11: Hoare triple {19016#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19017#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:14,465 INFO L273 TraceCheckUtils]: 12: Hoare triple {19017#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19017#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:14,465 INFO L273 TraceCheckUtils]: 13: Hoare triple {19017#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19018#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:14,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {19018#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19018#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:14,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {19018#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19019#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:14,467 INFO L273 TraceCheckUtils]: 16: Hoare triple {19019#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19019#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:14,467 INFO L273 TraceCheckUtils]: 17: Hoare triple {19019#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19020#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:14,468 INFO L273 TraceCheckUtils]: 18: Hoare triple {19020#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19020#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:14,469 INFO L273 TraceCheckUtils]: 19: Hoare triple {19020#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19021#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:14,469 INFO L273 TraceCheckUtils]: 20: Hoare triple {19021#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19021#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:14,470 INFO L273 TraceCheckUtils]: 21: Hoare triple {19021#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19022#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:14,470 INFO L273 TraceCheckUtils]: 22: Hoare triple {19022#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19022#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:14,471 INFO L273 TraceCheckUtils]: 23: Hoare triple {19022#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19023#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:14,471 INFO L273 TraceCheckUtils]: 24: Hoare triple {19023#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19023#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:14,472 INFO L273 TraceCheckUtils]: 25: Hoare triple {19023#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:14,472 INFO L273 TraceCheckUtils]: 26: Hoare triple {19024#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:14,473 INFO L273 TraceCheckUtils]: 27: Hoare triple {19024#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19025#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:14,474 INFO L273 TraceCheckUtils]: 28: Hoare triple {19025#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19025#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:14,474 INFO L273 TraceCheckUtils]: 29: Hoare triple {19025#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19026#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:14,475 INFO L273 TraceCheckUtils]: 30: Hoare triple {19026#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:14,475 INFO L273 TraceCheckUtils]: 31: Hoare triple {19026#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19027#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:14,476 INFO L273 TraceCheckUtils]: 32: Hoare triple {19027#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:14,477 INFO L273 TraceCheckUtils]: 33: Hoare triple {19027#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19028#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:14,477 INFO L273 TraceCheckUtils]: 34: Hoare triple {19028#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:14,478 INFO L273 TraceCheckUtils]: 35: Hoare triple {19028#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19029#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:14,478 INFO L273 TraceCheckUtils]: 36: Hoare triple {19029#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:14,479 INFO L273 TraceCheckUtils]: 37: Hoare triple {19029#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19030#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:14,479 INFO L273 TraceCheckUtils]: 38: Hoare triple {19030#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:14,480 INFO L273 TraceCheckUtils]: 39: Hoare triple {19030#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19031#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:14,481 INFO L273 TraceCheckUtils]: 40: Hoare triple {19031#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:14,481 INFO L273 TraceCheckUtils]: 41: Hoare triple {19031#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19032#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:14,482 INFO L273 TraceCheckUtils]: 42: Hoare triple {19032#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:14,482 INFO L273 TraceCheckUtils]: 43: Hoare triple {19032#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19033#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:14,483 INFO L273 TraceCheckUtils]: 44: Hoare triple {19033#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:14,484 INFO L273 TraceCheckUtils]: 45: Hoare triple {19033#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19034#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:14,484 INFO L273 TraceCheckUtils]: 46: Hoare triple {19034#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:14,485 INFO L273 TraceCheckUtils]: 47: Hoare triple {19034#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19035#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:14,485 INFO L273 TraceCheckUtils]: 48: Hoare triple {19035#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:14,486 INFO L273 TraceCheckUtils]: 49: Hoare triple {19035#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19036#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:14,486 INFO L273 TraceCheckUtils]: 50: Hoare triple {19036#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:14,487 INFO L273 TraceCheckUtils]: 51: Hoare triple {19036#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19037#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:14,487 INFO L273 TraceCheckUtils]: 52: Hoare triple {19037#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:14,488 INFO L273 TraceCheckUtils]: 53: Hoare triple {19037#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19038#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:14,489 INFO L273 TraceCheckUtils]: 54: Hoare triple {19038#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:28:14,489 INFO L273 TraceCheckUtils]: 55: Hoare triple {19038#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19039#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:14,490 INFO L273 TraceCheckUtils]: 56: Hoare triple {19039#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -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 25)} is VALID [2018-11-23 12:28:14,490 INFO L273 TraceCheckUtils]: 57: Hoare triple {19039#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19040#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:14,491 INFO L273 TraceCheckUtils]: 58: Hoare triple {19040#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -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 26)} is VALID [2018-11-23 12:28:14,492 INFO L273 TraceCheckUtils]: 59: Hoare triple {19040#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19041#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:14,492 INFO L273 TraceCheckUtils]: 60: Hoare triple {19041#(<= main_~i~1 27)} assume !(~i~1 < 100000); {19013#false} is VALID [2018-11-23 12:28:14,492 INFO L256 TraceCheckUtils]: 61: Hoare triple {19013#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {19012#true} is VALID [2018-11-23 12:28:14,493 INFO L273 TraceCheckUtils]: 62: Hoare triple {19012#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19012#true} is VALID [2018-11-23 12:28:14,493 INFO L273 TraceCheckUtils]: 63: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,493 INFO L273 TraceCheckUtils]: 64: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,493 INFO L273 TraceCheckUtils]: 65: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,493 INFO L273 TraceCheckUtils]: 66: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,493 INFO L273 TraceCheckUtils]: 67: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,494 INFO L273 TraceCheckUtils]: 68: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,494 INFO L273 TraceCheckUtils]: 69: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,494 INFO L273 TraceCheckUtils]: 70: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,494 INFO L273 TraceCheckUtils]: 71: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,494 INFO L273 TraceCheckUtils]: 72: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,494 INFO L273 TraceCheckUtils]: 73: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,495 INFO L273 TraceCheckUtils]: 74: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,495 INFO L273 TraceCheckUtils]: 75: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,495 INFO L273 TraceCheckUtils]: 76: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,495 INFO L273 TraceCheckUtils]: 77: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,495 INFO L273 TraceCheckUtils]: 78: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,495 INFO L273 TraceCheckUtils]: 79: Hoare triple {19012#true} assume !(~i~0 < 100000); {19012#true} is VALID [2018-11-23 12:28:14,495 INFO L273 TraceCheckUtils]: 80: Hoare triple {19012#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {19012#true} is VALID [2018-11-23 12:28:14,495 INFO L273 TraceCheckUtils]: 81: Hoare triple {19012#true} assume true; {19012#true} is VALID [2018-11-23 12:28:14,496 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19012#true} {19013#false} #70#return; {19013#false} is VALID [2018-11-23 12:28:14,496 INFO L273 TraceCheckUtils]: 83: Hoare triple {19013#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); {19013#false} is VALID [2018-11-23 12:28:14,496 INFO L256 TraceCheckUtils]: 84: Hoare triple {19013#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {19012#true} is VALID [2018-11-23 12:28:14,496 INFO L273 TraceCheckUtils]: 85: Hoare triple {19012#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19012#true} is VALID [2018-11-23 12:28:14,496 INFO L273 TraceCheckUtils]: 86: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,496 INFO L273 TraceCheckUtils]: 87: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,496 INFO L273 TraceCheckUtils]: 88: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,496 INFO L273 TraceCheckUtils]: 89: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,496 INFO L273 TraceCheckUtils]: 90: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,496 INFO L273 TraceCheckUtils]: 91: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,497 INFO L273 TraceCheckUtils]: 92: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,497 INFO L273 TraceCheckUtils]: 93: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,497 INFO L273 TraceCheckUtils]: 94: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,497 INFO L273 TraceCheckUtils]: 95: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,497 INFO L273 TraceCheckUtils]: 96: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,497 INFO L273 TraceCheckUtils]: 97: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,497 INFO L273 TraceCheckUtils]: 98: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,497 INFO L273 TraceCheckUtils]: 99: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,497 INFO L273 TraceCheckUtils]: 100: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,498 INFO L273 TraceCheckUtils]: 101: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,498 INFO L273 TraceCheckUtils]: 102: Hoare triple {19012#true} assume !(~i~0 < 100000); {19012#true} is VALID [2018-11-23 12:28:14,498 INFO L273 TraceCheckUtils]: 103: Hoare triple {19012#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {19012#true} is VALID [2018-11-23 12:28:14,498 INFO L273 TraceCheckUtils]: 104: Hoare triple {19012#true} assume true; {19012#true} is VALID [2018-11-23 12:28:14,498 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19012#true} {19013#false} #72#return; {19013#false} is VALID [2018-11-23 12:28:14,498 INFO L273 TraceCheckUtils]: 106: Hoare triple {19013#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; {19013#false} is VALID [2018-11-23 12:28:14,498 INFO L273 TraceCheckUtils]: 107: Hoare triple {19013#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19013#false} is VALID [2018-11-23 12:28:14,498 INFO L273 TraceCheckUtils]: 108: Hoare triple {19013#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19013#false} is VALID [2018-11-23 12:28:14,498 INFO L273 TraceCheckUtils]: 109: Hoare triple {19013#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19013#false} is VALID [2018-11-23 12:28:14,498 INFO L273 TraceCheckUtils]: 110: Hoare triple {19013#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19013#false} is VALID [2018-11-23 12:28:14,499 INFO L273 TraceCheckUtils]: 111: Hoare triple {19013#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19013#false} is VALID [2018-11-23 12:28:14,499 INFO L273 TraceCheckUtils]: 112: Hoare triple {19013#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19013#false} is VALID [2018-11-23 12:28:14,499 INFO L273 TraceCheckUtils]: 113: Hoare triple {19013#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19013#false} is VALID [2018-11-23 12:28:14,499 INFO L273 TraceCheckUtils]: 114: Hoare triple {19013#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19013#false} is VALID [2018-11-23 12:28:14,499 INFO L273 TraceCheckUtils]: 115: Hoare triple {19013#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19013#false} is VALID [2018-11-23 12:28:14,499 INFO L273 TraceCheckUtils]: 116: Hoare triple {19013#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19013#false} is VALID [2018-11-23 12:28:14,499 INFO L273 TraceCheckUtils]: 117: Hoare triple {19013#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19013#false} is VALID [2018-11-23 12:28:14,499 INFO L273 TraceCheckUtils]: 118: Hoare triple {19013#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19013#false} is VALID [2018-11-23 12:28:14,499 INFO L273 TraceCheckUtils]: 119: Hoare triple {19013#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19013#false} is VALID [2018-11-23 12:28:14,499 INFO L273 TraceCheckUtils]: 120: Hoare triple {19013#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19013#false} is VALID [2018-11-23 12:28:14,500 INFO L273 TraceCheckUtils]: 121: Hoare triple {19013#false} assume !(~i~2 < 99999); {19013#false} is VALID [2018-11-23 12:28:14,500 INFO L273 TraceCheckUtils]: 122: Hoare triple {19013#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {19013#false} is VALID [2018-11-23 12:28:14,500 INFO L256 TraceCheckUtils]: 123: Hoare triple {19013#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {19012#true} is VALID [2018-11-23 12:28:14,500 INFO L273 TraceCheckUtils]: 124: Hoare triple {19012#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19012#true} is VALID [2018-11-23 12:28:14,500 INFO L273 TraceCheckUtils]: 125: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,500 INFO L273 TraceCheckUtils]: 126: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,500 INFO L273 TraceCheckUtils]: 127: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,500 INFO L273 TraceCheckUtils]: 128: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,500 INFO L273 TraceCheckUtils]: 129: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,501 INFO L273 TraceCheckUtils]: 130: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,501 INFO L273 TraceCheckUtils]: 131: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,501 INFO L273 TraceCheckUtils]: 132: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,501 INFO L273 TraceCheckUtils]: 133: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,501 INFO L273 TraceCheckUtils]: 134: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,501 INFO L273 TraceCheckUtils]: 135: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,501 INFO L273 TraceCheckUtils]: 136: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,501 INFO L273 TraceCheckUtils]: 137: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,501 INFO L273 TraceCheckUtils]: 138: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,501 INFO L273 TraceCheckUtils]: 139: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,502 INFO L273 TraceCheckUtils]: 140: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,502 INFO L273 TraceCheckUtils]: 141: Hoare triple {19012#true} assume !(~i~0 < 100000); {19012#true} is VALID [2018-11-23 12:28:14,502 INFO L273 TraceCheckUtils]: 142: Hoare triple {19012#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {19012#true} is VALID [2018-11-23 12:28:14,502 INFO L273 TraceCheckUtils]: 143: Hoare triple {19012#true} assume true; {19012#true} is VALID [2018-11-23 12:28:14,502 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19012#true} {19013#false} #74#return; {19013#false} is VALID [2018-11-23 12:28:14,502 INFO L273 TraceCheckUtils]: 145: Hoare triple {19013#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {19013#false} is VALID [2018-11-23 12:28:14,502 INFO L273 TraceCheckUtils]: 146: Hoare triple {19013#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {19013#false} is VALID [2018-11-23 12:28:14,502 INFO L273 TraceCheckUtils]: 147: Hoare triple {19013#false} assume !false; {19013#false} is VALID [2018-11-23 12:28:14,512 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:14,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:14,513 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:14,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:14,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:28:14,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:14,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:14,971 INFO L256 TraceCheckUtils]: 0: Hoare triple {19012#true} call ULTIMATE.init(); {19012#true} is VALID [2018-11-23 12:28:14,971 INFO L273 TraceCheckUtils]: 1: Hoare triple {19012#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19012#true} is VALID [2018-11-23 12:28:14,971 INFO L273 TraceCheckUtils]: 2: Hoare triple {19012#true} assume true; {19012#true} is VALID [2018-11-23 12:28:14,971 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19012#true} {19012#true} #66#return; {19012#true} is VALID [2018-11-23 12:28:14,971 INFO L256 TraceCheckUtils]: 4: Hoare triple {19012#true} call #t~ret12 := main(); {19012#true} is VALID [2018-11-23 12:28:14,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {19012#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19012#true} is VALID [2018-11-23 12:28:14,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,972 INFO L273 TraceCheckUtils]: 7: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,973 INFO L273 TraceCheckUtils]: 10: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,973 INFO L273 TraceCheckUtils]: 11: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,973 INFO L273 TraceCheckUtils]: 12: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,973 INFO L273 TraceCheckUtils]: 16: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,973 INFO L273 TraceCheckUtils]: 17: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,973 INFO L273 TraceCheckUtils]: 18: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,974 INFO L273 TraceCheckUtils]: 19: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,974 INFO L273 TraceCheckUtils]: 20: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,974 INFO L273 TraceCheckUtils]: 21: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,974 INFO L273 TraceCheckUtils]: 22: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,974 INFO L273 TraceCheckUtils]: 23: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,974 INFO L273 TraceCheckUtils]: 24: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,974 INFO L273 TraceCheckUtils]: 25: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,974 INFO L273 TraceCheckUtils]: 26: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,974 INFO L273 TraceCheckUtils]: 27: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,974 INFO L273 TraceCheckUtils]: 28: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,975 INFO L273 TraceCheckUtils]: 29: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,975 INFO L273 TraceCheckUtils]: 30: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,975 INFO L273 TraceCheckUtils]: 31: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,975 INFO L273 TraceCheckUtils]: 32: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,975 INFO L273 TraceCheckUtils]: 33: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,975 INFO L273 TraceCheckUtils]: 34: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,975 INFO L273 TraceCheckUtils]: 35: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,975 INFO L273 TraceCheckUtils]: 36: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,975 INFO L273 TraceCheckUtils]: 37: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,976 INFO L273 TraceCheckUtils]: 38: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,976 INFO L273 TraceCheckUtils]: 39: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,976 INFO L273 TraceCheckUtils]: 40: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,976 INFO L273 TraceCheckUtils]: 41: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,976 INFO L273 TraceCheckUtils]: 42: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,976 INFO L273 TraceCheckUtils]: 43: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,976 INFO L273 TraceCheckUtils]: 44: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,976 INFO L273 TraceCheckUtils]: 45: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,976 INFO L273 TraceCheckUtils]: 46: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,976 INFO L273 TraceCheckUtils]: 47: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,977 INFO L273 TraceCheckUtils]: 48: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,977 INFO L273 TraceCheckUtils]: 49: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,977 INFO L273 TraceCheckUtils]: 50: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,977 INFO L273 TraceCheckUtils]: 51: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,977 INFO L273 TraceCheckUtils]: 52: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,977 INFO L273 TraceCheckUtils]: 53: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,977 INFO L273 TraceCheckUtils]: 54: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,977 INFO L273 TraceCheckUtils]: 55: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,977 INFO L273 TraceCheckUtils]: 56: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,977 INFO L273 TraceCheckUtils]: 57: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,978 INFO L273 TraceCheckUtils]: 58: Hoare triple {19012#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19012#true} is VALID [2018-11-23 12:28:14,978 INFO L273 TraceCheckUtils]: 59: Hoare triple {19012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19012#true} is VALID [2018-11-23 12:28:14,978 INFO L273 TraceCheckUtils]: 60: Hoare triple {19012#true} assume !(~i~1 < 100000); {19012#true} is VALID [2018-11-23 12:28:14,978 INFO L256 TraceCheckUtils]: 61: Hoare triple {19012#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {19012#true} is VALID [2018-11-23 12:28:14,978 INFO L273 TraceCheckUtils]: 62: Hoare triple {19012#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19012#true} is VALID [2018-11-23 12:28:14,978 INFO L273 TraceCheckUtils]: 63: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,978 INFO L273 TraceCheckUtils]: 64: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,978 INFO L273 TraceCheckUtils]: 65: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,978 INFO L273 TraceCheckUtils]: 66: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,979 INFO L273 TraceCheckUtils]: 67: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,979 INFO L273 TraceCheckUtils]: 68: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,979 INFO L273 TraceCheckUtils]: 69: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,979 INFO L273 TraceCheckUtils]: 70: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,979 INFO L273 TraceCheckUtils]: 71: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,979 INFO L273 TraceCheckUtils]: 72: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,979 INFO L273 TraceCheckUtils]: 73: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,979 INFO L273 TraceCheckUtils]: 74: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,979 INFO L273 TraceCheckUtils]: 75: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,980 INFO L273 TraceCheckUtils]: 76: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,980 INFO L273 TraceCheckUtils]: 77: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,980 INFO L273 TraceCheckUtils]: 78: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,980 INFO L273 TraceCheckUtils]: 79: Hoare triple {19012#true} assume !(~i~0 < 100000); {19012#true} is VALID [2018-11-23 12:28:14,980 INFO L273 TraceCheckUtils]: 80: Hoare triple {19012#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {19012#true} is VALID [2018-11-23 12:28:14,980 INFO L273 TraceCheckUtils]: 81: Hoare triple {19012#true} assume true; {19012#true} is VALID [2018-11-23 12:28:14,980 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19012#true} {19012#true} #70#return; {19012#true} is VALID [2018-11-23 12:28:14,980 INFO L273 TraceCheckUtils]: 83: Hoare triple {19012#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); {19012#true} is VALID [2018-11-23 12:28:14,980 INFO L256 TraceCheckUtils]: 84: Hoare triple {19012#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {19012#true} is VALID [2018-11-23 12:28:14,980 INFO L273 TraceCheckUtils]: 85: Hoare triple {19012#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19012#true} is VALID [2018-11-23 12:28:14,981 INFO L273 TraceCheckUtils]: 86: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,981 INFO L273 TraceCheckUtils]: 87: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,981 INFO L273 TraceCheckUtils]: 88: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,981 INFO L273 TraceCheckUtils]: 89: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,981 INFO L273 TraceCheckUtils]: 90: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,981 INFO L273 TraceCheckUtils]: 91: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,981 INFO L273 TraceCheckUtils]: 92: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,981 INFO L273 TraceCheckUtils]: 93: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,981 INFO L273 TraceCheckUtils]: 94: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,982 INFO L273 TraceCheckUtils]: 95: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,982 INFO L273 TraceCheckUtils]: 96: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,982 INFO L273 TraceCheckUtils]: 97: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,982 INFO L273 TraceCheckUtils]: 98: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,982 INFO L273 TraceCheckUtils]: 99: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,982 INFO L273 TraceCheckUtils]: 100: Hoare triple {19012#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19012#true} is VALID [2018-11-23 12:28:14,982 INFO L273 TraceCheckUtils]: 101: Hoare triple {19012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19012#true} is VALID [2018-11-23 12:28:14,982 INFO L273 TraceCheckUtils]: 102: Hoare triple {19012#true} assume !(~i~0 < 100000); {19012#true} is VALID [2018-11-23 12:28:14,982 INFO L273 TraceCheckUtils]: 103: Hoare triple {19012#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {19012#true} is VALID [2018-11-23 12:28:14,982 INFO L273 TraceCheckUtils]: 104: Hoare triple {19012#true} assume true; {19012#true} is VALID [2018-11-23 12:28:14,983 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19012#true} {19012#true} #72#return; {19012#true} is VALID [2018-11-23 12:28:14,983 INFO L273 TraceCheckUtils]: 106: Hoare triple {19012#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; {19363#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:14,983 INFO L273 TraceCheckUtils]: 107: Hoare triple {19363#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19363#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:14,984 INFO L273 TraceCheckUtils]: 108: Hoare triple {19363#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19370#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:14,984 INFO L273 TraceCheckUtils]: 109: Hoare triple {19370#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19370#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:14,985 INFO L273 TraceCheckUtils]: 110: Hoare triple {19370#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19377#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:14,985 INFO L273 TraceCheckUtils]: 111: Hoare triple {19377#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19377#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:14,985 INFO L273 TraceCheckUtils]: 112: Hoare triple {19377#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19384#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:14,986 INFO L273 TraceCheckUtils]: 113: Hoare triple {19384#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19384#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:14,986 INFO L273 TraceCheckUtils]: 114: Hoare triple {19384#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19391#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:14,986 INFO L273 TraceCheckUtils]: 115: Hoare triple {19391#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19391#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:14,987 INFO L273 TraceCheckUtils]: 116: Hoare triple {19391#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19398#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:14,987 INFO L273 TraceCheckUtils]: 117: Hoare triple {19398#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19398#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:14,987 INFO L273 TraceCheckUtils]: 118: Hoare triple {19398#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19405#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:14,988 INFO L273 TraceCheckUtils]: 119: Hoare triple {19405#(<= main_~i~2 6)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19405#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:14,988 INFO L273 TraceCheckUtils]: 120: Hoare triple {19405#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19412#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:14,989 INFO L273 TraceCheckUtils]: 121: Hoare triple {19412#(<= main_~i~2 7)} assume !(~i~2 < 99999); {19013#false} is VALID [2018-11-23 12:28:14,989 INFO L273 TraceCheckUtils]: 122: Hoare triple {19013#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {19013#false} is VALID [2018-11-23 12:28:14,989 INFO L256 TraceCheckUtils]: 123: Hoare triple {19013#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {19013#false} is VALID [2018-11-23 12:28:14,990 INFO L273 TraceCheckUtils]: 124: Hoare triple {19013#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19013#false} is VALID [2018-11-23 12:28:14,990 INFO L273 TraceCheckUtils]: 125: Hoare triple {19013#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19013#false} is VALID [2018-11-23 12:28:14,990 INFO L273 TraceCheckUtils]: 126: Hoare triple {19013#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19013#false} is VALID [2018-11-23 12:28:14,990 INFO L273 TraceCheckUtils]: 127: Hoare triple {19013#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19013#false} is VALID [2018-11-23 12:28:14,990 INFO L273 TraceCheckUtils]: 128: Hoare triple {19013#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19013#false} is VALID [2018-11-23 12:28:14,990 INFO L273 TraceCheckUtils]: 129: Hoare triple {19013#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19013#false} is VALID [2018-11-23 12:28:14,991 INFO L273 TraceCheckUtils]: 130: Hoare triple {19013#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19013#false} is VALID [2018-11-23 12:28:14,991 INFO L273 TraceCheckUtils]: 131: Hoare triple {19013#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19013#false} is VALID [2018-11-23 12:28:14,991 INFO L273 TraceCheckUtils]: 132: Hoare triple {19013#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19013#false} is VALID [2018-11-23 12:28:14,991 INFO L273 TraceCheckUtils]: 133: Hoare triple {19013#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19013#false} is VALID [2018-11-23 12:28:14,991 INFO L273 TraceCheckUtils]: 134: Hoare triple {19013#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19013#false} is VALID [2018-11-23 12:28:14,992 INFO L273 TraceCheckUtils]: 135: Hoare triple {19013#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19013#false} is VALID [2018-11-23 12:28:14,992 INFO L273 TraceCheckUtils]: 136: Hoare triple {19013#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19013#false} is VALID [2018-11-23 12:28:14,992 INFO L273 TraceCheckUtils]: 137: Hoare triple {19013#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19013#false} is VALID [2018-11-23 12:28:14,992 INFO L273 TraceCheckUtils]: 138: Hoare triple {19013#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19013#false} is VALID [2018-11-23 12:28:14,992 INFO L273 TraceCheckUtils]: 139: Hoare triple {19013#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19013#false} is VALID [2018-11-23 12:28:14,992 INFO L273 TraceCheckUtils]: 140: Hoare triple {19013#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19013#false} is VALID [2018-11-23 12:28:14,992 INFO L273 TraceCheckUtils]: 141: Hoare triple {19013#false} assume !(~i~0 < 100000); {19013#false} is VALID [2018-11-23 12:28:14,993 INFO L273 TraceCheckUtils]: 142: Hoare triple {19013#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {19013#false} is VALID [2018-11-23 12:28:14,993 INFO L273 TraceCheckUtils]: 143: Hoare triple {19013#false} assume true; {19013#false} is VALID [2018-11-23 12:28:14,993 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19013#false} {19013#false} #74#return; {19013#false} is VALID [2018-11-23 12:28:14,993 INFO L273 TraceCheckUtils]: 145: Hoare triple {19013#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {19013#false} is VALID [2018-11-23 12:28:14,993 INFO L273 TraceCheckUtils]: 146: Hoare triple {19013#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {19013#false} is VALID [2018-11-23 12:28:14,993 INFO L273 TraceCheckUtils]: 147: Hoare triple {19013#false} assume !false; {19013#false} is VALID [2018-11-23 12:28:15,004 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:15,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:15,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2018-11-23 12:28:15,027 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:28:15,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:15,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:28:15,419 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:15,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:28:15,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:28:15,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:28:15,420 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2018-11-23 12:28:16,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:16,433 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-11-23 12:28:16,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:28:16,433 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:28:16,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:28:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:28:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:28:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:28:16,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 125 transitions. [2018-11-23 12:28:16,558 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:16,561 INFO L225 Difference]: With dead ends: 159 [2018-11-23 12:28:16,561 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 12:28:16,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:28:16,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 12:28:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-23 12:28:16,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:16,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 111 states. [2018-11-23 12:28:16,723 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 111 states. [2018-11-23 12:28:16,723 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 111 states. [2018-11-23 12:28:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:16,726 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:28:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:28:16,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:16,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:16,727 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 113 states. [2018-11-23 12:28:16,727 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 113 states. [2018-11-23 12:28:16,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:16,729 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:28:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:28:16,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:16,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:16,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:16,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 12:28:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-11-23 12:28:16,732 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2018-11-23 12:28:16,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:16,732 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-11-23 12:28:16,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:28:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-11-23 12:28:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-23 12:28:16,733 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:16,734 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:16,734 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:16,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:16,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1027259565, now seen corresponding path program 28 times [2018-11-23 12:28:16,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:16,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:16,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:16,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:16,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:17,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {20120#true} call ULTIMATE.init(); {20120#true} is VALID [2018-11-23 12:28:17,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {20120#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20120#true} is VALID [2018-11-23 12:28:17,704 INFO L273 TraceCheckUtils]: 2: Hoare triple {20120#true} assume true; {20120#true} is VALID [2018-11-23 12:28:17,705 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20120#true} {20120#true} #66#return; {20120#true} is VALID [2018-11-23 12:28:17,705 INFO L256 TraceCheckUtils]: 4: Hoare triple {20120#true} call #t~ret12 := main(); {20120#true} is VALID [2018-11-23 12:28:17,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {20120#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20122#(= main_~i~1 0)} is VALID [2018-11-23 12:28:17,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {20122#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20122#(= main_~i~1 0)} is VALID [2018-11-23 12:28:17,716 INFO L273 TraceCheckUtils]: 7: Hoare triple {20122#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20123#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:17,716 INFO L273 TraceCheckUtils]: 8: Hoare triple {20123#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20123#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:17,716 INFO L273 TraceCheckUtils]: 9: Hoare triple {20123#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20124#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:17,717 INFO L273 TraceCheckUtils]: 10: Hoare triple {20124#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20124#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:17,717 INFO L273 TraceCheckUtils]: 11: Hoare triple {20124#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20125#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:17,717 INFO L273 TraceCheckUtils]: 12: Hoare triple {20125#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20125#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:17,719 INFO L273 TraceCheckUtils]: 13: Hoare triple {20125#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20126#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:17,719 INFO L273 TraceCheckUtils]: 14: Hoare triple {20126#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20126#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:17,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {20126#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20127#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:17,720 INFO L273 TraceCheckUtils]: 16: Hoare triple {20127#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20127#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:17,721 INFO L273 TraceCheckUtils]: 17: Hoare triple {20127#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20128#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:17,721 INFO L273 TraceCheckUtils]: 18: Hoare triple {20128#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20128#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:17,722 INFO L273 TraceCheckUtils]: 19: Hoare triple {20128#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20129#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:17,723 INFO L273 TraceCheckUtils]: 20: Hoare triple {20129#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20129#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:17,723 INFO L273 TraceCheckUtils]: 21: Hoare triple {20129#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20130#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:17,724 INFO L273 TraceCheckUtils]: 22: Hoare triple {20130#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20130#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:17,725 INFO L273 TraceCheckUtils]: 23: Hoare triple {20130#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20131#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:17,725 INFO L273 TraceCheckUtils]: 24: Hoare triple {20131#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20131#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:17,726 INFO L273 TraceCheckUtils]: 25: Hoare triple {20131#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:17,726 INFO L273 TraceCheckUtils]: 26: Hoare triple {20132#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:17,727 INFO L273 TraceCheckUtils]: 27: Hoare triple {20132#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20133#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:17,728 INFO L273 TraceCheckUtils]: 28: Hoare triple {20133#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20133#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:17,728 INFO L273 TraceCheckUtils]: 29: Hoare triple {20133#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20134#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:17,729 INFO L273 TraceCheckUtils]: 30: Hoare triple {20134#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:17,730 INFO L273 TraceCheckUtils]: 31: Hoare triple {20134#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20135#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:17,730 INFO L273 TraceCheckUtils]: 32: Hoare triple {20135#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:17,731 INFO L273 TraceCheckUtils]: 33: Hoare triple {20135#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20136#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:17,731 INFO L273 TraceCheckUtils]: 34: Hoare triple {20136#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:17,732 INFO L273 TraceCheckUtils]: 35: Hoare triple {20136#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20137#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:17,733 INFO L273 TraceCheckUtils]: 36: Hoare triple {20137#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:17,733 INFO L273 TraceCheckUtils]: 37: Hoare triple {20137#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20138#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:17,734 INFO L273 TraceCheckUtils]: 38: Hoare triple {20138#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:17,735 INFO L273 TraceCheckUtils]: 39: Hoare triple {20138#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20139#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:17,735 INFO L273 TraceCheckUtils]: 40: Hoare triple {20139#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:17,736 INFO L273 TraceCheckUtils]: 41: Hoare triple {20139#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20140#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:17,736 INFO L273 TraceCheckUtils]: 42: Hoare triple {20140#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:17,737 INFO L273 TraceCheckUtils]: 43: Hoare triple {20140#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20141#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:17,738 INFO L273 TraceCheckUtils]: 44: Hoare triple {20141#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:17,738 INFO L273 TraceCheckUtils]: 45: Hoare triple {20141#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20142#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:17,739 INFO L273 TraceCheckUtils]: 46: Hoare triple {20142#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:17,740 INFO L273 TraceCheckUtils]: 47: Hoare triple {20142#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20143#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:17,740 INFO L273 TraceCheckUtils]: 48: Hoare triple {20143#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:17,741 INFO L273 TraceCheckUtils]: 49: Hoare triple {20143#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20144#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:17,741 INFO L273 TraceCheckUtils]: 50: Hoare triple {20144#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:17,742 INFO L273 TraceCheckUtils]: 51: Hoare triple {20144#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20145#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:17,742 INFO L273 TraceCheckUtils]: 52: Hoare triple {20145#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:17,743 INFO L273 TraceCheckUtils]: 53: Hoare triple {20145#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20146#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:17,744 INFO L273 TraceCheckUtils]: 54: Hoare triple {20146#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:28:17,744 INFO L273 TraceCheckUtils]: 55: Hoare triple {20146#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20147#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:17,745 INFO L273 TraceCheckUtils]: 56: Hoare triple {20147#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -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 25)} is VALID [2018-11-23 12:28:17,746 INFO L273 TraceCheckUtils]: 57: Hoare triple {20147#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20148#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:17,746 INFO L273 TraceCheckUtils]: 58: Hoare triple {20148#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -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 26)} is VALID [2018-11-23 12:28:17,747 INFO L273 TraceCheckUtils]: 59: Hoare triple {20148#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20149#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:17,747 INFO L273 TraceCheckUtils]: 60: Hoare triple {20149#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -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 27)} is VALID [2018-11-23 12:28:17,748 INFO L273 TraceCheckUtils]: 61: Hoare triple {20149#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20150#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:17,749 INFO L273 TraceCheckUtils]: 62: Hoare triple {20150#(<= main_~i~1 28)} assume !(~i~1 < 100000); {20121#false} is VALID [2018-11-23 12:28:17,749 INFO L256 TraceCheckUtils]: 63: Hoare triple {20121#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {20120#true} is VALID [2018-11-23 12:28:17,749 INFO L273 TraceCheckUtils]: 64: Hoare triple {20120#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20120#true} is VALID [2018-11-23 12:28:17,749 INFO L273 TraceCheckUtils]: 65: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,750 INFO L273 TraceCheckUtils]: 66: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,750 INFO L273 TraceCheckUtils]: 67: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,750 INFO L273 TraceCheckUtils]: 68: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,750 INFO L273 TraceCheckUtils]: 69: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,750 INFO L273 TraceCheckUtils]: 70: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,750 INFO L273 TraceCheckUtils]: 71: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,751 INFO L273 TraceCheckUtils]: 72: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,751 INFO L273 TraceCheckUtils]: 73: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,751 INFO L273 TraceCheckUtils]: 74: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,751 INFO L273 TraceCheckUtils]: 75: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,751 INFO L273 TraceCheckUtils]: 76: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,752 INFO L273 TraceCheckUtils]: 77: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,752 INFO L273 TraceCheckUtils]: 78: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,752 INFO L273 TraceCheckUtils]: 79: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,752 INFO L273 TraceCheckUtils]: 80: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,752 INFO L273 TraceCheckUtils]: 81: Hoare triple {20120#true} assume !(~i~0 < 100000); {20120#true} is VALID [2018-11-23 12:28:17,752 INFO L273 TraceCheckUtils]: 82: Hoare triple {20120#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {20120#true} is VALID [2018-11-23 12:28:17,753 INFO L273 TraceCheckUtils]: 83: Hoare triple {20120#true} assume true; {20120#true} is VALID [2018-11-23 12:28:17,753 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20120#true} {20121#false} #70#return; {20121#false} is VALID [2018-11-23 12:28:17,753 INFO L273 TraceCheckUtils]: 85: Hoare triple {20121#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); {20121#false} is VALID [2018-11-23 12:28:17,753 INFO L256 TraceCheckUtils]: 86: Hoare triple {20121#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {20120#true} is VALID [2018-11-23 12:28:17,753 INFO L273 TraceCheckUtils]: 87: Hoare triple {20120#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20120#true} is VALID [2018-11-23 12:28:17,754 INFO L273 TraceCheckUtils]: 88: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,754 INFO L273 TraceCheckUtils]: 89: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,754 INFO L273 TraceCheckUtils]: 90: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,754 INFO L273 TraceCheckUtils]: 91: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,754 INFO L273 TraceCheckUtils]: 92: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,754 INFO L273 TraceCheckUtils]: 93: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,754 INFO L273 TraceCheckUtils]: 94: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,754 INFO L273 TraceCheckUtils]: 95: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,754 INFO L273 TraceCheckUtils]: 96: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,755 INFO L273 TraceCheckUtils]: 97: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,755 INFO L273 TraceCheckUtils]: 98: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,755 INFO L273 TraceCheckUtils]: 99: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,755 INFO L273 TraceCheckUtils]: 100: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,755 INFO L273 TraceCheckUtils]: 101: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,755 INFO L273 TraceCheckUtils]: 102: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,755 INFO L273 TraceCheckUtils]: 103: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,755 INFO L273 TraceCheckUtils]: 104: Hoare triple {20120#true} assume !(~i~0 < 100000); {20120#true} is VALID [2018-11-23 12:28:17,755 INFO L273 TraceCheckUtils]: 105: Hoare triple {20120#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {20120#true} is VALID [2018-11-23 12:28:17,756 INFO L273 TraceCheckUtils]: 106: Hoare triple {20120#true} assume true; {20120#true} is VALID [2018-11-23 12:28:17,756 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20120#true} {20121#false} #72#return; {20121#false} is VALID [2018-11-23 12:28:17,756 INFO L273 TraceCheckUtils]: 108: Hoare triple {20121#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; {20121#false} is VALID [2018-11-23 12:28:17,756 INFO L273 TraceCheckUtils]: 109: Hoare triple {20121#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20121#false} is VALID [2018-11-23 12:28:17,756 INFO L273 TraceCheckUtils]: 110: Hoare triple {20121#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20121#false} is VALID [2018-11-23 12:28:17,756 INFO L273 TraceCheckUtils]: 111: Hoare triple {20121#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20121#false} is VALID [2018-11-23 12:28:17,756 INFO L273 TraceCheckUtils]: 112: Hoare triple {20121#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20121#false} is VALID [2018-11-23 12:28:17,756 INFO L273 TraceCheckUtils]: 113: Hoare triple {20121#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20121#false} is VALID [2018-11-23 12:28:17,756 INFO L273 TraceCheckUtils]: 114: Hoare triple {20121#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20121#false} is VALID [2018-11-23 12:28:17,757 INFO L273 TraceCheckUtils]: 115: Hoare triple {20121#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20121#false} is VALID [2018-11-23 12:28:17,757 INFO L273 TraceCheckUtils]: 116: Hoare triple {20121#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20121#false} is VALID [2018-11-23 12:28:17,757 INFO L273 TraceCheckUtils]: 117: Hoare triple {20121#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20121#false} is VALID [2018-11-23 12:28:17,757 INFO L273 TraceCheckUtils]: 118: Hoare triple {20121#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20121#false} is VALID [2018-11-23 12:28:17,757 INFO L273 TraceCheckUtils]: 119: Hoare triple {20121#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20121#false} is VALID [2018-11-23 12:28:17,757 INFO L273 TraceCheckUtils]: 120: Hoare triple {20121#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20121#false} is VALID [2018-11-23 12:28:17,757 INFO L273 TraceCheckUtils]: 121: Hoare triple {20121#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20121#false} is VALID [2018-11-23 12:28:17,757 INFO L273 TraceCheckUtils]: 122: Hoare triple {20121#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20121#false} is VALID [2018-11-23 12:28:17,757 INFO L273 TraceCheckUtils]: 123: Hoare triple {20121#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20121#false} is VALID [2018-11-23 12:28:17,757 INFO L273 TraceCheckUtils]: 124: Hoare triple {20121#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20121#false} is VALID [2018-11-23 12:28:17,758 INFO L273 TraceCheckUtils]: 125: Hoare triple {20121#false} assume !(~i~2 < 99999); {20121#false} is VALID [2018-11-23 12:28:17,758 INFO L273 TraceCheckUtils]: 126: Hoare triple {20121#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {20121#false} is VALID [2018-11-23 12:28:17,758 INFO L256 TraceCheckUtils]: 127: Hoare triple {20121#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {20120#true} is VALID [2018-11-23 12:28:17,758 INFO L273 TraceCheckUtils]: 128: Hoare triple {20120#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20120#true} is VALID [2018-11-23 12:28:17,758 INFO L273 TraceCheckUtils]: 129: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,758 INFO L273 TraceCheckUtils]: 130: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,759 INFO L273 TraceCheckUtils]: 131: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,759 INFO L273 TraceCheckUtils]: 132: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,759 INFO L273 TraceCheckUtils]: 133: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,759 INFO L273 TraceCheckUtils]: 134: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,759 INFO L273 TraceCheckUtils]: 135: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,759 INFO L273 TraceCheckUtils]: 136: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,760 INFO L273 TraceCheckUtils]: 137: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,760 INFO L273 TraceCheckUtils]: 138: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,760 INFO L273 TraceCheckUtils]: 139: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,760 INFO L273 TraceCheckUtils]: 140: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,760 INFO L273 TraceCheckUtils]: 141: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,760 INFO L273 TraceCheckUtils]: 142: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,760 INFO L273 TraceCheckUtils]: 143: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:17,761 INFO L273 TraceCheckUtils]: 144: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:17,761 INFO L273 TraceCheckUtils]: 145: Hoare triple {20120#true} assume !(~i~0 < 100000); {20120#true} is VALID [2018-11-23 12:28:17,761 INFO L273 TraceCheckUtils]: 146: Hoare triple {20120#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {20120#true} is VALID [2018-11-23 12:28:17,761 INFO L273 TraceCheckUtils]: 147: Hoare triple {20120#true} assume true; {20120#true} is VALID [2018-11-23 12:28:17,761 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20120#true} {20121#false} #74#return; {20121#false} is VALID [2018-11-23 12:28:17,761 INFO L273 TraceCheckUtils]: 149: Hoare triple {20121#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {20121#false} is VALID [2018-11-23 12:28:17,762 INFO L273 TraceCheckUtils]: 150: Hoare triple {20121#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {20121#false} is VALID [2018-11-23 12:28:17,762 INFO L273 TraceCheckUtils]: 151: Hoare triple {20121#false} assume !false; {20121#false} is VALID [2018-11-23 12:28:17,776 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:17,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:17,777 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:17,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:17,866 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:17,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:17,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:18,195 INFO L256 TraceCheckUtils]: 0: Hoare triple {20120#true} call ULTIMATE.init(); {20120#true} is VALID [2018-11-23 12:28:18,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {20120#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20120#true} is VALID [2018-11-23 12:28:18,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {20120#true} assume true; {20120#true} is VALID [2018-11-23 12:28:18,196 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20120#true} {20120#true} #66#return; {20120#true} is VALID [2018-11-23 12:28:18,197 INFO L256 TraceCheckUtils]: 4: Hoare triple {20120#true} call #t~ret12 := main(); {20120#true} is VALID [2018-11-23 12:28:18,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {20120#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20120#true} is VALID [2018-11-23 12:28:18,197 INFO L273 TraceCheckUtils]: 6: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,197 INFO L273 TraceCheckUtils]: 7: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,198 INFO L273 TraceCheckUtils]: 12: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,198 INFO L273 TraceCheckUtils]: 13: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,198 INFO L273 TraceCheckUtils]: 14: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,199 INFO L273 TraceCheckUtils]: 15: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,199 INFO L273 TraceCheckUtils]: 16: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,199 INFO L273 TraceCheckUtils]: 17: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,199 INFO L273 TraceCheckUtils]: 18: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,199 INFO L273 TraceCheckUtils]: 19: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,199 INFO L273 TraceCheckUtils]: 20: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,199 INFO L273 TraceCheckUtils]: 22: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,199 INFO L273 TraceCheckUtils]: 23: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,199 INFO L273 TraceCheckUtils]: 24: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,200 INFO L273 TraceCheckUtils]: 25: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,200 INFO L273 TraceCheckUtils]: 26: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,200 INFO L273 TraceCheckUtils]: 27: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,200 INFO L273 TraceCheckUtils]: 28: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,200 INFO L273 TraceCheckUtils]: 29: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,200 INFO L273 TraceCheckUtils]: 30: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,200 INFO L273 TraceCheckUtils]: 31: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,200 INFO L273 TraceCheckUtils]: 32: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,200 INFO L273 TraceCheckUtils]: 33: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,201 INFO L273 TraceCheckUtils]: 34: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,201 INFO L273 TraceCheckUtils]: 35: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,201 INFO L273 TraceCheckUtils]: 36: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,201 INFO L273 TraceCheckUtils]: 37: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,201 INFO L273 TraceCheckUtils]: 38: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,201 INFO L273 TraceCheckUtils]: 39: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,201 INFO L273 TraceCheckUtils]: 40: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,201 INFO L273 TraceCheckUtils]: 41: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,201 INFO L273 TraceCheckUtils]: 42: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,201 INFO L273 TraceCheckUtils]: 43: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,202 INFO L273 TraceCheckUtils]: 44: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,202 INFO L273 TraceCheckUtils]: 45: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,202 INFO L273 TraceCheckUtils]: 46: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,202 INFO L273 TraceCheckUtils]: 47: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,202 INFO L273 TraceCheckUtils]: 48: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,202 INFO L273 TraceCheckUtils]: 49: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,202 INFO L273 TraceCheckUtils]: 50: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,202 INFO L273 TraceCheckUtils]: 51: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,202 INFO L273 TraceCheckUtils]: 52: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,203 INFO L273 TraceCheckUtils]: 53: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,203 INFO L273 TraceCheckUtils]: 54: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,203 INFO L273 TraceCheckUtils]: 55: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,203 INFO L273 TraceCheckUtils]: 56: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,203 INFO L273 TraceCheckUtils]: 57: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,203 INFO L273 TraceCheckUtils]: 58: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,203 INFO L273 TraceCheckUtils]: 59: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,203 INFO L273 TraceCheckUtils]: 60: Hoare triple {20120#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20120#true} is VALID [2018-11-23 12:28:18,203 INFO L273 TraceCheckUtils]: 61: Hoare triple {20120#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20120#true} is VALID [2018-11-23 12:28:18,203 INFO L273 TraceCheckUtils]: 62: Hoare triple {20120#true} assume !(~i~1 < 100000); {20120#true} is VALID [2018-11-23 12:28:18,204 INFO L256 TraceCheckUtils]: 63: Hoare triple {20120#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {20120#true} is VALID [2018-11-23 12:28:18,204 INFO L273 TraceCheckUtils]: 64: Hoare triple {20120#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20120#true} is VALID [2018-11-23 12:28:18,204 INFO L273 TraceCheckUtils]: 65: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,204 INFO L273 TraceCheckUtils]: 66: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,204 INFO L273 TraceCheckUtils]: 67: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,204 INFO L273 TraceCheckUtils]: 68: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,204 INFO L273 TraceCheckUtils]: 69: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,204 INFO L273 TraceCheckUtils]: 70: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,204 INFO L273 TraceCheckUtils]: 71: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,204 INFO L273 TraceCheckUtils]: 72: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,205 INFO L273 TraceCheckUtils]: 73: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,205 INFO L273 TraceCheckUtils]: 74: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,205 INFO L273 TraceCheckUtils]: 75: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,205 INFO L273 TraceCheckUtils]: 76: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,205 INFO L273 TraceCheckUtils]: 77: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,205 INFO L273 TraceCheckUtils]: 78: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,205 INFO L273 TraceCheckUtils]: 79: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,205 INFO L273 TraceCheckUtils]: 80: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,205 INFO L273 TraceCheckUtils]: 81: Hoare triple {20120#true} assume !(~i~0 < 100000); {20120#true} is VALID [2018-11-23 12:28:18,206 INFO L273 TraceCheckUtils]: 82: Hoare triple {20120#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {20120#true} is VALID [2018-11-23 12:28:18,206 INFO L273 TraceCheckUtils]: 83: Hoare triple {20120#true} assume true; {20120#true} is VALID [2018-11-23 12:28:18,206 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20120#true} {20120#true} #70#return; {20120#true} is VALID [2018-11-23 12:28:18,206 INFO L273 TraceCheckUtils]: 85: Hoare triple {20120#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); {20120#true} is VALID [2018-11-23 12:28:18,206 INFO L256 TraceCheckUtils]: 86: Hoare triple {20120#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {20120#true} is VALID [2018-11-23 12:28:18,206 INFO L273 TraceCheckUtils]: 87: Hoare triple {20120#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20120#true} is VALID [2018-11-23 12:28:18,206 INFO L273 TraceCheckUtils]: 88: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,206 INFO L273 TraceCheckUtils]: 89: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,206 INFO L273 TraceCheckUtils]: 90: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,207 INFO L273 TraceCheckUtils]: 91: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,207 INFO L273 TraceCheckUtils]: 92: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,207 INFO L273 TraceCheckUtils]: 93: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,207 INFO L273 TraceCheckUtils]: 94: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,207 INFO L273 TraceCheckUtils]: 95: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,207 INFO L273 TraceCheckUtils]: 96: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,207 INFO L273 TraceCheckUtils]: 97: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,207 INFO L273 TraceCheckUtils]: 98: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,208 INFO L273 TraceCheckUtils]: 99: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,208 INFO L273 TraceCheckUtils]: 100: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,208 INFO L273 TraceCheckUtils]: 101: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,208 INFO L273 TraceCheckUtils]: 102: Hoare triple {20120#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20120#true} is VALID [2018-11-23 12:28:18,208 INFO L273 TraceCheckUtils]: 103: Hoare triple {20120#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20120#true} is VALID [2018-11-23 12:28:18,208 INFO L273 TraceCheckUtils]: 104: Hoare triple {20120#true} assume !(~i~0 < 100000); {20120#true} is VALID [2018-11-23 12:28:18,208 INFO L273 TraceCheckUtils]: 105: Hoare triple {20120#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {20120#true} is VALID [2018-11-23 12:28:18,208 INFO L273 TraceCheckUtils]: 106: Hoare triple {20120#true} assume true; {20120#true} is VALID [2018-11-23 12:28:18,209 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20120#true} {20120#true} #72#return; {20120#true} is VALID [2018-11-23 12:28:18,209 INFO L273 TraceCheckUtils]: 108: Hoare triple {20120#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; {20120#true} is VALID [2018-11-23 12:28:18,209 INFO L273 TraceCheckUtils]: 109: Hoare triple {20120#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20120#true} is VALID [2018-11-23 12:28:18,209 INFO L273 TraceCheckUtils]: 110: Hoare triple {20120#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20120#true} is VALID [2018-11-23 12:28:18,209 INFO L273 TraceCheckUtils]: 111: Hoare triple {20120#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20120#true} is VALID [2018-11-23 12:28:18,209 INFO L273 TraceCheckUtils]: 112: Hoare triple {20120#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20120#true} is VALID [2018-11-23 12:28:18,209 INFO L273 TraceCheckUtils]: 113: Hoare triple {20120#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20120#true} is VALID [2018-11-23 12:28:18,209 INFO L273 TraceCheckUtils]: 114: Hoare triple {20120#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20120#true} is VALID [2018-11-23 12:28:18,209 INFO L273 TraceCheckUtils]: 115: Hoare triple {20120#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20120#true} is VALID [2018-11-23 12:28:18,209 INFO L273 TraceCheckUtils]: 116: Hoare triple {20120#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20120#true} is VALID [2018-11-23 12:28:18,210 INFO L273 TraceCheckUtils]: 117: Hoare triple {20120#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20120#true} is VALID [2018-11-23 12:28:18,210 INFO L273 TraceCheckUtils]: 118: Hoare triple {20120#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20120#true} is VALID [2018-11-23 12:28:18,210 INFO L273 TraceCheckUtils]: 119: Hoare triple {20120#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20120#true} is VALID [2018-11-23 12:28:18,210 INFO L273 TraceCheckUtils]: 120: Hoare triple {20120#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20120#true} is VALID [2018-11-23 12:28:18,210 INFO L273 TraceCheckUtils]: 121: Hoare triple {20120#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20120#true} is VALID [2018-11-23 12:28:18,210 INFO L273 TraceCheckUtils]: 122: Hoare triple {20120#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20120#true} is VALID [2018-11-23 12:28:18,210 INFO L273 TraceCheckUtils]: 123: Hoare triple {20120#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20120#true} is VALID [2018-11-23 12:28:18,210 INFO L273 TraceCheckUtils]: 124: Hoare triple {20120#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20120#true} is VALID [2018-11-23 12:28:18,210 INFO L273 TraceCheckUtils]: 125: Hoare triple {20120#true} assume !(~i~2 < 99999); {20120#true} is VALID [2018-11-23 12:28:18,211 INFO L273 TraceCheckUtils]: 126: Hoare triple {20120#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {20120#true} is VALID [2018-11-23 12:28:18,211 INFO L256 TraceCheckUtils]: 127: Hoare triple {20120#true} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {20120#true} is VALID [2018-11-23 12:28:18,211 INFO L273 TraceCheckUtils]: 128: Hoare triple {20120#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20538#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:18,211 INFO L273 TraceCheckUtils]: 129: Hoare triple {20538#(<= mapavg_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20538#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:18,212 INFO L273 TraceCheckUtils]: 130: Hoare triple {20538#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20545#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:18,212 INFO L273 TraceCheckUtils]: 131: Hoare triple {20545#(<= mapavg_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20545#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:18,213 INFO L273 TraceCheckUtils]: 132: Hoare triple {20545#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20552#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:18,213 INFO L273 TraceCheckUtils]: 133: Hoare triple {20552#(<= mapavg_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20552#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:18,213 INFO L273 TraceCheckUtils]: 134: Hoare triple {20552#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20559#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:18,214 INFO L273 TraceCheckUtils]: 135: Hoare triple {20559#(<= mapavg_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20559#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:18,215 INFO L273 TraceCheckUtils]: 136: Hoare triple {20559#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20566#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:18,215 INFO L273 TraceCheckUtils]: 137: Hoare triple {20566#(<= mapavg_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20566#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:18,216 INFO L273 TraceCheckUtils]: 138: Hoare triple {20566#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20573#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:18,216 INFO L273 TraceCheckUtils]: 139: Hoare triple {20573#(<= mapavg_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20573#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:18,217 INFO L273 TraceCheckUtils]: 140: Hoare triple {20573#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20580#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:18,218 INFO L273 TraceCheckUtils]: 141: Hoare triple {20580#(<= mapavg_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20580#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:18,218 INFO L273 TraceCheckUtils]: 142: Hoare triple {20580#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20587#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:18,219 INFO L273 TraceCheckUtils]: 143: Hoare triple {20587#(<= mapavg_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20587#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:18,220 INFO L273 TraceCheckUtils]: 144: Hoare triple {20587#(<= mapavg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20594#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:28:18,220 INFO L273 TraceCheckUtils]: 145: Hoare triple {20594#(<= mapavg_~i~0 8)} assume !(~i~0 < 100000); {20121#false} is VALID [2018-11-23 12:28:18,220 INFO L273 TraceCheckUtils]: 146: Hoare triple {20121#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {20121#false} is VALID [2018-11-23 12:28:18,221 INFO L273 TraceCheckUtils]: 147: Hoare triple {20121#false} assume true; {20121#false} is VALID [2018-11-23 12:28:18,221 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20121#false} {20120#true} #74#return; {20121#false} is VALID [2018-11-23 12:28:18,221 INFO L273 TraceCheckUtils]: 149: Hoare triple {20121#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {20121#false} is VALID [2018-11-23 12:28:18,221 INFO L273 TraceCheckUtils]: 150: Hoare triple {20121#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {20121#false} is VALID [2018-11-23 12:28:18,221 INFO L273 TraceCheckUtils]: 151: Hoare triple {20121#false} assume !false; {20121#false} is VALID [2018-11-23 12:28:18,232 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:18,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:18,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2018-11-23 12:28:18,254 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:28:18,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:18,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:28:18,375 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:18,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:28:18,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:28:18,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:28:18,376 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2018-11-23 12:28:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:19,662 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-11-23 12:28:19,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:28:19,662 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:28:19,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:28:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:28:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:28:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:28:19,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 132 transitions. [2018-11-23 12:28:19,792 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:19,794 INFO L225 Difference]: With dead ends: 165 [2018-11-23 12:28:19,795 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:28:19,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:28:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:28:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-23 12:28:19,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:19,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 115 states. [2018-11-23 12:28:19,848 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 115 states. [2018-11-23 12:28:19,848 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 115 states. [2018-11-23 12:28:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:19,851 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:28:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:28:19,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:19,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:19,852 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 117 states. [2018-11-23 12:28:19,852 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 117 states. [2018-11-23 12:28:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:19,854 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:28:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:28:19,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:19,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:19,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:19,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 12:28:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2018-11-23 12:28:19,857 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2018-11-23 12:28:19,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:19,858 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-11-23 12:28:19,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:28:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:28:19,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 12:28:19,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:19,859 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:19,859 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:19,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:19,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1026828691, now seen corresponding path program 29 times [2018-11-23 12:28:19,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:19,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:19,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:19,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:19,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:21,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {21265#true} call ULTIMATE.init(); {21265#true} is VALID [2018-11-23 12:28:21,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {21265#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21265#true} is VALID [2018-11-23 12:28:21,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {21265#true} assume true; {21265#true} is VALID [2018-11-23 12:28:21,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21265#true} {21265#true} #66#return; {21265#true} is VALID [2018-11-23 12:28:21,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {21265#true} call #t~ret12 := main(); {21265#true} is VALID [2018-11-23 12:28:21,130 INFO L273 TraceCheckUtils]: 5: Hoare triple {21265#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21267#(= main_~i~1 0)} is VALID [2018-11-23 12:28:21,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {21267#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21267#(= main_~i~1 0)} is VALID [2018-11-23 12:28:21,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {21267#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21268#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:21,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {21268#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21268#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:21,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {21268#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21269#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:21,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {21269#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21269#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:21,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {21269#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21270#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:21,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {21270#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21270#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:21,135 INFO L273 TraceCheckUtils]: 13: Hoare triple {21270#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21271#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:21,136 INFO L273 TraceCheckUtils]: 14: Hoare triple {21271#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21271#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:21,136 INFO L273 TraceCheckUtils]: 15: Hoare triple {21271#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21272#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:21,137 INFO L273 TraceCheckUtils]: 16: Hoare triple {21272#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21272#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:21,137 INFO L273 TraceCheckUtils]: 17: Hoare triple {21272#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21273#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:21,138 INFO L273 TraceCheckUtils]: 18: Hoare triple {21273#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21273#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:21,138 INFO L273 TraceCheckUtils]: 19: Hoare triple {21273#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21274#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:21,139 INFO L273 TraceCheckUtils]: 20: Hoare triple {21274#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21274#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:21,140 INFO L273 TraceCheckUtils]: 21: Hoare triple {21274#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21275#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:21,140 INFO L273 TraceCheckUtils]: 22: Hoare triple {21275#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21275#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:21,141 INFO L273 TraceCheckUtils]: 23: Hoare triple {21275#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21276#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:21,141 INFO L273 TraceCheckUtils]: 24: Hoare triple {21276#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21276#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:21,142 INFO L273 TraceCheckUtils]: 25: Hoare triple {21276#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:21,142 INFO L273 TraceCheckUtils]: 26: Hoare triple {21277#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:21,143 INFO L273 TraceCheckUtils]: 27: Hoare triple {21277#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21278#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:21,144 INFO L273 TraceCheckUtils]: 28: Hoare triple {21278#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21278#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:21,144 INFO L273 TraceCheckUtils]: 29: Hoare triple {21278#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21279#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:21,145 INFO L273 TraceCheckUtils]: 30: Hoare triple {21279#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:21,145 INFO L273 TraceCheckUtils]: 31: Hoare triple {21279#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21280#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:21,146 INFO L273 TraceCheckUtils]: 32: Hoare triple {21280#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:21,147 INFO L273 TraceCheckUtils]: 33: Hoare triple {21280#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21281#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:21,147 INFO L273 TraceCheckUtils]: 34: Hoare triple {21281#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:21,148 INFO L273 TraceCheckUtils]: 35: Hoare triple {21281#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21282#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:21,148 INFO L273 TraceCheckUtils]: 36: Hoare triple {21282#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:21,149 INFO L273 TraceCheckUtils]: 37: Hoare triple {21282#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21283#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:21,149 INFO L273 TraceCheckUtils]: 38: Hoare triple {21283#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:21,150 INFO L273 TraceCheckUtils]: 39: Hoare triple {21283#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21284#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:21,150 INFO L273 TraceCheckUtils]: 40: Hoare triple {21284#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:21,151 INFO L273 TraceCheckUtils]: 41: Hoare triple {21284#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21285#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:21,152 INFO L273 TraceCheckUtils]: 42: Hoare triple {21285#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:21,152 INFO L273 TraceCheckUtils]: 43: Hoare triple {21285#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21286#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:21,153 INFO L273 TraceCheckUtils]: 44: Hoare triple {21286#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:21,153 INFO L273 TraceCheckUtils]: 45: Hoare triple {21286#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21287#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:21,154 INFO L273 TraceCheckUtils]: 46: Hoare triple {21287#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:21,155 INFO L273 TraceCheckUtils]: 47: Hoare triple {21287#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21288#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:21,155 INFO L273 TraceCheckUtils]: 48: Hoare triple {21288#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:21,156 INFO L273 TraceCheckUtils]: 49: Hoare triple {21288#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21289#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:21,156 INFO L273 TraceCheckUtils]: 50: Hoare triple {21289#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:21,157 INFO L273 TraceCheckUtils]: 51: Hoare triple {21289#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21290#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:21,157 INFO L273 TraceCheckUtils]: 52: Hoare triple {21290#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:21,158 INFO L273 TraceCheckUtils]: 53: Hoare triple {21290#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21291#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:21,159 INFO L273 TraceCheckUtils]: 54: Hoare triple {21291#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:28:21,159 INFO L273 TraceCheckUtils]: 55: Hoare triple {21291#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21292#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:21,160 INFO L273 TraceCheckUtils]: 56: Hoare triple {21292#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -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 25)} is VALID [2018-11-23 12:28:21,160 INFO L273 TraceCheckUtils]: 57: Hoare triple {21292#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21293#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:21,161 INFO L273 TraceCheckUtils]: 58: Hoare triple {21293#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -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 26)} is VALID [2018-11-23 12:28:21,162 INFO L273 TraceCheckUtils]: 59: Hoare triple {21293#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21294#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:21,162 INFO L273 TraceCheckUtils]: 60: Hoare triple {21294#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -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 27)} is VALID [2018-11-23 12:28:21,163 INFO L273 TraceCheckUtils]: 61: Hoare triple {21294#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21295#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:21,163 INFO L273 TraceCheckUtils]: 62: Hoare triple {21295#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -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 28)} is VALID [2018-11-23 12:28:21,164 INFO L273 TraceCheckUtils]: 63: Hoare triple {21295#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21296#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:21,164 INFO L273 TraceCheckUtils]: 64: Hoare triple {21296#(<= main_~i~1 29)} assume !(~i~1 < 100000); {21266#false} is VALID [2018-11-23 12:28:21,165 INFO L256 TraceCheckUtils]: 65: Hoare triple {21266#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {21265#true} is VALID [2018-11-23 12:28:21,165 INFO L273 TraceCheckUtils]: 66: Hoare triple {21265#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21265#true} is VALID [2018-11-23 12:28:21,165 INFO L273 TraceCheckUtils]: 67: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,165 INFO L273 TraceCheckUtils]: 68: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,165 INFO L273 TraceCheckUtils]: 69: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,165 INFO L273 TraceCheckUtils]: 70: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,166 INFO L273 TraceCheckUtils]: 71: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,166 INFO L273 TraceCheckUtils]: 72: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,166 INFO L273 TraceCheckUtils]: 73: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,166 INFO L273 TraceCheckUtils]: 74: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,166 INFO L273 TraceCheckUtils]: 75: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,166 INFO L273 TraceCheckUtils]: 76: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,167 INFO L273 TraceCheckUtils]: 77: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,167 INFO L273 TraceCheckUtils]: 78: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,167 INFO L273 TraceCheckUtils]: 79: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,167 INFO L273 TraceCheckUtils]: 80: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,167 INFO L273 TraceCheckUtils]: 81: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,167 INFO L273 TraceCheckUtils]: 82: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,167 INFO L273 TraceCheckUtils]: 83: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,167 INFO L273 TraceCheckUtils]: 84: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,167 INFO L273 TraceCheckUtils]: 85: Hoare triple {21265#true} assume !(~i~0 < 100000); {21265#true} is VALID [2018-11-23 12:28:21,167 INFO L273 TraceCheckUtils]: 86: Hoare triple {21265#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {21265#true} is VALID [2018-11-23 12:28:21,168 INFO L273 TraceCheckUtils]: 87: Hoare triple {21265#true} assume true; {21265#true} is VALID [2018-11-23 12:28:21,168 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21265#true} {21266#false} #70#return; {21266#false} is VALID [2018-11-23 12:28:21,168 INFO L273 TraceCheckUtils]: 89: Hoare triple {21266#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); {21266#false} is VALID [2018-11-23 12:28:21,168 INFO L256 TraceCheckUtils]: 90: Hoare triple {21266#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {21265#true} is VALID [2018-11-23 12:28:21,168 INFO L273 TraceCheckUtils]: 91: Hoare triple {21265#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21265#true} is VALID [2018-11-23 12:28:21,168 INFO L273 TraceCheckUtils]: 92: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,168 INFO L273 TraceCheckUtils]: 93: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,168 INFO L273 TraceCheckUtils]: 94: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,168 INFO L273 TraceCheckUtils]: 95: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,169 INFO L273 TraceCheckUtils]: 96: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,169 INFO L273 TraceCheckUtils]: 97: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,169 INFO L273 TraceCheckUtils]: 98: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,169 INFO L273 TraceCheckUtils]: 99: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,169 INFO L273 TraceCheckUtils]: 100: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,169 INFO L273 TraceCheckUtils]: 101: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,169 INFO L273 TraceCheckUtils]: 102: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,169 INFO L273 TraceCheckUtils]: 103: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,169 INFO L273 TraceCheckUtils]: 104: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,169 INFO L273 TraceCheckUtils]: 105: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,170 INFO L273 TraceCheckUtils]: 106: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,170 INFO L273 TraceCheckUtils]: 107: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,170 INFO L273 TraceCheckUtils]: 108: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,170 INFO L273 TraceCheckUtils]: 109: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,170 INFO L273 TraceCheckUtils]: 110: Hoare triple {21265#true} assume !(~i~0 < 100000); {21265#true} is VALID [2018-11-23 12:28:21,170 INFO L273 TraceCheckUtils]: 111: Hoare triple {21265#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {21265#true} is VALID [2018-11-23 12:28:21,170 INFO L273 TraceCheckUtils]: 112: Hoare triple {21265#true} assume true; {21265#true} is VALID [2018-11-23 12:28:21,170 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21265#true} {21266#false} #72#return; {21266#false} is VALID [2018-11-23 12:28:21,170 INFO L273 TraceCheckUtils]: 114: Hoare triple {21266#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; {21266#false} is VALID [2018-11-23 12:28:21,170 INFO L273 TraceCheckUtils]: 115: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:21,171 INFO L273 TraceCheckUtils]: 116: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:21,171 INFO L273 TraceCheckUtils]: 117: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:21,171 INFO L273 TraceCheckUtils]: 118: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:21,171 INFO L273 TraceCheckUtils]: 119: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:21,171 INFO L273 TraceCheckUtils]: 120: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:21,171 INFO L273 TraceCheckUtils]: 121: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:21,171 INFO L273 TraceCheckUtils]: 122: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:21,171 INFO L273 TraceCheckUtils]: 123: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:21,171 INFO L273 TraceCheckUtils]: 124: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:21,172 INFO L273 TraceCheckUtils]: 125: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:21,172 INFO L273 TraceCheckUtils]: 126: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:21,172 INFO L273 TraceCheckUtils]: 127: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:21,172 INFO L273 TraceCheckUtils]: 128: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:21,172 INFO L273 TraceCheckUtils]: 129: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:21,172 INFO L273 TraceCheckUtils]: 130: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:21,172 INFO L273 TraceCheckUtils]: 131: Hoare triple {21266#false} assume !(~i~2 < 99999); {21266#false} is VALID [2018-11-23 12:28:21,172 INFO L273 TraceCheckUtils]: 132: Hoare triple {21266#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {21266#false} is VALID [2018-11-23 12:28:21,172 INFO L256 TraceCheckUtils]: 133: Hoare triple {21266#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {21265#true} is VALID [2018-11-23 12:28:21,173 INFO L273 TraceCheckUtils]: 134: Hoare triple {21265#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21265#true} is VALID [2018-11-23 12:28:21,173 INFO L273 TraceCheckUtils]: 135: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,173 INFO L273 TraceCheckUtils]: 136: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,173 INFO L273 TraceCheckUtils]: 137: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,173 INFO L273 TraceCheckUtils]: 138: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,173 INFO L273 TraceCheckUtils]: 139: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,173 INFO L273 TraceCheckUtils]: 140: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,173 INFO L273 TraceCheckUtils]: 141: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,173 INFO L273 TraceCheckUtils]: 142: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,173 INFO L273 TraceCheckUtils]: 143: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,174 INFO L273 TraceCheckUtils]: 144: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,174 INFO L273 TraceCheckUtils]: 145: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,174 INFO L273 TraceCheckUtils]: 146: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,174 INFO L273 TraceCheckUtils]: 147: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,174 INFO L273 TraceCheckUtils]: 148: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,174 INFO L273 TraceCheckUtils]: 149: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,174 INFO L273 TraceCheckUtils]: 150: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,174 INFO L273 TraceCheckUtils]: 151: Hoare triple {21265#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21265#true} is VALID [2018-11-23 12:28:21,174 INFO L273 TraceCheckUtils]: 152: Hoare triple {21265#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#true} is VALID [2018-11-23 12:28:21,174 INFO L273 TraceCheckUtils]: 153: Hoare triple {21265#true} assume !(~i~0 < 100000); {21265#true} is VALID [2018-11-23 12:28:21,175 INFO L273 TraceCheckUtils]: 154: Hoare triple {21265#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {21265#true} is VALID [2018-11-23 12:28:21,175 INFO L273 TraceCheckUtils]: 155: Hoare triple {21265#true} assume true; {21265#true} is VALID [2018-11-23 12:28:21,175 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21265#true} {21266#false} #74#return; {21266#false} is VALID [2018-11-23 12:28:21,175 INFO L273 TraceCheckUtils]: 157: Hoare triple {21266#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {21266#false} is VALID [2018-11-23 12:28:21,175 INFO L273 TraceCheckUtils]: 158: Hoare triple {21266#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {21266#false} is VALID [2018-11-23 12:28:21,175 INFO L273 TraceCheckUtils]: 159: Hoare triple {21266#false} assume !false; {21266#false} is VALID [2018-11-23 12:28:21,187 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:21,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:21,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:21,197 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:28:31,897 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-11-23 12:28:31,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:31,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:32,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {21265#true} call ULTIMATE.init(); {21265#true} is VALID [2018-11-23 12:28:32,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {21265#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21265#true} is VALID [2018-11-23 12:28:32,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {21265#true} assume true; {21265#true} is VALID [2018-11-23 12:28:32,306 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21265#true} {21265#true} #66#return; {21265#true} is VALID [2018-11-23 12:28:32,306 INFO L256 TraceCheckUtils]: 4: Hoare triple {21265#true} call #t~ret12 := main(); {21265#true} is VALID [2018-11-23 12:28:32,306 INFO L273 TraceCheckUtils]: 5: Hoare triple {21265#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21265#true} is VALID [2018-11-23 12:28:32,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,307 INFO L273 TraceCheckUtils]: 7: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,307 INFO L273 TraceCheckUtils]: 8: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,307 INFO L273 TraceCheckUtils]: 9: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,308 INFO L273 TraceCheckUtils]: 11: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,308 INFO L273 TraceCheckUtils]: 13: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,308 INFO L273 TraceCheckUtils]: 16: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,309 INFO L273 TraceCheckUtils]: 18: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,309 INFO L273 TraceCheckUtils]: 23: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,309 INFO L273 TraceCheckUtils]: 24: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,309 INFO L273 TraceCheckUtils]: 25: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,309 INFO L273 TraceCheckUtils]: 26: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,310 INFO L273 TraceCheckUtils]: 27: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,310 INFO L273 TraceCheckUtils]: 28: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,310 INFO L273 TraceCheckUtils]: 29: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,310 INFO L273 TraceCheckUtils]: 30: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,310 INFO L273 TraceCheckUtils]: 31: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,310 INFO L273 TraceCheckUtils]: 32: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,310 INFO L273 TraceCheckUtils]: 33: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,310 INFO L273 TraceCheckUtils]: 34: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,310 INFO L273 TraceCheckUtils]: 35: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,311 INFO L273 TraceCheckUtils]: 36: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,311 INFO L273 TraceCheckUtils]: 37: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,311 INFO L273 TraceCheckUtils]: 38: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,311 INFO L273 TraceCheckUtils]: 39: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,311 INFO L273 TraceCheckUtils]: 40: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,311 INFO L273 TraceCheckUtils]: 41: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,311 INFO L273 TraceCheckUtils]: 42: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,311 INFO L273 TraceCheckUtils]: 43: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,311 INFO L273 TraceCheckUtils]: 44: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,311 INFO L273 TraceCheckUtils]: 45: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,312 INFO L273 TraceCheckUtils]: 46: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,312 INFO L273 TraceCheckUtils]: 47: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,312 INFO L273 TraceCheckUtils]: 48: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,312 INFO L273 TraceCheckUtils]: 49: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,312 INFO L273 TraceCheckUtils]: 50: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,312 INFO L273 TraceCheckUtils]: 51: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,312 INFO L273 TraceCheckUtils]: 52: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,312 INFO L273 TraceCheckUtils]: 53: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,312 INFO L273 TraceCheckUtils]: 54: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,313 INFO L273 TraceCheckUtils]: 55: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,313 INFO L273 TraceCheckUtils]: 56: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,313 INFO L273 TraceCheckUtils]: 57: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,313 INFO L273 TraceCheckUtils]: 58: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,313 INFO L273 TraceCheckUtils]: 59: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,313 INFO L273 TraceCheckUtils]: 60: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,313 INFO L273 TraceCheckUtils]: 61: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,313 INFO L273 TraceCheckUtils]: 62: Hoare triple {21265#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21265#true} is VALID [2018-11-23 12:28:32,313 INFO L273 TraceCheckUtils]: 63: Hoare triple {21265#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21265#true} is VALID [2018-11-23 12:28:32,313 INFO L273 TraceCheckUtils]: 64: Hoare triple {21265#true} assume !(~i~1 < 100000); {21265#true} is VALID [2018-11-23 12:28:32,314 INFO L256 TraceCheckUtils]: 65: Hoare triple {21265#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {21265#true} is VALID [2018-11-23 12:28:32,314 INFO L273 TraceCheckUtils]: 66: Hoare triple {21265#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21498#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:32,314 INFO L273 TraceCheckUtils]: 67: Hoare triple {21498#(<= mapavg_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21498#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:28:32,315 INFO L273 TraceCheckUtils]: 68: Hoare triple {21498#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21505#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:32,315 INFO L273 TraceCheckUtils]: 69: Hoare triple {21505#(<= mapavg_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21505#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:28:32,316 INFO L273 TraceCheckUtils]: 70: Hoare triple {21505#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21512#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:32,316 INFO L273 TraceCheckUtils]: 71: Hoare triple {21512#(<= mapavg_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21512#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:28:32,316 INFO L273 TraceCheckUtils]: 72: Hoare triple {21512#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21519#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:32,317 INFO L273 TraceCheckUtils]: 73: Hoare triple {21519#(<= mapavg_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21519#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:28:32,317 INFO L273 TraceCheckUtils]: 74: Hoare triple {21519#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21526#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:32,317 INFO L273 TraceCheckUtils]: 75: Hoare triple {21526#(<= mapavg_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21526#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:28:32,318 INFO L273 TraceCheckUtils]: 76: Hoare triple {21526#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21533#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:32,318 INFO L273 TraceCheckUtils]: 77: Hoare triple {21533#(<= mapavg_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21533#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:28:32,319 INFO L273 TraceCheckUtils]: 78: Hoare triple {21533#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21540#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:32,320 INFO L273 TraceCheckUtils]: 79: Hoare triple {21540#(<= mapavg_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21540#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:28:32,320 INFO L273 TraceCheckUtils]: 80: Hoare triple {21540#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21547#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:32,321 INFO L273 TraceCheckUtils]: 81: Hoare triple {21547#(<= mapavg_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21547#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:28:32,322 INFO L273 TraceCheckUtils]: 82: Hoare triple {21547#(<= mapavg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21554#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:28:32,322 INFO L273 TraceCheckUtils]: 83: Hoare triple {21554#(<= mapavg_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21554#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:28:32,323 INFO L273 TraceCheckUtils]: 84: Hoare triple {21554#(<= mapavg_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21561#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:28:32,324 INFO L273 TraceCheckUtils]: 85: Hoare triple {21561#(<= mapavg_~i~0 9)} assume !(~i~0 < 100000); {21266#false} is VALID [2018-11-23 12:28:32,324 INFO L273 TraceCheckUtils]: 86: Hoare triple {21266#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {21266#false} is VALID [2018-11-23 12:28:32,324 INFO L273 TraceCheckUtils]: 87: Hoare triple {21266#false} assume true; {21266#false} is VALID [2018-11-23 12:28:32,324 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21266#false} {21265#true} #70#return; {21266#false} is VALID [2018-11-23 12:28:32,324 INFO L273 TraceCheckUtils]: 89: Hoare triple {21266#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); {21266#false} is VALID [2018-11-23 12:28:32,325 INFO L256 TraceCheckUtils]: 90: Hoare triple {21266#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {21266#false} is VALID [2018-11-23 12:28:32,325 INFO L273 TraceCheckUtils]: 91: Hoare triple {21266#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21266#false} is VALID [2018-11-23 12:28:32,325 INFO L273 TraceCheckUtils]: 92: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,325 INFO L273 TraceCheckUtils]: 93: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,325 INFO L273 TraceCheckUtils]: 94: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,326 INFO L273 TraceCheckUtils]: 95: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,326 INFO L273 TraceCheckUtils]: 96: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,326 INFO L273 TraceCheckUtils]: 97: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,327 INFO L273 TraceCheckUtils]: 98: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,327 INFO L273 TraceCheckUtils]: 99: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,327 INFO L273 TraceCheckUtils]: 100: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,327 INFO L273 TraceCheckUtils]: 101: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,328 INFO L273 TraceCheckUtils]: 102: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,328 INFO L273 TraceCheckUtils]: 103: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,328 INFO L273 TraceCheckUtils]: 104: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,328 INFO L273 TraceCheckUtils]: 105: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,328 INFO L273 TraceCheckUtils]: 106: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,328 INFO L273 TraceCheckUtils]: 107: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,329 INFO L273 TraceCheckUtils]: 108: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,329 INFO L273 TraceCheckUtils]: 109: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,329 INFO L273 TraceCheckUtils]: 110: Hoare triple {21266#false} assume !(~i~0 < 100000); {21266#false} is VALID [2018-11-23 12:28:32,329 INFO L273 TraceCheckUtils]: 111: Hoare triple {21266#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {21266#false} is VALID [2018-11-23 12:28:32,329 INFO L273 TraceCheckUtils]: 112: Hoare triple {21266#false} assume true; {21266#false} is VALID [2018-11-23 12:28:32,329 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21266#false} {21266#false} #72#return; {21266#false} is VALID [2018-11-23 12:28:32,329 INFO L273 TraceCheckUtils]: 114: Hoare triple {21266#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; {21266#false} is VALID [2018-11-23 12:28:32,329 INFO L273 TraceCheckUtils]: 115: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:32,329 INFO L273 TraceCheckUtils]: 116: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:32,329 INFO L273 TraceCheckUtils]: 117: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:32,330 INFO L273 TraceCheckUtils]: 118: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:32,330 INFO L273 TraceCheckUtils]: 119: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:32,330 INFO L273 TraceCheckUtils]: 120: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:32,330 INFO L273 TraceCheckUtils]: 121: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:32,330 INFO L273 TraceCheckUtils]: 122: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:32,330 INFO L273 TraceCheckUtils]: 123: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:32,330 INFO L273 TraceCheckUtils]: 124: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:32,330 INFO L273 TraceCheckUtils]: 125: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:32,330 INFO L273 TraceCheckUtils]: 126: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:32,331 INFO L273 TraceCheckUtils]: 127: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:32,331 INFO L273 TraceCheckUtils]: 128: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:32,331 INFO L273 TraceCheckUtils]: 129: Hoare triple {21266#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21266#false} is VALID [2018-11-23 12:28:32,331 INFO L273 TraceCheckUtils]: 130: Hoare triple {21266#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21266#false} is VALID [2018-11-23 12:28:32,331 INFO L273 TraceCheckUtils]: 131: Hoare triple {21266#false} assume !(~i~2 < 99999); {21266#false} is VALID [2018-11-23 12:28:32,331 INFO L273 TraceCheckUtils]: 132: Hoare triple {21266#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {21266#false} is VALID [2018-11-23 12:28:32,331 INFO L256 TraceCheckUtils]: 133: Hoare triple {21266#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {21266#false} is VALID [2018-11-23 12:28:32,331 INFO L273 TraceCheckUtils]: 134: Hoare triple {21266#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21266#false} is VALID [2018-11-23 12:28:32,331 INFO L273 TraceCheckUtils]: 135: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,331 INFO L273 TraceCheckUtils]: 136: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,332 INFO L273 TraceCheckUtils]: 137: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,332 INFO L273 TraceCheckUtils]: 138: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,332 INFO L273 TraceCheckUtils]: 139: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,332 INFO L273 TraceCheckUtils]: 140: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,332 INFO L273 TraceCheckUtils]: 141: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,332 INFO L273 TraceCheckUtils]: 142: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,332 INFO L273 TraceCheckUtils]: 143: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,332 INFO L273 TraceCheckUtils]: 144: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,332 INFO L273 TraceCheckUtils]: 145: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,332 INFO L273 TraceCheckUtils]: 146: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,333 INFO L273 TraceCheckUtils]: 147: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,333 INFO L273 TraceCheckUtils]: 148: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,333 INFO L273 TraceCheckUtils]: 149: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,333 INFO L273 TraceCheckUtils]: 150: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,333 INFO L273 TraceCheckUtils]: 151: Hoare triple {21266#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21266#false} is VALID [2018-11-23 12:28:32,333 INFO L273 TraceCheckUtils]: 152: Hoare triple {21266#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#false} is VALID [2018-11-23 12:28:32,333 INFO L273 TraceCheckUtils]: 153: Hoare triple {21266#false} assume !(~i~0 < 100000); {21266#false} is VALID [2018-11-23 12:28:32,333 INFO L273 TraceCheckUtils]: 154: Hoare triple {21266#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {21266#false} is VALID [2018-11-23 12:28:32,333 INFO L273 TraceCheckUtils]: 155: Hoare triple {21266#false} assume true; {21266#false} is VALID [2018-11-23 12:28:32,334 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21266#false} {21266#false} #74#return; {21266#false} is VALID [2018-11-23 12:28:32,334 INFO L273 TraceCheckUtils]: 157: Hoare triple {21266#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {21266#false} is VALID [2018-11-23 12:28:32,334 INFO L273 TraceCheckUtils]: 158: Hoare triple {21266#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {21266#false} is VALID [2018-11-23 12:28:32,334 INFO L273 TraceCheckUtils]: 159: Hoare triple {21266#false} assume !false; {21266#false} is VALID [2018-11-23 12:28:32,344 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:32,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:32,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2018-11-23 12:28:32,367 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:28:32,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:32,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:28:32,488 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:32,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:28:32,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:28:32,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:32,490 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2018-11-23 12:28:33,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:33,689 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2018-11-23 12:28:33,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:28:33,689 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:28:33,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:28:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:28:33,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 136 transitions. [2018-11-23 12:28:33,825 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:33,828 INFO L225 Difference]: With dead ends: 171 [2018-11-23 12:28:33,828 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 12:28:33,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 12:28:33,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-23 12:28:33,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:33,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 119 states. [2018-11-23 12:28:33,874 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 119 states. [2018-11-23 12:28:33,874 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 119 states. [2018-11-23 12:28:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:33,877 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:28:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:28:33,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:33,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:33,878 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 121 states. [2018-11-23 12:28:33,878 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 121 states. [2018-11-23 12:28:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:33,880 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:28:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:28:33,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:33,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:33,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:33,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 12:28:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-23 12:28:33,883 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2018-11-23 12:28:33,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:33,883 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-23 12:28:33,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:28:33,883 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-23 12:28:33,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-23 12:28:33,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:33,884 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:33,885 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:33,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:33,885 INFO L82 PathProgramCache]: Analyzing trace with hash 574332371, now seen corresponding path program 30 times [2018-11-23 12:28:33,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:33,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:33,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:33,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:33,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:34,827 INFO L256 TraceCheckUtils]: 0: Hoare triple {22459#true} call ULTIMATE.init(); {22459#true} is VALID [2018-11-23 12:28:34,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {22459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22459#true} is VALID [2018-11-23 12:28:34,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {22459#true} assume true; {22459#true} is VALID [2018-11-23 12:28:34,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22459#true} {22459#true} #66#return; {22459#true} is VALID [2018-11-23 12:28:34,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {22459#true} call #t~ret12 := main(); {22459#true} is VALID [2018-11-23 12:28:34,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {22459#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22461#(= main_~i~1 0)} is VALID [2018-11-23 12:28:34,829 INFO L273 TraceCheckUtils]: 6: Hoare triple {22461#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22461#(= main_~i~1 0)} is VALID [2018-11-23 12:28:34,829 INFO L273 TraceCheckUtils]: 7: Hoare triple {22461#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22462#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:34,829 INFO L273 TraceCheckUtils]: 8: Hoare triple {22462#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22462#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:34,830 INFO L273 TraceCheckUtils]: 9: Hoare triple {22462#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22463#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:34,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {22463#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22463#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:34,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {22463#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22464#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:34,831 INFO L273 TraceCheckUtils]: 12: Hoare triple {22464#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22464#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:34,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {22464#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22465#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:34,832 INFO L273 TraceCheckUtils]: 14: Hoare triple {22465#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22465#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:34,833 INFO L273 TraceCheckUtils]: 15: Hoare triple {22465#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22466#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:34,833 INFO L273 TraceCheckUtils]: 16: Hoare triple {22466#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22466#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:34,834 INFO L273 TraceCheckUtils]: 17: Hoare triple {22466#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22467#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:34,834 INFO L273 TraceCheckUtils]: 18: Hoare triple {22467#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22467#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:34,835 INFO L273 TraceCheckUtils]: 19: Hoare triple {22467#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22468#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:34,836 INFO L273 TraceCheckUtils]: 20: Hoare triple {22468#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22468#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:34,836 INFO L273 TraceCheckUtils]: 21: Hoare triple {22468#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22469#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:34,837 INFO L273 TraceCheckUtils]: 22: Hoare triple {22469#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22469#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:34,838 INFO L273 TraceCheckUtils]: 23: Hoare triple {22469#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22470#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:34,838 INFO L273 TraceCheckUtils]: 24: Hoare triple {22470#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22470#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:34,839 INFO L273 TraceCheckUtils]: 25: Hoare triple {22470#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:34,839 INFO L273 TraceCheckUtils]: 26: Hoare triple {22471#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:34,840 INFO L273 TraceCheckUtils]: 27: Hoare triple {22471#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22472#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:34,841 INFO L273 TraceCheckUtils]: 28: Hoare triple {22472#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22472#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:34,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {22472#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22473#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:34,842 INFO L273 TraceCheckUtils]: 30: Hoare triple {22473#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:34,843 INFO L273 TraceCheckUtils]: 31: Hoare triple {22473#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22474#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:34,843 INFO L273 TraceCheckUtils]: 32: Hoare triple {22474#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:34,844 INFO L273 TraceCheckUtils]: 33: Hoare triple {22474#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22475#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:34,844 INFO L273 TraceCheckUtils]: 34: Hoare triple {22475#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:34,845 INFO L273 TraceCheckUtils]: 35: Hoare triple {22475#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22476#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:34,846 INFO L273 TraceCheckUtils]: 36: Hoare triple {22476#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:34,846 INFO L273 TraceCheckUtils]: 37: Hoare triple {22476#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22477#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:34,847 INFO L273 TraceCheckUtils]: 38: Hoare triple {22477#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:34,848 INFO L273 TraceCheckUtils]: 39: Hoare triple {22477#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22478#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:34,848 INFO L273 TraceCheckUtils]: 40: Hoare triple {22478#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:34,849 INFO L273 TraceCheckUtils]: 41: Hoare triple {22478#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22479#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:34,849 INFO L273 TraceCheckUtils]: 42: Hoare triple {22479#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:34,850 INFO L273 TraceCheckUtils]: 43: Hoare triple {22479#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22480#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:34,851 INFO L273 TraceCheckUtils]: 44: Hoare triple {22480#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:34,851 INFO L273 TraceCheckUtils]: 45: Hoare triple {22480#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22481#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:34,852 INFO L273 TraceCheckUtils]: 46: Hoare triple {22481#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:34,852 INFO L273 TraceCheckUtils]: 47: Hoare triple {22481#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22482#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:34,853 INFO L273 TraceCheckUtils]: 48: Hoare triple {22482#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:34,854 INFO L273 TraceCheckUtils]: 49: Hoare triple {22482#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22483#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:34,854 INFO L273 TraceCheckUtils]: 50: Hoare triple {22483#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:34,855 INFO L273 TraceCheckUtils]: 51: Hoare triple {22483#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22484#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:34,856 INFO L273 TraceCheckUtils]: 52: Hoare triple {22484#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:34,856 INFO L273 TraceCheckUtils]: 53: Hoare triple {22484#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22485#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:34,857 INFO L273 TraceCheckUtils]: 54: Hoare triple {22485#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:28:34,857 INFO L273 TraceCheckUtils]: 55: Hoare triple {22485#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22486#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:34,858 INFO L273 TraceCheckUtils]: 56: Hoare triple {22486#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -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 25)} is VALID [2018-11-23 12:28:34,859 INFO L273 TraceCheckUtils]: 57: Hoare triple {22486#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22487#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:34,859 INFO L273 TraceCheckUtils]: 58: Hoare triple {22487#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -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 26)} is VALID [2018-11-23 12:28:34,860 INFO L273 TraceCheckUtils]: 59: Hoare triple {22487#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22488#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:34,860 INFO L273 TraceCheckUtils]: 60: Hoare triple {22488#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -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 27)} is VALID [2018-11-23 12:28:34,861 INFO L273 TraceCheckUtils]: 61: Hoare triple {22488#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22489#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:34,862 INFO L273 TraceCheckUtils]: 62: Hoare triple {22489#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -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 28)} is VALID [2018-11-23 12:28:34,862 INFO L273 TraceCheckUtils]: 63: Hoare triple {22489#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22490#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:34,863 INFO L273 TraceCheckUtils]: 64: Hoare triple {22490#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -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 29)} is VALID [2018-11-23 12:28:34,864 INFO L273 TraceCheckUtils]: 65: Hoare triple {22490#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22491#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:34,864 INFO L273 TraceCheckUtils]: 66: Hoare triple {22491#(<= main_~i~1 30)} assume !(~i~1 < 100000); {22460#false} is VALID [2018-11-23 12:28:34,865 INFO L256 TraceCheckUtils]: 67: Hoare triple {22460#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {22459#true} is VALID [2018-11-23 12:28:34,865 INFO L273 TraceCheckUtils]: 68: Hoare triple {22459#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22459#true} is VALID [2018-11-23 12:28:34,865 INFO L273 TraceCheckUtils]: 69: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,865 INFO L273 TraceCheckUtils]: 70: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,865 INFO L273 TraceCheckUtils]: 71: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,865 INFO L273 TraceCheckUtils]: 72: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,866 INFO L273 TraceCheckUtils]: 73: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,866 INFO L273 TraceCheckUtils]: 74: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,866 INFO L273 TraceCheckUtils]: 75: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,866 INFO L273 TraceCheckUtils]: 76: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,866 INFO L273 TraceCheckUtils]: 77: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,867 INFO L273 TraceCheckUtils]: 78: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,867 INFO L273 TraceCheckUtils]: 79: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,867 INFO L273 TraceCheckUtils]: 80: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,867 INFO L273 TraceCheckUtils]: 81: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,867 INFO L273 TraceCheckUtils]: 82: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,867 INFO L273 TraceCheckUtils]: 83: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,868 INFO L273 TraceCheckUtils]: 84: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,868 INFO L273 TraceCheckUtils]: 85: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,868 INFO L273 TraceCheckUtils]: 86: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,868 INFO L273 TraceCheckUtils]: 87: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,868 INFO L273 TraceCheckUtils]: 88: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,868 INFO L273 TraceCheckUtils]: 89: Hoare triple {22459#true} assume !(~i~0 < 100000); {22459#true} is VALID [2018-11-23 12:28:34,868 INFO L273 TraceCheckUtils]: 90: Hoare triple {22459#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {22459#true} is VALID [2018-11-23 12:28:34,869 INFO L273 TraceCheckUtils]: 91: Hoare triple {22459#true} assume true; {22459#true} is VALID [2018-11-23 12:28:34,869 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22459#true} {22460#false} #70#return; {22460#false} is VALID [2018-11-23 12:28:34,869 INFO L273 TraceCheckUtils]: 93: Hoare triple {22460#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); {22460#false} is VALID [2018-11-23 12:28:34,869 INFO L256 TraceCheckUtils]: 94: Hoare triple {22460#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {22459#true} is VALID [2018-11-23 12:28:34,869 INFO L273 TraceCheckUtils]: 95: Hoare triple {22459#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22459#true} is VALID [2018-11-23 12:28:34,869 INFO L273 TraceCheckUtils]: 96: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,869 INFO L273 TraceCheckUtils]: 97: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,869 INFO L273 TraceCheckUtils]: 98: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,869 INFO L273 TraceCheckUtils]: 99: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,870 INFO L273 TraceCheckUtils]: 100: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,870 INFO L273 TraceCheckUtils]: 101: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,870 INFO L273 TraceCheckUtils]: 102: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,870 INFO L273 TraceCheckUtils]: 103: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,870 INFO L273 TraceCheckUtils]: 104: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,870 INFO L273 TraceCheckUtils]: 105: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,870 INFO L273 TraceCheckUtils]: 106: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,870 INFO L273 TraceCheckUtils]: 107: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,870 INFO L273 TraceCheckUtils]: 108: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,870 INFO L273 TraceCheckUtils]: 109: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,871 INFO L273 TraceCheckUtils]: 110: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,871 INFO L273 TraceCheckUtils]: 111: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,871 INFO L273 TraceCheckUtils]: 112: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,871 INFO L273 TraceCheckUtils]: 113: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,871 INFO L273 TraceCheckUtils]: 114: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,871 INFO L273 TraceCheckUtils]: 115: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,871 INFO L273 TraceCheckUtils]: 116: Hoare triple {22459#true} assume !(~i~0 < 100000); {22459#true} is VALID [2018-11-23 12:28:34,871 INFO L273 TraceCheckUtils]: 117: Hoare triple {22459#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {22459#true} is VALID [2018-11-23 12:28:34,871 INFO L273 TraceCheckUtils]: 118: Hoare triple {22459#true} assume true; {22459#true} is VALID [2018-11-23 12:28:34,872 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22459#true} {22460#false} #72#return; {22460#false} is VALID [2018-11-23 12:28:34,872 INFO L273 TraceCheckUtils]: 120: Hoare triple {22460#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; {22460#false} is VALID [2018-11-23 12:28:34,872 INFO L273 TraceCheckUtils]: 121: Hoare triple {22460#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22460#false} is VALID [2018-11-23 12:28:34,872 INFO L273 TraceCheckUtils]: 122: Hoare triple {22460#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22460#false} is VALID [2018-11-23 12:28:34,872 INFO L273 TraceCheckUtils]: 123: Hoare triple {22460#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22460#false} is VALID [2018-11-23 12:28:34,872 INFO L273 TraceCheckUtils]: 124: Hoare triple {22460#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22460#false} is VALID [2018-11-23 12:28:34,872 INFO L273 TraceCheckUtils]: 125: Hoare triple {22460#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22460#false} is VALID [2018-11-23 12:28:34,872 INFO L273 TraceCheckUtils]: 126: Hoare triple {22460#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22460#false} is VALID [2018-11-23 12:28:34,872 INFO L273 TraceCheckUtils]: 127: Hoare triple {22460#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22460#false} is VALID [2018-11-23 12:28:34,872 INFO L273 TraceCheckUtils]: 128: Hoare triple {22460#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22460#false} is VALID [2018-11-23 12:28:34,873 INFO L273 TraceCheckUtils]: 129: Hoare triple {22460#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22460#false} is VALID [2018-11-23 12:28:34,873 INFO L273 TraceCheckUtils]: 130: Hoare triple {22460#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22460#false} is VALID [2018-11-23 12:28:34,873 INFO L273 TraceCheckUtils]: 131: Hoare triple {22460#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22460#false} is VALID [2018-11-23 12:28:34,873 INFO L273 TraceCheckUtils]: 132: Hoare triple {22460#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22460#false} is VALID [2018-11-23 12:28:34,873 INFO L273 TraceCheckUtils]: 133: Hoare triple {22460#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22460#false} is VALID [2018-11-23 12:28:34,873 INFO L273 TraceCheckUtils]: 134: Hoare triple {22460#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22460#false} is VALID [2018-11-23 12:28:34,873 INFO L273 TraceCheckUtils]: 135: Hoare triple {22460#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22460#false} is VALID [2018-11-23 12:28:34,873 INFO L273 TraceCheckUtils]: 136: Hoare triple {22460#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22460#false} is VALID [2018-11-23 12:28:34,873 INFO L273 TraceCheckUtils]: 137: Hoare triple {22460#false} assume !(~i~2 < 99999); {22460#false} is VALID [2018-11-23 12:28:34,874 INFO L273 TraceCheckUtils]: 138: Hoare triple {22460#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {22460#false} is VALID [2018-11-23 12:28:34,874 INFO L256 TraceCheckUtils]: 139: Hoare triple {22460#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {22459#true} is VALID [2018-11-23 12:28:34,874 INFO L273 TraceCheckUtils]: 140: Hoare triple {22459#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22459#true} is VALID [2018-11-23 12:28:34,874 INFO L273 TraceCheckUtils]: 141: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,874 INFO L273 TraceCheckUtils]: 142: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,874 INFO L273 TraceCheckUtils]: 143: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,874 INFO L273 TraceCheckUtils]: 144: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,874 INFO L273 TraceCheckUtils]: 145: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,874 INFO L273 TraceCheckUtils]: 146: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,874 INFO L273 TraceCheckUtils]: 147: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,875 INFO L273 TraceCheckUtils]: 148: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,875 INFO L273 TraceCheckUtils]: 149: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,875 INFO L273 TraceCheckUtils]: 150: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,875 INFO L273 TraceCheckUtils]: 151: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,875 INFO L273 TraceCheckUtils]: 152: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,875 INFO L273 TraceCheckUtils]: 153: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,875 INFO L273 TraceCheckUtils]: 154: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,875 INFO L273 TraceCheckUtils]: 155: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,875 INFO L273 TraceCheckUtils]: 156: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,876 INFO L273 TraceCheckUtils]: 157: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,876 INFO L273 TraceCheckUtils]: 158: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,876 INFO L273 TraceCheckUtils]: 159: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:34,876 INFO L273 TraceCheckUtils]: 160: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:34,876 INFO L273 TraceCheckUtils]: 161: Hoare triple {22459#true} assume !(~i~0 < 100000); {22459#true} is VALID [2018-11-23 12:28:34,876 INFO L273 TraceCheckUtils]: 162: Hoare triple {22459#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {22459#true} is VALID [2018-11-23 12:28:34,876 INFO L273 TraceCheckUtils]: 163: Hoare triple {22459#true} assume true; {22459#true} is VALID [2018-11-23 12:28:34,876 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22459#true} {22460#false} #74#return; {22460#false} is VALID [2018-11-23 12:28:34,876 INFO L273 TraceCheckUtils]: 165: Hoare triple {22460#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {22460#false} is VALID [2018-11-23 12:28:34,877 INFO L273 TraceCheckUtils]: 166: Hoare triple {22460#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {22460#false} is VALID [2018-11-23 12:28:34,877 INFO L273 TraceCheckUtils]: 167: Hoare triple {22460#false} assume !false; {22460#false} is VALID [2018-11-23 12:28:34,890 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:34,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:34,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:34,900 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:36,369 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:28:36,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:36,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:36,989 INFO L256 TraceCheckUtils]: 0: Hoare triple {22459#true} call ULTIMATE.init(); {22459#true} is VALID [2018-11-23 12:28:36,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {22459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22459#true} is VALID [2018-11-23 12:28:36,990 INFO L273 TraceCheckUtils]: 2: Hoare triple {22459#true} assume true; {22459#true} is VALID [2018-11-23 12:28:36,990 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22459#true} {22459#true} #66#return; {22459#true} is VALID [2018-11-23 12:28:36,990 INFO L256 TraceCheckUtils]: 4: Hoare triple {22459#true} call #t~ret12 := main(); {22459#true} is VALID [2018-11-23 12:28:36,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {22459#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22459#true} is VALID [2018-11-23 12:28:36,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,991 INFO L273 TraceCheckUtils]: 7: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,991 INFO L273 TraceCheckUtils]: 8: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,992 INFO L273 TraceCheckUtils]: 11: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,992 INFO L273 TraceCheckUtils]: 12: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,992 INFO L273 TraceCheckUtils]: 13: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,992 INFO L273 TraceCheckUtils]: 16: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,993 INFO L273 TraceCheckUtils]: 17: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,993 INFO L273 TraceCheckUtils]: 19: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,993 INFO L273 TraceCheckUtils]: 20: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,993 INFO L273 TraceCheckUtils]: 21: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,993 INFO L273 TraceCheckUtils]: 22: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,994 INFO L273 TraceCheckUtils]: 23: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,994 INFO L273 TraceCheckUtils]: 24: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,994 INFO L273 TraceCheckUtils]: 25: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,994 INFO L273 TraceCheckUtils]: 26: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,994 INFO L273 TraceCheckUtils]: 27: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,994 INFO L273 TraceCheckUtils]: 28: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,995 INFO L273 TraceCheckUtils]: 29: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,995 INFO L273 TraceCheckUtils]: 30: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,995 INFO L273 TraceCheckUtils]: 31: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,995 INFO L273 TraceCheckUtils]: 32: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,995 INFO L273 TraceCheckUtils]: 33: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,995 INFO L273 TraceCheckUtils]: 35: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 36: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 37: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 38: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 39: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 40: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 41: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 42: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 43: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 44: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 45: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 46: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 47: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 48: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 49: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,998 INFO L273 TraceCheckUtils]: 50: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,998 INFO L273 TraceCheckUtils]: 51: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,998 INFO L273 TraceCheckUtils]: 52: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,998 INFO L273 TraceCheckUtils]: 53: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,998 INFO L273 TraceCheckUtils]: 54: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,998 INFO L273 TraceCheckUtils]: 55: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 56: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 57: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 58: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 59: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 60: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 61: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 62: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:37,000 INFO L273 TraceCheckUtils]: 63: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:37,000 INFO L273 TraceCheckUtils]: 64: Hoare triple {22459#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22459#true} is VALID [2018-11-23 12:28:37,000 INFO L273 TraceCheckUtils]: 65: Hoare triple {22459#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22459#true} is VALID [2018-11-23 12:28:37,000 INFO L273 TraceCheckUtils]: 66: Hoare triple {22459#true} assume !(~i~1 < 100000); {22459#true} is VALID [2018-11-23 12:28:37,000 INFO L256 TraceCheckUtils]: 67: Hoare triple {22459#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {22459#true} is VALID [2018-11-23 12:28:37,000 INFO L273 TraceCheckUtils]: 68: Hoare triple {22459#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22459#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 69: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 70: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 71: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 72: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 73: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 74: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 75: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,002 INFO L273 TraceCheckUtils]: 76: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,002 INFO L273 TraceCheckUtils]: 77: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,002 INFO L273 TraceCheckUtils]: 78: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,002 INFO L273 TraceCheckUtils]: 79: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,002 INFO L273 TraceCheckUtils]: 80: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,002 INFO L273 TraceCheckUtils]: 81: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,003 INFO L273 TraceCheckUtils]: 82: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,003 INFO L273 TraceCheckUtils]: 83: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,003 INFO L273 TraceCheckUtils]: 84: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,003 INFO L273 TraceCheckUtils]: 85: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,003 INFO L273 TraceCheckUtils]: 86: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,003 INFO L273 TraceCheckUtils]: 87: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,003 INFO L273 TraceCheckUtils]: 88: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,004 INFO L273 TraceCheckUtils]: 89: Hoare triple {22459#true} assume !(~i~0 < 100000); {22459#true} is VALID [2018-11-23 12:28:37,004 INFO L273 TraceCheckUtils]: 90: Hoare triple {22459#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {22459#true} is VALID [2018-11-23 12:28:37,004 INFO L273 TraceCheckUtils]: 91: Hoare triple {22459#true} assume true; {22459#true} is VALID [2018-11-23 12:28:37,004 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22459#true} {22459#true} #70#return; {22459#true} is VALID [2018-11-23 12:28:37,004 INFO L273 TraceCheckUtils]: 93: Hoare triple {22459#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); {22459#true} is VALID [2018-11-23 12:28:37,004 INFO L256 TraceCheckUtils]: 94: Hoare triple {22459#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {22459#true} is VALID [2018-11-23 12:28:37,004 INFO L273 TraceCheckUtils]: 95: Hoare triple {22459#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22459#true} is VALID [2018-11-23 12:28:37,005 INFO L273 TraceCheckUtils]: 96: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,005 INFO L273 TraceCheckUtils]: 97: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,005 INFO L273 TraceCheckUtils]: 98: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,005 INFO L273 TraceCheckUtils]: 99: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,005 INFO L273 TraceCheckUtils]: 100: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,005 INFO L273 TraceCheckUtils]: 101: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,006 INFO L273 TraceCheckUtils]: 102: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,006 INFO L273 TraceCheckUtils]: 103: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,006 INFO L273 TraceCheckUtils]: 104: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,006 INFO L273 TraceCheckUtils]: 105: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,006 INFO L273 TraceCheckUtils]: 106: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,006 INFO L273 TraceCheckUtils]: 107: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,006 INFO L273 TraceCheckUtils]: 108: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,007 INFO L273 TraceCheckUtils]: 109: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,007 INFO L273 TraceCheckUtils]: 110: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,007 INFO L273 TraceCheckUtils]: 111: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,007 INFO L273 TraceCheckUtils]: 112: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,007 INFO L273 TraceCheckUtils]: 113: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,007 INFO L273 TraceCheckUtils]: 114: Hoare triple {22459#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22459#true} is VALID [2018-11-23 12:28:37,007 INFO L273 TraceCheckUtils]: 115: Hoare triple {22459#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22459#true} is VALID [2018-11-23 12:28:37,008 INFO L273 TraceCheckUtils]: 116: Hoare triple {22459#true} assume !(~i~0 < 100000); {22459#true} is VALID [2018-11-23 12:28:37,008 INFO L273 TraceCheckUtils]: 117: Hoare triple {22459#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {22459#true} is VALID [2018-11-23 12:28:37,008 INFO L273 TraceCheckUtils]: 118: Hoare triple {22459#true} assume true; {22459#true} is VALID [2018-11-23 12:28:37,008 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22459#true} {22459#true} #72#return; {22459#true} is VALID [2018-11-23 12:28:37,028 INFO L273 TraceCheckUtils]: 120: Hoare triple {22459#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; {22855#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:37,037 INFO L273 TraceCheckUtils]: 121: Hoare triple {22855#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22855#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:37,038 INFO L273 TraceCheckUtils]: 122: Hoare triple {22855#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22862#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:37,039 INFO L273 TraceCheckUtils]: 123: Hoare triple {22862#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22862#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:37,039 INFO L273 TraceCheckUtils]: 124: Hoare triple {22862#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22869#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:37,041 INFO L273 TraceCheckUtils]: 125: Hoare triple {22869#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22869#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:37,041 INFO L273 TraceCheckUtils]: 126: Hoare triple {22869#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22876#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:37,043 INFO L273 TraceCheckUtils]: 127: Hoare triple {22876#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22876#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:37,043 INFO L273 TraceCheckUtils]: 128: Hoare triple {22876#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22883#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:37,043 INFO L273 TraceCheckUtils]: 129: Hoare triple {22883#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22883#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:37,044 INFO L273 TraceCheckUtils]: 130: Hoare triple {22883#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22890#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:37,044 INFO L273 TraceCheckUtils]: 131: Hoare triple {22890#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22890#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:37,045 INFO L273 TraceCheckUtils]: 132: Hoare triple {22890#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22897#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:37,045 INFO L273 TraceCheckUtils]: 133: Hoare triple {22897#(<= main_~i~2 6)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22897#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:37,045 INFO L273 TraceCheckUtils]: 134: Hoare triple {22897#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22904#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:37,046 INFO L273 TraceCheckUtils]: 135: Hoare triple {22904#(<= main_~i~2 7)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22904#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:37,046 INFO L273 TraceCheckUtils]: 136: Hoare triple {22904#(<= main_~i~2 7)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22911#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:37,046 INFO L273 TraceCheckUtils]: 137: Hoare triple {22911#(<= main_~i~2 8)} assume !(~i~2 < 99999); {22460#false} is VALID [2018-11-23 12:28:37,047 INFO L273 TraceCheckUtils]: 138: Hoare triple {22460#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {22460#false} is VALID [2018-11-23 12:28:37,047 INFO L256 TraceCheckUtils]: 139: Hoare triple {22460#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {22460#false} is VALID [2018-11-23 12:28:37,047 INFO L273 TraceCheckUtils]: 140: Hoare triple {22460#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22460#false} is VALID [2018-11-23 12:28:37,047 INFO L273 TraceCheckUtils]: 141: Hoare triple {22460#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22460#false} is VALID [2018-11-23 12:28:37,047 INFO L273 TraceCheckUtils]: 142: Hoare triple {22460#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22460#false} is VALID [2018-11-23 12:28:37,048 INFO L273 TraceCheckUtils]: 143: Hoare triple {22460#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22460#false} is VALID [2018-11-23 12:28:37,048 INFO L273 TraceCheckUtils]: 144: Hoare triple {22460#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22460#false} is VALID [2018-11-23 12:28:37,048 INFO L273 TraceCheckUtils]: 145: Hoare triple {22460#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22460#false} is VALID [2018-11-23 12:28:37,048 INFO L273 TraceCheckUtils]: 146: Hoare triple {22460#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22460#false} is VALID [2018-11-23 12:28:37,048 INFO L273 TraceCheckUtils]: 147: Hoare triple {22460#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22460#false} is VALID [2018-11-23 12:28:37,049 INFO L273 TraceCheckUtils]: 148: Hoare triple {22460#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22460#false} is VALID [2018-11-23 12:28:37,049 INFO L273 TraceCheckUtils]: 149: Hoare triple {22460#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22460#false} is VALID [2018-11-23 12:28:37,049 INFO L273 TraceCheckUtils]: 150: Hoare triple {22460#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22460#false} is VALID [2018-11-23 12:28:37,049 INFO L273 TraceCheckUtils]: 151: Hoare triple {22460#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22460#false} is VALID [2018-11-23 12:28:37,049 INFO L273 TraceCheckUtils]: 152: Hoare triple {22460#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22460#false} is VALID [2018-11-23 12:28:37,049 INFO L273 TraceCheckUtils]: 153: Hoare triple {22460#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22460#false} is VALID [2018-11-23 12:28:37,050 INFO L273 TraceCheckUtils]: 154: Hoare triple {22460#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22460#false} is VALID [2018-11-23 12:28:37,050 INFO L273 TraceCheckUtils]: 155: Hoare triple {22460#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22460#false} is VALID [2018-11-23 12:28:37,050 INFO L273 TraceCheckUtils]: 156: Hoare triple {22460#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22460#false} is VALID [2018-11-23 12:28:37,050 INFO L273 TraceCheckUtils]: 157: Hoare triple {22460#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22460#false} is VALID [2018-11-23 12:28:37,050 INFO L273 TraceCheckUtils]: 158: Hoare triple {22460#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22460#false} is VALID [2018-11-23 12:28:37,050 INFO L273 TraceCheckUtils]: 159: Hoare triple {22460#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22460#false} is VALID [2018-11-23 12:28:37,051 INFO L273 TraceCheckUtils]: 160: Hoare triple {22460#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22460#false} is VALID [2018-11-23 12:28:37,051 INFO L273 TraceCheckUtils]: 161: Hoare triple {22460#false} assume !(~i~0 < 100000); {22460#false} is VALID [2018-11-23 12:28:37,051 INFO L273 TraceCheckUtils]: 162: Hoare triple {22460#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {22460#false} is VALID [2018-11-23 12:28:37,051 INFO L273 TraceCheckUtils]: 163: Hoare triple {22460#false} assume true; {22460#false} is VALID [2018-11-23 12:28:37,051 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22460#false} {22460#false} #74#return; {22460#false} is VALID [2018-11-23 12:28:37,051 INFO L273 TraceCheckUtils]: 165: Hoare triple {22460#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {22460#false} is VALID [2018-11-23 12:28:37,052 INFO L273 TraceCheckUtils]: 166: Hoare triple {22460#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {22460#false} is VALID [2018-11-23 12:28:37,052 INFO L273 TraceCheckUtils]: 167: Hoare triple {22460#false} assume !false; {22460#false} is VALID [2018-11-23 12:28:37,063 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,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:37,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2018-11-23 12:28:37,084 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:28:37,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:37,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:28:37,208 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:37,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:28:37,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:28:37,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:37,210 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2018-11-23 12:28:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:38,461 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-11-23 12:28:38,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:28:38,461 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:28:38,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:28:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:28:38,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 133 transitions. [2018-11-23 12:28:38,638 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:38,640 INFO L225 Difference]: With dead ends: 177 [2018-11-23 12:28:38,641 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:28:38,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:38,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:28:38,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-23 12:28:38,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:38,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 123 states. [2018-11-23 12:28:38,690 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 123 states. [2018-11-23 12:28:38,690 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 123 states. [2018-11-23 12:28:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:38,693 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:28:38,693 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:28:38,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:38,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:38,694 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 125 states. [2018-11-23 12:28:38,694 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 125 states. [2018-11-23 12:28:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:38,696 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:28:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:28:38,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:38,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:38,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:38,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 12:28:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-11-23 12:28:38,699 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2018-11-23 12:28:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:38,700 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-11-23 12:28:38,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:28:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-23 12:28:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 12:28:38,701 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:38,701 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:38,701 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:38,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:38,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1218163405, now seen corresponding path program 31 times [2018-11-23 12:28:38,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:38,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:38,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:38,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:38,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:39,377 INFO L256 TraceCheckUtils]: 0: Hoare triple {23700#true} call ULTIMATE.init(); {23700#true} is VALID [2018-11-23 12:28:39,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {23700#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23700#true} is VALID [2018-11-23 12:28:39,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {23700#true} assume true; {23700#true} is VALID [2018-11-23 12:28:39,377 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23700#true} {23700#true} #66#return; {23700#true} is VALID [2018-11-23 12:28:39,378 INFO L256 TraceCheckUtils]: 4: Hoare triple {23700#true} call #t~ret12 := main(); {23700#true} is VALID [2018-11-23 12:28:39,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {23700#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23702#(= main_~i~1 0)} is VALID [2018-11-23 12:28:39,379 INFO L273 TraceCheckUtils]: 6: Hoare triple {23702#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23702#(= main_~i~1 0)} is VALID [2018-11-23 12:28:39,379 INFO L273 TraceCheckUtils]: 7: Hoare triple {23702#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23703#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:39,380 INFO L273 TraceCheckUtils]: 8: Hoare triple {23703#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23703#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:39,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {23703#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23704#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:39,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {23704#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23704#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:39,381 INFO L273 TraceCheckUtils]: 11: Hoare triple {23704#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23705#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:39,381 INFO L273 TraceCheckUtils]: 12: Hoare triple {23705#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23705#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:39,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {23705#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23706#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:39,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {23706#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23706#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:39,382 INFO L273 TraceCheckUtils]: 15: Hoare triple {23706#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23707#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:39,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {23707#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23707#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:39,383 INFO L273 TraceCheckUtils]: 17: Hoare triple {23707#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23708#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:39,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {23708#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23708#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:39,385 INFO L273 TraceCheckUtils]: 19: Hoare triple {23708#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23709#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:39,385 INFO L273 TraceCheckUtils]: 20: Hoare triple {23709#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23709#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:39,386 INFO L273 TraceCheckUtils]: 21: Hoare triple {23709#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23710#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:39,386 INFO L273 TraceCheckUtils]: 22: Hoare triple {23710#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23710#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:39,387 INFO L273 TraceCheckUtils]: 23: Hoare triple {23710#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23711#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:39,388 INFO L273 TraceCheckUtils]: 24: Hoare triple {23711#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23711#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:39,388 INFO L273 TraceCheckUtils]: 25: Hoare triple {23711#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23712#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:39,389 INFO L273 TraceCheckUtils]: 26: Hoare triple {23712#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23712#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:39,390 INFO L273 TraceCheckUtils]: 27: Hoare triple {23712#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23713#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:39,390 INFO L273 TraceCheckUtils]: 28: Hoare triple {23713#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23713#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:39,391 INFO L273 TraceCheckUtils]: 29: Hoare triple {23713#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23714#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:39,391 INFO L273 TraceCheckUtils]: 30: Hoare triple {23714#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:39,392 INFO L273 TraceCheckUtils]: 31: Hoare triple {23714#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23715#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:39,393 INFO L273 TraceCheckUtils]: 32: Hoare triple {23715#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:39,398 INFO L273 TraceCheckUtils]: 33: Hoare triple {23715#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23716#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:39,398 INFO L273 TraceCheckUtils]: 34: Hoare triple {23716#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:39,400 INFO L273 TraceCheckUtils]: 35: Hoare triple {23716#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23717#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:39,400 INFO L273 TraceCheckUtils]: 36: Hoare triple {23717#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:39,401 INFO L273 TraceCheckUtils]: 37: Hoare triple {23717#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23718#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:39,402 INFO L273 TraceCheckUtils]: 38: Hoare triple {23718#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:39,403 INFO L273 TraceCheckUtils]: 39: Hoare triple {23718#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23719#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:39,405 INFO L273 TraceCheckUtils]: 40: Hoare triple {23719#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:39,405 INFO L273 TraceCheckUtils]: 41: Hoare triple {23719#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23720#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:39,406 INFO L273 TraceCheckUtils]: 42: Hoare triple {23720#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:39,407 INFO L273 TraceCheckUtils]: 43: Hoare triple {23720#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23721#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:39,407 INFO L273 TraceCheckUtils]: 44: Hoare triple {23721#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:39,409 INFO L273 TraceCheckUtils]: 45: Hoare triple {23721#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23722#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:39,412 INFO L273 TraceCheckUtils]: 46: Hoare triple {23722#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:39,412 INFO L273 TraceCheckUtils]: 47: Hoare triple {23722#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23723#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:39,414 INFO L273 TraceCheckUtils]: 48: Hoare triple {23723#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:39,414 INFO L273 TraceCheckUtils]: 49: Hoare triple {23723#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23724#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:39,416 INFO L273 TraceCheckUtils]: 50: Hoare triple {23724#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:39,416 INFO L273 TraceCheckUtils]: 51: Hoare triple {23724#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23725#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:39,418 INFO L273 TraceCheckUtils]: 52: Hoare triple {23725#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:39,418 INFO L273 TraceCheckUtils]: 53: Hoare triple {23725#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23726#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:39,421 INFO L273 TraceCheckUtils]: 54: Hoare triple {23726#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:28:39,421 INFO L273 TraceCheckUtils]: 55: Hoare triple {23726#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23727#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:39,423 INFO L273 TraceCheckUtils]: 56: Hoare triple {23727#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -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 25)} is VALID [2018-11-23 12:28:39,423 INFO L273 TraceCheckUtils]: 57: Hoare triple {23727#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23728#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:39,425 INFO L273 TraceCheckUtils]: 58: Hoare triple {23728#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -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 26)} is VALID [2018-11-23 12:28:39,425 INFO L273 TraceCheckUtils]: 59: Hoare triple {23728#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23729#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:39,427 INFO L273 TraceCheckUtils]: 60: Hoare triple {23729#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -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 27)} is VALID [2018-11-23 12:28:39,427 INFO L273 TraceCheckUtils]: 61: Hoare triple {23729#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23730#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:39,430 INFO L273 TraceCheckUtils]: 62: Hoare triple {23730#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -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 28)} is VALID [2018-11-23 12:28:39,430 INFO L273 TraceCheckUtils]: 63: Hoare triple {23730#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23731#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:39,433 INFO L273 TraceCheckUtils]: 64: Hoare triple {23731#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -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 29)} is VALID [2018-11-23 12:28:39,433 INFO L273 TraceCheckUtils]: 65: Hoare triple {23731#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23732#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:39,435 INFO L273 TraceCheckUtils]: 66: Hoare triple {23732#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -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 30)} is VALID [2018-11-23 12:28:39,435 INFO L273 TraceCheckUtils]: 67: Hoare triple {23732#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23733#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:39,437 INFO L273 TraceCheckUtils]: 68: Hoare triple {23733#(<= main_~i~1 31)} assume !(~i~1 < 100000); {23701#false} is VALID [2018-11-23 12:28:39,437 INFO L256 TraceCheckUtils]: 69: Hoare triple {23701#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {23700#true} is VALID [2018-11-23 12:28:39,437 INFO L273 TraceCheckUtils]: 70: Hoare triple {23700#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23700#true} is VALID [2018-11-23 12:28:39,437 INFO L273 TraceCheckUtils]: 71: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,437 INFO L273 TraceCheckUtils]: 72: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,437 INFO L273 TraceCheckUtils]: 73: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,437 INFO L273 TraceCheckUtils]: 74: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,437 INFO L273 TraceCheckUtils]: 75: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,438 INFO L273 TraceCheckUtils]: 76: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,438 INFO L273 TraceCheckUtils]: 77: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,438 INFO L273 TraceCheckUtils]: 78: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,438 INFO L273 TraceCheckUtils]: 79: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,438 INFO L273 TraceCheckUtils]: 80: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,438 INFO L273 TraceCheckUtils]: 81: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,438 INFO L273 TraceCheckUtils]: 82: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,438 INFO L273 TraceCheckUtils]: 83: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,438 INFO L273 TraceCheckUtils]: 84: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,438 INFO L273 TraceCheckUtils]: 85: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,439 INFO L273 TraceCheckUtils]: 86: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,439 INFO L273 TraceCheckUtils]: 87: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,439 INFO L273 TraceCheckUtils]: 88: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,439 INFO L273 TraceCheckUtils]: 89: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,439 INFO L273 TraceCheckUtils]: 90: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,439 INFO L273 TraceCheckUtils]: 91: Hoare triple {23700#true} assume !(~i~0 < 100000); {23700#true} is VALID [2018-11-23 12:28:39,439 INFO L273 TraceCheckUtils]: 92: Hoare triple {23700#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {23700#true} is VALID [2018-11-23 12:28:39,439 INFO L273 TraceCheckUtils]: 93: Hoare triple {23700#true} assume true; {23700#true} is VALID [2018-11-23 12:28:39,439 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23700#true} {23701#false} #70#return; {23701#false} is VALID [2018-11-23 12:28:39,440 INFO L273 TraceCheckUtils]: 95: Hoare triple {23701#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); {23701#false} is VALID [2018-11-23 12:28:39,440 INFO L256 TraceCheckUtils]: 96: Hoare triple {23701#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {23700#true} is VALID [2018-11-23 12:28:39,440 INFO L273 TraceCheckUtils]: 97: Hoare triple {23700#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23700#true} is VALID [2018-11-23 12:28:39,440 INFO L273 TraceCheckUtils]: 98: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,440 INFO L273 TraceCheckUtils]: 99: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,440 INFO L273 TraceCheckUtils]: 100: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,440 INFO L273 TraceCheckUtils]: 101: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,440 INFO L273 TraceCheckUtils]: 102: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,440 INFO L273 TraceCheckUtils]: 103: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,440 INFO L273 TraceCheckUtils]: 104: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,441 INFO L273 TraceCheckUtils]: 105: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,441 INFO L273 TraceCheckUtils]: 106: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,441 INFO L273 TraceCheckUtils]: 107: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,441 INFO L273 TraceCheckUtils]: 108: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,441 INFO L273 TraceCheckUtils]: 109: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,441 INFO L273 TraceCheckUtils]: 110: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,441 INFO L273 TraceCheckUtils]: 111: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,441 INFO L273 TraceCheckUtils]: 112: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,441 INFO L273 TraceCheckUtils]: 113: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,441 INFO L273 TraceCheckUtils]: 114: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,442 INFO L273 TraceCheckUtils]: 115: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,442 INFO L273 TraceCheckUtils]: 116: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,442 INFO L273 TraceCheckUtils]: 117: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,442 INFO L273 TraceCheckUtils]: 118: Hoare triple {23700#true} assume !(~i~0 < 100000); {23700#true} is VALID [2018-11-23 12:28:39,442 INFO L273 TraceCheckUtils]: 119: Hoare triple {23700#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {23700#true} is VALID [2018-11-23 12:28:39,442 INFO L273 TraceCheckUtils]: 120: Hoare triple {23700#true} assume true; {23700#true} is VALID [2018-11-23 12:28:39,442 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23700#true} {23701#false} #72#return; {23701#false} is VALID [2018-11-23 12:28:39,442 INFO L273 TraceCheckUtils]: 122: Hoare triple {23701#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; {23701#false} is VALID [2018-11-23 12:28:39,442 INFO L273 TraceCheckUtils]: 123: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:39,442 INFO L273 TraceCheckUtils]: 124: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:39,443 INFO L273 TraceCheckUtils]: 125: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:39,443 INFO L273 TraceCheckUtils]: 126: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:39,443 INFO L273 TraceCheckUtils]: 127: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:39,443 INFO L273 TraceCheckUtils]: 128: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:39,443 INFO L273 TraceCheckUtils]: 129: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:39,443 INFO L273 TraceCheckUtils]: 130: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:39,443 INFO L273 TraceCheckUtils]: 131: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:39,443 INFO L273 TraceCheckUtils]: 132: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:39,443 INFO L273 TraceCheckUtils]: 133: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:39,444 INFO L273 TraceCheckUtils]: 134: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:39,444 INFO L273 TraceCheckUtils]: 135: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:39,444 INFO L273 TraceCheckUtils]: 136: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:39,444 INFO L273 TraceCheckUtils]: 137: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:39,444 INFO L273 TraceCheckUtils]: 138: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:39,444 INFO L273 TraceCheckUtils]: 139: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:39,444 INFO L273 TraceCheckUtils]: 140: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:39,444 INFO L273 TraceCheckUtils]: 141: Hoare triple {23701#false} assume !(~i~2 < 99999); {23701#false} is VALID [2018-11-23 12:28:39,444 INFO L273 TraceCheckUtils]: 142: Hoare triple {23701#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {23701#false} is VALID [2018-11-23 12:28:39,444 INFO L256 TraceCheckUtils]: 143: Hoare triple {23701#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {23700#true} is VALID [2018-11-23 12:28:39,445 INFO L273 TraceCheckUtils]: 144: Hoare triple {23700#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23700#true} is VALID [2018-11-23 12:28:39,445 INFO L273 TraceCheckUtils]: 145: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,445 INFO L273 TraceCheckUtils]: 146: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,445 INFO L273 TraceCheckUtils]: 147: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,445 INFO L273 TraceCheckUtils]: 148: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,445 INFO L273 TraceCheckUtils]: 149: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,445 INFO L273 TraceCheckUtils]: 150: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,445 INFO L273 TraceCheckUtils]: 151: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,445 INFO L273 TraceCheckUtils]: 152: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,445 INFO L273 TraceCheckUtils]: 153: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,446 INFO L273 TraceCheckUtils]: 154: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,446 INFO L273 TraceCheckUtils]: 155: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,446 INFO L273 TraceCheckUtils]: 156: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,446 INFO L273 TraceCheckUtils]: 157: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,446 INFO L273 TraceCheckUtils]: 158: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,446 INFO L273 TraceCheckUtils]: 159: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,446 INFO L273 TraceCheckUtils]: 160: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,446 INFO L273 TraceCheckUtils]: 161: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,446 INFO L273 TraceCheckUtils]: 162: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,447 INFO L273 TraceCheckUtils]: 163: Hoare triple {23700#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23700#true} is VALID [2018-11-23 12:28:39,447 INFO L273 TraceCheckUtils]: 164: Hoare triple {23700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23700#true} is VALID [2018-11-23 12:28:39,447 INFO L273 TraceCheckUtils]: 165: Hoare triple {23700#true} assume !(~i~0 < 100000); {23700#true} is VALID [2018-11-23 12:28:39,447 INFO L273 TraceCheckUtils]: 166: Hoare triple {23700#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {23700#true} is VALID [2018-11-23 12:28:39,447 INFO L273 TraceCheckUtils]: 167: Hoare triple {23700#true} assume true; {23700#true} is VALID [2018-11-23 12:28:39,447 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23700#true} {23701#false} #74#return; {23701#false} is VALID [2018-11-23 12:28:39,447 INFO L273 TraceCheckUtils]: 169: Hoare triple {23701#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {23701#false} is VALID [2018-11-23 12:28:39,447 INFO L273 TraceCheckUtils]: 170: Hoare triple {23701#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {23701#false} is VALID [2018-11-23 12:28:39,447 INFO L273 TraceCheckUtils]: 171: Hoare triple {23701#false} assume !false; {23701#false} is VALID [2018-11-23 12:28:39,461 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:39,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:39,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:39,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:40,076 INFO L256 TraceCheckUtils]: 0: Hoare triple {23700#true} call ULTIMATE.init(); {23700#true} is VALID [2018-11-23 12:28:40,077 INFO L273 TraceCheckUtils]: 1: Hoare triple {23700#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23700#true} is VALID [2018-11-23 12:28:40,077 INFO L273 TraceCheckUtils]: 2: Hoare triple {23700#true} assume true; {23700#true} is VALID [2018-11-23 12:28:40,077 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23700#true} {23700#true} #66#return; {23700#true} is VALID [2018-11-23 12:28:40,077 INFO L256 TraceCheckUtils]: 4: Hoare triple {23700#true} call #t~ret12 := main(); {23700#true} is VALID [2018-11-23 12:28:40,078 INFO L273 TraceCheckUtils]: 5: Hoare triple {23700#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23752#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:40,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {23752#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23752#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:40,079 INFO L273 TraceCheckUtils]: 7: Hoare triple {23752#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23703#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:40,079 INFO L273 TraceCheckUtils]: 8: Hoare triple {23703#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23703#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:40,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {23703#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23704#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:40,080 INFO L273 TraceCheckUtils]: 10: Hoare triple {23704#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23704#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:40,080 INFO L273 TraceCheckUtils]: 11: Hoare triple {23704#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23705#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:40,081 INFO L273 TraceCheckUtils]: 12: Hoare triple {23705#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23705#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:40,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {23705#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23706#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:40,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {23706#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23706#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:40,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {23706#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23707#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:40,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {23707#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23707#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:40,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {23707#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23708#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:40,085 INFO L273 TraceCheckUtils]: 18: Hoare triple {23708#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23708#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:40,085 INFO L273 TraceCheckUtils]: 19: Hoare triple {23708#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23709#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:40,086 INFO L273 TraceCheckUtils]: 20: Hoare triple {23709#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23709#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:40,087 INFO L273 TraceCheckUtils]: 21: Hoare triple {23709#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23710#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:40,087 INFO L273 TraceCheckUtils]: 22: Hoare triple {23710#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23710#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:40,088 INFO L273 TraceCheckUtils]: 23: Hoare triple {23710#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23711#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:40,088 INFO L273 TraceCheckUtils]: 24: Hoare triple {23711#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23711#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:40,089 INFO L273 TraceCheckUtils]: 25: Hoare triple {23711#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23712#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:40,090 INFO L273 TraceCheckUtils]: 26: Hoare triple {23712#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23712#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:40,090 INFO L273 TraceCheckUtils]: 27: Hoare triple {23712#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23713#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:40,091 INFO L273 TraceCheckUtils]: 28: Hoare triple {23713#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23713#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:40,091 INFO L273 TraceCheckUtils]: 29: Hoare triple {23713#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23714#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:40,092 INFO L273 TraceCheckUtils]: 30: Hoare triple {23714#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:40,093 INFO L273 TraceCheckUtils]: 31: Hoare triple {23714#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23715#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:40,093 INFO L273 TraceCheckUtils]: 32: Hoare triple {23715#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:40,094 INFO L273 TraceCheckUtils]: 33: Hoare triple {23715#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23716#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:40,094 INFO L273 TraceCheckUtils]: 34: Hoare triple {23716#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:40,095 INFO L273 TraceCheckUtils]: 35: Hoare triple {23716#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23717#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:40,096 INFO L273 TraceCheckUtils]: 36: Hoare triple {23717#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:40,096 INFO L273 TraceCheckUtils]: 37: Hoare triple {23717#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23718#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:40,097 INFO L273 TraceCheckUtils]: 38: Hoare triple {23718#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:40,098 INFO L273 TraceCheckUtils]: 39: Hoare triple {23718#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23719#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:40,098 INFO L273 TraceCheckUtils]: 40: Hoare triple {23719#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:40,099 INFO L273 TraceCheckUtils]: 41: Hoare triple {23719#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23720#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:40,099 INFO L273 TraceCheckUtils]: 42: Hoare triple {23720#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:40,100 INFO L273 TraceCheckUtils]: 43: Hoare triple {23720#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23721#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:40,101 INFO L273 TraceCheckUtils]: 44: Hoare triple {23721#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:40,101 INFO L273 TraceCheckUtils]: 45: Hoare triple {23721#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23722#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:40,102 INFO L273 TraceCheckUtils]: 46: Hoare triple {23722#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:40,103 INFO L273 TraceCheckUtils]: 47: Hoare triple {23722#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23723#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:40,103 INFO L273 TraceCheckUtils]: 48: Hoare triple {23723#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:40,104 INFO L273 TraceCheckUtils]: 49: Hoare triple {23723#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23724#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:40,104 INFO L273 TraceCheckUtils]: 50: Hoare triple {23724#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:40,105 INFO L273 TraceCheckUtils]: 51: Hoare triple {23724#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23725#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:40,106 INFO L273 TraceCheckUtils]: 52: Hoare triple {23725#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:40,106 INFO L273 TraceCheckUtils]: 53: Hoare triple {23725#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23726#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:40,107 INFO L273 TraceCheckUtils]: 54: Hoare triple {23726#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:28:40,107 INFO L273 TraceCheckUtils]: 55: Hoare triple {23726#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23727#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:40,108 INFO L273 TraceCheckUtils]: 56: Hoare triple {23727#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -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 25)} is VALID [2018-11-23 12:28:40,109 INFO L273 TraceCheckUtils]: 57: Hoare triple {23727#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23728#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:40,109 INFO L273 TraceCheckUtils]: 58: Hoare triple {23728#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -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 26)} is VALID [2018-11-23 12:28:40,110 INFO L273 TraceCheckUtils]: 59: Hoare triple {23728#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23729#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:40,110 INFO L273 TraceCheckUtils]: 60: Hoare triple {23729#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -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 27)} is VALID [2018-11-23 12:28:40,111 INFO L273 TraceCheckUtils]: 61: Hoare triple {23729#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23730#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:40,112 INFO L273 TraceCheckUtils]: 62: Hoare triple {23730#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -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 28)} is VALID [2018-11-23 12:28:40,112 INFO L273 TraceCheckUtils]: 63: Hoare triple {23730#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23731#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:40,113 INFO L273 TraceCheckUtils]: 64: Hoare triple {23731#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -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 29)} is VALID [2018-11-23 12:28:40,114 INFO L273 TraceCheckUtils]: 65: Hoare triple {23731#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23732#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:40,114 INFO L273 TraceCheckUtils]: 66: Hoare triple {23732#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -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 30)} is VALID [2018-11-23 12:28:40,115 INFO L273 TraceCheckUtils]: 67: Hoare triple {23732#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23733#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:40,116 INFO L273 TraceCheckUtils]: 68: Hoare triple {23733#(<= main_~i~1 31)} assume !(~i~1 < 100000); {23701#false} is VALID [2018-11-23 12:28:40,116 INFO L256 TraceCheckUtils]: 69: Hoare triple {23701#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {23701#false} is VALID [2018-11-23 12:28:40,116 INFO L273 TraceCheckUtils]: 70: Hoare triple {23701#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23701#false} is VALID [2018-11-23 12:28:40,116 INFO L273 TraceCheckUtils]: 71: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,116 INFO L273 TraceCheckUtils]: 72: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,117 INFO L273 TraceCheckUtils]: 73: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,117 INFO L273 TraceCheckUtils]: 74: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,117 INFO L273 TraceCheckUtils]: 75: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,117 INFO L273 TraceCheckUtils]: 76: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,117 INFO L273 TraceCheckUtils]: 77: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,117 INFO L273 TraceCheckUtils]: 78: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,117 INFO L273 TraceCheckUtils]: 79: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,117 INFO L273 TraceCheckUtils]: 80: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,118 INFO L273 TraceCheckUtils]: 81: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,118 INFO L273 TraceCheckUtils]: 82: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,118 INFO L273 TraceCheckUtils]: 83: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,118 INFO L273 TraceCheckUtils]: 84: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,118 INFO L273 TraceCheckUtils]: 85: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,118 INFO L273 TraceCheckUtils]: 86: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,118 INFO L273 TraceCheckUtils]: 87: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,118 INFO L273 TraceCheckUtils]: 88: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,118 INFO L273 TraceCheckUtils]: 89: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,119 INFO L273 TraceCheckUtils]: 90: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,119 INFO L273 TraceCheckUtils]: 91: Hoare triple {23701#false} assume !(~i~0 < 100000); {23701#false} is VALID [2018-11-23 12:28:40,119 INFO L273 TraceCheckUtils]: 92: Hoare triple {23701#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {23701#false} is VALID [2018-11-23 12:28:40,119 INFO L273 TraceCheckUtils]: 93: Hoare triple {23701#false} assume true; {23701#false} is VALID [2018-11-23 12:28:40,119 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23701#false} {23701#false} #70#return; {23701#false} is VALID [2018-11-23 12:28:40,119 INFO L273 TraceCheckUtils]: 95: Hoare triple {23701#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); {23701#false} is VALID [2018-11-23 12:28:40,119 INFO L256 TraceCheckUtils]: 96: Hoare triple {23701#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {23701#false} is VALID [2018-11-23 12:28:40,119 INFO L273 TraceCheckUtils]: 97: Hoare triple {23701#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23701#false} is VALID [2018-11-23 12:28:40,119 INFO L273 TraceCheckUtils]: 98: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,119 INFO L273 TraceCheckUtils]: 99: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,120 INFO L273 TraceCheckUtils]: 100: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,120 INFO L273 TraceCheckUtils]: 101: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,120 INFO L273 TraceCheckUtils]: 102: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,120 INFO L273 TraceCheckUtils]: 103: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,120 INFO L273 TraceCheckUtils]: 104: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,120 INFO L273 TraceCheckUtils]: 105: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,120 INFO L273 TraceCheckUtils]: 106: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,120 INFO L273 TraceCheckUtils]: 107: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,120 INFO L273 TraceCheckUtils]: 108: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,120 INFO L273 TraceCheckUtils]: 109: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,121 INFO L273 TraceCheckUtils]: 110: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,121 INFO L273 TraceCheckUtils]: 111: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,121 INFO L273 TraceCheckUtils]: 112: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,121 INFO L273 TraceCheckUtils]: 113: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,121 INFO L273 TraceCheckUtils]: 114: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,121 INFO L273 TraceCheckUtils]: 115: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,121 INFO L273 TraceCheckUtils]: 116: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,121 INFO L273 TraceCheckUtils]: 117: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,121 INFO L273 TraceCheckUtils]: 118: Hoare triple {23701#false} assume !(~i~0 < 100000); {23701#false} is VALID [2018-11-23 12:28:40,122 INFO L273 TraceCheckUtils]: 119: Hoare triple {23701#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {23701#false} is VALID [2018-11-23 12:28:40,122 INFO L273 TraceCheckUtils]: 120: Hoare triple {23701#false} assume true; {23701#false} is VALID [2018-11-23 12:28:40,122 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23701#false} {23701#false} #72#return; {23701#false} is VALID [2018-11-23 12:28:40,122 INFO L273 TraceCheckUtils]: 122: Hoare triple {23701#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; {23701#false} is VALID [2018-11-23 12:28:40,122 INFO L273 TraceCheckUtils]: 123: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:40,122 INFO L273 TraceCheckUtils]: 124: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:40,122 INFO L273 TraceCheckUtils]: 125: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:40,122 INFO L273 TraceCheckUtils]: 126: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:40,122 INFO L273 TraceCheckUtils]: 127: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:40,122 INFO L273 TraceCheckUtils]: 128: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:40,123 INFO L273 TraceCheckUtils]: 129: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:40,123 INFO L273 TraceCheckUtils]: 130: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:40,123 INFO L273 TraceCheckUtils]: 131: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:40,123 INFO L273 TraceCheckUtils]: 132: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:40,123 INFO L273 TraceCheckUtils]: 133: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:40,123 INFO L273 TraceCheckUtils]: 134: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:40,123 INFO L273 TraceCheckUtils]: 135: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:40,123 INFO L273 TraceCheckUtils]: 136: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:40,123 INFO L273 TraceCheckUtils]: 137: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:40,124 INFO L273 TraceCheckUtils]: 138: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:40,124 INFO L273 TraceCheckUtils]: 139: Hoare triple {23701#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23701#false} is VALID [2018-11-23 12:28:40,124 INFO L273 TraceCheckUtils]: 140: Hoare triple {23701#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23701#false} is VALID [2018-11-23 12:28:40,124 INFO L273 TraceCheckUtils]: 141: Hoare triple {23701#false} assume !(~i~2 < 99999); {23701#false} is VALID [2018-11-23 12:28:40,124 INFO L273 TraceCheckUtils]: 142: Hoare triple {23701#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {23701#false} is VALID [2018-11-23 12:28:40,124 INFO L256 TraceCheckUtils]: 143: Hoare triple {23701#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {23701#false} is VALID [2018-11-23 12:28:40,124 INFO L273 TraceCheckUtils]: 144: Hoare triple {23701#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23701#false} is VALID [2018-11-23 12:28:40,125 INFO L273 TraceCheckUtils]: 145: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,125 INFO L273 TraceCheckUtils]: 146: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,125 INFO L273 TraceCheckUtils]: 147: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,125 INFO L273 TraceCheckUtils]: 148: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,125 INFO L273 TraceCheckUtils]: 149: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,125 INFO L273 TraceCheckUtils]: 150: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,125 INFO L273 TraceCheckUtils]: 151: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,126 INFO L273 TraceCheckUtils]: 152: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,126 INFO L273 TraceCheckUtils]: 153: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,126 INFO L273 TraceCheckUtils]: 154: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,126 INFO L273 TraceCheckUtils]: 155: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,126 INFO L273 TraceCheckUtils]: 156: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,126 INFO L273 TraceCheckUtils]: 157: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,127 INFO L273 TraceCheckUtils]: 158: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,127 INFO L273 TraceCheckUtils]: 159: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,127 INFO L273 TraceCheckUtils]: 160: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,127 INFO L273 TraceCheckUtils]: 161: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,127 INFO L273 TraceCheckUtils]: 162: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,127 INFO L273 TraceCheckUtils]: 163: Hoare triple {23701#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23701#false} is VALID [2018-11-23 12:28:40,128 INFO L273 TraceCheckUtils]: 164: Hoare triple {23701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23701#false} is VALID [2018-11-23 12:28:40,128 INFO L273 TraceCheckUtils]: 165: Hoare triple {23701#false} assume !(~i~0 < 100000); {23701#false} is VALID [2018-11-23 12:28:40,128 INFO L273 TraceCheckUtils]: 166: Hoare triple {23701#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {23701#false} is VALID [2018-11-23 12:28:40,128 INFO L273 TraceCheckUtils]: 167: Hoare triple {23701#false} assume true; {23701#false} is VALID [2018-11-23 12:28:40,128 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23701#false} {23701#false} #74#return; {23701#false} is VALID [2018-11-23 12:28:40,128 INFO L273 TraceCheckUtils]: 169: Hoare triple {23701#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {23701#false} is VALID [2018-11-23 12:28:40,128 INFO L273 TraceCheckUtils]: 170: Hoare triple {23701#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {23701#false} is VALID [2018-11-23 12:28:40,129 INFO L273 TraceCheckUtils]: 171: Hoare triple {23701#false} assume !false; {23701#false} is VALID [2018-11-23 12:28:40,147 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,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:40,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:28:40,179 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:28:40,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:40,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:28:40,321 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:40,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:28:40,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:28:40,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:28:40,323 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2018-11-23 12:28:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:41,261 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-23 12:28:41,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:28:41,261 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:28:41,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:28:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:28:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:28:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:28:41,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 116 transitions. [2018-11-23 12:28:41,416 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,419 INFO L225 Difference]: With dead ends: 180 [2018-11-23 12:28:41,419 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 12:28:41,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:28:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 12:28:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-23 12:28:41,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:41,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-23 12:28:41,466 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-23 12:28:41,466 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-23 12:28:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:41,469 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:28:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:28:41,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:41,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:41,469 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-23 12:28:41,469 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-23 12:28:41,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:41,472 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:28:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:28:41,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:41,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:41,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:41,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 12:28:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-23 12:28:41,475 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2018-11-23 12:28:41,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:41,475 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-23 12:28:41,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:28:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:28:41,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 12:28:41,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:41,476 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,476 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:41,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:41,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1888810859, now seen corresponding path program 32 times [2018-11-23 12:28:41,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:41,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:41,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:41,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:41,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:42,306 INFO L256 TraceCheckUtils]: 0: Hoare triple {24956#true} call ULTIMATE.init(); {24956#true} is VALID [2018-11-23 12:28:42,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {24956#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24956#true} is VALID [2018-11-23 12:28:42,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {24956#true} assume true; {24956#true} is VALID [2018-11-23 12:28:42,307 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24956#true} {24956#true} #66#return; {24956#true} is VALID [2018-11-23 12:28:42,307 INFO L256 TraceCheckUtils]: 4: Hoare triple {24956#true} call #t~ret12 := main(); {24956#true} is VALID [2018-11-23 12:28:42,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {24956#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {24958#(= main_~i~1 0)} is VALID [2018-11-23 12:28:42,308 INFO L273 TraceCheckUtils]: 6: Hoare triple {24958#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24958#(= main_~i~1 0)} is VALID [2018-11-23 12:28:42,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {24958#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24959#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:42,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {24959#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24959#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:42,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {24959#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24960#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:42,310 INFO L273 TraceCheckUtils]: 10: Hoare triple {24960#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24960#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:42,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {24960#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24961#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:42,312 INFO L273 TraceCheckUtils]: 12: Hoare triple {24961#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24961#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:42,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {24961#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24962#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:42,313 INFO L273 TraceCheckUtils]: 14: Hoare triple {24962#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24962#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:42,314 INFO L273 TraceCheckUtils]: 15: Hoare triple {24962#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24963#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:42,314 INFO L273 TraceCheckUtils]: 16: Hoare triple {24963#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24963#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:42,315 INFO L273 TraceCheckUtils]: 17: Hoare triple {24963#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24964#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:42,315 INFO L273 TraceCheckUtils]: 18: Hoare triple {24964#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24964#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:42,316 INFO L273 TraceCheckUtils]: 19: Hoare triple {24964#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24965#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:42,316 INFO L273 TraceCheckUtils]: 20: Hoare triple {24965#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24965#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:42,317 INFO L273 TraceCheckUtils]: 21: Hoare triple {24965#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24966#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:42,318 INFO L273 TraceCheckUtils]: 22: Hoare triple {24966#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24966#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:42,318 INFO L273 TraceCheckUtils]: 23: Hoare triple {24966#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24967#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:42,319 INFO L273 TraceCheckUtils]: 24: Hoare triple {24967#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24967#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:42,320 INFO L273 TraceCheckUtils]: 25: Hoare triple {24967#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24968#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:42,320 INFO L273 TraceCheckUtils]: 26: Hoare triple {24968#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24968#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:42,321 INFO L273 TraceCheckUtils]: 27: Hoare triple {24968#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24969#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:42,321 INFO L273 TraceCheckUtils]: 28: Hoare triple {24969#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24969#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:42,322 INFO L273 TraceCheckUtils]: 29: Hoare triple {24969#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24970#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:42,323 INFO L273 TraceCheckUtils]: 30: Hoare triple {24970#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:42,323 INFO L273 TraceCheckUtils]: 31: Hoare triple {24970#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24971#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:42,324 INFO L273 TraceCheckUtils]: 32: Hoare triple {24971#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:42,325 INFO L273 TraceCheckUtils]: 33: Hoare triple {24971#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24972#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:42,325 INFO L273 TraceCheckUtils]: 34: Hoare triple {24972#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:42,326 INFO L273 TraceCheckUtils]: 35: Hoare triple {24972#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24973#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:42,326 INFO L273 TraceCheckUtils]: 36: Hoare triple {24973#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:42,327 INFO L273 TraceCheckUtils]: 37: Hoare triple {24973#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24974#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:42,328 INFO L273 TraceCheckUtils]: 38: Hoare triple {24974#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:42,328 INFO L273 TraceCheckUtils]: 39: Hoare triple {24974#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24975#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:42,329 INFO L273 TraceCheckUtils]: 40: Hoare triple {24975#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:42,329 INFO L273 TraceCheckUtils]: 41: Hoare triple {24975#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24976#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:42,330 INFO L273 TraceCheckUtils]: 42: Hoare triple {24976#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:42,331 INFO L273 TraceCheckUtils]: 43: Hoare triple {24976#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24977#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:42,331 INFO L273 TraceCheckUtils]: 44: Hoare triple {24977#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:42,332 INFO L273 TraceCheckUtils]: 45: Hoare triple {24977#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24978#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:42,332 INFO L273 TraceCheckUtils]: 46: Hoare triple {24978#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:42,333 INFO L273 TraceCheckUtils]: 47: Hoare triple {24978#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24979#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:42,334 INFO L273 TraceCheckUtils]: 48: Hoare triple {24979#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:42,334 INFO L273 TraceCheckUtils]: 49: Hoare triple {24979#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24980#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:42,335 INFO L273 TraceCheckUtils]: 50: Hoare triple {24980#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:42,336 INFO L273 TraceCheckUtils]: 51: Hoare triple {24980#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24981#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:42,336 INFO L273 TraceCheckUtils]: 52: Hoare triple {24981#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:42,337 INFO L273 TraceCheckUtils]: 53: Hoare triple {24981#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24982#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:42,337 INFO L273 TraceCheckUtils]: 54: Hoare triple {24982#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:28:42,338 INFO L273 TraceCheckUtils]: 55: Hoare triple {24982#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24983#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:42,339 INFO L273 TraceCheckUtils]: 56: Hoare triple {24983#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -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 25)} is VALID [2018-11-23 12:28:42,339 INFO L273 TraceCheckUtils]: 57: Hoare triple {24983#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24984#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:42,340 INFO L273 TraceCheckUtils]: 58: Hoare triple {24984#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -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 26)} is VALID [2018-11-23 12:28:42,341 INFO L273 TraceCheckUtils]: 59: Hoare triple {24984#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24985#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:42,341 INFO L273 TraceCheckUtils]: 60: Hoare triple {24985#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -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 27)} is VALID [2018-11-23 12:28:42,342 INFO L273 TraceCheckUtils]: 61: Hoare triple {24985#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24986#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:42,342 INFO L273 TraceCheckUtils]: 62: Hoare triple {24986#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -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 28)} is VALID [2018-11-23 12:28:42,343 INFO L273 TraceCheckUtils]: 63: Hoare triple {24986#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24987#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:42,344 INFO L273 TraceCheckUtils]: 64: Hoare triple {24987#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -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 29)} is VALID [2018-11-23 12:28:42,344 INFO L273 TraceCheckUtils]: 65: Hoare triple {24987#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24988#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:42,345 INFO L273 TraceCheckUtils]: 66: Hoare triple {24988#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -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 30)} is VALID [2018-11-23 12:28:42,345 INFO L273 TraceCheckUtils]: 67: Hoare triple {24988#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24989#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:42,346 INFO L273 TraceCheckUtils]: 68: Hoare triple {24989#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -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 31)} is VALID [2018-11-23 12:28:42,347 INFO L273 TraceCheckUtils]: 69: Hoare triple {24989#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24990#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:42,347 INFO L273 TraceCheckUtils]: 70: Hoare triple {24990#(<= main_~i~1 32)} assume !(~i~1 < 100000); {24957#false} is VALID [2018-11-23 12:28:42,348 INFO L256 TraceCheckUtils]: 71: Hoare triple {24957#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {24956#true} is VALID [2018-11-23 12:28:42,348 INFO L273 TraceCheckUtils]: 72: Hoare triple {24956#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24956#true} is VALID [2018-11-23 12:28:42,348 INFO L273 TraceCheckUtils]: 73: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,348 INFO L273 TraceCheckUtils]: 74: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,348 INFO L273 TraceCheckUtils]: 75: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,348 INFO L273 TraceCheckUtils]: 76: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,349 INFO L273 TraceCheckUtils]: 77: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,349 INFO L273 TraceCheckUtils]: 78: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,349 INFO L273 TraceCheckUtils]: 79: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,349 INFO L273 TraceCheckUtils]: 80: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,349 INFO L273 TraceCheckUtils]: 81: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,350 INFO L273 TraceCheckUtils]: 82: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,350 INFO L273 TraceCheckUtils]: 83: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,350 INFO L273 TraceCheckUtils]: 84: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,350 INFO L273 TraceCheckUtils]: 85: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,350 INFO L273 TraceCheckUtils]: 86: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,350 INFO L273 TraceCheckUtils]: 87: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,351 INFO L273 TraceCheckUtils]: 88: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,351 INFO L273 TraceCheckUtils]: 89: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,351 INFO L273 TraceCheckUtils]: 90: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,351 INFO L273 TraceCheckUtils]: 91: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,351 INFO L273 TraceCheckUtils]: 92: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,351 INFO L273 TraceCheckUtils]: 93: Hoare triple {24956#true} assume !(~i~0 < 100000); {24956#true} is VALID [2018-11-23 12:28:42,352 INFO L273 TraceCheckUtils]: 94: Hoare triple {24956#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {24956#true} is VALID [2018-11-23 12:28:42,352 INFO L273 TraceCheckUtils]: 95: Hoare triple {24956#true} assume true; {24956#true} is VALID [2018-11-23 12:28:42,352 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24956#true} {24957#false} #70#return; {24957#false} is VALID [2018-11-23 12:28:42,352 INFO L273 TraceCheckUtils]: 97: Hoare triple {24957#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); {24957#false} is VALID [2018-11-23 12:28:42,352 INFO L256 TraceCheckUtils]: 98: Hoare triple {24957#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {24956#true} is VALID [2018-11-23 12:28:42,352 INFO L273 TraceCheckUtils]: 99: Hoare triple {24956#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24956#true} is VALID [2018-11-23 12:28:42,353 INFO L273 TraceCheckUtils]: 100: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,353 INFO L273 TraceCheckUtils]: 101: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,353 INFO L273 TraceCheckUtils]: 102: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,353 INFO L273 TraceCheckUtils]: 103: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,353 INFO L273 TraceCheckUtils]: 104: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,353 INFO L273 TraceCheckUtils]: 105: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,353 INFO L273 TraceCheckUtils]: 106: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,353 INFO L273 TraceCheckUtils]: 107: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,353 INFO L273 TraceCheckUtils]: 108: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,353 INFO L273 TraceCheckUtils]: 109: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,354 INFO L273 TraceCheckUtils]: 110: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,354 INFO L273 TraceCheckUtils]: 111: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,354 INFO L273 TraceCheckUtils]: 112: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,354 INFO L273 TraceCheckUtils]: 113: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,354 INFO L273 TraceCheckUtils]: 114: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,354 INFO L273 TraceCheckUtils]: 115: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,354 INFO L273 TraceCheckUtils]: 116: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,354 INFO L273 TraceCheckUtils]: 117: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,354 INFO L273 TraceCheckUtils]: 118: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,354 INFO L273 TraceCheckUtils]: 119: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,355 INFO L273 TraceCheckUtils]: 120: Hoare triple {24956#true} assume !(~i~0 < 100000); {24956#true} is VALID [2018-11-23 12:28:42,355 INFO L273 TraceCheckUtils]: 121: Hoare triple {24956#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {24956#true} is VALID [2018-11-23 12:28:42,355 INFO L273 TraceCheckUtils]: 122: Hoare triple {24956#true} assume true; {24956#true} is VALID [2018-11-23 12:28:42,355 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24956#true} {24957#false} #72#return; {24957#false} is VALID [2018-11-23 12:28:42,355 INFO L273 TraceCheckUtils]: 124: Hoare triple {24957#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; {24957#false} is VALID [2018-11-23 12:28:42,355 INFO L273 TraceCheckUtils]: 125: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,355 INFO L273 TraceCheckUtils]: 126: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,355 INFO L273 TraceCheckUtils]: 127: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,355 INFO L273 TraceCheckUtils]: 128: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,356 INFO L273 TraceCheckUtils]: 129: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,356 INFO L273 TraceCheckUtils]: 130: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,356 INFO L273 TraceCheckUtils]: 131: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,356 INFO L273 TraceCheckUtils]: 132: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,356 INFO L273 TraceCheckUtils]: 133: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,356 INFO L273 TraceCheckUtils]: 134: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,356 INFO L273 TraceCheckUtils]: 135: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,356 INFO L273 TraceCheckUtils]: 136: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,356 INFO L273 TraceCheckUtils]: 137: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,356 INFO L273 TraceCheckUtils]: 138: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,357 INFO L273 TraceCheckUtils]: 139: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,357 INFO L273 TraceCheckUtils]: 140: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,357 INFO L273 TraceCheckUtils]: 141: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,357 INFO L273 TraceCheckUtils]: 142: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,357 INFO L273 TraceCheckUtils]: 143: Hoare triple {24957#false} assume !(~i~2 < 99999); {24957#false} is VALID [2018-11-23 12:28:42,357 INFO L273 TraceCheckUtils]: 144: Hoare triple {24957#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {24957#false} is VALID [2018-11-23 12:28:42,357 INFO L256 TraceCheckUtils]: 145: Hoare triple {24957#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {24956#true} is VALID [2018-11-23 12:28:42,357 INFO L273 TraceCheckUtils]: 146: Hoare triple {24956#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24956#true} is VALID [2018-11-23 12:28:42,357 INFO L273 TraceCheckUtils]: 147: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,357 INFO L273 TraceCheckUtils]: 148: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,358 INFO L273 TraceCheckUtils]: 149: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,358 INFO L273 TraceCheckUtils]: 150: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,358 INFO L273 TraceCheckUtils]: 151: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,358 INFO L273 TraceCheckUtils]: 152: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,358 INFO L273 TraceCheckUtils]: 153: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,358 INFO L273 TraceCheckUtils]: 154: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,358 INFO L273 TraceCheckUtils]: 155: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,358 INFO L273 TraceCheckUtils]: 156: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,358 INFO L273 TraceCheckUtils]: 157: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,358 INFO L273 TraceCheckUtils]: 158: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,359 INFO L273 TraceCheckUtils]: 159: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,359 INFO L273 TraceCheckUtils]: 160: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,359 INFO L273 TraceCheckUtils]: 161: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,359 INFO L273 TraceCheckUtils]: 162: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,359 INFO L273 TraceCheckUtils]: 163: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,359 INFO L273 TraceCheckUtils]: 164: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,359 INFO L273 TraceCheckUtils]: 165: Hoare triple {24956#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24956#true} is VALID [2018-11-23 12:28:42,359 INFO L273 TraceCheckUtils]: 166: Hoare triple {24956#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#true} is VALID [2018-11-23 12:28:42,359 INFO L273 TraceCheckUtils]: 167: Hoare triple {24956#true} assume !(~i~0 < 100000); {24956#true} is VALID [2018-11-23 12:28:42,360 INFO L273 TraceCheckUtils]: 168: Hoare triple {24956#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {24956#true} is VALID [2018-11-23 12:28:42,360 INFO L273 TraceCheckUtils]: 169: Hoare triple {24956#true} assume true; {24956#true} is VALID [2018-11-23 12:28:42,360 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24956#true} {24957#false} #74#return; {24957#false} is VALID [2018-11-23 12:28:42,360 INFO L273 TraceCheckUtils]: 171: Hoare triple {24957#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {24957#false} is VALID [2018-11-23 12:28:42,360 INFO L273 TraceCheckUtils]: 172: Hoare triple {24957#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {24957#false} is VALID [2018-11-23 12:28:42,360 INFO L273 TraceCheckUtils]: 173: Hoare triple {24957#false} assume !false; {24957#false} is VALID [2018-11-23 12:28:42,374 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:42,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:42,374 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:42,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:42,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:42,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:42,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:42,821 INFO L256 TraceCheckUtils]: 0: Hoare triple {24956#true} call ULTIMATE.init(); {24956#true} is VALID [2018-11-23 12:28:42,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {24956#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24956#true} is VALID [2018-11-23 12:28:42,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {24956#true} assume true; {24956#true} is VALID [2018-11-23 12:28:42,822 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24956#true} {24956#true} #66#return; {24956#true} is VALID [2018-11-23 12:28:42,822 INFO L256 TraceCheckUtils]: 4: Hoare triple {24956#true} call #t~ret12 := main(); {24956#true} is VALID [2018-11-23 12:28:42,823 INFO L273 TraceCheckUtils]: 5: Hoare triple {24956#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {25009#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:42,823 INFO L273 TraceCheckUtils]: 6: Hoare triple {25009#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25009#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:42,824 INFO L273 TraceCheckUtils]: 7: Hoare triple {25009#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24959#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:42,824 INFO L273 TraceCheckUtils]: 8: Hoare triple {24959#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24959#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:42,825 INFO L273 TraceCheckUtils]: 9: Hoare triple {24959#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24960#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:42,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {24960#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24960#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:42,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {24960#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24961#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:42,827 INFO L273 TraceCheckUtils]: 12: Hoare triple {24961#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24961#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:42,828 INFO L273 TraceCheckUtils]: 13: Hoare triple {24961#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24962#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:42,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {24962#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24962#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:42,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {24962#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24963#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:42,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {24963#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24963#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:42,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {24963#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24964#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:42,831 INFO L273 TraceCheckUtils]: 18: Hoare triple {24964#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24964#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:42,831 INFO L273 TraceCheckUtils]: 19: Hoare triple {24964#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24965#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:42,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {24965#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24965#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:42,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {24965#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24966#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:42,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {24966#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24966#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:42,834 INFO L273 TraceCheckUtils]: 23: Hoare triple {24966#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24967#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:42,834 INFO L273 TraceCheckUtils]: 24: Hoare triple {24967#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24967#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:42,835 INFO L273 TraceCheckUtils]: 25: Hoare triple {24967#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24968#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:42,836 INFO L273 TraceCheckUtils]: 26: Hoare triple {24968#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24968#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:42,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {24968#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24969#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:42,837 INFO L273 TraceCheckUtils]: 28: Hoare triple {24969#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24969#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:42,837 INFO L273 TraceCheckUtils]: 29: Hoare triple {24969#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24970#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:42,838 INFO L273 TraceCheckUtils]: 30: Hoare triple {24970#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:42,839 INFO L273 TraceCheckUtils]: 31: Hoare triple {24970#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24971#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:42,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {24971#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:42,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {24971#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24972#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:42,841 INFO L273 TraceCheckUtils]: 34: Hoare triple {24972#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:42,841 INFO L273 TraceCheckUtils]: 35: Hoare triple {24972#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24973#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:42,842 INFO L273 TraceCheckUtils]: 36: Hoare triple {24973#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:42,842 INFO L273 TraceCheckUtils]: 37: Hoare triple {24973#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24974#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:42,843 INFO L273 TraceCheckUtils]: 38: Hoare triple {24974#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:42,844 INFO L273 TraceCheckUtils]: 39: Hoare triple {24974#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24975#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:42,844 INFO L273 TraceCheckUtils]: 40: Hoare triple {24975#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:42,845 INFO L273 TraceCheckUtils]: 41: Hoare triple {24975#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24976#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:42,845 INFO L273 TraceCheckUtils]: 42: Hoare triple {24976#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:42,846 INFO L273 TraceCheckUtils]: 43: Hoare triple {24976#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24977#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:42,847 INFO L273 TraceCheckUtils]: 44: Hoare triple {24977#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:42,847 INFO L273 TraceCheckUtils]: 45: Hoare triple {24977#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24978#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:42,848 INFO L273 TraceCheckUtils]: 46: Hoare triple {24978#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:42,849 INFO L273 TraceCheckUtils]: 47: Hoare triple {24978#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24979#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:42,849 INFO L273 TraceCheckUtils]: 48: Hoare triple {24979#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:42,850 INFO L273 TraceCheckUtils]: 49: Hoare triple {24979#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24980#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:42,850 INFO L273 TraceCheckUtils]: 50: Hoare triple {24980#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:42,851 INFO L273 TraceCheckUtils]: 51: Hoare triple {24980#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24981#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:42,852 INFO L273 TraceCheckUtils]: 52: Hoare triple {24981#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:42,852 INFO L273 TraceCheckUtils]: 53: Hoare triple {24981#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24982#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:42,853 INFO L273 TraceCheckUtils]: 54: Hoare triple {24982#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:28:42,854 INFO L273 TraceCheckUtils]: 55: Hoare triple {24982#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24983#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:42,854 INFO L273 TraceCheckUtils]: 56: Hoare triple {24983#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -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 25)} is VALID [2018-11-23 12:28:42,855 INFO L273 TraceCheckUtils]: 57: Hoare triple {24983#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24984#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:42,855 INFO L273 TraceCheckUtils]: 58: Hoare triple {24984#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -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 26)} is VALID [2018-11-23 12:28:42,856 INFO L273 TraceCheckUtils]: 59: Hoare triple {24984#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24985#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:42,857 INFO L273 TraceCheckUtils]: 60: Hoare triple {24985#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -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 27)} is VALID [2018-11-23 12:28:42,857 INFO L273 TraceCheckUtils]: 61: Hoare triple {24985#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24986#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:42,858 INFO L273 TraceCheckUtils]: 62: Hoare triple {24986#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -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 28)} is VALID [2018-11-23 12:28:42,859 INFO L273 TraceCheckUtils]: 63: Hoare triple {24986#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24987#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:42,859 INFO L273 TraceCheckUtils]: 64: Hoare triple {24987#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -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 29)} is VALID [2018-11-23 12:28:42,860 INFO L273 TraceCheckUtils]: 65: Hoare triple {24987#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24988#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:42,860 INFO L273 TraceCheckUtils]: 66: Hoare triple {24988#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -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 30)} is VALID [2018-11-23 12:28:42,861 INFO L273 TraceCheckUtils]: 67: Hoare triple {24988#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24989#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:42,861 INFO L273 TraceCheckUtils]: 68: Hoare triple {24989#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -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 31)} is VALID [2018-11-23 12:28:42,862 INFO L273 TraceCheckUtils]: 69: Hoare triple {24989#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24990#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:42,863 INFO L273 TraceCheckUtils]: 70: Hoare triple {24990#(<= main_~i~1 32)} assume !(~i~1 < 100000); {24957#false} is VALID [2018-11-23 12:28:42,863 INFO L256 TraceCheckUtils]: 71: Hoare triple {24957#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {24957#false} is VALID [2018-11-23 12:28:42,863 INFO L273 TraceCheckUtils]: 72: Hoare triple {24957#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24957#false} is VALID [2018-11-23 12:28:42,863 INFO L273 TraceCheckUtils]: 73: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,864 INFO L273 TraceCheckUtils]: 74: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,864 INFO L273 TraceCheckUtils]: 75: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,864 INFO L273 TraceCheckUtils]: 76: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,864 INFO L273 TraceCheckUtils]: 77: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,864 INFO L273 TraceCheckUtils]: 78: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,865 INFO L273 TraceCheckUtils]: 79: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,865 INFO L273 TraceCheckUtils]: 80: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,865 INFO L273 TraceCheckUtils]: 81: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,865 INFO L273 TraceCheckUtils]: 82: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,865 INFO L273 TraceCheckUtils]: 83: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,865 INFO L273 TraceCheckUtils]: 84: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,865 INFO L273 TraceCheckUtils]: 85: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,866 INFO L273 TraceCheckUtils]: 86: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,866 INFO L273 TraceCheckUtils]: 87: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,866 INFO L273 TraceCheckUtils]: 88: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,866 INFO L273 TraceCheckUtils]: 89: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,866 INFO L273 TraceCheckUtils]: 90: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,866 INFO L273 TraceCheckUtils]: 91: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,866 INFO L273 TraceCheckUtils]: 92: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,866 INFO L273 TraceCheckUtils]: 93: Hoare triple {24957#false} assume !(~i~0 < 100000); {24957#false} is VALID [2018-11-23 12:28:42,866 INFO L273 TraceCheckUtils]: 94: Hoare triple {24957#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {24957#false} is VALID [2018-11-23 12:28:42,866 INFO L273 TraceCheckUtils]: 95: Hoare triple {24957#false} assume true; {24957#false} is VALID [2018-11-23 12:28:42,867 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24957#false} {24957#false} #70#return; {24957#false} is VALID [2018-11-23 12:28:42,867 INFO L273 TraceCheckUtils]: 97: Hoare triple {24957#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); {24957#false} is VALID [2018-11-23 12:28:42,867 INFO L256 TraceCheckUtils]: 98: Hoare triple {24957#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {24957#false} is VALID [2018-11-23 12:28:42,867 INFO L273 TraceCheckUtils]: 99: Hoare triple {24957#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24957#false} is VALID [2018-11-23 12:28:42,867 INFO L273 TraceCheckUtils]: 100: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,867 INFO L273 TraceCheckUtils]: 101: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,867 INFO L273 TraceCheckUtils]: 102: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,867 INFO L273 TraceCheckUtils]: 103: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,867 INFO L273 TraceCheckUtils]: 104: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,867 INFO L273 TraceCheckUtils]: 105: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,868 INFO L273 TraceCheckUtils]: 106: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,868 INFO L273 TraceCheckUtils]: 107: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,868 INFO L273 TraceCheckUtils]: 108: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,868 INFO L273 TraceCheckUtils]: 109: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,868 INFO L273 TraceCheckUtils]: 110: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,868 INFO L273 TraceCheckUtils]: 111: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,868 INFO L273 TraceCheckUtils]: 112: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,868 INFO L273 TraceCheckUtils]: 113: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,868 INFO L273 TraceCheckUtils]: 114: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,869 INFO L273 TraceCheckUtils]: 115: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,869 INFO L273 TraceCheckUtils]: 116: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,869 INFO L273 TraceCheckUtils]: 117: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,869 INFO L273 TraceCheckUtils]: 118: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,869 INFO L273 TraceCheckUtils]: 119: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,869 INFO L273 TraceCheckUtils]: 120: Hoare triple {24957#false} assume !(~i~0 < 100000); {24957#false} is VALID [2018-11-23 12:28:42,869 INFO L273 TraceCheckUtils]: 121: Hoare triple {24957#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {24957#false} is VALID [2018-11-23 12:28:42,869 INFO L273 TraceCheckUtils]: 122: Hoare triple {24957#false} assume true; {24957#false} is VALID [2018-11-23 12:28:42,869 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24957#false} {24957#false} #72#return; {24957#false} is VALID [2018-11-23 12:28:42,869 INFO L273 TraceCheckUtils]: 124: Hoare triple {24957#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; {24957#false} is VALID [2018-11-23 12:28:42,870 INFO L273 TraceCheckUtils]: 125: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,870 INFO L273 TraceCheckUtils]: 126: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,870 INFO L273 TraceCheckUtils]: 127: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,870 INFO L273 TraceCheckUtils]: 128: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,870 INFO L273 TraceCheckUtils]: 129: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,870 INFO L273 TraceCheckUtils]: 130: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,870 INFO L273 TraceCheckUtils]: 131: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,870 INFO L273 TraceCheckUtils]: 132: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,870 INFO L273 TraceCheckUtils]: 133: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,870 INFO L273 TraceCheckUtils]: 134: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,871 INFO L273 TraceCheckUtils]: 135: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,871 INFO L273 TraceCheckUtils]: 136: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,871 INFO L273 TraceCheckUtils]: 137: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,871 INFO L273 TraceCheckUtils]: 138: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,871 INFO L273 TraceCheckUtils]: 139: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,871 INFO L273 TraceCheckUtils]: 140: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,871 INFO L273 TraceCheckUtils]: 141: Hoare triple {24957#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24957#false} is VALID [2018-11-23 12:28:42,871 INFO L273 TraceCheckUtils]: 142: Hoare triple {24957#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24957#false} is VALID [2018-11-23 12:28:42,871 INFO L273 TraceCheckUtils]: 143: Hoare triple {24957#false} assume !(~i~2 < 99999); {24957#false} is VALID [2018-11-23 12:28:42,871 INFO L273 TraceCheckUtils]: 144: Hoare triple {24957#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {24957#false} is VALID [2018-11-23 12:28:42,872 INFO L256 TraceCheckUtils]: 145: Hoare triple {24957#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {24957#false} is VALID [2018-11-23 12:28:42,872 INFO L273 TraceCheckUtils]: 146: Hoare triple {24957#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24957#false} is VALID [2018-11-23 12:28:42,872 INFO L273 TraceCheckUtils]: 147: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,872 INFO L273 TraceCheckUtils]: 148: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,872 INFO L273 TraceCheckUtils]: 149: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,872 INFO L273 TraceCheckUtils]: 150: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,872 INFO L273 TraceCheckUtils]: 151: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,872 INFO L273 TraceCheckUtils]: 152: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,872 INFO L273 TraceCheckUtils]: 153: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,873 INFO L273 TraceCheckUtils]: 154: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,873 INFO L273 TraceCheckUtils]: 155: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,873 INFO L273 TraceCheckUtils]: 156: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,873 INFO L273 TraceCheckUtils]: 157: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,873 INFO L273 TraceCheckUtils]: 158: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,873 INFO L273 TraceCheckUtils]: 159: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,873 INFO L273 TraceCheckUtils]: 160: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,873 INFO L273 TraceCheckUtils]: 161: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,873 INFO L273 TraceCheckUtils]: 162: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,873 INFO L273 TraceCheckUtils]: 163: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,874 INFO L273 TraceCheckUtils]: 164: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,874 INFO L273 TraceCheckUtils]: 165: Hoare triple {24957#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24957#false} is VALID [2018-11-23 12:28:42,874 INFO L273 TraceCheckUtils]: 166: Hoare triple {24957#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#false} is VALID [2018-11-23 12:28:42,874 INFO L273 TraceCheckUtils]: 167: Hoare triple {24957#false} assume !(~i~0 < 100000); {24957#false} is VALID [2018-11-23 12:28:42,874 INFO L273 TraceCheckUtils]: 168: Hoare triple {24957#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {24957#false} is VALID [2018-11-23 12:28:42,874 INFO L273 TraceCheckUtils]: 169: Hoare triple {24957#false} assume true; {24957#false} is VALID [2018-11-23 12:28:42,874 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24957#false} {24957#false} #74#return; {24957#false} is VALID [2018-11-23 12:28:42,874 INFO L273 TraceCheckUtils]: 171: Hoare triple {24957#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {24957#false} is VALID [2018-11-23 12:28:42,874 INFO L273 TraceCheckUtils]: 172: Hoare triple {24957#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {24957#false} is VALID [2018-11-23 12:28:42,874 INFO L273 TraceCheckUtils]: 173: Hoare triple {24957#false} assume !false; {24957#false} is VALID [2018-11-23 12:28:42,888 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:42,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:42,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:28:42,908 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:28:42,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:42,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:28:43,015 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,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:28:43,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:28:43,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:28:43,017 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2018-11-23 12:28:43,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:43,961 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2018-11-23 12:28:43,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:28:43,962 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:28:43,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:43,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:28:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:28:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:28:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:28:43,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 118 transitions. [2018-11-23 12:28:44,080 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:44,083 INFO L225 Difference]: With dead ends: 182 [2018-11-23 12:28:44,084 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:28:44,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:28:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:28:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-11-23 12:28:44,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:44,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 127 states. [2018-11-23 12:28:44,186 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 127 states. [2018-11-23 12:28:44,186 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 127 states. [2018-11-23 12:28:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:44,188 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:28:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:28:44,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:44,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:44,188 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 128 states. [2018-11-23 12:28:44,188 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 128 states. [2018-11-23 12:28:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:44,190 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:28:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:28:44,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:44,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:44,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:44,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 12:28:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-11-23 12:28:44,193 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2018-11-23 12:28:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:44,194 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-11-23 12:28:44,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:28:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:28:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-23 12:28:44,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:44,195 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:44,195 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:44,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:44,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2135919753, now seen corresponding path program 33 times [2018-11-23 12:28:44,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:44,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:44,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:44,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:44,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:45,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {26229#true} call ULTIMATE.init(); {26229#true} is VALID [2018-11-23 12:28:45,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {26229#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26229#true} is VALID [2018-11-23 12:28:45,531 INFO L273 TraceCheckUtils]: 2: Hoare triple {26229#true} assume true; {26229#true} is VALID [2018-11-23 12:28:45,531 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26229#true} {26229#true} #66#return; {26229#true} is VALID [2018-11-23 12:28:45,531 INFO L256 TraceCheckUtils]: 4: Hoare triple {26229#true} call #t~ret12 := main(); {26229#true} is VALID [2018-11-23 12:28:45,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {26229#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26231#(= main_~i~1 0)} is VALID [2018-11-23 12:28:45,532 INFO L273 TraceCheckUtils]: 6: Hoare triple {26231#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26231#(= main_~i~1 0)} is VALID [2018-11-23 12:28:45,533 INFO L273 TraceCheckUtils]: 7: Hoare triple {26231#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26232#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:45,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {26232#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26232#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:45,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {26232#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26233#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:45,535 INFO L273 TraceCheckUtils]: 10: Hoare triple {26233#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26233#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:45,536 INFO L273 TraceCheckUtils]: 11: Hoare triple {26233#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26234#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:45,536 INFO L273 TraceCheckUtils]: 12: Hoare triple {26234#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26234#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:45,537 INFO L273 TraceCheckUtils]: 13: Hoare triple {26234#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26235#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:45,538 INFO L273 TraceCheckUtils]: 14: Hoare triple {26235#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26235#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:45,538 INFO L273 TraceCheckUtils]: 15: Hoare triple {26235#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26236#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:45,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {26236#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26236#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:45,539 INFO L273 TraceCheckUtils]: 17: Hoare triple {26236#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26237#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:45,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {26237#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26237#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:45,541 INFO L273 TraceCheckUtils]: 19: Hoare triple {26237#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26238#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:45,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {26238#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26238#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:45,542 INFO L273 TraceCheckUtils]: 21: Hoare triple {26238#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26239#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:45,542 INFO L273 TraceCheckUtils]: 22: Hoare triple {26239#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26239#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:45,543 INFO L273 TraceCheckUtils]: 23: Hoare triple {26239#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26240#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:45,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {26240#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26240#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:45,544 INFO L273 TraceCheckUtils]: 25: Hoare triple {26240#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:45,545 INFO L273 TraceCheckUtils]: 26: Hoare triple {26241#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:45,546 INFO L273 TraceCheckUtils]: 27: Hoare triple {26241#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26242#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:45,546 INFO L273 TraceCheckUtils]: 28: Hoare triple {26242#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26242#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:45,547 INFO L273 TraceCheckUtils]: 29: Hoare triple {26242#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26243#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:45,547 INFO L273 TraceCheckUtils]: 30: Hoare triple {26243#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:45,548 INFO L273 TraceCheckUtils]: 31: Hoare triple {26243#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26244#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:45,549 INFO L273 TraceCheckUtils]: 32: Hoare triple {26244#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:45,549 INFO L273 TraceCheckUtils]: 33: Hoare triple {26244#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26245#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:45,550 INFO L273 TraceCheckUtils]: 34: Hoare triple {26245#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:45,551 INFO L273 TraceCheckUtils]: 35: Hoare triple {26245#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26246#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:45,551 INFO L273 TraceCheckUtils]: 36: Hoare triple {26246#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:45,552 INFO L273 TraceCheckUtils]: 37: Hoare triple {26246#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26247#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:45,552 INFO L273 TraceCheckUtils]: 38: Hoare triple {26247#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:45,553 INFO L273 TraceCheckUtils]: 39: Hoare triple {26247#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26248#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:45,554 INFO L273 TraceCheckUtils]: 40: Hoare triple {26248#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:45,554 INFO L273 TraceCheckUtils]: 41: Hoare triple {26248#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26249#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:45,555 INFO L273 TraceCheckUtils]: 42: Hoare triple {26249#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:45,556 INFO L273 TraceCheckUtils]: 43: Hoare triple {26249#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26250#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:45,556 INFO L273 TraceCheckUtils]: 44: Hoare triple {26250#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:45,557 INFO L273 TraceCheckUtils]: 45: Hoare triple {26250#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26251#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:45,557 INFO L273 TraceCheckUtils]: 46: Hoare triple {26251#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:45,558 INFO L273 TraceCheckUtils]: 47: Hoare triple {26251#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26252#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:45,559 INFO L273 TraceCheckUtils]: 48: Hoare triple {26252#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:45,559 INFO L273 TraceCheckUtils]: 49: Hoare triple {26252#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26253#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:45,560 INFO L273 TraceCheckUtils]: 50: Hoare triple {26253#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:45,561 INFO L273 TraceCheckUtils]: 51: Hoare triple {26253#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26254#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:45,561 INFO L273 TraceCheckUtils]: 52: Hoare triple {26254#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:45,562 INFO L273 TraceCheckUtils]: 53: Hoare triple {26254#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26255#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:45,562 INFO L273 TraceCheckUtils]: 54: Hoare triple {26255#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:28:45,563 INFO L273 TraceCheckUtils]: 55: Hoare triple {26255#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26256#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:45,564 INFO L273 TraceCheckUtils]: 56: Hoare triple {26256#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -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 25)} is VALID [2018-11-23 12:28:45,564 INFO L273 TraceCheckUtils]: 57: Hoare triple {26256#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26257#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:45,565 INFO L273 TraceCheckUtils]: 58: Hoare triple {26257#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -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 26)} is VALID [2018-11-23 12:28:45,565 INFO L273 TraceCheckUtils]: 59: Hoare triple {26257#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26258#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:45,566 INFO L273 TraceCheckUtils]: 60: Hoare triple {26258#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -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 27)} is VALID [2018-11-23 12:28:45,567 INFO L273 TraceCheckUtils]: 61: Hoare triple {26258#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26259#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:45,567 INFO L273 TraceCheckUtils]: 62: Hoare triple {26259#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -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 28)} is VALID [2018-11-23 12:28:45,568 INFO L273 TraceCheckUtils]: 63: Hoare triple {26259#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26260#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:45,568 INFO L273 TraceCheckUtils]: 64: Hoare triple {26260#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -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 29)} is VALID [2018-11-23 12:28:45,569 INFO L273 TraceCheckUtils]: 65: Hoare triple {26260#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26261#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:45,570 INFO L273 TraceCheckUtils]: 66: Hoare triple {26261#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -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 30)} is VALID [2018-11-23 12:28:45,570 INFO L273 TraceCheckUtils]: 67: Hoare triple {26261#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26262#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:45,571 INFO L273 TraceCheckUtils]: 68: Hoare triple {26262#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -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 31)} is VALID [2018-11-23 12:28:45,572 INFO L273 TraceCheckUtils]: 69: Hoare triple {26262#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26263#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:45,572 INFO L273 TraceCheckUtils]: 70: Hoare triple {26263#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -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 32)} is VALID [2018-11-23 12:28:45,573 INFO L273 TraceCheckUtils]: 71: Hoare triple {26263#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26264#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:45,573 INFO L273 TraceCheckUtils]: 72: Hoare triple {26264#(<= main_~i~1 33)} assume !(~i~1 < 100000); {26230#false} is VALID [2018-11-23 12:28:45,574 INFO L256 TraceCheckUtils]: 73: Hoare triple {26230#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {26229#true} is VALID [2018-11-23 12:28:45,574 INFO L273 TraceCheckUtils]: 74: Hoare triple {26229#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26229#true} is VALID [2018-11-23 12:28:45,574 INFO L273 TraceCheckUtils]: 75: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,574 INFO L273 TraceCheckUtils]: 76: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,574 INFO L273 TraceCheckUtils]: 77: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,574 INFO L273 TraceCheckUtils]: 78: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,575 INFO L273 TraceCheckUtils]: 79: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,575 INFO L273 TraceCheckUtils]: 80: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,575 INFO L273 TraceCheckUtils]: 81: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,575 INFO L273 TraceCheckUtils]: 82: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,575 INFO L273 TraceCheckUtils]: 83: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,576 INFO L273 TraceCheckUtils]: 84: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,576 INFO L273 TraceCheckUtils]: 85: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,576 INFO L273 TraceCheckUtils]: 86: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,576 INFO L273 TraceCheckUtils]: 87: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,576 INFO L273 TraceCheckUtils]: 88: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,576 INFO L273 TraceCheckUtils]: 89: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,577 INFO L273 TraceCheckUtils]: 90: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,577 INFO L273 TraceCheckUtils]: 91: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,577 INFO L273 TraceCheckUtils]: 92: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,577 INFO L273 TraceCheckUtils]: 93: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,577 INFO L273 TraceCheckUtils]: 94: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,577 INFO L273 TraceCheckUtils]: 95: Hoare triple {26229#true} assume !(~i~0 < 100000); {26229#true} is VALID [2018-11-23 12:28:45,578 INFO L273 TraceCheckUtils]: 96: Hoare triple {26229#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {26229#true} is VALID [2018-11-23 12:28:45,578 INFO L273 TraceCheckUtils]: 97: Hoare triple {26229#true} assume true; {26229#true} is VALID [2018-11-23 12:28:45,578 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26229#true} {26230#false} #70#return; {26230#false} is VALID [2018-11-23 12:28:45,578 INFO L273 TraceCheckUtils]: 99: Hoare triple {26230#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); {26230#false} is VALID [2018-11-23 12:28:45,578 INFO L256 TraceCheckUtils]: 100: Hoare triple {26230#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {26229#true} is VALID [2018-11-23 12:28:45,579 INFO L273 TraceCheckUtils]: 101: Hoare triple {26229#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26229#true} is VALID [2018-11-23 12:28:45,579 INFO L273 TraceCheckUtils]: 102: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,579 INFO L273 TraceCheckUtils]: 103: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,579 INFO L273 TraceCheckUtils]: 104: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,579 INFO L273 TraceCheckUtils]: 105: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,579 INFO L273 TraceCheckUtils]: 106: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,579 INFO L273 TraceCheckUtils]: 107: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,579 INFO L273 TraceCheckUtils]: 108: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,579 INFO L273 TraceCheckUtils]: 109: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,579 INFO L273 TraceCheckUtils]: 110: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,580 INFO L273 TraceCheckUtils]: 111: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,580 INFO L273 TraceCheckUtils]: 112: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,580 INFO L273 TraceCheckUtils]: 113: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,580 INFO L273 TraceCheckUtils]: 114: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,580 INFO L273 TraceCheckUtils]: 115: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,580 INFO L273 TraceCheckUtils]: 116: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,580 INFO L273 TraceCheckUtils]: 117: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,580 INFO L273 TraceCheckUtils]: 118: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,580 INFO L273 TraceCheckUtils]: 119: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,580 INFO L273 TraceCheckUtils]: 120: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,581 INFO L273 TraceCheckUtils]: 121: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,581 INFO L273 TraceCheckUtils]: 122: Hoare triple {26229#true} assume !(~i~0 < 100000); {26229#true} is VALID [2018-11-23 12:28:45,581 INFO L273 TraceCheckUtils]: 123: Hoare triple {26229#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {26229#true} is VALID [2018-11-23 12:28:45,581 INFO L273 TraceCheckUtils]: 124: Hoare triple {26229#true} assume true; {26229#true} is VALID [2018-11-23 12:28:45,581 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26229#true} {26230#false} #72#return; {26230#false} is VALID [2018-11-23 12:28:45,581 INFO L273 TraceCheckUtils]: 126: Hoare triple {26230#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; {26230#false} is VALID [2018-11-23 12:28:45,581 INFO L273 TraceCheckUtils]: 127: Hoare triple {26230#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26230#false} is VALID [2018-11-23 12:28:45,581 INFO L273 TraceCheckUtils]: 128: Hoare triple {26230#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26230#false} is VALID [2018-11-23 12:28:45,581 INFO L273 TraceCheckUtils]: 129: Hoare triple {26230#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26230#false} is VALID [2018-11-23 12:28:45,582 INFO L273 TraceCheckUtils]: 130: Hoare triple {26230#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26230#false} is VALID [2018-11-23 12:28:45,582 INFO L273 TraceCheckUtils]: 131: Hoare triple {26230#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26230#false} is VALID [2018-11-23 12:28:45,582 INFO L273 TraceCheckUtils]: 132: Hoare triple {26230#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26230#false} is VALID [2018-11-23 12:28:45,582 INFO L273 TraceCheckUtils]: 133: Hoare triple {26230#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26230#false} is VALID [2018-11-23 12:28:45,582 INFO L273 TraceCheckUtils]: 134: Hoare triple {26230#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26230#false} is VALID [2018-11-23 12:28:45,582 INFO L273 TraceCheckUtils]: 135: Hoare triple {26230#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26230#false} is VALID [2018-11-23 12:28:45,582 INFO L273 TraceCheckUtils]: 136: Hoare triple {26230#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26230#false} is VALID [2018-11-23 12:28:45,582 INFO L273 TraceCheckUtils]: 137: Hoare triple {26230#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26230#false} is VALID [2018-11-23 12:28:45,582 INFO L273 TraceCheckUtils]: 138: Hoare triple {26230#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26230#false} is VALID [2018-11-23 12:28:45,582 INFO L273 TraceCheckUtils]: 139: Hoare triple {26230#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26230#false} is VALID [2018-11-23 12:28:45,583 INFO L273 TraceCheckUtils]: 140: Hoare triple {26230#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26230#false} is VALID [2018-11-23 12:28:45,583 INFO L273 TraceCheckUtils]: 141: Hoare triple {26230#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26230#false} is VALID [2018-11-23 12:28:45,583 INFO L273 TraceCheckUtils]: 142: Hoare triple {26230#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26230#false} is VALID [2018-11-23 12:28:45,583 INFO L273 TraceCheckUtils]: 143: Hoare triple {26230#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26230#false} is VALID [2018-11-23 12:28:45,583 INFO L273 TraceCheckUtils]: 144: Hoare triple {26230#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26230#false} is VALID [2018-11-23 12:28:45,583 INFO L273 TraceCheckUtils]: 145: Hoare triple {26230#false} assume !(~i~2 < 99999); {26230#false} is VALID [2018-11-23 12:28:45,583 INFO L273 TraceCheckUtils]: 146: Hoare triple {26230#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {26230#false} is VALID [2018-11-23 12:28:45,583 INFO L256 TraceCheckUtils]: 147: Hoare triple {26230#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {26229#true} is VALID [2018-11-23 12:28:45,583 INFO L273 TraceCheckUtils]: 148: Hoare triple {26229#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26229#true} is VALID [2018-11-23 12:28:45,583 INFO L273 TraceCheckUtils]: 149: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,584 INFO L273 TraceCheckUtils]: 150: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,584 INFO L273 TraceCheckUtils]: 151: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,584 INFO L273 TraceCheckUtils]: 152: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,584 INFO L273 TraceCheckUtils]: 153: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,584 INFO L273 TraceCheckUtils]: 154: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,584 INFO L273 TraceCheckUtils]: 155: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,584 INFO L273 TraceCheckUtils]: 156: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,584 INFO L273 TraceCheckUtils]: 157: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,584 INFO L273 TraceCheckUtils]: 158: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,585 INFO L273 TraceCheckUtils]: 159: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,585 INFO L273 TraceCheckUtils]: 160: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,585 INFO L273 TraceCheckUtils]: 161: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,585 INFO L273 TraceCheckUtils]: 162: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,585 INFO L273 TraceCheckUtils]: 163: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,585 INFO L273 TraceCheckUtils]: 164: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,585 INFO L273 TraceCheckUtils]: 165: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,585 INFO L273 TraceCheckUtils]: 166: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,585 INFO L273 TraceCheckUtils]: 167: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:45,585 INFO L273 TraceCheckUtils]: 168: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:45,586 INFO L273 TraceCheckUtils]: 169: Hoare triple {26229#true} assume !(~i~0 < 100000); {26229#true} is VALID [2018-11-23 12:28:45,586 INFO L273 TraceCheckUtils]: 170: Hoare triple {26229#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {26229#true} is VALID [2018-11-23 12:28:45,586 INFO L273 TraceCheckUtils]: 171: Hoare triple {26229#true} assume true; {26229#true} is VALID [2018-11-23 12:28:45,586 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26229#true} {26230#false} #74#return; {26230#false} is VALID [2018-11-23 12:28:45,586 INFO L273 TraceCheckUtils]: 173: Hoare triple {26230#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {26230#false} is VALID [2018-11-23 12:28:45,586 INFO L273 TraceCheckUtils]: 174: Hoare triple {26230#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {26230#false} is VALID [2018-11-23 12:28:45,586 INFO L273 TraceCheckUtils]: 175: Hoare triple {26230#false} assume !false; {26230#false} is VALID [2018-11-23 12:28:45,601 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:45,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:45,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:45,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:45,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 12:28:45,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:45,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:46,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {26229#true} call ULTIMATE.init(); {26229#true} is VALID [2018-11-23 12:28:46,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {26229#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26229#true} is VALID [2018-11-23 12:28:46,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {26229#true} assume true; {26229#true} is VALID [2018-11-23 12:28:46,385 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26229#true} {26229#true} #66#return; {26229#true} is VALID [2018-11-23 12:28:46,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {26229#true} call #t~ret12 := main(); {26229#true} is VALID [2018-11-23 12:28:46,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {26229#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26229#true} is VALID [2018-11-23 12:28:46,386 INFO L273 TraceCheckUtils]: 6: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,388 INFO L273 TraceCheckUtils]: 16: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,388 INFO L273 TraceCheckUtils]: 17: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,388 INFO L273 TraceCheckUtils]: 18: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,388 INFO L273 TraceCheckUtils]: 19: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,388 INFO L273 TraceCheckUtils]: 20: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,388 INFO L273 TraceCheckUtils]: 21: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,389 INFO L273 TraceCheckUtils]: 22: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,389 INFO L273 TraceCheckUtils]: 23: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,389 INFO L273 TraceCheckUtils]: 24: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,389 INFO L273 TraceCheckUtils]: 25: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,389 INFO L273 TraceCheckUtils]: 26: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,389 INFO L273 TraceCheckUtils]: 27: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,389 INFO L273 TraceCheckUtils]: 28: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,389 INFO L273 TraceCheckUtils]: 29: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,389 INFO L273 TraceCheckUtils]: 30: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,389 INFO L273 TraceCheckUtils]: 31: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,390 INFO L273 TraceCheckUtils]: 32: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,390 INFO L273 TraceCheckUtils]: 33: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,390 INFO L273 TraceCheckUtils]: 34: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,390 INFO L273 TraceCheckUtils]: 35: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,390 INFO L273 TraceCheckUtils]: 36: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,390 INFO L273 TraceCheckUtils]: 37: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,390 INFO L273 TraceCheckUtils]: 38: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,390 INFO L273 TraceCheckUtils]: 39: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,390 INFO L273 TraceCheckUtils]: 40: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,390 INFO L273 TraceCheckUtils]: 41: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,391 INFO L273 TraceCheckUtils]: 42: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,391 INFO L273 TraceCheckUtils]: 43: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,391 INFO L273 TraceCheckUtils]: 44: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,391 INFO L273 TraceCheckUtils]: 45: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,391 INFO L273 TraceCheckUtils]: 46: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,391 INFO L273 TraceCheckUtils]: 47: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,391 INFO L273 TraceCheckUtils]: 48: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,391 INFO L273 TraceCheckUtils]: 49: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,391 INFO L273 TraceCheckUtils]: 50: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,391 INFO L273 TraceCheckUtils]: 51: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,392 INFO L273 TraceCheckUtils]: 52: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,392 INFO L273 TraceCheckUtils]: 53: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,392 INFO L273 TraceCheckUtils]: 54: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,392 INFO L273 TraceCheckUtils]: 55: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,392 INFO L273 TraceCheckUtils]: 56: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,392 INFO L273 TraceCheckUtils]: 57: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,392 INFO L273 TraceCheckUtils]: 58: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,392 INFO L273 TraceCheckUtils]: 59: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,392 INFO L273 TraceCheckUtils]: 60: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,393 INFO L273 TraceCheckUtils]: 61: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,393 INFO L273 TraceCheckUtils]: 62: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,393 INFO L273 TraceCheckUtils]: 63: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,393 INFO L273 TraceCheckUtils]: 64: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,393 INFO L273 TraceCheckUtils]: 65: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,393 INFO L273 TraceCheckUtils]: 66: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,393 INFO L273 TraceCheckUtils]: 67: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,393 INFO L273 TraceCheckUtils]: 68: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,393 INFO L273 TraceCheckUtils]: 69: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,393 INFO L273 TraceCheckUtils]: 70: Hoare triple {26229#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26229#true} is VALID [2018-11-23 12:28:46,394 INFO L273 TraceCheckUtils]: 71: Hoare triple {26229#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26229#true} is VALID [2018-11-23 12:28:46,394 INFO L273 TraceCheckUtils]: 72: Hoare triple {26229#true} assume !(~i~1 < 100000); {26229#true} is VALID [2018-11-23 12:28:46,394 INFO L256 TraceCheckUtils]: 73: Hoare triple {26229#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {26229#true} is VALID [2018-11-23 12:28:46,394 INFO L273 TraceCheckUtils]: 74: Hoare triple {26229#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26229#true} is VALID [2018-11-23 12:28:46,394 INFO L273 TraceCheckUtils]: 75: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,394 INFO L273 TraceCheckUtils]: 76: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,394 INFO L273 TraceCheckUtils]: 77: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,394 INFO L273 TraceCheckUtils]: 78: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,394 INFO L273 TraceCheckUtils]: 79: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,394 INFO L273 TraceCheckUtils]: 80: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,395 INFO L273 TraceCheckUtils]: 81: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,395 INFO L273 TraceCheckUtils]: 82: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,395 INFO L273 TraceCheckUtils]: 83: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,395 INFO L273 TraceCheckUtils]: 84: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,395 INFO L273 TraceCheckUtils]: 85: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,395 INFO L273 TraceCheckUtils]: 86: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,395 INFO L273 TraceCheckUtils]: 87: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,395 INFO L273 TraceCheckUtils]: 88: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,395 INFO L273 TraceCheckUtils]: 89: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,396 INFO L273 TraceCheckUtils]: 90: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,396 INFO L273 TraceCheckUtils]: 91: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,396 INFO L273 TraceCheckUtils]: 92: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,396 INFO L273 TraceCheckUtils]: 93: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,396 INFO L273 TraceCheckUtils]: 94: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,396 INFO L273 TraceCheckUtils]: 95: Hoare triple {26229#true} assume !(~i~0 < 100000); {26229#true} is VALID [2018-11-23 12:28:46,396 INFO L273 TraceCheckUtils]: 96: Hoare triple {26229#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {26229#true} is VALID [2018-11-23 12:28:46,396 INFO L273 TraceCheckUtils]: 97: Hoare triple {26229#true} assume true; {26229#true} is VALID [2018-11-23 12:28:46,396 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26229#true} {26229#true} #70#return; {26229#true} is VALID [2018-11-23 12:28:46,396 INFO L273 TraceCheckUtils]: 99: Hoare triple {26229#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); {26229#true} is VALID [2018-11-23 12:28:46,397 INFO L256 TraceCheckUtils]: 100: Hoare triple {26229#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {26229#true} is VALID [2018-11-23 12:28:46,397 INFO L273 TraceCheckUtils]: 101: Hoare triple {26229#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26229#true} is VALID [2018-11-23 12:28:46,397 INFO L273 TraceCheckUtils]: 102: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,397 INFO L273 TraceCheckUtils]: 103: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,397 INFO L273 TraceCheckUtils]: 104: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,397 INFO L273 TraceCheckUtils]: 105: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,397 INFO L273 TraceCheckUtils]: 106: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,397 INFO L273 TraceCheckUtils]: 107: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,397 INFO L273 TraceCheckUtils]: 108: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,397 INFO L273 TraceCheckUtils]: 109: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,398 INFO L273 TraceCheckUtils]: 110: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,398 INFO L273 TraceCheckUtils]: 111: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,398 INFO L273 TraceCheckUtils]: 112: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,398 INFO L273 TraceCheckUtils]: 113: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,398 INFO L273 TraceCheckUtils]: 114: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,398 INFO L273 TraceCheckUtils]: 115: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,398 INFO L273 TraceCheckUtils]: 116: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,398 INFO L273 TraceCheckUtils]: 117: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,398 INFO L273 TraceCheckUtils]: 118: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,398 INFO L273 TraceCheckUtils]: 119: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,399 INFO L273 TraceCheckUtils]: 120: Hoare triple {26229#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26229#true} is VALID [2018-11-23 12:28:46,399 INFO L273 TraceCheckUtils]: 121: Hoare triple {26229#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26229#true} is VALID [2018-11-23 12:28:46,399 INFO L273 TraceCheckUtils]: 122: Hoare triple {26229#true} assume !(~i~0 < 100000); {26229#true} is VALID [2018-11-23 12:28:46,399 INFO L273 TraceCheckUtils]: 123: Hoare triple {26229#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {26229#true} is VALID [2018-11-23 12:28:46,399 INFO L273 TraceCheckUtils]: 124: Hoare triple {26229#true} assume true; {26229#true} is VALID [2018-11-23 12:28:46,399 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26229#true} {26229#true} #72#return; {26229#true} is VALID [2018-11-23 12:28:46,400 INFO L273 TraceCheckUtils]: 126: Hoare triple {26229#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; {26646#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:46,400 INFO L273 TraceCheckUtils]: 127: Hoare triple {26646#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26646#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:46,401 INFO L273 TraceCheckUtils]: 128: Hoare triple {26646#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26653#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:46,401 INFO L273 TraceCheckUtils]: 129: Hoare triple {26653#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26653#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:46,401 INFO L273 TraceCheckUtils]: 130: Hoare triple {26653#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26660#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:46,402 INFO L273 TraceCheckUtils]: 131: Hoare triple {26660#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26660#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:46,402 INFO L273 TraceCheckUtils]: 132: Hoare triple {26660#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26667#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:46,402 INFO L273 TraceCheckUtils]: 133: Hoare triple {26667#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26667#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:46,403 INFO L273 TraceCheckUtils]: 134: Hoare triple {26667#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26674#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:46,403 INFO L273 TraceCheckUtils]: 135: Hoare triple {26674#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26674#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:46,403 INFO L273 TraceCheckUtils]: 136: Hoare triple {26674#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26681#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:46,404 INFO L273 TraceCheckUtils]: 137: Hoare triple {26681#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26681#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:46,404 INFO L273 TraceCheckUtils]: 138: Hoare triple {26681#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26688#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:46,405 INFO L273 TraceCheckUtils]: 139: Hoare triple {26688#(<= main_~i~2 6)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26688#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:46,406 INFO L273 TraceCheckUtils]: 140: Hoare triple {26688#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26695#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:46,406 INFO L273 TraceCheckUtils]: 141: Hoare triple {26695#(<= main_~i~2 7)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26695#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:46,407 INFO L273 TraceCheckUtils]: 142: Hoare triple {26695#(<= main_~i~2 7)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26702#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:46,407 INFO L273 TraceCheckUtils]: 143: Hoare triple {26702#(<= main_~i~2 8)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26702#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:46,408 INFO L273 TraceCheckUtils]: 144: Hoare triple {26702#(<= main_~i~2 8)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26709#(<= main_~i~2 9)} is VALID [2018-11-23 12:28:46,409 INFO L273 TraceCheckUtils]: 145: Hoare triple {26709#(<= main_~i~2 9)} assume !(~i~2 < 99999); {26230#false} is VALID [2018-11-23 12:28:46,409 INFO L273 TraceCheckUtils]: 146: Hoare triple {26230#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {26230#false} is VALID [2018-11-23 12:28:46,409 INFO L256 TraceCheckUtils]: 147: Hoare triple {26230#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {26230#false} is VALID [2018-11-23 12:28:46,409 INFO L273 TraceCheckUtils]: 148: Hoare triple {26230#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26230#false} is VALID [2018-11-23 12:28:46,409 INFO L273 TraceCheckUtils]: 149: Hoare triple {26230#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26230#false} is VALID [2018-11-23 12:28:46,410 INFO L273 TraceCheckUtils]: 150: Hoare triple {26230#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26230#false} is VALID [2018-11-23 12:28:46,410 INFO L273 TraceCheckUtils]: 151: Hoare triple {26230#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26230#false} is VALID [2018-11-23 12:28:46,410 INFO L273 TraceCheckUtils]: 152: Hoare triple {26230#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26230#false} is VALID [2018-11-23 12:28:46,410 INFO L273 TraceCheckUtils]: 153: Hoare triple {26230#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26230#false} is VALID [2018-11-23 12:28:46,410 INFO L273 TraceCheckUtils]: 154: Hoare triple {26230#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26230#false} is VALID [2018-11-23 12:28:46,411 INFO L273 TraceCheckUtils]: 155: Hoare triple {26230#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26230#false} is VALID [2018-11-23 12:28:46,411 INFO L273 TraceCheckUtils]: 156: Hoare triple {26230#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26230#false} is VALID [2018-11-23 12:28:46,411 INFO L273 TraceCheckUtils]: 157: Hoare triple {26230#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26230#false} is VALID [2018-11-23 12:28:46,411 INFO L273 TraceCheckUtils]: 158: Hoare triple {26230#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26230#false} is VALID [2018-11-23 12:28:46,411 INFO L273 TraceCheckUtils]: 159: Hoare triple {26230#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26230#false} is VALID [2018-11-23 12:28:46,411 INFO L273 TraceCheckUtils]: 160: Hoare triple {26230#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26230#false} is VALID [2018-11-23 12:28:46,412 INFO L273 TraceCheckUtils]: 161: Hoare triple {26230#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26230#false} is VALID [2018-11-23 12:28:46,412 INFO L273 TraceCheckUtils]: 162: Hoare triple {26230#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26230#false} is VALID [2018-11-23 12:28:46,412 INFO L273 TraceCheckUtils]: 163: Hoare triple {26230#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26230#false} is VALID [2018-11-23 12:28:46,412 INFO L273 TraceCheckUtils]: 164: Hoare triple {26230#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26230#false} is VALID [2018-11-23 12:28:46,412 INFO L273 TraceCheckUtils]: 165: Hoare triple {26230#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26230#false} is VALID [2018-11-23 12:28:46,412 INFO L273 TraceCheckUtils]: 166: Hoare triple {26230#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26230#false} is VALID [2018-11-23 12:28:46,412 INFO L273 TraceCheckUtils]: 167: Hoare triple {26230#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26230#false} is VALID [2018-11-23 12:28:46,413 INFO L273 TraceCheckUtils]: 168: Hoare triple {26230#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26230#false} is VALID [2018-11-23 12:28:46,413 INFO L273 TraceCheckUtils]: 169: Hoare triple {26230#false} assume !(~i~0 < 100000); {26230#false} is VALID [2018-11-23 12:28:46,413 INFO L273 TraceCheckUtils]: 170: Hoare triple {26230#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {26230#false} is VALID [2018-11-23 12:28:46,413 INFO L273 TraceCheckUtils]: 171: Hoare triple {26230#false} assume true; {26230#false} is VALID [2018-11-23 12:28:46,413 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26230#false} {26230#false} #74#return; {26230#false} is VALID [2018-11-23 12:28:46,413 INFO L273 TraceCheckUtils]: 173: Hoare triple {26230#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {26230#false} is VALID [2018-11-23 12:28:46,413 INFO L273 TraceCheckUtils]: 174: Hoare triple {26230#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {26230#false} is VALID [2018-11-23 12:28:46,413 INFO L273 TraceCheckUtils]: 175: Hoare triple {26230#false} assume !false; {26230#false} is VALID [2018-11-23 12:28:46,425 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:46,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:46,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2018-11-23 12:28:46,446 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:28:46,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:46,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:28:46,579 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:46,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:28:46,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:28:46,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:28:46,581 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2018-11-23 12:28:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:47,556 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2018-11-23 12:28:47,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:28:47,556 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:28:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:28:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:28:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:28:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:28:47,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 141 transitions. [2018-11-23 12:28:47,699 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:47,702 INFO L225 Difference]: With dead ends: 187 [2018-11-23 12:28:47,703 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 12:28:47,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:28:47,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 12:28:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-23 12:28:48,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:48,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-23 12:28:48,007 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-23 12:28:48,007 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-23 12:28:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:48,010 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:28:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:28:48,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:48,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:48,011 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-23 12:28:48,011 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-23 12:28:48,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:48,013 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:28:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:28:48,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:48,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:48,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:48,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 12:28:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-11-23 12:28:48,015 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2018-11-23 12:28:48,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:48,015 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-11-23 12:28:48,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:28:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-23 12:28:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-23 12:28:48,016 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:48,016 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:48,017 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:48,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:48,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1391900713, now seen corresponding path program 34 times [2018-11-23 12:28:48,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:48,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:48,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:48,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:48,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:48,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {27541#true} call ULTIMATE.init(); {27541#true} is VALID [2018-11-23 12:28:48,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {27541#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27541#true} is VALID [2018-11-23 12:28:48,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {27541#true} assume true; {27541#true} is VALID [2018-11-23 12:28:48,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27541#true} {27541#true} #66#return; {27541#true} is VALID [2018-11-23 12:28:48,826 INFO L256 TraceCheckUtils]: 4: Hoare triple {27541#true} call #t~ret12 := main(); {27541#true} is VALID [2018-11-23 12:28:48,826 INFO L273 TraceCheckUtils]: 5: Hoare triple {27541#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27543#(= main_~i~1 0)} is VALID [2018-11-23 12:28:48,826 INFO L273 TraceCheckUtils]: 6: Hoare triple {27543#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27543#(= main_~i~1 0)} is VALID [2018-11-23 12:28:48,827 INFO L273 TraceCheckUtils]: 7: Hoare triple {27543#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27544#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:48,827 INFO L273 TraceCheckUtils]: 8: Hoare triple {27544#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27544#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:48,828 INFO L273 TraceCheckUtils]: 9: Hoare triple {27544#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27545#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:48,829 INFO L273 TraceCheckUtils]: 10: Hoare triple {27545#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27545#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:48,829 INFO L273 TraceCheckUtils]: 11: Hoare triple {27545#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27546#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:48,830 INFO L273 TraceCheckUtils]: 12: Hoare triple {27546#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27546#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:48,830 INFO L273 TraceCheckUtils]: 13: Hoare triple {27546#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27547#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:48,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {27547#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27547#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:48,832 INFO L273 TraceCheckUtils]: 15: Hoare triple {27547#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27548#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:48,832 INFO L273 TraceCheckUtils]: 16: Hoare triple {27548#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27548#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:48,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {27548#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27549#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:48,833 INFO L273 TraceCheckUtils]: 18: Hoare triple {27549#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27549#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:48,834 INFO L273 TraceCheckUtils]: 19: Hoare triple {27549#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27550#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:48,835 INFO L273 TraceCheckUtils]: 20: Hoare triple {27550#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27550#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:48,835 INFO L273 TraceCheckUtils]: 21: Hoare triple {27550#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27551#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:48,836 INFO L273 TraceCheckUtils]: 22: Hoare triple {27551#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27551#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:48,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {27551#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27552#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:48,837 INFO L273 TraceCheckUtils]: 24: Hoare triple {27552#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27552#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:48,838 INFO L273 TraceCheckUtils]: 25: Hoare triple {27552#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:48,838 INFO L273 TraceCheckUtils]: 26: Hoare triple {27553#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:48,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {27553#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27554#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:48,840 INFO L273 TraceCheckUtils]: 28: Hoare triple {27554#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27554#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:48,840 INFO L273 TraceCheckUtils]: 29: Hoare triple {27554#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27555#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:48,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {27555#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:48,842 INFO L273 TraceCheckUtils]: 31: Hoare triple {27555#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27556#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:48,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {27556#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:48,843 INFO L273 TraceCheckUtils]: 33: Hoare triple {27556#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27557#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:48,843 INFO L273 TraceCheckUtils]: 34: Hoare triple {27557#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:48,844 INFO L273 TraceCheckUtils]: 35: Hoare triple {27557#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27558#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:48,845 INFO L273 TraceCheckUtils]: 36: Hoare triple {27558#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:48,845 INFO L273 TraceCheckUtils]: 37: Hoare triple {27558#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27559#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:48,846 INFO L273 TraceCheckUtils]: 38: Hoare triple {27559#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:48,846 INFO L273 TraceCheckUtils]: 39: Hoare triple {27559#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27560#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:48,847 INFO L273 TraceCheckUtils]: 40: Hoare triple {27560#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:48,848 INFO L273 TraceCheckUtils]: 41: Hoare triple {27560#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27561#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:48,848 INFO L273 TraceCheckUtils]: 42: Hoare triple {27561#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:48,849 INFO L273 TraceCheckUtils]: 43: Hoare triple {27561#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27562#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:48,849 INFO L273 TraceCheckUtils]: 44: Hoare triple {27562#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:48,850 INFO L273 TraceCheckUtils]: 45: Hoare triple {27562#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27563#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:48,851 INFO L273 TraceCheckUtils]: 46: Hoare triple {27563#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:48,851 INFO L273 TraceCheckUtils]: 47: Hoare triple {27563#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27564#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:48,852 INFO L273 TraceCheckUtils]: 48: Hoare triple {27564#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:48,853 INFO L273 TraceCheckUtils]: 49: Hoare triple {27564#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27565#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:48,853 INFO L273 TraceCheckUtils]: 50: Hoare triple {27565#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:48,854 INFO L273 TraceCheckUtils]: 51: Hoare triple {27565#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27566#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:48,854 INFO L273 TraceCheckUtils]: 52: Hoare triple {27566#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:48,855 INFO L273 TraceCheckUtils]: 53: Hoare triple {27566#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27567#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:48,856 INFO L273 TraceCheckUtils]: 54: Hoare triple {27567#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:28:48,856 INFO L273 TraceCheckUtils]: 55: Hoare triple {27567#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27568#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:48,857 INFO L273 TraceCheckUtils]: 56: Hoare triple {27568#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -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 25)} is VALID [2018-11-23 12:28:48,858 INFO L273 TraceCheckUtils]: 57: Hoare triple {27568#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27569#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:48,858 INFO L273 TraceCheckUtils]: 58: Hoare triple {27569#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -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 26)} is VALID [2018-11-23 12:28:48,859 INFO L273 TraceCheckUtils]: 59: Hoare triple {27569#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27570#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:48,859 INFO L273 TraceCheckUtils]: 60: Hoare triple {27570#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -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 27)} is VALID [2018-11-23 12:28:48,860 INFO L273 TraceCheckUtils]: 61: Hoare triple {27570#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27571#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:48,861 INFO L273 TraceCheckUtils]: 62: Hoare triple {27571#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -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 28)} is VALID [2018-11-23 12:28:48,861 INFO L273 TraceCheckUtils]: 63: Hoare triple {27571#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27572#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:48,862 INFO L273 TraceCheckUtils]: 64: Hoare triple {27572#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -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 29)} is VALID [2018-11-23 12:28:48,863 INFO L273 TraceCheckUtils]: 65: Hoare triple {27572#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27573#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:48,863 INFO L273 TraceCheckUtils]: 66: Hoare triple {27573#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -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 30)} is VALID [2018-11-23 12:28:48,864 INFO L273 TraceCheckUtils]: 67: Hoare triple {27573#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27574#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:48,864 INFO L273 TraceCheckUtils]: 68: Hoare triple {27574#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -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 31)} is VALID [2018-11-23 12:28:48,865 INFO L273 TraceCheckUtils]: 69: Hoare triple {27574#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27575#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:48,866 INFO L273 TraceCheckUtils]: 70: Hoare triple {27575#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -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 32)} is VALID [2018-11-23 12:28:48,866 INFO L273 TraceCheckUtils]: 71: Hoare triple {27575#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27576#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:48,867 INFO L273 TraceCheckUtils]: 72: Hoare triple {27576#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -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 33)} is VALID [2018-11-23 12:28:48,867 INFO L273 TraceCheckUtils]: 73: Hoare triple {27576#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27577#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:48,868 INFO L273 TraceCheckUtils]: 74: Hoare triple {27577#(<= main_~i~1 34)} assume !(~i~1 < 100000); {27542#false} is VALID [2018-11-23 12:28:48,868 INFO L256 TraceCheckUtils]: 75: Hoare triple {27542#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {27541#true} is VALID [2018-11-23 12:28:48,869 INFO L273 TraceCheckUtils]: 76: Hoare triple {27541#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27541#true} is VALID [2018-11-23 12:28:48,869 INFO L273 TraceCheckUtils]: 77: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,869 INFO L273 TraceCheckUtils]: 78: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,869 INFO L273 TraceCheckUtils]: 79: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,869 INFO L273 TraceCheckUtils]: 80: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,869 INFO L273 TraceCheckUtils]: 81: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,870 INFO L273 TraceCheckUtils]: 82: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,870 INFO L273 TraceCheckUtils]: 83: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,870 INFO L273 TraceCheckUtils]: 84: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,870 INFO L273 TraceCheckUtils]: 85: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,870 INFO L273 TraceCheckUtils]: 86: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,871 INFO L273 TraceCheckUtils]: 87: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,871 INFO L273 TraceCheckUtils]: 88: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,871 INFO L273 TraceCheckUtils]: 89: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,871 INFO L273 TraceCheckUtils]: 90: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,871 INFO L273 TraceCheckUtils]: 91: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,871 INFO L273 TraceCheckUtils]: 92: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,872 INFO L273 TraceCheckUtils]: 93: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,872 INFO L273 TraceCheckUtils]: 94: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,872 INFO L273 TraceCheckUtils]: 95: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,872 INFO L273 TraceCheckUtils]: 96: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,872 INFO L273 TraceCheckUtils]: 97: Hoare triple {27541#true} assume !(~i~0 < 100000); {27541#true} is VALID [2018-11-23 12:28:48,872 INFO L273 TraceCheckUtils]: 98: Hoare triple {27541#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {27541#true} is VALID [2018-11-23 12:28:48,873 INFO L273 TraceCheckUtils]: 99: Hoare triple {27541#true} assume true; {27541#true} is VALID [2018-11-23 12:28:48,873 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27541#true} {27542#false} #70#return; {27542#false} is VALID [2018-11-23 12:28:48,873 INFO L273 TraceCheckUtils]: 101: Hoare triple {27542#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); {27542#false} is VALID [2018-11-23 12:28:48,873 INFO L256 TraceCheckUtils]: 102: Hoare triple {27542#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {27541#true} is VALID [2018-11-23 12:28:48,873 INFO L273 TraceCheckUtils]: 103: Hoare triple {27541#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27541#true} is VALID [2018-11-23 12:28:48,873 INFO L273 TraceCheckUtils]: 104: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,873 INFO L273 TraceCheckUtils]: 105: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,873 INFO L273 TraceCheckUtils]: 106: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,873 INFO L273 TraceCheckUtils]: 107: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,874 INFO L273 TraceCheckUtils]: 108: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,874 INFO L273 TraceCheckUtils]: 109: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,874 INFO L273 TraceCheckUtils]: 110: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,874 INFO L273 TraceCheckUtils]: 111: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,874 INFO L273 TraceCheckUtils]: 112: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,874 INFO L273 TraceCheckUtils]: 113: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,874 INFO L273 TraceCheckUtils]: 114: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,874 INFO L273 TraceCheckUtils]: 115: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,874 INFO L273 TraceCheckUtils]: 116: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,875 INFO L273 TraceCheckUtils]: 117: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,875 INFO L273 TraceCheckUtils]: 118: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,875 INFO L273 TraceCheckUtils]: 119: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,875 INFO L273 TraceCheckUtils]: 120: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,875 INFO L273 TraceCheckUtils]: 121: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,875 INFO L273 TraceCheckUtils]: 122: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,875 INFO L273 TraceCheckUtils]: 123: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,875 INFO L273 TraceCheckUtils]: 124: Hoare triple {27541#true} assume !(~i~0 < 100000); {27541#true} is VALID [2018-11-23 12:28:48,875 INFO L273 TraceCheckUtils]: 125: Hoare triple {27541#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {27541#true} is VALID [2018-11-23 12:28:48,875 INFO L273 TraceCheckUtils]: 126: Hoare triple {27541#true} assume true; {27541#true} is VALID [2018-11-23 12:28:48,876 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27541#true} {27542#false} #72#return; {27542#false} is VALID [2018-11-23 12:28:48,876 INFO L273 TraceCheckUtils]: 128: Hoare triple {27542#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; {27542#false} is VALID [2018-11-23 12:28:48,876 INFO L273 TraceCheckUtils]: 129: Hoare triple {27542#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27542#false} is VALID [2018-11-23 12:28:48,876 INFO L273 TraceCheckUtils]: 130: Hoare triple {27542#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27542#false} is VALID [2018-11-23 12:28:48,876 INFO L273 TraceCheckUtils]: 131: Hoare triple {27542#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27542#false} is VALID [2018-11-23 12:28:48,876 INFO L273 TraceCheckUtils]: 132: Hoare triple {27542#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27542#false} is VALID [2018-11-23 12:28:48,876 INFO L273 TraceCheckUtils]: 133: Hoare triple {27542#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27542#false} is VALID [2018-11-23 12:28:48,876 INFO L273 TraceCheckUtils]: 134: Hoare triple {27542#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27542#false} is VALID [2018-11-23 12:28:48,876 INFO L273 TraceCheckUtils]: 135: Hoare triple {27542#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27542#false} is VALID [2018-11-23 12:28:48,876 INFO L273 TraceCheckUtils]: 136: Hoare triple {27542#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27542#false} is VALID [2018-11-23 12:28:48,877 INFO L273 TraceCheckUtils]: 137: Hoare triple {27542#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27542#false} is VALID [2018-11-23 12:28:48,877 INFO L273 TraceCheckUtils]: 138: Hoare triple {27542#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27542#false} is VALID [2018-11-23 12:28:48,877 INFO L273 TraceCheckUtils]: 139: Hoare triple {27542#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27542#false} is VALID [2018-11-23 12:28:48,877 INFO L273 TraceCheckUtils]: 140: Hoare triple {27542#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27542#false} is VALID [2018-11-23 12:28:48,877 INFO L273 TraceCheckUtils]: 141: Hoare triple {27542#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27542#false} is VALID [2018-11-23 12:28:48,877 INFO L273 TraceCheckUtils]: 142: Hoare triple {27542#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27542#false} is VALID [2018-11-23 12:28:48,877 INFO L273 TraceCheckUtils]: 143: Hoare triple {27542#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27542#false} is VALID [2018-11-23 12:28:48,877 INFO L273 TraceCheckUtils]: 144: Hoare triple {27542#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27542#false} is VALID [2018-11-23 12:28:48,877 INFO L273 TraceCheckUtils]: 145: Hoare triple {27542#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27542#false} is VALID [2018-11-23 12:28:48,877 INFO L273 TraceCheckUtils]: 146: Hoare triple {27542#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27542#false} is VALID [2018-11-23 12:28:48,878 INFO L273 TraceCheckUtils]: 147: Hoare triple {27542#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27542#false} is VALID [2018-11-23 12:28:48,878 INFO L273 TraceCheckUtils]: 148: Hoare triple {27542#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27542#false} is VALID [2018-11-23 12:28:48,878 INFO L273 TraceCheckUtils]: 149: Hoare triple {27542#false} assume !(~i~2 < 99999); {27542#false} is VALID [2018-11-23 12:28:48,878 INFO L273 TraceCheckUtils]: 150: Hoare triple {27542#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {27542#false} is VALID [2018-11-23 12:28:48,878 INFO L256 TraceCheckUtils]: 151: Hoare triple {27542#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {27541#true} is VALID [2018-11-23 12:28:48,878 INFO L273 TraceCheckUtils]: 152: Hoare triple {27541#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27541#true} is VALID [2018-11-23 12:28:48,878 INFO L273 TraceCheckUtils]: 153: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,878 INFO L273 TraceCheckUtils]: 154: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,878 INFO L273 TraceCheckUtils]: 155: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,879 INFO L273 TraceCheckUtils]: 156: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,879 INFO L273 TraceCheckUtils]: 157: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,879 INFO L273 TraceCheckUtils]: 158: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,879 INFO L273 TraceCheckUtils]: 159: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,879 INFO L273 TraceCheckUtils]: 160: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,879 INFO L273 TraceCheckUtils]: 161: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,879 INFO L273 TraceCheckUtils]: 162: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,879 INFO L273 TraceCheckUtils]: 163: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,879 INFO L273 TraceCheckUtils]: 164: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,879 INFO L273 TraceCheckUtils]: 165: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,880 INFO L273 TraceCheckUtils]: 166: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,880 INFO L273 TraceCheckUtils]: 167: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,880 INFO L273 TraceCheckUtils]: 168: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,880 INFO L273 TraceCheckUtils]: 169: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,880 INFO L273 TraceCheckUtils]: 170: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,880 INFO L273 TraceCheckUtils]: 171: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:48,880 INFO L273 TraceCheckUtils]: 172: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:48,880 INFO L273 TraceCheckUtils]: 173: Hoare triple {27541#true} assume !(~i~0 < 100000); {27541#true} is VALID [2018-11-23 12:28:48,880 INFO L273 TraceCheckUtils]: 174: Hoare triple {27541#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {27541#true} is VALID [2018-11-23 12:28:48,880 INFO L273 TraceCheckUtils]: 175: Hoare triple {27541#true} assume true; {27541#true} is VALID [2018-11-23 12:28:48,881 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27541#true} {27542#false} #74#return; {27542#false} is VALID [2018-11-23 12:28:48,881 INFO L273 TraceCheckUtils]: 177: Hoare triple {27542#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {27542#false} is VALID [2018-11-23 12:28:48,881 INFO L273 TraceCheckUtils]: 178: Hoare triple {27542#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {27542#false} is VALID [2018-11-23 12:28:48,881 INFO L273 TraceCheckUtils]: 179: Hoare triple {27542#false} assume !false; {27542#false} is VALID [2018-11-23 12:28:48,896 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:48,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:48,896 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:48,907 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:49,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:49,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:49,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:49,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {27541#true} call ULTIMATE.init(); {27541#true} is VALID [2018-11-23 12:28:49,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {27541#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27541#true} is VALID [2018-11-23 12:28:49,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {27541#true} assume true; {27541#true} is VALID [2018-11-23 12:28:49,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27541#true} {27541#true} #66#return; {27541#true} is VALID [2018-11-23 12:28:49,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {27541#true} call #t~ret12 := main(); {27541#true} is VALID [2018-11-23 12:28:49,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {27541#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27541#true} is VALID [2018-11-23 12:28:49,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,422 INFO L273 TraceCheckUtils]: 8: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,422 INFO L273 TraceCheckUtils]: 9: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,422 INFO L273 TraceCheckUtils]: 10: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,422 INFO L273 TraceCheckUtils]: 11: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,423 INFO L273 TraceCheckUtils]: 13: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,423 INFO L273 TraceCheckUtils]: 15: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,423 INFO L273 TraceCheckUtils]: 16: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,423 INFO L273 TraceCheckUtils]: 19: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,424 INFO L273 TraceCheckUtils]: 21: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,424 INFO L273 TraceCheckUtils]: 23: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,424 INFO L273 TraceCheckUtils]: 24: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,424 INFO L273 TraceCheckUtils]: 25: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,424 INFO L273 TraceCheckUtils]: 26: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,424 INFO L273 TraceCheckUtils]: 27: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,424 INFO L273 TraceCheckUtils]: 28: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,424 INFO L273 TraceCheckUtils]: 29: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,425 INFO L273 TraceCheckUtils]: 30: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,425 INFO L273 TraceCheckUtils]: 31: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,425 INFO L273 TraceCheckUtils]: 32: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,425 INFO L273 TraceCheckUtils]: 33: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,425 INFO L273 TraceCheckUtils]: 34: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,425 INFO L273 TraceCheckUtils]: 35: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,425 INFO L273 TraceCheckUtils]: 36: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,425 INFO L273 TraceCheckUtils]: 37: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,425 INFO L273 TraceCheckUtils]: 38: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,425 INFO L273 TraceCheckUtils]: 39: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,426 INFO L273 TraceCheckUtils]: 40: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,426 INFO L273 TraceCheckUtils]: 41: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,426 INFO L273 TraceCheckUtils]: 42: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,426 INFO L273 TraceCheckUtils]: 43: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,426 INFO L273 TraceCheckUtils]: 44: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,426 INFO L273 TraceCheckUtils]: 45: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,426 INFO L273 TraceCheckUtils]: 46: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,426 INFO L273 TraceCheckUtils]: 47: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,426 INFO L273 TraceCheckUtils]: 48: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,426 INFO L273 TraceCheckUtils]: 49: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,427 INFO L273 TraceCheckUtils]: 50: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,427 INFO L273 TraceCheckUtils]: 51: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,427 INFO L273 TraceCheckUtils]: 52: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,427 INFO L273 TraceCheckUtils]: 53: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,427 INFO L273 TraceCheckUtils]: 54: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,427 INFO L273 TraceCheckUtils]: 55: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,427 INFO L273 TraceCheckUtils]: 56: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,427 INFO L273 TraceCheckUtils]: 57: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,427 INFO L273 TraceCheckUtils]: 58: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,427 INFO L273 TraceCheckUtils]: 59: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,428 INFO L273 TraceCheckUtils]: 60: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,428 INFO L273 TraceCheckUtils]: 61: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,428 INFO L273 TraceCheckUtils]: 62: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,428 INFO L273 TraceCheckUtils]: 63: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,428 INFO L273 TraceCheckUtils]: 64: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,428 INFO L273 TraceCheckUtils]: 65: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,428 INFO L273 TraceCheckUtils]: 66: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,428 INFO L273 TraceCheckUtils]: 67: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,428 INFO L273 TraceCheckUtils]: 68: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,429 INFO L273 TraceCheckUtils]: 69: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,429 INFO L273 TraceCheckUtils]: 70: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,429 INFO L273 TraceCheckUtils]: 71: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,429 INFO L273 TraceCheckUtils]: 72: Hoare triple {27541#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27541#true} is VALID [2018-11-23 12:28:49,429 INFO L273 TraceCheckUtils]: 73: Hoare triple {27541#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27541#true} is VALID [2018-11-23 12:28:49,429 INFO L273 TraceCheckUtils]: 74: Hoare triple {27541#true} assume !(~i~1 < 100000); {27541#true} is VALID [2018-11-23 12:28:49,429 INFO L256 TraceCheckUtils]: 75: Hoare triple {27541#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {27541#true} is VALID [2018-11-23 12:28:49,429 INFO L273 TraceCheckUtils]: 76: Hoare triple {27541#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27541#true} is VALID [2018-11-23 12:28:49,429 INFO L273 TraceCheckUtils]: 77: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,429 INFO L273 TraceCheckUtils]: 78: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,430 INFO L273 TraceCheckUtils]: 79: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,430 INFO L273 TraceCheckUtils]: 80: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,430 INFO L273 TraceCheckUtils]: 81: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,430 INFO L273 TraceCheckUtils]: 82: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,430 INFO L273 TraceCheckUtils]: 83: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,430 INFO L273 TraceCheckUtils]: 84: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,430 INFO L273 TraceCheckUtils]: 85: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,430 INFO L273 TraceCheckUtils]: 86: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,430 INFO L273 TraceCheckUtils]: 87: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,430 INFO L273 TraceCheckUtils]: 88: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,431 INFO L273 TraceCheckUtils]: 89: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,431 INFO L273 TraceCheckUtils]: 90: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,431 INFO L273 TraceCheckUtils]: 91: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,431 INFO L273 TraceCheckUtils]: 92: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,431 INFO L273 TraceCheckUtils]: 93: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,431 INFO L273 TraceCheckUtils]: 94: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,431 INFO L273 TraceCheckUtils]: 95: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,431 INFO L273 TraceCheckUtils]: 96: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,431 INFO L273 TraceCheckUtils]: 97: Hoare triple {27541#true} assume !(~i~0 < 100000); {27541#true} is VALID [2018-11-23 12:28:49,431 INFO L273 TraceCheckUtils]: 98: Hoare triple {27541#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {27541#true} is VALID [2018-11-23 12:28:49,432 INFO L273 TraceCheckUtils]: 99: Hoare triple {27541#true} assume true; {27541#true} is VALID [2018-11-23 12:28:49,432 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27541#true} {27541#true} #70#return; {27541#true} is VALID [2018-11-23 12:28:49,432 INFO L273 TraceCheckUtils]: 101: Hoare triple {27541#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); {27541#true} is VALID [2018-11-23 12:28:49,432 INFO L256 TraceCheckUtils]: 102: Hoare triple {27541#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {27541#true} is VALID [2018-11-23 12:28:49,432 INFO L273 TraceCheckUtils]: 103: Hoare triple {27541#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27541#true} is VALID [2018-11-23 12:28:49,432 INFO L273 TraceCheckUtils]: 104: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,432 INFO L273 TraceCheckUtils]: 105: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,432 INFO L273 TraceCheckUtils]: 106: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,432 INFO L273 TraceCheckUtils]: 107: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,433 INFO L273 TraceCheckUtils]: 108: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,433 INFO L273 TraceCheckUtils]: 109: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,433 INFO L273 TraceCheckUtils]: 110: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,433 INFO L273 TraceCheckUtils]: 111: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,433 INFO L273 TraceCheckUtils]: 112: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,433 INFO L273 TraceCheckUtils]: 113: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,433 INFO L273 TraceCheckUtils]: 114: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,433 INFO L273 TraceCheckUtils]: 115: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,433 INFO L273 TraceCheckUtils]: 116: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,433 INFO L273 TraceCheckUtils]: 117: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,434 INFO L273 TraceCheckUtils]: 118: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,434 INFO L273 TraceCheckUtils]: 119: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,434 INFO L273 TraceCheckUtils]: 120: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,434 INFO L273 TraceCheckUtils]: 121: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,434 INFO L273 TraceCheckUtils]: 122: Hoare triple {27541#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27541#true} is VALID [2018-11-23 12:28:49,434 INFO L273 TraceCheckUtils]: 123: Hoare triple {27541#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27541#true} is VALID [2018-11-23 12:28:49,434 INFO L273 TraceCheckUtils]: 124: Hoare triple {27541#true} assume !(~i~0 < 100000); {27541#true} is VALID [2018-11-23 12:28:49,434 INFO L273 TraceCheckUtils]: 125: Hoare triple {27541#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {27541#true} is VALID [2018-11-23 12:28:49,434 INFO L273 TraceCheckUtils]: 126: Hoare triple {27541#true} assume true; {27541#true} is VALID [2018-11-23 12:28:49,434 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27541#true} {27541#true} #72#return; {27541#true} is VALID [2018-11-23 12:28:49,435 INFO L273 TraceCheckUtils]: 128: Hoare triple {27541#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; {27965#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:49,435 INFO L273 TraceCheckUtils]: 129: Hoare triple {27965#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27965#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:49,436 INFO L273 TraceCheckUtils]: 130: Hoare triple {27965#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27972#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:49,436 INFO L273 TraceCheckUtils]: 131: Hoare triple {27972#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27972#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:49,437 INFO L273 TraceCheckUtils]: 132: Hoare triple {27972#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27979#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:49,437 INFO L273 TraceCheckUtils]: 133: Hoare triple {27979#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27979#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:49,438 INFO L273 TraceCheckUtils]: 134: Hoare triple {27979#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27986#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:49,438 INFO L273 TraceCheckUtils]: 135: Hoare triple {27986#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27986#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:49,439 INFO L273 TraceCheckUtils]: 136: Hoare triple {27986#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27993#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:49,440 INFO L273 TraceCheckUtils]: 137: Hoare triple {27993#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27993#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:49,440 INFO L273 TraceCheckUtils]: 138: Hoare triple {27993#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28000#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:49,441 INFO L273 TraceCheckUtils]: 139: Hoare triple {28000#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28000#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:49,441 INFO L273 TraceCheckUtils]: 140: Hoare triple {28000#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28007#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:49,442 INFO L273 TraceCheckUtils]: 141: Hoare triple {28007#(<= main_~i~2 6)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28007#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:49,443 INFO L273 TraceCheckUtils]: 142: Hoare triple {28007#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28014#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:49,443 INFO L273 TraceCheckUtils]: 143: Hoare triple {28014#(<= main_~i~2 7)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28014#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:49,444 INFO L273 TraceCheckUtils]: 144: Hoare triple {28014#(<= main_~i~2 7)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28021#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:49,444 INFO L273 TraceCheckUtils]: 145: Hoare triple {28021#(<= main_~i~2 8)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28021#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:49,445 INFO L273 TraceCheckUtils]: 146: Hoare triple {28021#(<= main_~i~2 8)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28028#(<= main_~i~2 9)} is VALID [2018-11-23 12:28:49,446 INFO L273 TraceCheckUtils]: 147: Hoare triple {28028#(<= main_~i~2 9)} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28028#(<= main_~i~2 9)} is VALID [2018-11-23 12:28:49,447 INFO L273 TraceCheckUtils]: 148: Hoare triple {28028#(<= main_~i~2 9)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28035#(<= main_~i~2 10)} is VALID [2018-11-23 12:28:49,447 INFO L273 TraceCheckUtils]: 149: Hoare triple {28035#(<= main_~i~2 10)} assume !(~i~2 < 99999); {27542#false} is VALID [2018-11-23 12:28:49,447 INFO L273 TraceCheckUtils]: 150: Hoare triple {27542#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {27542#false} is VALID [2018-11-23 12:28:49,448 INFO L256 TraceCheckUtils]: 151: Hoare triple {27542#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {27542#false} is VALID [2018-11-23 12:28:49,448 INFO L273 TraceCheckUtils]: 152: Hoare triple {27542#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27542#false} is VALID [2018-11-23 12:28:49,448 INFO L273 TraceCheckUtils]: 153: Hoare triple {27542#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27542#false} is VALID [2018-11-23 12:28:49,448 INFO L273 TraceCheckUtils]: 154: Hoare triple {27542#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27542#false} is VALID [2018-11-23 12:28:49,448 INFO L273 TraceCheckUtils]: 155: Hoare triple {27542#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27542#false} is VALID [2018-11-23 12:28:49,448 INFO L273 TraceCheckUtils]: 156: Hoare triple {27542#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27542#false} is VALID [2018-11-23 12:28:49,449 INFO L273 TraceCheckUtils]: 157: Hoare triple {27542#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27542#false} is VALID [2018-11-23 12:28:49,449 INFO L273 TraceCheckUtils]: 158: Hoare triple {27542#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27542#false} is VALID [2018-11-23 12:28:49,449 INFO L273 TraceCheckUtils]: 159: Hoare triple {27542#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27542#false} is VALID [2018-11-23 12:28:49,449 INFO L273 TraceCheckUtils]: 160: Hoare triple {27542#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27542#false} is VALID [2018-11-23 12:28:49,449 INFO L273 TraceCheckUtils]: 161: Hoare triple {27542#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27542#false} is VALID [2018-11-23 12:28:49,450 INFO L273 TraceCheckUtils]: 162: Hoare triple {27542#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27542#false} is VALID [2018-11-23 12:28:49,450 INFO L273 TraceCheckUtils]: 163: Hoare triple {27542#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27542#false} is VALID [2018-11-23 12:28:49,450 INFO L273 TraceCheckUtils]: 164: Hoare triple {27542#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27542#false} is VALID [2018-11-23 12:28:49,450 INFO L273 TraceCheckUtils]: 165: Hoare triple {27542#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27542#false} is VALID [2018-11-23 12:28:49,450 INFO L273 TraceCheckUtils]: 166: Hoare triple {27542#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27542#false} is VALID [2018-11-23 12:28:49,450 INFO L273 TraceCheckUtils]: 167: Hoare triple {27542#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27542#false} is VALID [2018-11-23 12:28:49,450 INFO L273 TraceCheckUtils]: 168: Hoare triple {27542#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27542#false} is VALID [2018-11-23 12:28:49,450 INFO L273 TraceCheckUtils]: 169: Hoare triple {27542#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27542#false} is VALID [2018-11-23 12:28:49,450 INFO L273 TraceCheckUtils]: 170: Hoare triple {27542#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27542#false} is VALID [2018-11-23 12:28:49,451 INFO L273 TraceCheckUtils]: 171: Hoare triple {27542#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27542#false} is VALID [2018-11-23 12:28:49,451 INFO L273 TraceCheckUtils]: 172: Hoare triple {27542#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27542#false} is VALID [2018-11-23 12:28:49,451 INFO L273 TraceCheckUtils]: 173: Hoare triple {27542#false} assume !(~i~0 < 100000); {27542#false} is VALID [2018-11-23 12:28:49,451 INFO L273 TraceCheckUtils]: 174: Hoare triple {27542#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {27542#false} is VALID [2018-11-23 12:28:49,451 INFO L273 TraceCheckUtils]: 175: Hoare triple {27542#false} assume true; {27542#false} is VALID [2018-11-23 12:28:49,451 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27542#false} {27542#false} #74#return; {27542#false} is VALID [2018-11-23 12:28:49,451 INFO L273 TraceCheckUtils]: 177: Hoare triple {27542#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {27542#false} is VALID [2018-11-23 12:28:49,451 INFO L273 TraceCheckUtils]: 178: Hoare triple {27542#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {27542#false} is VALID [2018-11-23 12:28:49,451 INFO L273 TraceCheckUtils]: 179: Hoare triple {27542#false} assume !false; {27542#false} is VALID [2018-11-23 12:28:49,464 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:49,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:49,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2018-11-23 12:28:49,484 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:28:49,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:49,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:28:49,624 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:49,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:28:49,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:28:49,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:28:49,626 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2018-11-23 12:28:51,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:51,014 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-11-23 12:28:51,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:28:51,014 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:28:51,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:28:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:28:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:28:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:28:51,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 145 transitions. [2018-11-23 12:28:51,503 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:51,506 INFO L225 Difference]: With dead ends: 193 [2018-11-23 12:28:51,506 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 12:28:51,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:28:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 12:28:51,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-23 12:28:51,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:51,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 135 states. [2018-11-23 12:28:51,556 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 135 states. [2018-11-23 12:28:51,556 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 135 states. [2018-11-23 12:28:51,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:51,559 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:28:51,559 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:28:51,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:51,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:51,559 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 137 states. [2018-11-23 12:28:51,559 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 137 states. [2018-11-23 12:28:51,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:51,564 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:28:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:28:51,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:51,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:51,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:51,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:51,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 12:28:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-11-23 12:28:51,568 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2018-11-23 12:28:51,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:51,568 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-11-23 12:28:51,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:28:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-23 12:28:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 12:28:51,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:51,569 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:51,570 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:51,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1808612553, now seen corresponding path program 35 times [2018-11-23 12:28:51,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:51,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:51,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:51,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:51,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:52,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {28890#true} call ULTIMATE.init(); {28890#true} is VALID [2018-11-23 12:28:52,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {28890#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28890#true} is VALID [2018-11-23 12:28:52,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {28890#true} assume true; {28890#true} is VALID [2018-11-23 12:28:52,896 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28890#true} {28890#true} #66#return; {28890#true} is VALID [2018-11-23 12:28:52,896 INFO L256 TraceCheckUtils]: 4: Hoare triple {28890#true} call #t~ret12 := main(); {28890#true} is VALID [2018-11-23 12:28:52,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {28890#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {28892#(= main_~i~1 0)} is VALID [2018-11-23 12:28:52,897 INFO L273 TraceCheckUtils]: 6: Hoare triple {28892#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28892#(= main_~i~1 0)} is VALID [2018-11-23 12:28:52,898 INFO L273 TraceCheckUtils]: 7: Hoare triple {28892#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28893#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:52,899 INFO L273 TraceCheckUtils]: 8: Hoare triple {28893#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28893#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:52,899 INFO L273 TraceCheckUtils]: 9: Hoare triple {28893#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28894#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:52,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {28894#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28894#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:52,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {28894#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28895#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:52,901 INFO L273 TraceCheckUtils]: 12: Hoare triple {28895#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28895#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:52,902 INFO L273 TraceCheckUtils]: 13: Hoare triple {28895#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28896#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:52,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {28896#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28896#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:52,903 INFO L273 TraceCheckUtils]: 15: Hoare triple {28896#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28897#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:52,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {28897#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28897#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:52,904 INFO L273 TraceCheckUtils]: 17: Hoare triple {28897#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28898#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:52,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {28898#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28898#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:52,906 INFO L273 TraceCheckUtils]: 19: Hoare triple {28898#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28899#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:52,906 INFO L273 TraceCheckUtils]: 20: Hoare triple {28899#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28899#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:52,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {28899#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28900#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:52,907 INFO L273 TraceCheckUtils]: 22: Hoare triple {28900#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28900#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:52,908 INFO L273 TraceCheckUtils]: 23: Hoare triple {28900#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28901#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:52,908 INFO L273 TraceCheckUtils]: 24: Hoare triple {28901#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28901#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:52,909 INFO L273 TraceCheckUtils]: 25: Hoare triple {28901#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:52,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {28902#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:52,910 INFO L273 TraceCheckUtils]: 27: Hoare triple {28902#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28903#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:52,911 INFO L273 TraceCheckUtils]: 28: Hoare triple {28903#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28903#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:52,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {28903#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28904#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:52,912 INFO L273 TraceCheckUtils]: 30: Hoare triple {28904#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:28:52,913 INFO L273 TraceCheckUtils]: 31: Hoare triple {28904#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28905#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:52,913 INFO L273 TraceCheckUtils]: 32: Hoare triple {28905#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:28:52,914 INFO L273 TraceCheckUtils]: 33: Hoare triple {28905#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28906#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:52,915 INFO L273 TraceCheckUtils]: 34: Hoare triple {28906#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:28:52,915 INFO L273 TraceCheckUtils]: 35: Hoare triple {28906#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28907#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:52,916 INFO L273 TraceCheckUtils]: 36: Hoare triple {28907#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:28:52,917 INFO L273 TraceCheckUtils]: 37: Hoare triple {28907#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28908#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:52,917 INFO L273 TraceCheckUtils]: 38: Hoare triple {28908#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:28:52,918 INFO L273 TraceCheckUtils]: 39: Hoare triple {28908#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28909#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:52,918 INFO L273 TraceCheckUtils]: 40: Hoare triple {28909#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:28:52,919 INFO L273 TraceCheckUtils]: 41: Hoare triple {28909#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28910#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:52,920 INFO L273 TraceCheckUtils]: 42: Hoare triple {28910#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:28:52,920 INFO L273 TraceCheckUtils]: 43: Hoare triple {28910#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28911#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:52,921 INFO L273 TraceCheckUtils]: 44: Hoare triple {28911#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:28:52,921 INFO L273 TraceCheckUtils]: 45: Hoare triple {28911#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28912#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:52,922 INFO L273 TraceCheckUtils]: 46: Hoare triple {28912#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:28:52,923 INFO L273 TraceCheckUtils]: 47: Hoare triple {28912#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28913#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:52,923 INFO L273 TraceCheckUtils]: 48: Hoare triple {28913#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:28:52,924 INFO L273 TraceCheckUtils]: 49: Hoare triple {28913#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28914#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:52,924 INFO L273 TraceCheckUtils]: 50: Hoare triple {28914#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:28:52,925 INFO L273 TraceCheckUtils]: 51: Hoare triple {28914#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28915#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:52,926 INFO L273 TraceCheckUtils]: 52: Hoare triple {28915#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:28:52,926 INFO L273 TraceCheckUtils]: 53: Hoare triple {28915#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28916#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:52,927 INFO L273 TraceCheckUtils]: 54: Hoare triple {28916#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:28:52,928 INFO L273 TraceCheckUtils]: 55: Hoare triple {28916#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28917#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:52,928 INFO L273 TraceCheckUtils]: 56: Hoare triple {28917#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -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 25)} is VALID [2018-11-23 12:28:52,929 INFO L273 TraceCheckUtils]: 57: Hoare triple {28917#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28918#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:52,929 INFO L273 TraceCheckUtils]: 58: Hoare triple {28918#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -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 26)} is VALID [2018-11-23 12:28:52,930 INFO L273 TraceCheckUtils]: 59: Hoare triple {28918#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28919#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:52,931 INFO L273 TraceCheckUtils]: 60: Hoare triple {28919#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -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 27)} is VALID [2018-11-23 12:28:52,931 INFO L273 TraceCheckUtils]: 61: Hoare triple {28919#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28920#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:52,932 INFO L273 TraceCheckUtils]: 62: Hoare triple {28920#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -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 28)} is VALID [2018-11-23 12:28:52,933 INFO L273 TraceCheckUtils]: 63: Hoare triple {28920#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28921#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:52,933 INFO L273 TraceCheckUtils]: 64: Hoare triple {28921#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -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 29)} is VALID [2018-11-23 12:28:52,934 INFO L273 TraceCheckUtils]: 65: Hoare triple {28921#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28922#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:52,934 INFO L273 TraceCheckUtils]: 66: Hoare triple {28922#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -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 30)} is VALID [2018-11-23 12:28:52,935 INFO L273 TraceCheckUtils]: 67: Hoare triple {28922#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28923#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:52,936 INFO L273 TraceCheckUtils]: 68: Hoare triple {28923#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -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 31)} is VALID [2018-11-23 12:28:52,936 INFO L273 TraceCheckUtils]: 69: Hoare triple {28923#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28924#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:52,937 INFO L273 TraceCheckUtils]: 70: Hoare triple {28924#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -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 32)} is VALID [2018-11-23 12:28:52,938 INFO L273 TraceCheckUtils]: 71: Hoare triple {28924#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28925#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:52,938 INFO L273 TraceCheckUtils]: 72: Hoare triple {28925#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -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 33)} is VALID [2018-11-23 12:28:52,939 INFO L273 TraceCheckUtils]: 73: Hoare triple {28925#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28926#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:52,939 INFO L273 TraceCheckUtils]: 74: Hoare triple {28926#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -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 34)} is VALID [2018-11-23 12:28:52,940 INFO L273 TraceCheckUtils]: 75: Hoare triple {28926#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28927#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:52,941 INFO L273 TraceCheckUtils]: 76: Hoare triple {28927#(<= main_~i~1 35)} assume !(~i~1 < 100000); {28891#false} is VALID [2018-11-23 12:28:52,941 INFO L256 TraceCheckUtils]: 77: Hoare triple {28891#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {28890#true} is VALID [2018-11-23 12:28:52,941 INFO L273 TraceCheckUtils]: 78: Hoare triple {28890#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28890#true} is VALID [2018-11-23 12:28:52,941 INFO L273 TraceCheckUtils]: 79: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,941 INFO L273 TraceCheckUtils]: 80: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,942 INFO L273 TraceCheckUtils]: 81: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,942 INFO L273 TraceCheckUtils]: 82: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,942 INFO L273 TraceCheckUtils]: 83: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,942 INFO L273 TraceCheckUtils]: 84: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,942 INFO L273 TraceCheckUtils]: 85: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,942 INFO L273 TraceCheckUtils]: 86: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,943 INFO L273 TraceCheckUtils]: 87: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,943 INFO L273 TraceCheckUtils]: 88: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,943 INFO L273 TraceCheckUtils]: 89: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,943 INFO L273 TraceCheckUtils]: 90: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,943 INFO L273 TraceCheckUtils]: 91: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,943 INFO L273 TraceCheckUtils]: 92: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,944 INFO L273 TraceCheckUtils]: 93: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,944 INFO L273 TraceCheckUtils]: 94: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,944 INFO L273 TraceCheckUtils]: 95: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,944 INFO L273 TraceCheckUtils]: 96: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,944 INFO L273 TraceCheckUtils]: 97: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,944 INFO L273 TraceCheckUtils]: 98: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,944 INFO L273 TraceCheckUtils]: 99: Hoare triple {28890#true} assume !(~i~0 < 100000); {28890#true} is VALID [2018-11-23 12:28:52,944 INFO L273 TraceCheckUtils]: 100: Hoare triple {28890#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {28890#true} is VALID [2018-11-23 12:28:52,944 INFO L273 TraceCheckUtils]: 101: Hoare triple {28890#true} assume true; {28890#true} is VALID [2018-11-23 12:28:52,944 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28890#true} {28891#false} #70#return; {28891#false} is VALID [2018-11-23 12:28:52,945 INFO L273 TraceCheckUtils]: 103: Hoare triple {28891#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); {28891#false} is VALID [2018-11-23 12:28:52,945 INFO L256 TraceCheckUtils]: 104: Hoare triple {28891#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {28890#true} is VALID [2018-11-23 12:28:52,945 INFO L273 TraceCheckUtils]: 105: Hoare triple {28890#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28890#true} is VALID [2018-11-23 12:28:52,945 INFO L273 TraceCheckUtils]: 106: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,945 INFO L273 TraceCheckUtils]: 107: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,945 INFO L273 TraceCheckUtils]: 108: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,945 INFO L273 TraceCheckUtils]: 109: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,945 INFO L273 TraceCheckUtils]: 110: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,945 INFO L273 TraceCheckUtils]: 111: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,946 INFO L273 TraceCheckUtils]: 112: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,946 INFO L273 TraceCheckUtils]: 113: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,946 INFO L273 TraceCheckUtils]: 114: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,946 INFO L273 TraceCheckUtils]: 115: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,946 INFO L273 TraceCheckUtils]: 116: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,946 INFO L273 TraceCheckUtils]: 117: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,946 INFO L273 TraceCheckUtils]: 118: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,946 INFO L273 TraceCheckUtils]: 119: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,946 INFO L273 TraceCheckUtils]: 120: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,946 INFO L273 TraceCheckUtils]: 121: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,947 INFO L273 TraceCheckUtils]: 122: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,947 INFO L273 TraceCheckUtils]: 123: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,947 INFO L273 TraceCheckUtils]: 124: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,947 INFO L273 TraceCheckUtils]: 125: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,947 INFO L273 TraceCheckUtils]: 126: Hoare triple {28890#true} assume !(~i~0 < 100000); {28890#true} is VALID [2018-11-23 12:28:52,947 INFO L273 TraceCheckUtils]: 127: Hoare triple {28890#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {28890#true} is VALID [2018-11-23 12:28:52,947 INFO L273 TraceCheckUtils]: 128: Hoare triple {28890#true} assume true; {28890#true} is VALID [2018-11-23 12:28:52,947 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28890#true} {28891#false} #72#return; {28891#false} is VALID [2018-11-23 12:28:52,947 INFO L273 TraceCheckUtils]: 130: Hoare triple {28891#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; {28891#false} is VALID [2018-11-23 12:28:52,947 INFO L273 TraceCheckUtils]: 131: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:28:52,948 INFO L273 TraceCheckUtils]: 132: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:28:52,948 INFO L273 TraceCheckUtils]: 133: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:28:52,948 INFO L273 TraceCheckUtils]: 134: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:28:52,948 INFO L273 TraceCheckUtils]: 135: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:28:52,948 INFO L273 TraceCheckUtils]: 136: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:28:52,948 INFO L273 TraceCheckUtils]: 137: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:28:52,948 INFO L273 TraceCheckUtils]: 138: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:28:52,948 INFO L273 TraceCheckUtils]: 139: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:28:52,948 INFO L273 TraceCheckUtils]: 140: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:28:52,949 INFO L273 TraceCheckUtils]: 141: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:28:52,949 INFO L273 TraceCheckUtils]: 142: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:28:52,949 INFO L273 TraceCheckUtils]: 143: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:28:52,949 INFO L273 TraceCheckUtils]: 144: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:28:52,949 INFO L273 TraceCheckUtils]: 145: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:28:52,949 INFO L273 TraceCheckUtils]: 146: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:28:52,949 INFO L273 TraceCheckUtils]: 147: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:28:52,949 INFO L273 TraceCheckUtils]: 148: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:28:52,949 INFO L273 TraceCheckUtils]: 149: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:28:52,949 INFO L273 TraceCheckUtils]: 150: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:28:52,950 INFO L273 TraceCheckUtils]: 151: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:28:52,950 INFO L273 TraceCheckUtils]: 152: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:28:52,950 INFO L273 TraceCheckUtils]: 153: Hoare triple {28891#false} assume !(~i~2 < 99999); {28891#false} is VALID [2018-11-23 12:28:52,950 INFO L273 TraceCheckUtils]: 154: Hoare triple {28891#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {28891#false} is VALID [2018-11-23 12:28:52,950 INFO L256 TraceCheckUtils]: 155: Hoare triple {28891#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {28890#true} is VALID [2018-11-23 12:28:52,950 INFO L273 TraceCheckUtils]: 156: Hoare triple {28890#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28890#true} is VALID [2018-11-23 12:28:52,950 INFO L273 TraceCheckUtils]: 157: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,950 INFO L273 TraceCheckUtils]: 158: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,950 INFO L273 TraceCheckUtils]: 159: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,950 INFO L273 TraceCheckUtils]: 160: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,951 INFO L273 TraceCheckUtils]: 161: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,951 INFO L273 TraceCheckUtils]: 162: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,951 INFO L273 TraceCheckUtils]: 163: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,951 INFO L273 TraceCheckUtils]: 164: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,951 INFO L273 TraceCheckUtils]: 165: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,951 INFO L273 TraceCheckUtils]: 166: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,951 INFO L273 TraceCheckUtils]: 167: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,951 INFO L273 TraceCheckUtils]: 168: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,951 INFO L273 TraceCheckUtils]: 169: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,951 INFO L273 TraceCheckUtils]: 170: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,952 INFO L273 TraceCheckUtils]: 171: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,952 INFO L273 TraceCheckUtils]: 172: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,952 INFO L273 TraceCheckUtils]: 173: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,952 INFO L273 TraceCheckUtils]: 174: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,952 INFO L273 TraceCheckUtils]: 175: Hoare triple {28890#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28890#true} is VALID [2018-11-23 12:28:52,952 INFO L273 TraceCheckUtils]: 176: Hoare triple {28890#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28890#true} is VALID [2018-11-23 12:28:52,952 INFO L273 TraceCheckUtils]: 177: Hoare triple {28890#true} assume !(~i~0 < 100000); {28890#true} is VALID [2018-11-23 12:28:52,952 INFO L273 TraceCheckUtils]: 178: Hoare triple {28890#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {28890#true} is VALID [2018-11-23 12:28:52,952 INFO L273 TraceCheckUtils]: 179: Hoare triple {28890#true} assume true; {28890#true} is VALID [2018-11-23 12:28:52,953 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28890#true} {28891#false} #74#return; {28891#false} is VALID [2018-11-23 12:28:52,953 INFO L273 TraceCheckUtils]: 181: Hoare triple {28891#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {28891#false} is VALID [2018-11-23 12:28:52,953 INFO L273 TraceCheckUtils]: 182: Hoare triple {28891#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {28891#false} is VALID [2018-11-23 12:28:52,953 INFO L273 TraceCheckUtils]: 183: Hoare triple {28891#false} assume !false; {28891#false} is VALID [2018-11-23 12:28:52,968 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:52,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:52,968 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:52,977 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:29:52,693 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2018-11-23 12:29:52,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:52,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:53,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {28890#true} call ULTIMATE.init(); {28890#true} is VALID [2018-11-23 12:29:53,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {28890#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28890#true} is VALID [2018-11-23 12:29:53,165 INFO L273 TraceCheckUtils]: 2: Hoare triple {28890#true} assume true; {28890#true} is VALID [2018-11-23 12:29:53,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28890#true} {28890#true} #66#return; {28890#true} is VALID [2018-11-23 12:29:53,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {28890#true} call #t~ret12 := main(); {28890#true} is VALID [2018-11-23 12:29:53,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {28890#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {28890#true} is VALID [2018-11-23 12:29:53,166 INFO L273 TraceCheckUtils]: 6: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 13: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 14: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 16: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 17: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,167 INFO L273 TraceCheckUtils]: 18: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 19: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 20: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 21: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 22: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 23: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 24: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 25: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 26: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 27: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,168 INFO L273 TraceCheckUtils]: 28: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 29: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 30: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 31: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 32: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 33: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 34: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 35: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 36: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 37: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,169 INFO L273 TraceCheckUtils]: 38: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 39: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 40: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 41: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 42: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 43: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 44: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 45: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 46: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,170 INFO L273 TraceCheckUtils]: 47: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 48: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 49: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 50: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 51: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 52: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 53: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 54: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 55: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 56: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,171 INFO L273 TraceCheckUtils]: 57: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 58: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 59: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 60: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 61: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 62: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 63: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 64: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 65: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,172 INFO L273 TraceCheckUtils]: 66: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,173 INFO L273 TraceCheckUtils]: 67: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,173 INFO L273 TraceCheckUtils]: 68: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,173 INFO L273 TraceCheckUtils]: 69: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,173 INFO L273 TraceCheckUtils]: 70: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,173 INFO L273 TraceCheckUtils]: 71: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,173 INFO L273 TraceCheckUtils]: 72: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,173 INFO L273 TraceCheckUtils]: 73: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,173 INFO L273 TraceCheckUtils]: 74: Hoare triple {28890#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28890#true} is VALID [2018-11-23 12:29:53,173 INFO L273 TraceCheckUtils]: 75: Hoare triple {28890#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28890#true} is VALID [2018-11-23 12:29:53,173 INFO L273 TraceCheckUtils]: 76: Hoare triple {28890#true} assume !(~i~1 < 100000); {28890#true} is VALID [2018-11-23 12:29:53,174 INFO L256 TraceCheckUtils]: 77: Hoare triple {28890#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {28890#true} is VALID [2018-11-23 12:29:53,174 INFO L273 TraceCheckUtils]: 78: Hoare triple {28890#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {29165#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:29:53,174 INFO L273 TraceCheckUtils]: 79: Hoare triple {29165#(<= mapavg_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29165#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:29:53,175 INFO L273 TraceCheckUtils]: 80: Hoare triple {29165#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29172#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:29:53,175 INFO L273 TraceCheckUtils]: 81: Hoare triple {29172#(<= mapavg_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29172#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:29:53,176 INFO L273 TraceCheckUtils]: 82: Hoare triple {29172#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29179#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:29:53,176 INFO L273 TraceCheckUtils]: 83: Hoare triple {29179#(<= mapavg_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29179#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:29:53,176 INFO L273 TraceCheckUtils]: 84: Hoare triple {29179#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29186#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:29:53,177 INFO L273 TraceCheckUtils]: 85: Hoare triple {29186#(<= mapavg_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29186#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:29:53,178 INFO L273 TraceCheckUtils]: 86: Hoare triple {29186#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29193#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:29:53,178 INFO L273 TraceCheckUtils]: 87: Hoare triple {29193#(<= mapavg_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29193#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:29:53,179 INFO L273 TraceCheckUtils]: 88: Hoare triple {29193#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29200#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:29:53,179 INFO L273 TraceCheckUtils]: 89: Hoare triple {29200#(<= mapavg_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29200#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:29:53,180 INFO L273 TraceCheckUtils]: 90: Hoare triple {29200#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29207#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:29:53,181 INFO L273 TraceCheckUtils]: 91: Hoare triple {29207#(<= mapavg_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29207#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:29:53,181 INFO L273 TraceCheckUtils]: 92: Hoare triple {29207#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29214#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:29:53,182 INFO L273 TraceCheckUtils]: 93: Hoare triple {29214#(<= mapavg_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29214#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:29:53,183 INFO L273 TraceCheckUtils]: 94: Hoare triple {29214#(<= mapavg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29221#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:29:53,183 INFO L273 TraceCheckUtils]: 95: Hoare triple {29221#(<= mapavg_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29221#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:29:53,184 INFO L273 TraceCheckUtils]: 96: Hoare triple {29221#(<= mapavg_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29228#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:29:53,184 INFO L273 TraceCheckUtils]: 97: Hoare triple {29228#(<= mapavg_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29228#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:29:53,185 INFO L273 TraceCheckUtils]: 98: Hoare triple {29228#(<= mapavg_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29235#(<= mapavg_~i~0 10)} is VALID [2018-11-23 12:29:53,186 INFO L273 TraceCheckUtils]: 99: Hoare triple {29235#(<= mapavg_~i~0 10)} assume !(~i~0 < 100000); {28891#false} is VALID [2018-11-23 12:29:53,186 INFO L273 TraceCheckUtils]: 100: Hoare triple {28891#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {28891#false} is VALID [2018-11-23 12:29:53,186 INFO L273 TraceCheckUtils]: 101: Hoare triple {28891#false} assume true; {28891#false} is VALID [2018-11-23 12:29:53,186 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28891#false} {28890#true} #70#return; {28891#false} is VALID [2018-11-23 12:29:53,186 INFO L273 TraceCheckUtils]: 103: Hoare triple {28891#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); {28891#false} is VALID [2018-11-23 12:29:53,187 INFO L256 TraceCheckUtils]: 104: Hoare triple {28891#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {28891#false} is VALID [2018-11-23 12:29:53,187 INFO L273 TraceCheckUtils]: 105: Hoare triple {28891#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28891#false} is VALID [2018-11-23 12:29:53,187 INFO L273 TraceCheckUtils]: 106: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,187 INFO L273 TraceCheckUtils]: 107: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,187 INFO L273 TraceCheckUtils]: 108: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,188 INFO L273 TraceCheckUtils]: 109: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,188 INFO L273 TraceCheckUtils]: 110: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,188 INFO L273 TraceCheckUtils]: 111: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,188 INFO L273 TraceCheckUtils]: 112: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,188 INFO L273 TraceCheckUtils]: 113: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,188 INFO L273 TraceCheckUtils]: 114: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,189 INFO L273 TraceCheckUtils]: 115: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,189 INFO L273 TraceCheckUtils]: 116: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,189 INFO L273 TraceCheckUtils]: 117: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,189 INFO L273 TraceCheckUtils]: 118: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,189 INFO L273 TraceCheckUtils]: 119: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,189 INFO L273 TraceCheckUtils]: 120: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 121: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 122: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 123: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 124: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 125: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,190 INFO L273 TraceCheckUtils]: 126: Hoare triple {28891#false} assume !(~i~0 < 100000); {28891#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 127: Hoare triple {28891#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {28891#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 128: Hoare triple {28891#false} assume true; {28891#false} is VALID [2018-11-23 12:29:53,191 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28891#false} {28891#false} #72#return; {28891#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 130: Hoare triple {28891#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; {28891#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 131: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 132: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 133: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 134: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 135: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:29:53,191 INFO L273 TraceCheckUtils]: 136: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 137: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 138: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 139: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 140: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 141: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 142: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 143: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 144: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:29:53,192 INFO L273 TraceCheckUtils]: 145: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 146: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 147: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 148: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 149: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 150: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 151: Hoare triple {28891#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28891#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 152: Hoare triple {28891#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28891#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 153: Hoare triple {28891#false} assume !(~i~2 < 99999); {28891#false} is VALID [2018-11-23 12:29:53,193 INFO L273 TraceCheckUtils]: 154: Hoare triple {28891#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {28891#false} is VALID [2018-11-23 12:29:53,193 INFO L256 TraceCheckUtils]: 155: Hoare triple {28891#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {28891#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 156: Hoare triple {28891#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28891#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 157: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 158: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 159: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 160: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 161: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 162: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 163: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,194 INFO L273 TraceCheckUtils]: 164: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,195 INFO L273 TraceCheckUtils]: 165: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,195 INFO L273 TraceCheckUtils]: 166: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,195 INFO L273 TraceCheckUtils]: 167: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,195 INFO L273 TraceCheckUtils]: 168: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,195 INFO L273 TraceCheckUtils]: 169: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,195 INFO L273 TraceCheckUtils]: 170: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,195 INFO L273 TraceCheckUtils]: 171: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,195 INFO L273 TraceCheckUtils]: 172: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,195 INFO L273 TraceCheckUtils]: 173: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,195 INFO L273 TraceCheckUtils]: 174: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,196 INFO L273 TraceCheckUtils]: 175: Hoare triple {28891#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28891#false} is VALID [2018-11-23 12:29:53,196 INFO L273 TraceCheckUtils]: 176: Hoare triple {28891#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28891#false} is VALID [2018-11-23 12:29:53,196 INFO L273 TraceCheckUtils]: 177: Hoare triple {28891#false} assume !(~i~0 < 100000); {28891#false} is VALID [2018-11-23 12:29:53,196 INFO L273 TraceCheckUtils]: 178: Hoare triple {28891#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {28891#false} is VALID [2018-11-23 12:29:53,196 INFO L273 TraceCheckUtils]: 179: Hoare triple {28891#false} assume true; {28891#false} is VALID [2018-11-23 12:29:53,196 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28891#false} {28891#false} #74#return; {28891#false} is VALID [2018-11-23 12:29:53,196 INFO L273 TraceCheckUtils]: 181: Hoare triple {28891#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {28891#false} is VALID [2018-11-23 12:29:53,196 INFO L273 TraceCheckUtils]: 182: Hoare triple {28891#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {28891#false} is VALID [2018-11-23 12:29:53,196 INFO L273 TraceCheckUtils]: 183: Hoare triple {28891#false} assume !false; {28891#false} is VALID [2018-11-23 12:29:53,209 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,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:53,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2018-11-23 12:29:53,239 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:29:53,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:53,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:29:53,377 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,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:29:53,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:29:53,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:29:53,379 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2018-11-23 12:29:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:54,737 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2018-11-23 12:29:54,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:29:54,737 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:29:54,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:29:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:29:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:29:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:29:54,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 150 transitions. [2018-11-23 12:29:54,896 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,899 INFO L225 Difference]: With dead ends: 199 [2018-11-23 12:29:54,899 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 12:29:54,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:29:54,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 12:29:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-23 12:29:54,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:54,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 139 states. [2018-11-23 12:29:54,957 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 139 states. [2018-11-23 12:29:54,957 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 139 states. [2018-11-23 12:29:54,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:54,960 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:29:54,960 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:29:54,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:54,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:54,960 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 141 states. [2018-11-23 12:29:54,960 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 141 states. [2018-11-23 12:29:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:54,963 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:29:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:29:54,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:54,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:54,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:54,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 12:29:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2018-11-23 12:29:54,967 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2018-11-23 12:29:54,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:54,967 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2018-11-23 12:29:54,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:29:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:29:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-23 12:29:54,968 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:54,969 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,969 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:54,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:54,969 INFO L82 PathProgramCache]: Analyzing trace with hash 822690679, now seen corresponding path program 36 times [2018-11-23 12:29:54,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:54,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:54,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:54,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:54,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:55,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {30275#true} call ULTIMATE.init(); {30275#true} is VALID [2018-11-23 12:29:55,783 INFO L273 TraceCheckUtils]: 1: Hoare triple {30275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30275#true} is VALID [2018-11-23 12:29:55,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {30275#true} assume true; {30275#true} is VALID [2018-11-23 12:29:55,784 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30275#true} {30275#true} #66#return; {30275#true} is VALID [2018-11-23 12:29:55,784 INFO L256 TraceCheckUtils]: 4: Hoare triple {30275#true} call #t~ret12 := main(); {30275#true} is VALID [2018-11-23 12:29:55,784 INFO L273 TraceCheckUtils]: 5: Hoare triple {30275#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30277#(= main_~i~1 0)} is VALID [2018-11-23 12:29:55,785 INFO L273 TraceCheckUtils]: 6: Hoare triple {30277#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30277#(= main_~i~1 0)} is VALID [2018-11-23 12:29:55,786 INFO L273 TraceCheckUtils]: 7: Hoare triple {30277#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30278#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:55,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {30278#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30278#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:55,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {30278#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30279#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:55,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {30279#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30279#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:55,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {30279#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30280#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:55,789 INFO L273 TraceCheckUtils]: 12: Hoare triple {30280#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30280#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:55,789 INFO L273 TraceCheckUtils]: 13: Hoare triple {30280#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30281#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:55,790 INFO L273 TraceCheckUtils]: 14: Hoare triple {30281#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30281#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:55,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {30281#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30282#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:55,791 INFO L273 TraceCheckUtils]: 16: Hoare triple {30282#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30282#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:55,792 INFO L273 TraceCheckUtils]: 17: Hoare triple {30282#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30283#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:55,792 INFO L273 TraceCheckUtils]: 18: Hoare triple {30283#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30283#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:55,793 INFO L273 TraceCheckUtils]: 19: Hoare triple {30283#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30284#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:55,793 INFO L273 TraceCheckUtils]: 20: Hoare triple {30284#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30284#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:55,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {30284#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30285#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:55,794 INFO L273 TraceCheckUtils]: 22: Hoare triple {30285#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30285#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:55,795 INFO L273 TraceCheckUtils]: 23: Hoare triple {30285#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30286#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:55,795 INFO L273 TraceCheckUtils]: 24: Hoare triple {30286#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30286#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:55,795 INFO L273 TraceCheckUtils]: 25: Hoare triple {30286#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:55,796 INFO L273 TraceCheckUtils]: 26: Hoare triple {30287#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -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#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:55,797 INFO L273 TraceCheckUtils]: 27: Hoare triple {30287#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30288#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:55,797 INFO L273 TraceCheckUtils]: 28: Hoare triple {30288#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30288#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:55,798 INFO L273 TraceCheckUtils]: 29: Hoare triple {30288#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30289#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:55,798 INFO L273 TraceCheckUtils]: 30: Hoare triple {30289#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -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 12)} is VALID [2018-11-23 12:29:55,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {30289#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30290#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:55,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {30290#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -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 13)} is VALID [2018-11-23 12:29:55,800 INFO L273 TraceCheckUtils]: 33: Hoare triple {30290#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30291#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:55,801 INFO L273 TraceCheckUtils]: 34: Hoare triple {30291#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -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 14)} is VALID [2018-11-23 12:29:55,801 INFO L273 TraceCheckUtils]: 35: Hoare triple {30291#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30292#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:55,802 INFO L273 TraceCheckUtils]: 36: Hoare triple {30292#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -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 15)} is VALID [2018-11-23 12:29:55,803 INFO L273 TraceCheckUtils]: 37: Hoare triple {30292#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30293#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:55,803 INFO L273 TraceCheckUtils]: 38: Hoare triple {30293#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -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 16)} is VALID [2018-11-23 12:29:55,804 INFO L273 TraceCheckUtils]: 39: Hoare triple {30293#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30294#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:55,804 INFO L273 TraceCheckUtils]: 40: Hoare triple {30294#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -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 17)} is VALID [2018-11-23 12:29:55,805 INFO L273 TraceCheckUtils]: 41: Hoare triple {30294#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30295#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:55,806 INFO L273 TraceCheckUtils]: 42: Hoare triple {30295#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -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 18)} is VALID [2018-11-23 12:29:55,806 INFO L273 TraceCheckUtils]: 43: Hoare triple {30295#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30296#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:55,807 INFO L273 TraceCheckUtils]: 44: Hoare triple {30296#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -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 19)} is VALID [2018-11-23 12:29:55,808 INFO L273 TraceCheckUtils]: 45: Hoare triple {30296#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30297#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:55,808 INFO L273 TraceCheckUtils]: 46: Hoare triple {30297#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -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 20)} is VALID [2018-11-23 12:29:55,809 INFO L273 TraceCheckUtils]: 47: Hoare triple {30297#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30298#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:55,809 INFO L273 TraceCheckUtils]: 48: Hoare triple {30298#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -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 21)} is VALID [2018-11-23 12:29:55,810 INFO L273 TraceCheckUtils]: 49: Hoare triple {30298#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30299#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:55,811 INFO L273 TraceCheckUtils]: 50: Hoare triple {30299#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -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 22)} is VALID [2018-11-23 12:29:55,811 INFO L273 TraceCheckUtils]: 51: Hoare triple {30299#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30300#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:55,812 INFO L273 TraceCheckUtils]: 52: Hoare triple {30300#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -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 23)} is VALID [2018-11-23 12:29:55,813 INFO L273 TraceCheckUtils]: 53: Hoare triple {30300#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30301#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:55,813 INFO L273 TraceCheckUtils]: 54: Hoare triple {30301#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -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 24)} is VALID [2018-11-23 12:29:55,814 INFO L273 TraceCheckUtils]: 55: Hoare triple {30301#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30302#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:55,814 INFO L273 TraceCheckUtils]: 56: Hoare triple {30302#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -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 25)} is VALID [2018-11-23 12:29:55,815 INFO L273 TraceCheckUtils]: 57: Hoare triple {30302#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30303#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:55,816 INFO L273 TraceCheckUtils]: 58: Hoare triple {30303#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -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 26)} is VALID [2018-11-23 12:29:55,816 INFO L273 TraceCheckUtils]: 59: Hoare triple {30303#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30304#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:55,817 INFO L273 TraceCheckUtils]: 60: Hoare triple {30304#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -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 27)} is VALID [2018-11-23 12:29:55,817 INFO L273 TraceCheckUtils]: 61: Hoare triple {30304#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30305#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:55,818 INFO L273 TraceCheckUtils]: 62: Hoare triple {30305#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -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 28)} is VALID [2018-11-23 12:29:55,819 INFO L273 TraceCheckUtils]: 63: Hoare triple {30305#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30306#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:55,819 INFO L273 TraceCheckUtils]: 64: Hoare triple {30306#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -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 29)} is VALID [2018-11-23 12:29:55,820 INFO L273 TraceCheckUtils]: 65: Hoare triple {30306#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30307#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:55,820 INFO L273 TraceCheckUtils]: 66: Hoare triple {30307#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -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 30)} is VALID [2018-11-23 12:29:55,821 INFO L273 TraceCheckUtils]: 67: Hoare triple {30307#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30308#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:55,822 INFO L273 TraceCheckUtils]: 68: Hoare triple {30308#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -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 31)} is VALID [2018-11-23 12:29:55,822 INFO L273 TraceCheckUtils]: 69: Hoare triple {30308#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30309#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:55,822 INFO L273 TraceCheckUtils]: 70: Hoare triple {30309#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -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 32)} is VALID [2018-11-23 12:29:55,823 INFO L273 TraceCheckUtils]: 71: Hoare triple {30309#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30310#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:55,823 INFO L273 TraceCheckUtils]: 72: Hoare triple {30310#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -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 33)} is VALID [2018-11-23 12:29:55,823 INFO L273 TraceCheckUtils]: 73: Hoare triple {30310#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30311#(<= main_~i~1 34)} is VALID [2018-11-23 12:29:55,824 INFO L273 TraceCheckUtils]: 74: Hoare triple {30311#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -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 34)} is VALID [2018-11-23 12:29:55,824 INFO L273 TraceCheckUtils]: 75: Hoare triple {30311#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30312#(<= main_~i~1 35)} is VALID [2018-11-23 12:29:55,825 INFO L273 TraceCheckUtils]: 76: Hoare triple {30312#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -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 35)} is VALID [2018-11-23 12:29:55,825 INFO L273 TraceCheckUtils]: 77: Hoare triple {30312#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30313#(<= main_~i~1 36)} is VALID [2018-11-23 12:29:55,826 INFO L273 TraceCheckUtils]: 78: Hoare triple {30313#(<= main_~i~1 36)} assume !(~i~1 < 100000); {30276#false} is VALID [2018-11-23 12:29:55,826 INFO L256 TraceCheckUtils]: 79: Hoare triple {30276#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {30275#true} is VALID [2018-11-23 12:29:55,826 INFO L273 TraceCheckUtils]: 80: Hoare triple {30275#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30275#true} is VALID [2018-11-23 12:29:55,826 INFO L273 TraceCheckUtils]: 81: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,827 INFO L273 TraceCheckUtils]: 82: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,827 INFO L273 TraceCheckUtils]: 83: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,827 INFO L273 TraceCheckUtils]: 84: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,827 INFO L273 TraceCheckUtils]: 85: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,827 INFO L273 TraceCheckUtils]: 86: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,828 INFO L273 TraceCheckUtils]: 87: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,828 INFO L273 TraceCheckUtils]: 88: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,828 INFO L273 TraceCheckUtils]: 89: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,828 INFO L273 TraceCheckUtils]: 90: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,828 INFO L273 TraceCheckUtils]: 91: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,828 INFO L273 TraceCheckUtils]: 92: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,828 INFO L273 TraceCheckUtils]: 93: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,829 INFO L273 TraceCheckUtils]: 94: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,829 INFO L273 TraceCheckUtils]: 95: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,829 INFO L273 TraceCheckUtils]: 96: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,829 INFO L273 TraceCheckUtils]: 97: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,829 INFO L273 TraceCheckUtils]: 98: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,829 INFO L273 TraceCheckUtils]: 99: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,829 INFO L273 TraceCheckUtils]: 100: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,829 INFO L273 TraceCheckUtils]: 101: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,829 INFO L273 TraceCheckUtils]: 102: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,829 INFO L273 TraceCheckUtils]: 103: Hoare triple {30275#true} assume !(~i~0 < 100000); {30275#true} is VALID [2018-11-23 12:29:55,830 INFO L273 TraceCheckUtils]: 104: Hoare triple {30275#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {30275#true} is VALID [2018-11-23 12:29:55,830 INFO L273 TraceCheckUtils]: 105: Hoare triple {30275#true} assume true; {30275#true} is VALID [2018-11-23 12:29:55,830 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30275#true} {30276#false} #70#return; {30276#false} is VALID [2018-11-23 12:29:55,830 INFO L273 TraceCheckUtils]: 107: Hoare triple {30276#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); {30276#false} is VALID [2018-11-23 12:29:55,830 INFO L256 TraceCheckUtils]: 108: Hoare triple {30276#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {30275#true} is VALID [2018-11-23 12:29:55,830 INFO L273 TraceCheckUtils]: 109: Hoare triple {30275#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30275#true} is VALID [2018-11-23 12:29:55,830 INFO L273 TraceCheckUtils]: 110: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,830 INFO L273 TraceCheckUtils]: 111: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,830 INFO L273 TraceCheckUtils]: 112: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,831 INFO L273 TraceCheckUtils]: 113: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,831 INFO L273 TraceCheckUtils]: 114: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,831 INFO L273 TraceCheckUtils]: 115: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,831 INFO L273 TraceCheckUtils]: 116: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,831 INFO L273 TraceCheckUtils]: 117: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,831 INFO L273 TraceCheckUtils]: 118: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,831 INFO L273 TraceCheckUtils]: 119: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,831 INFO L273 TraceCheckUtils]: 120: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,831 INFO L273 TraceCheckUtils]: 121: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,831 INFO L273 TraceCheckUtils]: 122: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,832 INFO L273 TraceCheckUtils]: 123: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,832 INFO L273 TraceCheckUtils]: 124: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,832 INFO L273 TraceCheckUtils]: 125: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,832 INFO L273 TraceCheckUtils]: 126: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,832 INFO L273 TraceCheckUtils]: 127: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,832 INFO L273 TraceCheckUtils]: 128: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,832 INFO L273 TraceCheckUtils]: 129: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,832 INFO L273 TraceCheckUtils]: 130: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,832 INFO L273 TraceCheckUtils]: 131: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,832 INFO L273 TraceCheckUtils]: 132: Hoare triple {30275#true} assume !(~i~0 < 100000); {30275#true} is VALID [2018-11-23 12:29:55,833 INFO L273 TraceCheckUtils]: 133: Hoare triple {30275#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {30275#true} is VALID [2018-11-23 12:29:55,833 INFO L273 TraceCheckUtils]: 134: Hoare triple {30275#true} assume true; {30275#true} is VALID [2018-11-23 12:29:55,833 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30275#true} {30276#false} #72#return; {30276#false} is VALID [2018-11-23 12:29:55,833 INFO L273 TraceCheckUtils]: 136: Hoare triple {30276#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; {30276#false} is VALID [2018-11-23 12:29:55,833 INFO L273 TraceCheckUtils]: 137: Hoare triple {30276#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30276#false} is VALID [2018-11-23 12:29:55,833 INFO L273 TraceCheckUtils]: 138: Hoare triple {30276#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30276#false} is VALID [2018-11-23 12:29:55,833 INFO L273 TraceCheckUtils]: 139: Hoare triple {30276#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30276#false} is VALID [2018-11-23 12:29:55,833 INFO L273 TraceCheckUtils]: 140: Hoare triple {30276#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30276#false} is VALID [2018-11-23 12:29:55,833 INFO L273 TraceCheckUtils]: 141: Hoare triple {30276#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30276#false} is VALID [2018-11-23 12:29:55,834 INFO L273 TraceCheckUtils]: 142: Hoare triple {30276#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30276#false} is VALID [2018-11-23 12:29:55,834 INFO L273 TraceCheckUtils]: 143: Hoare triple {30276#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30276#false} is VALID [2018-11-23 12:29:55,834 INFO L273 TraceCheckUtils]: 144: Hoare triple {30276#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30276#false} is VALID [2018-11-23 12:29:55,834 INFO L273 TraceCheckUtils]: 145: Hoare triple {30276#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30276#false} is VALID [2018-11-23 12:29:55,834 INFO L273 TraceCheckUtils]: 146: Hoare triple {30276#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30276#false} is VALID [2018-11-23 12:29:55,834 INFO L273 TraceCheckUtils]: 147: Hoare triple {30276#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30276#false} is VALID [2018-11-23 12:29:55,834 INFO L273 TraceCheckUtils]: 148: Hoare triple {30276#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30276#false} is VALID [2018-11-23 12:29:55,834 INFO L273 TraceCheckUtils]: 149: Hoare triple {30276#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30276#false} is VALID [2018-11-23 12:29:55,834 INFO L273 TraceCheckUtils]: 150: Hoare triple {30276#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30276#false} is VALID [2018-11-23 12:29:55,834 INFO L273 TraceCheckUtils]: 151: Hoare triple {30276#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30276#false} is VALID [2018-11-23 12:29:55,835 INFO L273 TraceCheckUtils]: 152: Hoare triple {30276#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30276#false} is VALID [2018-11-23 12:29:55,835 INFO L273 TraceCheckUtils]: 153: Hoare triple {30276#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30276#false} is VALID [2018-11-23 12:29:55,835 INFO L273 TraceCheckUtils]: 154: Hoare triple {30276#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30276#false} is VALID [2018-11-23 12:29:55,835 INFO L273 TraceCheckUtils]: 155: Hoare triple {30276#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30276#false} is VALID [2018-11-23 12:29:55,835 INFO L273 TraceCheckUtils]: 156: Hoare triple {30276#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30276#false} is VALID [2018-11-23 12:29:55,835 INFO L273 TraceCheckUtils]: 157: Hoare triple {30276#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30276#false} is VALID [2018-11-23 12:29:55,835 INFO L273 TraceCheckUtils]: 158: Hoare triple {30276#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30276#false} is VALID [2018-11-23 12:29:55,835 INFO L273 TraceCheckUtils]: 159: Hoare triple {30276#false} assume !(~i~2 < 99999); {30276#false} is VALID [2018-11-23 12:29:55,835 INFO L273 TraceCheckUtils]: 160: Hoare triple {30276#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {30276#false} is VALID [2018-11-23 12:29:55,835 INFO L256 TraceCheckUtils]: 161: Hoare triple {30276#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {30275#true} is VALID [2018-11-23 12:29:55,836 INFO L273 TraceCheckUtils]: 162: Hoare triple {30275#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30275#true} is VALID [2018-11-23 12:29:55,836 INFO L273 TraceCheckUtils]: 163: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,836 INFO L273 TraceCheckUtils]: 164: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,836 INFO L273 TraceCheckUtils]: 165: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,836 INFO L273 TraceCheckUtils]: 166: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,836 INFO L273 TraceCheckUtils]: 167: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,836 INFO L273 TraceCheckUtils]: 168: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,836 INFO L273 TraceCheckUtils]: 169: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,836 INFO L273 TraceCheckUtils]: 170: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,836 INFO L273 TraceCheckUtils]: 171: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,837 INFO L273 TraceCheckUtils]: 172: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,837 INFO L273 TraceCheckUtils]: 173: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,837 INFO L273 TraceCheckUtils]: 174: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,837 INFO L273 TraceCheckUtils]: 175: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,837 INFO L273 TraceCheckUtils]: 176: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,837 INFO L273 TraceCheckUtils]: 177: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,837 INFO L273 TraceCheckUtils]: 178: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,837 INFO L273 TraceCheckUtils]: 179: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,837 INFO L273 TraceCheckUtils]: 180: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,837 INFO L273 TraceCheckUtils]: 181: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,838 INFO L273 TraceCheckUtils]: 182: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,838 INFO L273 TraceCheckUtils]: 183: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:29:55,838 INFO L273 TraceCheckUtils]: 184: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:29:55,838 INFO L273 TraceCheckUtils]: 185: Hoare triple {30275#true} assume !(~i~0 < 100000); {30275#true} is VALID [2018-11-23 12:29:55,838 INFO L273 TraceCheckUtils]: 186: Hoare triple {30275#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {30275#true} is VALID [2018-11-23 12:29:55,838 INFO L273 TraceCheckUtils]: 187: Hoare triple {30275#true} assume true; {30275#true} is VALID [2018-11-23 12:29:55,838 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30275#true} {30276#false} #74#return; {30276#false} is VALID [2018-11-23 12:29:55,838 INFO L273 TraceCheckUtils]: 189: Hoare triple {30276#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {30276#false} is VALID [2018-11-23 12:29:55,838 INFO L273 TraceCheckUtils]: 190: Hoare triple {30276#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {30276#false} is VALID [2018-11-23 12:29:55,839 INFO L273 TraceCheckUtils]: 191: Hoare triple {30276#false} assume !false; {30276#false} is VALID [2018-11-23 12:29:55,855 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,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:55,855 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,864 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:30:02,556 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-11-23 12:30:02,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:02,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:03,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {30275#true} call ULTIMATE.init(); {30275#true} is VALID [2018-11-23 12:30:03,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {30275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30275#true} is VALID [2018-11-23 12:30:03,169 INFO L273 TraceCheckUtils]: 2: Hoare triple {30275#true} assume true; {30275#true} is VALID [2018-11-23 12:30:03,170 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30275#true} {30275#true} #66#return; {30275#true} is VALID [2018-11-23 12:30:03,170 INFO L256 TraceCheckUtils]: 4: Hoare triple {30275#true} call #t~ret12 := main(); {30275#true} is VALID [2018-11-23 12:30:03,170 INFO L273 TraceCheckUtils]: 5: Hoare triple {30275#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30275#true} is VALID [2018-11-23 12:30:03,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,171 INFO L273 TraceCheckUtils]: 12: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,171 INFO L273 TraceCheckUtils]: 14: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,172 INFO L273 TraceCheckUtils]: 16: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,172 INFO L273 TraceCheckUtils]: 17: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,172 INFO L273 TraceCheckUtils]: 18: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,172 INFO L273 TraceCheckUtils]: 20: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,172 INFO L273 TraceCheckUtils]: 21: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,172 INFO L273 TraceCheckUtils]: 22: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,172 INFO L273 TraceCheckUtils]: 23: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,172 INFO L273 TraceCheckUtils]: 24: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,173 INFO L273 TraceCheckUtils]: 25: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,173 INFO L273 TraceCheckUtils]: 26: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,173 INFO L273 TraceCheckUtils]: 27: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,173 INFO L273 TraceCheckUtils]: 28: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,173 INFO L273 TraceCheckUtils]: 29: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,173 INFO L273 TraceCheckUtils]: 30: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,173 INFO L273 TraceCheckUtils]: 31: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,173 INFO L273 TraceCheckUtils]: 32: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,173 INFO L273 TraceCheckUtils]: 33: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,173 INFO L273 TraceCheckUtils]: 34: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,174 INFO L273 TraceCheckUtils]: 35: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,174 INFO L273 TraceCheckUtils]: 36: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,174 INFO L273 TraceCheckUtils]: 37: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,174 INFO L273 TraceCheckUtils]: 38: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,174 INFO L273 TraceCheckUtils]: 39: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,174 INFO L273 TraceCheckUtils]: 40: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,174 INFO L273 TraceCheckUtils]: 41: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,174 INFO L273 TraceCheckUtils]: 42: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,174 INFO L273 TraceCheckUtils]: 43: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,174 INFO L273 TraceCheckUtils]: 44: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,175 INFO L273 TraceCheckUtils]: 45: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,175 INFO L273 TraceCheckUtils]: 46: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,175 INFO L273 TraceCheckUtils]: 47: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,175 INFO L273 TraceCheckUtils]: 48: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,175 INFO L273 TraceCheckUtils]: 49: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,175 INFO L273 TraceCheckUtils]: 50: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,175 INFO L273 TraceCheckUtils]: 51: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,175 INFO L273 TraceCheckUtils]: 52: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,175 INFO L273 TraceCheckUtils]: 53: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,175 INFO L273 TraceCheckUtils]: 54: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,176 INFO L273 TraceCheckUtils]: 55: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,176 INFO L273 TraceCheckUtils]: 56: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,176 INFO L273 TraceCheckUtils]: 57: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,176 INFO L273 TraceCheckUtils]: 58: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,176 INFO L273 TraceCheckUtils]: 59: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,176 INFO L273 TraceCheckUtils]: 60: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,176 INFO L273 TraceCheckUtils]: 61: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,176 INFO L273 TraceCheckUtils]: 62: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,176 INFO L273 TraceCheckUtils]: 63: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,176 INFO L273 TraceCheckUtils]: 64: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,177 INFO L273 TraceCheckUtils]: 65: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,177 INFO L273 TraceCheckUtils]: 66: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,177 INFO L273 TraceCheckUtils]: 67: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,177 INFO L273 TraceCheckUtils]: 68: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,177 INFO L273 TraceCheckUtils]: 69: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,177 INFO L273 TraceCheckUtils]: 70: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,177 INFO L273 TraceCheckUtils]: 71: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,177 INFO L273 TraceCheckUtils]: 72: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,177 INFO L273 TraceCheckUtils]: 73: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,178 INFO L273 TraceCheckUtils]: 74: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,178 INFO L273 TraceCheckUtils]: 75: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,178 INFO L273 TraceCheckUtils]: 76: Hoare triple {30275#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30275#true} is VALID [2018-11-23 12:30:03,178 INFO L273 TraceCheckUtils]: 77: Hoare triple {30275#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30275#true} is VALID [2018-11-23 12:30:03,178 INFO L273 TraceCheckUtils]: 78: Hoare triple {30275#true} assume !(~i~1 < 100000); {30275#true} is VALID [2018-11-23 12:30:03,178 INFO L256 TraceCheckUtils]: 79: Hoare triple {30275#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {30275#true} is VALID [2018-11-23 12:30:03,178 INFO L273 TraceCheckUtils]: 80: Hoare triple {30275#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30275#true} is VALID [2018-11-23 12:30:03,178 INFO L273 TraceCheckUtils]: 81: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,178 INFO L273 TraceCheckUtils]: 82: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,178 INFO L273 TraceCheckUtils]: 83: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,179 INFO L273 TraceCheckUtils]: 84: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,179 INFO L273 TraceCheckUtils]: 85: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,179 INFO L273 TraceCheckUtils]: 86: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,179 INFO L273 TraceCheckUtils]: 87: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,179 INFO L273 TraceCheckUtils]: 88: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,179 INFO L273 TraceCheckUtils]: 89: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,179 INFO L273 TraceCheckUtils]: 90: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,179 INFO L273 TraceCheckUtils]: 91: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,179 INFO L273 TraceCheckUtils]: 92: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,179 INFO L273 TraceCheckUtils]: 93: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,180 INFO L273 TraceCheckUtils]: 94: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,180 INFO L273 TraceCheckUtils]: 95: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,180 INFO L273 TraceCheckUtils]: 96: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,180 INFO L273 TraceCheckUtils]: 97: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,180 INFO L273 TraceCheckUtils]: 98: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,180 INFO L273 TraceCheckUtils]: 99: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,180 INFO L273 TraceCheckUtils]: 100: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,180 INFO L273 TraceCheckUtils]: 101: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,180 INFO L273 TraceCheckUtils]: 102: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,181 INFO L273 TraceCheckUtils]: 103: Hoare triple {30275#true} assume !(~i~0 < 100000); {30275#true} is VALID [2018-11-23 12:30:03,181 INFO L273 TraceCheckUtils]: 104: Hoare triple {30275#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {30275#true} is VALID [2018-11-23 12:30:03,181 INFO L273 TraceCheckUtils]: 105: Hoare triple {30275#true} assume true; {30275#true} is VALID [2018-11-23 12:30:03,181 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30275#true} {30275#true} #70#return; {30275#true} is VALID [2018-11-23 12:30:03,181 INFO L273 TraceCheckUtils]: 107: Hoare triple {30275#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); {30275#true} is VALID [2018-11-23 12:30:03,181 INFO L256 TraceCheckUtils]: 108: Hoare triple {30275#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {30275#true} is VALID [2018-11-23 12:30:03,181 INFO L273 TraceCheckUtils]: 109: Hoare triple {30275#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30275#true} is VALID [2018-11-23 12:30:03,181 INFO L273 TraceCheckUtils]: 110: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,181 INFO L273 TraceCheckUtils]: 111: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,181 INFO L273 TraceCheckUtils]: 112: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,182 INFO L273 TraceCheckUtils]: 113: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,182 INFO L273 TraceCheckUtils]: 114: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,182 INFO L273 TraceCheckUtils]: 115: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,182 INFO L273 TraceCheckUtils]: 116: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,182 INFO L273 TraceCheckUtils]: 117: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,182 INFO L273 TraceCheckUtils]: 118: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,182 INFO L273 TraceCheckUtils]: 119: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,182 INFO L273 TraceCheckUtils]: 120: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,182 INFO L273 TraceCheckUtils]: 121: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,182 INFO L273 TraceCheckUtils]: 122: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,183 INFO L273 TraceCheckUtils]: 123: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,183 INFO L273 TraceCheckUtils]: 124: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,183 INFO L273 TraceCheckUtils]: 125: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,183 INFO L273 TraceCheckUtils]: 126: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,183 INFO L273 TraceCheckUtils]: 127: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,183 INFO L273 TraceCheckUtils]: 128: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,183 INFO L273 TraceCheckUtils]: 129: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,183 INFO L273 TraceCheckUtils]: 130: Hoare triple {30275#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30275#true} is VALID [2018-11-23 12:30:03,183 INFO L273 TraceCheckUtils]: 131: Hoare triple {30275#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30275#true} is VALID [2018-11-23 12:30:03,183 INFO L273 TraceCheckUtils]: 132: Hoare triple {30275#true} assume !(~i~0 < 100000); {30275#true} is VALID [2018-11-23 12:30:03,184 INFO L273 TraceCheckUtils]: 133: Hoare triple {30275#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {30275#true} is VALID [2018-11-23 12:30:03,184 INFO L273 TraceCheckUtils]: 134: Hoare triple {30275#true} assume true; {30275#true} is VALID [2018-11-23 12:30:03,184 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30275#true} {30275#true} #72#return; {30275#true} is VALID [2018-11-23 12:30:03,184 INFO L273 TraceCheckUtils]: 136: Hoare triple {30275#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; {30275#true} is VALID [2018-11-23 12:30:03,184 INFO L273 TraceCheckUtils]: 137: Hoare triple {30275#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30275#true} is VALID [2018-11-23 12:30:03,184 INFO L273 TraceCheckUtils]: 138: Hoare triple {30275#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30275#true} is VALID [2018-11-23 12:30:03,184 INFO L273 TraceCheckUtils]: 139: Hoare triple {30275#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30275#true} is VALID [2018-11-23 12:30:03,184 INFO L273 TraceCheckUtils]: 140: Hoare triple {30275#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30275#true} is VALID [2018-11-23 12:30:03,184 INFO L273 TraceCheckUtils]: 141: Hoare triple {30275#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30275#true} is VALID [2018-11-23 12:30:03,184 INFO L273 TraceCheckUtils]: 142: Hoare triple {30275#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30275#true} is VALID [2018-11-23 12:30:03,185 INFO L273 TraceCheckUtils]: 143: Hoare triple {30275#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30275#true} is VALID [2018-11-23 12:30:03,185 INFO L273 TraceCheckUtils]: 144: Hoare triple {30275#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30275#true} is VALID [2018-11-23 12:30:03,185 INFO L273 TraceCheckUtils]: 145: Hoare triple {30275#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30275#true} is VALID [2018-11-23 12:30:03,185 INFO L273 TraceCheckUtils]: 146: Hoare triple {30275#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30275#true} is VALID [2018-11-23 12:30:03,185 INFO L273 TraceCheckUtils]: 147: Hoare triple {30275#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30275#true} is VALID [2018-11-23 12:30:03,185 INFO L273 TraceCheckUtils]: 148: Hoare triple {30275#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30275#true} is VALID [2018-11-23 12:30:03,185 INFO L273 TraceCheckUtils]: 149: Hoare triple {30275#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30275#true} is VALID [2018-11-23 12:30:03,185 INFO L273 TraceCheckUtils]: 150: Hoare triple {30275#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30275#true} is VALID [2018-11-23 12:30:03,185 INFO L273 TraceCheckUtils]: 151: Hoare triple {30275#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30275#true} is VALID [2018-11-23 12:30:03,186 INFO L273 TraceCheckUtils]: 152: Hoare triple {30275#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30275#true} is VALID [2018-11-23 12:30:03,186 INFO L273 TraceCheckUtils]: 153: Hoare triple {30275#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30275#true} is VALID [2018-11-23 12:30:03,186 INFO L273 TraceCheckUtils]: 154: Hoare triple {30275#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30275#true} is VALID [2018-11-23 12:30:03,186 INFO L273 TraceCheckUtils]: 155: Hoare triple {30275#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30275#true} is VALID [2018-11-23 12:30:03,186 INFO L273 TraceCheckUtils]: 156: Hoare triple {30275#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30275#true} is VALID [2018-11-23 12:30:03,186 INFO L273 TraceCheckUtils]: 157: Hoare triple {30275#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30275#true} is VALID [2018-11-23 12:30:03,186 INFO L273 TraceCheckUtils]: 158: Hoare triple {30275#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30275#true} is VALID [2018-11-23 12:30:03,186 INFO L273 TraceCheckUtils]: 159: Hoare triple {30275#true} assume !(~i~2 < 99999); {30275#true} is VALID [2018-11-23 12:30:03,186 INFO L273 TraceCheckUtils]: 160: Hoare triple {30275#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {30275#true} is VALID [2018-11-23 12:30:03,186 INFO L256 TraceCheckUtils]: 161: Hoare triple {30275#true} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {30275#true} is VALID [2018-11-23 12:30:03,187 INFO L273 TraceCheckUtils]: 162: Hoare triple {30275#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30803#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:30:03,187 INFO L273 TraceCheckUtils]: 163: Hoare triple {30803#(<= mapavg_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30803#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:30:03,188 INFO L273 TraceCheckUtils]: 164: Hoare triple {30803#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30810#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:30:03,188 INFO L273 TraceCheckUtils]: 165: Hoare triple {30810#(<= mapavg_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30810#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:30:03,189 INFO L273 TraceCheckUtils]: 166: Hoare triple {30810#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30817#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:30:03,189 INFO L273 TraceCheckUtils]: 167: Hoare triple {30817#(<= mapavg_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30817#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:30:03,189 INFO L273 TraceCheckUtils]: 168: Hoare triple {30817#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30824#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:30:03,190 INFO L273 TraceCheckUtils]: 169: Hoare triple {30824#(<= mapavg_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30824#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:30:03,190 INFO L273 TraceCheckUtils]: 170: Hoare triple {30824#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30831#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:30:03,190 INFO L273 TraceCheckUtils]: 171: Hoare triple {30831#(<= mapavg_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30831#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:30:03,191 INFO L273 TraceCheckUtils]: 172: Hoare triple {30831#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30838#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:30:03,191 INFO L273 TraceCheckUtils]: 173: Hoare triple {30838#(<= mapavg_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30838#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:30:03,192 INFO L273 TraceCheckUtils]: 174: Hoare triple {30838#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30845#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:30:03,192 INFO L273 TraceCheckUtils]: 175: Hoare triple {30845#(<= mapavg_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30845#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:30:03,193 INFO L273 TraceCheckUtils]: 176: Hoare triple {30845#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30852#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:30:03,193 INFO L273 TraceCheckUtils]: 177: Hoare triple {30852#(<= mapavg_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30852#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:30:03,194 INFO L273 TraceCheckUtils]: 178: Hoare triple {30852#(<= mapavg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30859#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:30:03,195 INFO L273 TraceCheckUtils]: 179: Hoare triple {30859#(<= mapavg_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30859#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:30:03,195 INFO L273 TraceCheckUtils]: 180: Hoare triple {30859#(<= mapavg_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30866#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:30:03,196 INFO L273 TraceCheckUtils]: 181: Hoare triple {30866#(<= mapavg_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30866#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:30:03,197 INFO L273 TraceCheckUtils]: 182: Hoare triple {30866#(<= mapavg_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30873#(<= mapavg_~i~0 10)} is VALID [2018-11-23 12:30:03,197 INFO L273 TraceCheckUtils]: 183: Hoare triple {30873#(<= mapavg_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30873#(<= mapavg_~i~0 10)} is VALID [2018-11-23 12:30:03,198 INFO L273 TraceCheckUtils]: 184: Hoare triple {30873#(<= mapavg_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30880#(<= mapavg_~i~0 11)} is VALID [2018-11-23 12:30:03,198 INFO L273 TraceCheckUtils]: 185: Hoare triple {30880#(<= mapavg_~i~0 11)} assume !(~i~0 < 100000); {30276#false} is VALID [2018-11-23 12:30:03,199 INFO L273 TraceCheckUtils]: 186: Hoare triple {30276#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {30276#false} is VALID [2018-11-23 12:30:03,199 INFO L273 TraceCheckUtils]: 187: Hoare triple {30276#false} assume true; {30276#false} is VALID [2018-11-23 12:30:03,199 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30276#false} {30275#true} #74#return; {30276#false} is VALID [2018-11-23 12:30:03,199 INFO L273 TraceCheckUtils]: 189: Hoare triple {30276#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {30276#false} is VALID [2018-11-23 12:30:03,199 INFO L273 TraceCheckUtils]: 190: Hoare triple {30276#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {30276#false} is VALID [2018-11-23 12:30:03,200 INFO L273 TraceCheckUtils]: 191: Hoare triple {30276#false} assume !false; {30276#false} is VALID [2018-11-23 12:30:03,238 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:03,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:03,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2018-11-23 12:30:03,260 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:30:03,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:03,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 12:30:03,407 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:03,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 12:30:03,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 12:30:03,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:30:03,409 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2018-11-23 12:30:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:04,844 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2018-11-23 12:30:04,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 12:30:04,845 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:30:04,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:30:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:30:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:30:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:30:04,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 154 transitions. [2018-11-23 12:30:05,002 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:05,005 INFO L225 Difference]: With dead ends: 205 [2018-11-23 12:30:05,005 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 12:30:05,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:30:05,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 12:30:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-23 12:30:05,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:05,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-23 12:30:05,060 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-23 12:30:05,061 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-23 12:30:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:05,064 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:30:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:30:05,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:05,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:05,065 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-23 12:30:05,065 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-23 12:30:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:05,067 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:30:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:30:05,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:05,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:05,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:05,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:05,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 12:30:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-11-23 12:30:05,069 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2018-11-23 12:30:05,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:05,069 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-11-23 12:30:05,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 12:30:05,069 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:30:05,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-23 12:30:05,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:05,070 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:05,070 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:05,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:05,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1844433335, now seen corresponding path program 37 times [2018-11-23 12:30:05,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:05,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:05,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:05,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:05,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:07,001 INFO L256 TraceCheckUtils]: 0: Hoare triple {31709#true} call ULTIMATE.init(); {31709#true} is VALID [2018-11-23 12:30:07,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {31709#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31709#true} is VALID [2018-11-23 12:30:07,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {31709#true} assume true; {31709#true} is VALID [2018-11-23 12:30:07,002 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31709#true} {31709#true} #66#return; {31709#true} is VALID [2018-11-23 12:30:07,002 INFO L256 TraceCheckUtils]: 4: Hoare triple {31709#true} call #t~ret12 := main(); {31709#true} is VALID [2018-11-23 12:30:07,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {31709#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {31711#(= main_~i~1 0)} is VALID [2018-11-23 12:30:07,003 INFO L273 TraceCheckUtils]: 6: Hoare triple {31711#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31711#(= main_~i~1 0)} is VALID [2018-11-23 12:30:07,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {31711#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31712#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:07,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {31712#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31712#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:07,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {31712#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31713#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:07,005 INFO L273 TraceCheckUtils]: 10: Hoare triple {31713#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31713#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:07,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {31713#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31714#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:07,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {31714#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31714#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:07,006 INFO L273 TraceCheckUtils]: 13: Hoare triple {31714#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31715#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:07,007 INFO L273 TraceCheckUtils]: 14: Hoare triple {31715#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31715#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:07,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {31715#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31716#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:07,008 INFO L273 TraceCheckUtils]: 16: Hoare triple {31716#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31716#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:07,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {31716#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31717#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:07,009 INFO L273 TraceCheckUtils]: 18: Hoare triple {31717#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31717#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:07,010 INFO L273 TraceCheckUtils]: 19: Hoare triple {31717#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31718#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:07,010 INFO L273 TraceCheckUtils]: 20: Hoare triple {31718#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31718#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:07,011 INFO L273 TraceCheckUtils]: 21: Hoare triple {31718#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31719#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:07,011 INFO L273 TraceCheckUtils]: 22: Hoare triple {31719#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31719#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:07,012 INFO L273 TraceCheckUtils]: 23: Hoare triple {31719#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31720#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:07,012 INFO L273 TraceCheckUtils]: 24: Hoare triple {31720#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31720#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:07,013 INFO L273 TraceCheckUtils]: 25: Hoare triple {31720#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31721#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:07,014 INFO L273 TraceCheckUtils]: 26: Hoare triple {31721#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31721#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:07,014 INFO L273 TraceCheckUtils]: 27: Hoare triple {31721#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31722#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:07,015 INFO L273 TraceCheckUtils]: 28: Hoare triple {31722#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31722#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:07,016 INFO L273 TraceCheckUtils]: 29: Hoare triple {31722#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31723#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:07,016 INFO L273 TraceCheckUtils]: 30: Hoare triple {31723#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31723#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:07,017 INFO L273 TraceCheckUtils]: 31: Hoare triple {31723#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31724#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:07,017 INFO L273 TraceCheckUtils]: 32: Hoare triple {31724#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31724#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:07,018 INFO L273 TraceCheckUtils]: 33: Hoare triple {31724#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31725#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:07,019 INFO L273 TraceCheckUtils]: 34: Hoare triple {31725#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31725#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:07,019 INFO L273 TraceCheckUtils]: 35: Hoare triple {31725#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31726#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:07,020 INFO L273 TraceCheckUtils]: 36: Hoare triple {31726#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31726#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:07,021 INFO L273 TraceCheckUtils]: 37: Hoare triple {31726#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31727#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:07,021 INFO L273 TraceCheckUtils]: 38: Hoare triple {31727#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31727#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:07,022 INFO L273 TraceCheckUtils]: 39: Hoare triple {31727#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31728#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:07,022 INFO L273 TraceCheckUtils]: 40: Hoare triple {31728#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31728#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:07,023 INFO L273 TraceCheckUtils]: 41: Hoare triple {31728#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31729#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:07,024 INFO L273 TraceCheckUtils]: 42: Hoare triple {31729#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31729#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:07,024 INFO L273 TraceCheckUtils]: 43: Hoare triple {31729#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31730#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:07,025 INFO L273 TraceCheckUtils]: 44: Hoare triple {31730#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31730#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:07,026 INFO L273 TraceCheckUtils]: 45: Hoare triple {31730#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31731#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:07,026 INFO L273 TraceCheckUtils]: 46: Hoare triple {31731#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31731#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:07,027 INFO L273 TraceCheckUtils]: 47: Hoare triple {31731#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31732#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:07,027 INFO L273 TraceCheckUtils]: 48: Hoare triple {31732#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31732#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:07,028 INFO L273 TraceCheckUtils]: 49: Hoare triple {31732#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31733#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:07,029 INFO L273 TraceCheckUtils]: 50: Hoare triple {31733#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31733#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:07,029 INFO L273 TraceCheckUtils]: 51: Hoare triple {31733#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31734#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:07,030 INFO L273 TraceCheckUtils]: 52: Hoare triple {31734#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31734#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:07,030 INFO L273 TraceCheckUtils]: 53: Hoare triple {31734#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31735#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:07,031 INFO L273 TraceCheckUtils]: 54: Hoare triple {31735#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31735#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:07,032 INFO L273 TraceCheckUtils]: 55: Hoare triple {31735#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31736#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:07,032 INFO L273 TraceCheckUtils]: 56: Hoare triple {31736#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31736#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:07,033 INFO L273 TraceCheckUtils]: 57: Hoare triple {31736#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31737#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:07,034 INFO L273 TraceCheckUtils]: 58: Hoare triple {31737#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31737#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:07,034 INFO L273 TraceCheckUtils]: 59: Hoare triple {31737#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31738#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:07,035 INFO L273 TraceCheckUtils]: 60: Hoare triple {31738#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31738#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:07,035 INFO L273 TraceCheckUtils]: 61: Hoare triple {31738#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31739#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:07,036 INFO L273 TraceCheckUtils]: 62: Hoare triple {31739#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31739#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:07,037 INFO L273 TraceCheckUtils]: 63: Hoare triple {31739#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31740#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:07,037 INFO L273 TraceCheckUtils]: 64: Hoare triple {31740#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31740#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:07,038 INFO L273 TraceCheckUtils]: 65: Hoare triple {31740#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31741#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:07,038 INFO L273 TraceCheckUtils]: 66: Hoare triple {31741#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31741#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:07,039 INFO L273 TraceCheckUtils]: 67: Hoare triple {31741#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31742#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:07,040 INFO L273 TraceCheckUtils]: 68: Hoare triple {31742#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31742#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:07,040 INFO L273 TraceCheckUtils]: 69: Hoare triple {31742#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31743#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:07,041 INFO L273 TraceCheckUtils]: 70: Hoare triple {31743#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31743#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:07,042 INFO L273 TraceCheckUtils]: 71: Hoare triple {31743#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31744#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:07,042 INFO L273 TraceCheckUtils]: 72: Hoare triple {31744#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31744#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:07,043 INFO L273 TraceCheckUtils]: 73: Hoare triple {31744#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31745#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:07,043 INFO L273 TraceCheckUtils]: 74: Hoare triple {31745#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31745#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:07,044 INFO L273 TraceCheckUtils]: 75: Hoare triple {31745#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31746#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:07,045 INFO L273 TraceCheckUtils]: 76: Hoare triple {31746#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31746#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:07,045 INFO L273 TraceCheckUtils]: 77: Hoare triple {31746#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31747#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:07,046 INFO L273 TraceCheckUtils]: 78: Hoare triple {31747#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31747#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:07,046 INFO L273 TraceCheckUtils]: 79: Hoare triple {31747#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31748#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:07,047 INFO L273 TraceCheckUtils]: 80: Hoare triple {31748#(<= main_~i~1 37)} assume !(~i~1 < 100000); {31710#false} is VALID [2018-11-23 12:30:07,047 INFO L256 TraceCheckUtils]: 81: Hoare triple {31710#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {31709#true} is VALID [2018-11-23 12:30:07,048 INFO L273 TraceCheckUtils]: 82: Hoare triple {31709#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {31709#true} is VALID [2018-11-23 12:30:07,048 INFO L273 TraceCheckUtils]: 83: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,048 INFO L273 TraceCheckUtils]: 84: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,048 INFO L273 TraceCheckUtils]: 85: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,048 INFO L273 TraceCheckUtils]: 86: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,048 INFO L273 TraceCheckUtils]: 87: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,049 INFO L273 TraceCheckUtils]: 88: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,049 INFO L273 TraceCheckUtils]: 89: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,049 INFO L273 TraceCheckUtils]: 90: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,049 INFO L273 TraceCheckUtils]: 91: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,049 INFO L273 TraceCheckUtils]: 92: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,050 INFO L273 TraceCheckUtils]: 93: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,050 INFO L273 TraceCheckUtils]: 94: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,050 INFO L273 TraceCheckUtils]: 95: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,050 INFO L273 TraceCheckUtils]: 96: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,050 INFO L273 TraceCheckUtils]: 97: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,050 INFO L273 TraceCheckUtils]: 98: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,051 INFO L273 TraceCheckUtils]: 99: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,051 INFO L273 TraceCheckUtils]: 100: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,051 INFO L273 TraceCheckUtils]: 101: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,051 INFO L273 TraceCheckUtils]: 102: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,051 INFO L273 TraceCheckUtils]: 103: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,051 INFO L273 TraceCheckUtils]: 104: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,052 INFO L273 TraceCheckUtils]: 105: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,052 INFO L273 TraceCheckUtils]: 106: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,052 INFO L273 TraceCheckUtils]: 107: Hoare triple {31709#true} assume !(~i~0 < 100000); {31709#true} is VALID [2018-11-23 12:30:07,052 INFO L273 TraceCheckUtils]: 108: Hoare triple {31709#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {31709#true} is VALID [2018-11-23 12:30:07,052 INFO L273 TraceCheckUtils]: 109: Hoare triple {31709#true} assume true; {31709#true} is VALID [2018-11-23 12:30:07,052 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31709#true} {31710#false} #70#return; {31710#false} is VALID [2018-11-23 12:30:07,052 INFO L273 TraceCheckUtils]: 111: Hoare triple {31710#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); {31710#false} is VALID [2018-11-23 12:30:07,052 INFO L256 TraceCheckUtils]: 112: Hoare triple {31710#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {31709#true} is VALID [2018-11-23 12:30:07,052 INFO L273 TraceCheckUtils]: 113: Hoare triple {31709#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {31709#true} is VALID [2018-11-23 12:30:07,052 INFO L273 TraceCheckUtils]: 114: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,053 INFO L273 TraceCheckUtils]: 115: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,053 INFO L273 TraceCheckUtils]: 116: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,053 INFO L273 TraceCheckUtils]: 117: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,053 INFO L273 TraceCheckUtils]: 118: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,053 INFO L273 TraceCheckUtils]: 119: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,053 INFO L273 TraceCheckUtils]: 120: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,053 INFO L273 TraceCheckUtils]: 121: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,053 INFO L273 TraceCheckUtils]: 122: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,053 INFO L273 TraceCheckUtils]: 123: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,054 INFO L273 TraceCheckUtils]: 124: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,054 INFO L273 TraceCheckUtils]: 125: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,054 INFO L273 TraceCheckUtils]: 126: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,054 INFO L273 TraceCheckUtils]: 127: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,054 INFO L273 TraceCheckUtils]: 128: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,054 INFO L273 TraceCheckUtils]: 129: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,054 INFO L273 TraceCheckUtils]: 130: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,054 INFO L273 TraceCheckUtils]: 131: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,054 INFO L273 TraceCheckUtils]: 132: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,054 INFO L273 TraceCheckUtils]: 133: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,055 INFO L273 TraceCheckUtils]: 134: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,055 INFO L273 TraceCheckUtils]: 135: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,055 INFO L273 TraceCheckUtils]: 136: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,055 INFO L273 TraceCheckUtils]: 137: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,055 INFO L273 TraceCheckUtils]: 138: Hoare triple {31709#true} assume !(~i~0 < 100000); {31709#true} is VALID [2018-11-23 12:30:07,055 INFO L273 TraceCheckUtils]: 139: Hoare triple {31709#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {31709#true} is VALID [2018-11-23 12:30:07,055 INFO L273 TraceCheckUtils]: 140: Hoare triple {31709#true} assume true; {31709#true} is VALID [2018-11-23 12:30:07,055 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31709#true} {31710#false} #72#return; {31710#false} is VALID [2018-11-23 12:30:07,055 INFO L273 TraceCheckUtils]: 142: Hoare triple {31710#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; {31710#false} is VALID [2018-11-23 12:30:07,055 INFO L273 TraceCheckUtils]: 143: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,056 INFO L273 TraceCheckUtils]: 144: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,056 INFO L273 TraceCheckUtils]: 145: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,056 INFO L273 TraceCheckUtils]: 146: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,056 INFO L273 TraceCheckUtils]: 147: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,056 INFO L273 TraceCheckUtils]: 148: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,056 INFO L273 TraceCheckUtils]: 149: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,056 INFO L273 TraceCheckUtils]: 150: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,056 INFO L273 TraceCheckUtils]: 151: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,056 INFO L273 TraceCheckUtils]: 152: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,056 INFO L273 TraceCheckUtils]: 153: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,057 INFO L273 TraceCheckUtils]: 154: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,057 INFO L273 TraceCheckUtils]: 155: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,057 INFO L273 TraceCheckUtils]: 156: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,057 INFO L273 TraceCheckUtils]: 157: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,057 INFO L273 TraceCheckUtils]: 158: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,057 INFO L273 TraceCheckUtils]: 159: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,057 INFO L273 TraceCheckUtils]: 160: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,057 INFO L273 TraceCheckUtils]: 161: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,057 INFO L273 TraceCheckUtils]: 162: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,058 INFO L273 TraceCheckUtils]: 163: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,058 INFO L273 TraceCheckUtils]: 164: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,058 INFO L273 TraceCheckUtils]: 165: Hoare triple {31710#false} assume !(~i~2 < 99999); {31710#false} is VALID [2018-11-23 12:30:07,058 INFO L273 TraceCheckUtils]: 166: Hoare triple {31710#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {31710#false} is VALID [2018-11-23 12:30:07,058 INFO L256 TraceCheckUtils]: 167: Hoare triple {31710#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {31709#true} is VALID [2018-11-23 12:30:07,058 INFO L273 TraceCheckUtils]: 168: Hoare triple {31709#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {31709#true} is VALID [2018-11-23 12:30:07,058 INFO L273 TraceCheckUtils]: 169: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,058 INFO L273 TraceCheckUtils]: 170: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,058 INFO L273 TraceCheckUtils]: 171: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,058 INFO L273 TraceCheckUtils]: 172: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,059 INFO L273 TraceCheckUtils]: 173: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,059 INFO L273 TraceCheckUtils]: 174: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,059 INFO L273 TraceCheckUtils]: 175: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,059 INFO L273 TraceCheckUtils]: 176: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,059 INFO L273 TraceCheckUtils]: 177: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,059 INFO L273 TraceCheckUtils]: 178: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,059 INFO L273 TraceCheckUtils]: 179: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,059 INFO L273 TraceCheckUtils]: 180: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,059 INFO L273 TraceCheckUtils]: 181: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,059 INFO L273 TraceCheckUtils]: 182: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,060 INFO L273 TraceCheckUtils]: 183: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,060 INFO L273 TraceCheckUtils]: 184: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,060 INFO L273 TraceCheckUtils]: 185: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,060 INFO L273 TraceCheckUtils]: 186: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,060 INFO L273 TraceCheckUtils]: 187: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,060 INFO L273 TraceCheckUtils]: 188: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,060 INFO L273 TraceCheckUtils]: 189: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,060 INFO L273 TraceCheckUtils]: 190: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,060 INFO L273 TraceCheckUtils]: 191: Hoare triple {31709#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31709#true} is VALID [2018-11-23 12:30:07,060 INFO L273 TraceCheckUtils]: 192: Hoare triple {31709#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#true} is VALID [2018-11-23 12:30:07,061 INFO L273 TraceCheckUtils]: 193: Hoare triple {31709#true} assume !(~i~0 < 100000); {31709#true} is VALID [2018-11-23 12:30:07,061 INFO L273 TraceCheckUtils]: 194: Hoare triple {31709#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {31709#true} is VALID [2018-11-23 12:30:07,061 INFO L273 TraceCheckUtils]: 195: Hoare triple {31709#true} assume true; {31709#true} is VALID [2018-11-23 12:30:07,061 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31709#true} {31710#false} #74#return; {31710#false} is VALID [2018-11-23 12:30:07,061 INFO L273 TraceCheckUtils]: 197: Hoare triple {31710#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {31710#false} is VALID [2018-11-23 12:30:07,061 INFO L273 TraceCheckUtils]: 198: Hoare triple {31710#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {31710#false} is VALID [2018-11-23 12:30:07,061 INFO L273 TraceCheckUtils]: 199: Hoare triple {31710#false} assume !false; {31710#false} is VALID [2018-11-23 12:30:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:30:07,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:07,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:30:07,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:30:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:07,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:07,529 INFO L256 TraceCheckUtils]: 0: Hoare triple {31709#true} call ULTIMATE.init(); {31709#true} is VALID [2018-11-23 12:30:07,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {31709#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31709#true} is VALID [2018-11-23 12:30:07,529 INFO L273 TraceCheckUtils]: 2: Hoare triple {31709#true} assume true; {31709#true} is VALID [2018-11-23 12:30:07,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31709#true} {31709#true} #66#return; {31709#true} is VALID [2018-11-23 12:30:07,530 INFO L256 TraceCheckUtils]: 4: Hoare triple {31709#true} call #t~ret12 := main(); {31709#true} is VALID [2018-11-23 12:30:07,530 INFO L273 TraceCheckUtils]: 5: Hoare triple {31709#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {31767#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:07,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {31767#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31767#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:07,531 INFO L273 TraceCheckUtils]: 7: Hoare triple {31767#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31712#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:07,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {31712#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31712#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:07,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {31712#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31713#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:07,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {31713#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31713#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:07,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {31713#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31714#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:07,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {31714#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31714#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:07,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {31714#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31715#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:07,535 INFO L273 TraceCheckUtils]: 14: Hoare triple {31715#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31715#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:07,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {31715#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31716#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:07,536 INFO L273 TraceCheckUtils]: 16: Hoare triple {31716#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31716#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:07,537 INFO L273 TraceCheckUtils]: 17: Hoare triple {31716#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31717#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:07,537 INFO L273 TraceCheckUtils]: 18: Hoare triple {31717#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31717#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:07,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {31717#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31718#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:07,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {31718#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31718#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:07,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {31718#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31719#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:07,540 INFO L273 TraceCheckUtils]: 22: Hoare triple {31719#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31719#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:07,540 INFO L273 TraceCheckUtils]: 23: Hoare triple {31719#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31720#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:07,541 INFO L273 TraceCheckUtils]: 24: Hoare triple {31720#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31720#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:07,542 INFO L273 TraceCheckUtils]: 25: Hoare triple {31720#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31721#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:07,542 INFO L273 TraceCheckUtils]: 26: Hoare triple {31721#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31721#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:07,543 INFO L273 TraceCheckUtils]: 27: Hoare triple {31721#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31722#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:07,543 INFO L273 TraceCheckUtils]: 28: Hoare triple {31722#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31722#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:07,544 INFO L273 TraceCheckUtils]: 29: Hoare triple {31722#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31723#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:07,545 INFO L273 TraceCheckUtils]: 30: Hoare triple {31723#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31723#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:07,545 INFO L273 TraceCheckUtils]: 31: Hoare triple {31723#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31724#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:07,546 INFO L273 TraceCheckUtils]: 32: Hoare triple {31724#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31724#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:07,546 INFO L273 TraceCheckUtils]: 33: Hoare triple {31724#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31725#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:07,547 INFO L273 TraceCheckUtils]: 34: Hoare triple {31725#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31725#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:07,548 INFO L273 TraceCheckUtils]: 35: Hoare triple {31725#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31726#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:07,548 INFO L273 TraceCheckUtils]: 36: Hoare triple {31726#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31726#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:07,549 INFO L273 TraceCheckUtils]: 37: Hoare triple {31726#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31727#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:07,549 INFO L273 TraceCheckUtils]: 38: Hoare triple {31727#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31727#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:07,550 INFO L273 TraceCheckUtils]: 39: Hoare triple {31727#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31728#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:07,551 INFO L273 TraceCheckUtils]: 40: Hoare triple {31728#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31728#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:07,551 INFO L273 TraceCheckUtils]: 41: Hoare triple {31728#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31729#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:07,552 INFO L273 TraceCheckUtils]: 42: Hoare triple {31729#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31729#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:07,553 INFO L273 TraceCheckUtils]: 43: Hoare triple {31729#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31730#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:07,553 INFO L273 TraceCheckUtils]: 44: Hoare triple {31730#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31730#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:07,554 INFO L273 TraceCheckUtils]: 45: Hoare triple {31730#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31731#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:07,554 INFO L273 TraceCheckUtils]: 46: Hoare triple {31731#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31731#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:07,555 INFO L273 TraceCheckUtils]: 47: Hoare triple {31731#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31732#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:07,556 INFO L273 TraceCheckUtils]: 48: Hoare triple {31732#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31732#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:07,556 INFO L273 TraceCheckUtils]: 49: Hoare triple {31732#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31733#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:07,557 INFO L273 TraceCheckUtils]: 50: Hoare triple {31733#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31733#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:07,558 INFO L273 TraceCheckUtils]: 51: Hoare triple {31733#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31734#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:07,558 INFO L273 TraceCheckUtils]: 52: Hoare triple {31734#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31734#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:07,559 INFO L273 TraceCheckUtils]: 53: Hoare triple {31734#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31735#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:07,559 INFO L273 TraceCheckUtils]: 54: Hoare triple {31735#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31735#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:07,560 INFO L273 TraceCheckUtils]: 55: Hoare triple {31735#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31736#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:07,561 INFO L273 TraceCheckUtils]: 56: Hoare triple {31736#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31736#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:07,561 INFO L273 TraceCheckUtils]: 57: Hoare triple {31736#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31737#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:07,562 INFO L273 TraceCheckUtils]: 58: Hoare triple {31737#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31737#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:07,562 INFO L273 TraceCheckUtils]: 59: Hoare triple {31737#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31738#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:07,563 INFO L273 TraceCheckUtils]: 60: Hoare triple {31738#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31738#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:07,564 INFO L273 TraceCheckUtils]: 61: Hoare triple {31738#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31739#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:07,564 INFO L273 TraceCheckUtils]: 62: Hoare triple {31739#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31739#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:07,565 INFO L273 TraceCheckUtils]: 63: Hoare triple {31739#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31740#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:07,565 INFO L273 TraceCheckUtils]: 64: Hoare triple {31740#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31740#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:07,566 INFO L273 TraceCheckUtils]: 65: Hoare triple {31740#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31741#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:07,567 INFO L273 TraceCheckUtils]: 66: Hoare triple {31741#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31741#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:07,567 INFO L273 TraceCheckUtils]: 67: Hoare triple {31741#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31742#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:07,568 INFO L273 TraceCheckUtils]: 68: Hoare triple {31742#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31742#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:07,569 INFO L273 TraceCheckUtils]: 69: Hoare triple {31742#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31743#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:07,569 INFO L273 TraceCheckUtils]: 70: Hoare triple {31743#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31743#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:07,570 INFO L273 TraceCheckUtils]: 71: Hoare triple {31743#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31744#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:07,570 INFO L273 TraceCheckUtils]: 72: Hoare triple {31744#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31744#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:07,571 INFO L273 TraceCheckUtils]: 73: Hoare triple {31744#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31745#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:07,572 INFO L273 TraceCheckUtils]: 74: Hoare triple {31745#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31745#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:07,572 INFO L273 TraceCheckUtils]: 75: Hoare triple {31745#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31746#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:07,573 INFO L273 TraceCheckUtils]: 76: Hoare triple {31746#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31746#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:07,574 INFO L273 TraceCheckUtils]: 77: Hoare triple {31746#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31747#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:07,574 INFO L273 TraceCheckUtils]: 78: Hoare triple {31747#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31747#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:07,575 INFO L273 TraceCheckUtils]: 79: Hoare triple {31747#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31748#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:07,575 INFO L273 TraceCheckUtils]: 80: Hoare triple {31748#(<= main_~i~1 37)} assume !(~i~1 < 100000); {31710#false} is VALID [2018-11-23 12:30:07,576 INFO L256 TraceCheckUtils]: 81: Hoare triple {31710#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {31710#false} is VALID [2018-11-23 12:30:07,576 INFO L273 TraceCheckUtils]: 82: Hoare triple {31710#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {31710#false} is VALID [2018-11-23 12:30:07,576 INFO L273 TraceCheckUtils]: 83: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,576 INFO L273 TraceCheckUtils]: 84: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,576 INFO L273 TraceCheckUtils]: 85: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,577 INFO L273 TraceCheckUtils]: 86: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,577 INFO L273 TraceCheckUtils]: 87: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,577 INFO L273 TraceCheckUtils]: 88: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,577 INFO L273 TraceCheckUtils]: 89: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,577 INFO L273 TraceCheckUtils]: 90: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,577 INFO L273 TraceCheckUtils]: 91: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,578 INFO L273 TraceCheckUtils]: 92: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,578 INFO L273 TraceCheckUtils]: 93: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,578 INFO L273 TraceCheckUtils]: 94: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,578 INFO L273 TraceCheckUtils]: 95: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,578 INFO L273 TraceCheckUtils]: 96: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,578 INFO L273 TraceCheckUtils]: 97: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,579 INFO L273 TraceCheckUtils]: 98: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,579 INFO L273 TraceCheckUtils]: 99: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,579 INFO L273 TraceCheckUtils]: 100: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,579 INFO L273 TraceCheckUtils]: 101: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,579 INFO L273 TraceCheckUtils]: 102: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,579 INFO L273 TraceCheckUtils]: 103: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,579 INFO L273 TraceCheckUtils]: 104: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,579 INFO L273 TraceCheckUtils]: 105: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,579 INFO L273 TraceCheckUtils]: 106: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,580 INFO L273 TraceCheckUtils]: 107: Hoare triple {31710#false} assume !(~i~0 < 100000); {31710#false} is VALID [2018-11-23 12:30:07,580 INFO L273 TraceCheckUtils]: 108: Hoare triple {31710#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {31710#false} is VALID [2018-11-23 12:30:07,580 INFO L273 TraceCheckUtils]: 109: Hoare triple {31710#false} assume true; {31710#false} is VALID [2018-11-23 12:30:07,580 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31710#false} {31710#false} #70#return; {31710#false} is VALID [2018-11-23 12:30:07,580 INFO L273 TraceCheckUtils]: 111: Hoare triple {31710#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); {31710#false} is VALID [2018-11-23 12:30:07,580 INFO L256 TraceCheckUtils]: 112: Hoare triple {31710#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {31710#false} is VALID [2018-11-23 12:30:07,580 INFO L273 TraceCheckUtils]: 113: Hoare triple {31710#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {31710#false} is VALID [2018-11-23 12:30:07,580 INFO L273 TraceCheckUtils]: 114: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,580 INFO L273 TraceCheckUtils]: 115: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,580 INFO L273 TraceCheckUtils]: 116: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,581 INFO L273 TraceCheckUtils]: 117: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,581 INFO L273 TraceCheckUtils]: 118: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,581 INFO L273 TraceCheckUtils]: 119: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,581 INFO L273 TraceCheckUtils]: 120: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,581 INFO L273 TraceCheckUtils]: 121: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,581 INFO L273 TraceCheckUtils]: 122: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,581 INFO L273 TraceCheckUtils]: 123: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,581 INFO L273 TraceCheckUtils]: 124: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,581 INFO L273 TraceCheckUtils]: 125: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,581 INFO L273 TraceCheckUtils]: 126: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,582 INFO L273 TraceCheckUtils]: 127: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,582 INFO L273 TraceCheckUtils]: 128: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,582 INFO L273 TraceCheckUtils]: 129: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,582 INFO L273 TraceCheckUtils]: 130: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,582 INFO L273 TraceCheckUtils]: 131: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,582 INFO L273 TraceCheckUtils]: 132: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,582 INFO L273 TraceCheckUtils]: 133: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,582 INFO L273 TraceCheckUtils]: 134: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,582 INFO L273 TraceCheckUtils]: 135: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,582 INFO L273 TraceCheckUtils]: 136: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,583 INFO L273 TraceCheckUtils]: 137: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,583 INFO L273 TraceCheckUtils]: 138: Hoare triple {31710#false} assume !(~i~0 < 100000); {31710#false} is VALID [2018-11-23 12:30:07,583 INFO L273 TraceCheckUtils]: 139: Hoare triple {31710#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {31710#false} is VALID [2018-11-23 12:30:07,583 INFO L273 TraceCheckUtils]: 140: Hoare triple {31710#false} assume true; {31710#false} is VALID [2018-11-23 12:30:07,583 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31710#false} {31710#false} #72#return; {31710#false} is VALID [2018-11-23 12:30:07,583 INFO L273 TraceCheckUtils]: 142: Hoare triple {31710#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; {31710#false} is VALID [2018-11-23 12:30:07,583 INFO L273 TraceCheckUtils]: 143: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,583 INFO L273 TraceCheckUtils]: 144: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,583 INFO L273 TraceCheckUtils]: 145: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,584 INFO L273 TraceCheckUtils]: 146: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,584 INFO L273 TraceCheckUtils]: 147: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,584 INFO L273 TraceCheckUtils]: 148: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,584 INFO L273 TraceCheckUtils]: 149: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,584 INFO L273 TraceCheckUtils]: 150: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,584 INFO L273 TraceCheckUtils]: 151: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,584 INFO L273 TraceCheckUtils]: 152: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,584 INFO L273 TraceCheckUtils]: 153: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,584 INFO L273 TraceCheckUtils]: 154: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,584 INFO L273 TraceCheckUtils]: 155: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,585 INFO L273 TraceCheckUtils]: 156: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,585 INFO L273 TraceCheckUtils]: 157: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,585 INFO L273 TraceCheckUtils]: 158: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,585 INFO L273 TraceCheckUtils]: 159: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,585 INFO L273 TraceCheckUtils]: 160: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,585 INFO L273 TraceCheckUtils]: 161: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,585 INFO L273 TraceCheckUtils]: 162: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,585 INFO L273 TraceCheckUtils]: 163: Hoare triple {31710#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31710#false} is VALID [2018-11-23 12:30:07,585 INFO L273 TraceCheckUtils]: 164: Hoare triple {31710#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31710#false} is VALID [2018-11-23 12:30:07,585 INFO L273 TraceCheckUtils]: 165: Hoare triple {31710#false} assume !(~i~2 < 99999); {31710#false} is VALID [2018-11-23 12:30:07,586 INFO L273 TraceCheckUtils]: 166: Hoare triple {31710#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {31710#false} is VALID [2018-11-23 12:30:07,586 INFO L256 TraceCheckUtils]: 167: Hoare triple {31710#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {31710#false} is VALID [2018-11-23 12:30:07,586 INFO L273 TraceCheckUtils]: 168: Hoare triple {31710#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {31710#false} is VALID [2018-11-23 12:30:07,586 INFO L273 TraceCheckUtils]: 169: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,586 INFO L273 TraceCheckUtils]: 170: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,586 INFO L273 TraceCheckUtils]: 171: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,586 INFO L273 TraceCheckUtils]: 172: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,586 INFO L273 TraceCheckUtils]: 173: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,586 INFO L273 TraceCheckUtils]: 174: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,587 INFO L273 TraceCheckUtils]: 175: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,587 INFO L273 TraceCheckUtils]: 176: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,587 INFO L273 TraceCheckUtils]: 177: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,587 INFO L273 TraceCheckUtils]: 178: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,587 INFO L273 TraceCheckUtils]: 179: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,587 INFO L273 TraceCheckUtils]: 180: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,587 INFO L273 TraceCheckUtils]: 181: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,587 INFO L273 TraceCheckUtils]: 182: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,587 INFO L273 TraceCheckUtils]: 183: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,587 INFO L273 TraceCheckUtils]: 184: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,588 INFO L273 TraceCheckUtils]: 185: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,588 INFO L273 TraceCheckUtils]: 186: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,588 INFO L273 TraceCheckUtils]: 187: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,588 INFO L273 TraceCheckUtils]: 188: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,588 INFO L273 TraceCheckUtils]: 189: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,588 INFO L273 TraceCheckUtils]: 190: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,588 INFO L273 TraceCheckUtils]: 191: Hoare triple {31710#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31710#false} is VALID [2018-11-23 12:30:07,588 INFO L273 TraceCheckUtils]: 192: Hoare triple {31710#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#false} is VALID [2018-11-23 12:30:07,588 INFO L273 TraceCheckUtils]: 193: Hoare triple {31710#false} assume !(~i~0 < 100000); {31710#false} is VALID [2018-11-23 12:30:07,588 INFO L273 TraceCheckUtils]: 194: Hoare triple {31710#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {31710#false} is VALID [2018-11-23 12:30:07,589 INFO L273 TraceCheckUtils]: 195: Hoare triple {31710#false} assume true; {31710#false} is VALID [2018-11-23 12:30:07,589 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31710#false} {31710#false} #74#return; {31710#false} is VALID [2018-11-23 12:30:07,589 INFO L273 TraceCheckUtils]: 197: Hoare triple {31710#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {31710#false} is VALID [2018-11-23 12:30:07,589 INFO L273 TraceCheckUtils]: 198: Hoare triple {31710#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {31710#false} is VALID [2018-11-23 12:30:07,589 INFO L273 TraceCheckUtils]: 199: Hoare triple {31710#false} assume !false; {31710#false} is VALID [2018-11-23 12:30:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:30:07,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:07,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:30:07,628 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:30:07,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:07,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:30:07,750 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:30:07,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:30:07,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:30:07,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:30:07,752 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2018-11-23 12:30:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:08,151 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2018-11-23 12:30:08,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:30:08,151 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:30:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:30:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:30:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:30:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:30:08,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 128 transitions. [2018-11-23 12:30:08,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:08,291 INFO L225 Difference]: With dead ends: 208 [2018-11-23 12:30:08,292 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:30:08,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:30:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:30:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-11-23 12:30:08,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:08,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 145 states. [2018-11-23 12:30:08,388 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 145 states. [2018-11-23 12:30:08,388 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 145 states. [2018-11-23 12:30:08,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:08,391 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:30:08,391 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:30:08,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:08,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:08,391 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 146 states. [2018-11-23 12:30:08,391 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 146 states. [2018-11-23 12:30:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:08,393 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:30:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:30:08,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:08,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:08,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:08,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 12:30:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2018-11-23 12:30:08,396 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 200 [2018-11-23 12:30:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:08,396 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-11-23 12:30:08,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:30:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:30:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-23 12:30:08,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:08,397 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:08,397 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:08,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:08,398 INFO L82 PathProgramCache]: Analyzing trace with hash -847935975, now seen corresponding path program 38 times [2018-11-23 12:30:08,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:08,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:08,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:08,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:30:08,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:09,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {33167#true} call ULTIMATE.init(); {33167#true} is VALID [2018-11-23 12:30:09,336 INFO L273 TraceCheckUtils]: 1: Hoare triple {33167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33167#true} is VALID [2018-11-23 12:30:09,336 INFO L273 TraceCheckUtils]: 2: Hoare triple {33167#true} assume true; {33167#true} is VALID [2018-11-23 12:30:09,336 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33167#true} {33167#true} #66#return; {33167#true} is VALID [2018-11-23 12:30:09,336 INFO L256 TraceCheckUtils]: 4: Hoare triple {33167#true} call #t~ret12 := main(); {33167#true} is VALID [2018-11-23 12:30:09,337 INFO L273 TraceCheckUtils]: 5: Hoare triple {33167#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {33169#(= main_~i~1 0)} is VALID [2018-11-23 12:30:09,337 INFO L273 TraceCheckUtils]: 6: Hoare triple {33169#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33169#(= main_~i~1 0)} is VALID [2018-11-23 12:30:09,337 INFO L273 TraceCheckUtils]: 7: Hoare triple {33169#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33170#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:09,338 INFO L273 TraceCheckUtils]: 8: Hoare triple {33170#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33170#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:09,339 INFO L273 TraceCheckUtils]: 9: Hoare triple {33170#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33171#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:09,339 INFO L273 TraceCheckUtils]: 10: Hoare triple {33171#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33171#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:09,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {33171#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33172#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:09,340 INFO L273 TraceCheckUtils]: 12: Hoare triple {33172#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33172#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:09,341 INFO L273 TraceCheckUtils]: 13: Hoare triple {33172#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33173#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:09,342 INFO L273 TraceCheckUtils]: 14: Hoare triple {33173#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33173#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:09,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {33173#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33174#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:09,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {33174#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33174#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:09,344 INFO L273 TraceCheckUtils]: 17: Hoare triple {33174#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33175#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:09,344 INFO L273 TraceCheckUtils]: 18: Hoare triple {33175#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33175#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:09,345 INFO L273 TraceCheckUtils]: 19: Hoare triple {33175#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33176#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:09,345 INFO L273 TraceCheckUtils]: 20: Hoare triple {33176#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33176#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:09,346 INFO L273 TraceCheckUtils]: 21: Hoare triple {33176#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33177#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:09,347 INFO L273 TraceCheckUtils]: 22: Hoare triple {33177#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33177#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:09,347 INFO L273 TraceCheckUtils]: 23: Hoare triple {33177#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33178#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:09,348 INFO L273 TraceCheckUtils]: 24: Hoare triple {33178#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33178#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:09,348 INFO L273 TraceCheckUtils]: 25: Hoare triple {33178#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33179#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:09,349 INFO L273 TraceCheckUtils]: 26: Hoare triple {33179#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33179#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:09,350 INFO L273 TraceCheckUtils]: 27: Hoare triple {33179#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33180#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:09,350 INFO L273 TraceCheckUtils]: 28: Hoare triple {33180#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33180#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:09,351 INFO L273 TraceCheckUtils]: 29: Hoare triple {33180#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33181#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:09,351 INFO L273 TraceCheckUtils]: 30: Hoare triple {33181#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33181#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:09,352 INFO L273 TraceCheckUtils]: 31: Hoare triple {33181#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33182#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:09,353 INFO L273 TraceCheckUtils]: 32: Hoare triple {33182#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33182#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:09,353 INFO L273 TraceCheckUtils]: 33: Hoare triple {33182#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33183#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:09,354 INFO L273 TraceCheckUtils]: 34: Hoare triple {33183#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33183#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:09,355 INFO L273 TraceCheckUtils]: 35: Hoare triple {33183#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33184#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:09,355 INFO L273 TraceCheckUtils]: 36: Hoare triple {33184#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33184#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:09,356 INFO L273 TraceCheckUtils]: 37: Hoare triple {33184#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33185#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:09,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {33185#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33185#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:09,357 INFO L273 TraceCheckUtils]: 39: Hoare triple {33185#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33186#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:09,358 INFO L273 TraceCheckUtils]: 40: Hoare triple {33186#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33186#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:09,358 INFO L273 TraceCheckUtils]: 41: Hoare triple {33186#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33187#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:09,359 INFO L273 TraceCheckUtils]: 42: Hoare triple {33187#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33187#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:09,360 INFO L273 TraceCheckUtils]: 43: Hoare triple {33187#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33188#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:09,360 INFO L273 TraceCheckUtils]: 44: Hoare triple {33188#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33188#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:09,361 INFO L273 TraceCheckUtils]: 45: Hoare triple {33188#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33189#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:09,361 INFO L273 TraceCheckUtils]: 46: Hoare triple {33189#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33189#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:09,362 INFO L273 TraceCheckUtils]: 47: Hoare triple {33189#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33190#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:09,362 INFO L273 TraceCheckUtils]: 48: Hoare triple {33190#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33190#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:09,363 INFO L273 TraceCheckUtils]: 49: Hoare triple {33190#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33191#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:09,364 INFO L273 TraceCheckUtils]: 50: Hoare triple {33191#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33191#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:09,364 INFO L273 TraceCheckUtils]: 51: Hoare triple {33191#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33192#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:09,365 INFO L273 TraceCheckUtils]: 52: Hoare triple {33192#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33192#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:09,366 INFO L273 TraceCheckUtils]: 53: Hoare triple {33192#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33193#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:09,366 INFO L273 TraceCheckUtils]: 54: Hoare triple {33193#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33193#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:09,367 INFO L273 TraceCheckUtils]: 55: Hoare triple {33193#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33194#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:09,367 INFO L273 TraceCheckUtils]: 56: Hoare triple {33194#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33194#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:09,368 INFO L273 TraceCheckUtils]: 57: Hoare triple {33194#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33195#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:09,369 INFO L273 TraceCheckUtils]: 58: Hoare triple {33195#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33195#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:09,369 INFO L273 TraceCheckUtils]: 59: Hoare triple {33195#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33196#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:09,370 INFO L273 TraceCheckUtils]: 60: Hoare triple {33196#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33196#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:09,371 INFO L273 TraceCheckUtils]: 61: Hoare triple {33196#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33197#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:09,371 INFO L273 TraceCheckUtils]: 62: Hoare triple {33197#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33197#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:09,372 INFO L273 TraceCheckUtils]: 63: Hoare triple {33197#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33198#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:09,372 INFO L273 TraceCheckUtils]: 64: Hoare triple {33198#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33198#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:09,373 INFO L273 TraceCheckUtils]: 65: Hoare triple {33198#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33199#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:09,374 INFO L273 TraceCheckUtils]: 66: Hoare triple {33199#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33199#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:09,374 INFO L273 TraceCheckUtils]: 67: Hoare triple {33199#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33200#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:09,375 INFO L273 TraceCheckUtils]: 68: Hoare triple {33200#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33200#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:09,376 INFO L273 TraceCheckUtils]: 69: Hoare triple {33200#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33201#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:09,376 INFO L273 TraceCheckUtils]: 70: Hoare triple {33201#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33201#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:09,377 INFO L273 TraceCheckUtils]: 71: Hoare triple {33201#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33202#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:09,377 INFO L273 TraceCheckUtils]: 72: Hoare triple {33202#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33202#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:09,378 INFO L273 TraceCheckUtils]: 73: Hoare triple {33202#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33203#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:09,379 INFO L273 TraceCheckUtils]: 74: Hoare triple {33203#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33203#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:09,379 INFO L273 TraceCheckUtils]: 75: Hoare triple {33203#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33204#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:09,380 INFO L273 TraceCheckUtils]: 76: Hoare triple {33204#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33204#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:09,381 INFO L273 TraceCheckUtils]: 77: Hoare triple {33204#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33205#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:09,381 INFO L273 TraceCheckUtils]: 78: Hoare triple {33205#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33205#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:09,382 INFO L273 TraceCheckUtils]: 79: Hoare triple {33205#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33206#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:09,382 INFO L273 TraceCheckUtils]: 80: Hoare triple {33206#(<= main_~i~1 37)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33206#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:09,383 INFO L273 TraceCheckUtils]: 81: Hoare triple {33206#(<= main_~i~1 37)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33207#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:09,384 INFO L273 TraceCheckUtils]: 82: Hoare triple {33207#(<= main_~i~1 38)} assume !(~i~1 < 100000); {33168#false} is VALID [2018-11-23 12:30:09,384 INFO L256 TraceCheckUtils]: 83: Hoare triple {33168#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {33167#true} is VALID [2018-11-23 12:30:09,384 INFO L273 TraceCheckUtils]: 84: Hoare triple {33167#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33167#true} is VALID [2018-11-23 12:30:09,384 INFO L273 TraceCheckUtils]: 85: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,385 INFO L273 TraceCheckUtils]: 86: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,385 INFO L273 TraceCheckUtils]: 87: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,385 INFO L273 TraceCheckUtils]: 88: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,385 INFO L273 TraceCheckUtils]: 89: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,385 INFO L273 TraceCheckUtils]: 90: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,385 INFO L273 TraceCheckUtils]: 91: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,386 INFO L273 TraceCheckUtils]: 92: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,386 INFO L273 TraceCheckUtils]: 93: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,386 INFO L273 TraceCheckUtils]: 94: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,386 INFO L273 TraceCheckUtils]: 95: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,386 INFO L273 TraceCheckUtils]: 96: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,386 INFO L273 TraceCheckUtils]: 97: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,387 INFO L273 TraceCheckUtils]: 98: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,387 INFO L273 TraceCheckUtils]: 99: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,387 INFO L273 TraceCheckUtils]: 100: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,387 INFO L273 TraceCheckUtils]: 101: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,387 INFO L273 TraceCheckUtils]: 102: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,388 INFO L273 TraceCheckUtils]: 103: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,388 INFO L273 TraceCheckUtils]: 104: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,388 INFO L273 TraceCheckUtils]: 105: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,388 INFO L273 TraceCheckUtils]: 106: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,388 INFO L273 TraceCheckUtils]: 107: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,388 INFO L273 TraceCheckUtils]: 108: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,389 INFO L273 TraceCheckUtils]: 109: Hoare triple {33167#true} assume !(~i~0 < 100000); {33167#true} is VALID [2018-11-23 12:30:09,389 INFO L273 TraceCheckUtils]: 110: Hoare triple {33167#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {33167#true} is VALID [2018-11-23 12:30:09,389 INFO L273 TraceCheckUtils]: 111: Hoare triple {33167#true} assume true; {33167#true} is VALID [2018-11-23 12:30:09,389 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {33167#true} {33168#false} #70#return; {33168#false} is VALID [2018-11-23 12:30:09,389 INFO L273 TraceCheckUtils]: 113: Hoare triple {33168#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); {33168#false} is VALID [2018-11-23 12:30:09,389 INFO L256 TraceCheckUtils]: 114: Hoare triple {33168#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {33167#true} is VALID [2018-11-23 12:30:09,389 INFO L273 TraceCheckUtils]: 115: Hoare triple {33167#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33167#true} is VALID [2018-11-23 12:30:09,389 INFO L273 TraceCheckUtils]: 116: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,390 INFO L273 TraceCheckUtils]: 117: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,390 INFO L273 TraceCheckUtils]: 118: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,390 INFO L273 TraceCheckUtils]: 119: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,390 INFO L273 TraceCheckUtils]: 120: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,390 INFO L273 TraceCheckUtils]: 121: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,390 INFO L273 TraceCheckUtils]: 122: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,390 INFO L273 TraceCheckUtils]: 123: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,390 INFO L273 TraceCheckUtils]: 124: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,390 INFO L273 TraceCheckUtils]: 125: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,391 INFO L273 TraceCheckUtils]: 126: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,391 INFO L273 TraceCheckUtils]: 127: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,391 INFO L273 TraceCheckUtils]: 128: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,391 INFO L273 TraceCheckUtils]: 129: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,391 INFO L273 TraceCheckUtils]: 130: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,391 INFO L273 TraceCheckUtils]: 131: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,391 INFO L273 TraceCheckUtils]: 132: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,391 INFO L273 TraceCheckUtils]: 133: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,391 INFO L273 TraceCheckUtils]: 134: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,391 INFO L273 TraceCheckUtils]: 135: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,392 INFO L273 TraceCheckUtils]: 136: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,392 INFO L273 TraceCheckUtils]: 137: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,392 INFO L273 TraceCheckUtils]: 138: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,392 INFO L273 TraceCheckUtils]: 139: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,392 INFO L273 TraceCheckUtils]: 140: Hoare triple {33167#true} assume !(~i~0 < 100000); {33167#true} is VALID [2018-11-23 12:30:09,392 INFO L273 TraceCheckUtils]: 141: Hoare triple {33167#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {33167#true} is VALID [2018-11-23 12:30:09,392 INFO L273 TraceCheckUtils]: 142: Hoare triple {33167#true} assume true; {33167#true} is VALID [2018-11-23 12:30:09,392 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {33167#true} {33168#false} #72#return; {33168#false} is VALID [2018-11-23 12:30:09,392 INFO L273 TraceCheckUtils]: 144: Hoare triple {33168#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; {33168#false} is VALID [2018-11-23 12:30:09,392 INFO L273 TraceCheckUtils]: 145: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:09,393 INFO L273 TraceCheckUtils]: 146: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:09,393 INFO L273 TraceCheckUtils]: 147: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:09,393 INFO L273 TraceCheckUtils]: 148: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:09,393 INFO L273 TraceCheckUtils]: 149: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:09,393 INFO L273 TraceCheckUtils]: 150: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:09,393 INFO L273 TraceCheckUtils]: 151: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:09,393 INFO L273 TraceCheckUtils]: 152: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:09,393 INFO L273 TraceCheckUtils]: 153: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:09,393 INFO L273 TraceCheckUtils]: 154: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:09,394 INFO L273 TraceCheckUtils]: 155: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:09,394 INFO L273 TraceCheckUtils]: 156: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:09,394 INFO L273 TraceCheckUtils]: 157: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:09,394 INFO L273 TraceCheckUtils]: 158: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:09,394 INFO L273 TraceCheckUtils]: 159: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:09,394 INFO L273 TraceCheckUtils]: 160: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:09,394 INFO L273 TraceCheckUtils]: 161: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:09,394 INFO L273 TraceCheckUtils]: 162: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:09,394 INFO L273 TraceCheckUtils]: 163: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:09,394 INFO L273 TraceCheckUtils]: 164: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:09,395 INFO L273 TraceCheckUtils]: 165: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:09,395 INFO L273 TraceCheckUtils]: 166: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:09,395 INFO L273 TraceCheckUtils]: 167: Hoare triple {33168#false} assume !(~i~2 < 99999); {33168#false} is VALID [2018-11-23 12:30:09,395 INFO L273 TraceCheckUtils]: 168: Hoare triple {33168#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {33168#false} is VALID [2018-11-23 12:30:09,395 INFO L256 TraceCheckUtils]: 169: Hoare triple {33168#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {33167#true} is VALID [2018-11-23 12:30:09,395 INFO L273 TraceCheckUtils]: 170: Hoare triple {33167#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33167#true} is VALID [2018-11-23 12:30:09,395 INFO L273 TraceCheckUtils]: 171: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,395 INFO L273 TraceCheckUtils]: 172: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,395 INFO L273 TraceCheckUtils]: 173: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,395 INFO L273 TraceCheckUtils]: 174: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,396 INFO L273 TraceCheckUtils]: 175: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,396 INFO L273 TraceCheckUtils]: 176: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,396 INFO L273 TraceCheckUtils]: 177: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,396 INFO L273 TraceCheckUtils]: 178: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,396 INFO L273 TraceCheckUtils]: 179: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,396 INFO L273 TraceCheckUtils]: 180: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,396 INFO L273 TraceCheckUtils]: 181: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,396 INFO L273 TraceCheckUtils]: 182: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,396 INFO L273 TraceCheckUtils]: 183: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,396 INFO L273 TraceCheckUtils]: 184: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,397 INFO L273 TraceCheckUtils]: 185: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,397 INFO L273 TraceCheckUtils]: 186: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,397 INFO L273 TraceCheckUtils]: 187: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,397 INFO L273 TraceCheckUtils]: 188: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,397 INFO L273 TraceCheckUtils]: 189: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,397 INFO L273 TraceCheckUtils]: 190: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,397 INFO L273 TraceCheckUtils]: 191: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,397 INFO L273 TraceCheckUtils]: 192: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,397 INFO L273 TraceCheckUtils]: 193: Hoare triple {33167#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33167#true} is VALID [2018-11-23 12:30:09,397 INFO L273 TraceCheckUtils]: 194: Hoare triple {33167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33167#true} is VALID [2018-11-23 12:30:09,398 INFO L273 TraceCheckUtils]: 195: Hoare triple {33167#true} assume !(~i~0 < 100000); {33167#true} is VALID [2018-11-23 12:30:09,398 INFO L273 TraceCheckUtils]: 196: Hoare triple {33167#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {33167#true} is VALID [2018-11-23 12:30:09,398 INFO L273 TraceCheckUtils]: 197: Hoare triple {33167#true} assume true; {33167#true} is VALID [2018-11-23 12:30:09,398 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {33167#true} {33168#false} #74#return; {33168#false} is VALID [2018-11-23 12:30:09,398 INFO L273 TraceCheckUtils]: 199: Hoare triple {33168#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {33168#false} is VALID [2018-11-23 12:30:09,398 INFO L273 TraceCheckUtils]: 200: Hoare triple {33168#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {33168#false} is VALID [2018-11-23 12:30:09,398 INFO L273 TraceCheckUtils]: 201: Hoare triple {33168#false} assume !false; {33168#false} is VALID [2018-11-23 12:30:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:30:09,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:09,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:30:09,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:30:09,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:30:09,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:09,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:10,881 INFO L256 TraceCheckUtils]: 0: Hoare triple {33167#true} call ULTIMATE.init(); {33167#true} is VALID [2018-11-23 12:30:10,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {33167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33167#true} is VALID [2018-11-23 12:30:10,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {33167#true} assume true; {33167#true} is VALID [2018-11-23 12:30:10,882 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33167#true} {33167#true} #66#return; {33167#true} is VALID [2018-11-23 12:30:10,882 INFO L256 TraceCheckUtils]: 4: Hoare triple {33167#true} call #t~ret12 := main(); {33167#true} is VALID [2018-11-23 12:30:10,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {33167#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {33226#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:10,884 INFO L273 TraceCheckUtils]: 6: Hoare triple {33226#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33226#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:10,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {33226#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33170#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:10,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {33170#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33170#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:10,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {33170#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33171#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:10,886 INFO L273 TraceCheckUtils]: 10: Hoare triple {33171#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33171#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:10,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {33171#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33172#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:10,887 INFO L273 TraceCheckUtils]: 12: Hoare triple {33172#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33172#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:10,888 INFO L273 TraceCheckUtils]: 13: Hoare triple {33172#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33173#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:10,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {33173#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33173#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:10,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {33173#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33174#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:10,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {33174#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33174#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:10,891 INFO L273 TraceCheckUtils]: 17: Hoare triple {33174#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33175#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:10,891 INFO L273 TraceCheckUtils]: 18: Hoare triple {33175#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33175#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:10,892 INFO L273 TraceCheckUtils]: 19: Hoare triple {33175#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33176#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:10,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {33176#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33176#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:10,893 INFO L273 TraceCheckUtils]: 21: Hoare triple {33176#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33177#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:10,894 INFO L273 TraceCheckUtils]: 22: Hoare triple {33177#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33177#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:10,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {33177#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33178#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:10,895 INFO L273 TraceCheckUtils]: 24: Hoare triple {33178#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33178#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:10,896 INFO L273 TraceCheckUtils]: 25: Hoare triple {33178#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33179#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:10,896 INFO L273 TraceCheckUtils]: 26: Hoare triple {33179#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33179#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:10,897 INFO L273 TraceCheckUtils]: 27: Hoare triple {33179#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33180#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:10,897 INFO L273 TraceCheckUtils]: 28: Hoare triple {33180#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33180#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:10,898 INFO L273 TraceCheckUtils]: 29: Hoare triple {33180#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33181#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:10,899 INFO L273 TraceCheckUtils]: 30: Hoare triple {33181#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33181#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:10,899 INFO L273 TraceCheckUtils]: 31: Hoare triple {33181#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33182#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:10,900 INFO L273 TraceCheckUtils]: 32: Hoare triple {33182#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33182#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:10,900 INFO L273 TraceCheckUtils]: 33: Hoare triple {33182#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33183#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:10,901 INFO L273 TraceCheckUtils]: 34: Hoare triple {33183#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33183#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:10,902 INFO L273 TraceCheckUtils]: 35: Hoare triple {33183#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33184#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:10,902 INFO L273 TraceCheckUtils]: 36: Hoare triple {33184#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33184#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:10,903 INFO L273 TraceCheckUtils]: 37: Hoare triple {33184#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33185#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:10,903 INFO L273 TraceCheckUtils]: 38: Hoare triple {33185#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33185#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:10,904 INFO L273 TraceCheckUtils]: 39: Hoare triple {33185#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33186#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:10,905 INFO L273 TraceCheckUtils]: 40: Hoare triple {33186#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33186#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:10,905 INFO L273 TraceCheckUtils]: 41: Hoare triple {33186#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33187#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:10,906 INFO L273 TraceCheckUtils]: 42: Hoare triple {33187#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33187#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:10,907 INFO L273 TraceCheckUtils]: 43: Hoare triple {33187#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33188#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:10,907 INFO L273 TraceCheckUtils]: 44: Hoare triple {33188#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33188#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:10,908 INFO L273 TraceCheckUtils]: 45: Hoare triple {33188#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33189#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:10,908 INFO L273 TraceCheckUtils]: 46: Hoare triple {33189#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33189#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:10,909 INFO L273 TraceCheckUtils]: 47: Hoare triple {33189#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33190#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:10,910 INFO L273 TraceCheckUtils]: 48: Hoare triple {33190#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33190#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:10,910 INFO L273 TraceCheckUtils]: 49: Hoare triple {33190#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33191#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:10,911 INFO L273 TraceCheckUtils]: 50: Hoare triple {33191#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33191#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:10,912 INFO L273 TraceCheckUtils]: 51: Hoare triple {33191#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33192#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:10,912 INFO L273 TraceCheckUtils]: 52: Hoare triple {33192#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33192#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:10,913 INFO L273 TraceCheckUtils]: 53: Hoare triple {33192#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33193#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:10,913 INFO L273 TraceCheckUtils]: 54: Hoare triple {33193#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33193#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:10,914 INFO L273 TraceCheckUtils]: 55: Hoare triple {33193#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33194#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:10,915 INFO L273 TraceCheckUtils]: 56: Hoare triple {33194#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33194#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:10,915 INFO L273 TraceCheckUtils]: 57: Hoare triple {33194#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33195#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:10,916 INFO L273 TraceCheckUtils]: 58: Hoare triple {33195#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33195#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:10,916 INFO L273 TraceCheckUtils]: 59: Hoare triple {33195#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33196#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:10,917 INFO L273 TraceCheckUtils]: 60: Hoare triple {33196#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33196#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:10,918 INFO L273 TraceCheckUtils]: 61: Hoare triple {33196#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33197#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:10,918 INFO L273 TraceCheckUtils]: 62: Hoare triple {33197#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33197#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:10,919 INFO L273 TraceCheckUtils]: 63: Hoare triple {33197#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33198#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:10,919 INFO L273 TraceCheckUtils]: 64: Hoare triple {33198#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33198#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:10,920 INFO L273 TraceCheckUtils]: 65: Hoare triple {33198#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33199#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:10,921 INFO L273 TraceCheckUtils]: 66: Hoare triple {33199#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33199#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:10,921 INFO L273 TraceCheckUtils]: 67: Hoare triple {33199#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33200#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:10,922 INFO L273 TraceCheckUtils]: 68: Hoare triple {33200#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33200#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:10,923 INFO L273 TraceCheckUtils]: 69: Hoare triple {33200#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33201#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:10,923 INFO L273 TraceCheckUtils]: 70: Hoare triple {33201#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33201#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:10,924 INFO L273 TraceCheckUtils]: 71: Hoare triple {33201#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33202#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:10,924 INFO L273 TraceCheckUtils]: 72: Hoare triple {33202#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33202#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:10,925 INFO L273 TraceCheckUtils]: 73: Hoare triple {33202#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33203#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:10,925 INFO L273 TraceCheckUtils]: 74: Hoare triple {33203#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33203#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:10,926 INFO L273 TraceCheckUtils]: 75: Hoare triple {33203#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33204#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:10,927 INFO L273 TraceCheckUtils]: 76: Hoare triple {33204#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33204#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:10,927 INFO L273 TraceCheckUtils]: 77: Hoare triple {33204#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33205#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:10,928 INFO L273 TraceCheckUtils]: 78: Hoare triple {33205#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33205#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:10,929 INFO L273 TraceCheckUtils]: 79: Hoare triple {33205#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33206#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:10,929 INFO L273 TraceCheckUtils]: 80: Hoare triple {33206#(<= main_~i~1 37)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33206#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:10,930 INFO L273 TraceCheckUtils]: 81: Hoare triple {33206#(<= main_~i~1 37)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33207#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:10,931 INFO L273 TraceCheckUtils]: 82: Hoare triple {33207#(<= main_~i~1 38)} assume !(~i~1 < 100000); {33168#false} is VALID [2018-11-23 12:30:10,931 INFO L256 TraceCheckUtils]: 83: Hoare triple {33168#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {33168#false} is VALID [2018-11-23 12:30:10,931 INFO L273 TraceCheckUtils]: 84: Hoare triple {33168#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33168#false} is VALID [2018-11-23 12:30:10,931 INFO L273 TraceCheckUtils]: 85: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,931 INFO L273 TraceCheckUtils]: 86: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,931 INFO L273 TraceCheckUtils]: 87: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,932 INFO L273 TraceCheckUtils]: 88: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,932 INFO L273 TraceCheckUtils]: 89: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,932 INFO L273 TraceCheckUtils]: 90: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,932 INFO L273 TraceCheckUtils]: 91: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,932 INFO L273 TraceCheckUtils]: 92: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,933 INFO L273 TraceCheckUtils]: 93: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,933 INFO L273 TraceCheckUtils]: 94: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,933 INFO L273 TraceCheckUtils]: 95: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,933 INFO L273 TraceCheckUtils]: 96: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,933 INFO L273 TraceCheckUtils]: 97: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,933 INFO L273 TraceCheckUtils]: 98: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,934 INFO L273 TraceCheckUtils]: 99: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,934 INFO L273 TraceCheckUtils]: 100: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,934 INFO L273 TraceCheckUtils]: 101: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,934 INFO L273 TraceCheckUtils]: 102: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,934 INFO L273 TraceCheckUtils]: 103: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,934 INFO L273 TraceCheckUtils]: 104: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,935 INFO L273 TraceCheckUtils]: 105: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,935 INFO L273 TraceCheckUtils]: 106: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,935 INFO L273 TraceCheckUtils]: 107: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,935 INFO L273 TraceCheckUtils]: 108: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,935 INFO L273 TraceCheckUtils]: 109: Hoare triple {33168#false} assume !(~i~0 < 100000); {33168#false} is VALID [2018-11-23 12:30:10,935 INFO L273 TraceCheckUtils]: 110: Hoare triple {33168#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {33168#false} is VALID [2018-11-23 12:30:10,935 INFO L273 TraceCheckUtils]: 111: Hoare triple {33168#false} assume true; {33168#false} is VALID [2018-11-23 12:30:10,935 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {33168#false} {33168#false} #70#return; {33168#false} is VALID [2018-11-23 12:30:10,936 INFO L273 TraceCheckUtils]: 113: Hoare triple {33168#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); {33168#false} is VALID [2018-11-23 12:30:10,936 INFO L256 TraceCheckUtils]: 114: Hoare triple {33168#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {33168#false} is VALID [2018-11-23 12:30:10,936 INFO L273 TraceCheckUtils]: 115: Hoare triple {33168#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33168#false} is VALID [2018-11-23 12:30:10,936 INFO L273 TraceCheckUtils]: 116: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,936 INFO L273 TraceCheckUtils]: 117: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,936 INFO L273 TraceCheckUtils]: 118: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,936 INFO L273 TraceCheckUtils]: 119: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,936 INFO L273 TraceCheckUtils]: 120: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,936 INFO L273 TraceCheckUtils]: 121: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,936 INFO L273 TraceCheckUtils]: 122: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,937 INFO L273 TraceCheckUtils]: 123: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,937 INFO L273 TraceCheckUtils]: 124: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,937 INFO L273 TraceCheckUtils]: 125: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,937 INFO L273 TraceCheckUtils]: 126: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,937 INFO L273 TraceCheckUtils]: 127: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,937 INFO L273 TraceCheckUtils]: 128: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,937 INFO L273 TraceCheckUtils]: 129: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,937 INFO L273 TraceCheckUtils]: 130: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,937 INFO L273 TraceCheckUtils]: 131: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,937 INFO L273 TraceCheckUtils]: 132: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,938 INFO L273 TraceCheckUtils]: 133: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,938 INFO L273 TraceCheckUtils]: 134: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,938 INFO L273 TraceCheckUtils]: 135: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,938 INFO L273 TraceCheckUtils]: 136: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,938 INFO L273 TraceCheckUtils]: 137: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,938 INFO L273 TraceCheckUtils]: 138: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,938 INFO L273 TraceCheckUtils]: 139: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,938 INFO L273 TraceCheckUtils]: 140: Hoare triple {33168#false} assume !(~i~0 < 100000); {33168#false} is VALID [2018-11-23 12:30:10,938 INFO L273 TraceCheckUtils]: 141: Hoare triple {33168#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {33168#false} is VALID [2018-11-23 12:30:10,938 INFO L273 TraceCheckUtils]: 142: Hoare triple {33168#false} assume true; {33168#false} is VALID [2018-11-23 12:30:10,939 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {33168#false} {33168#false} #72#return; {33168#false} is VALID [2018-11-23 12:30:10,939 INFO L273 TraceCheckUtils]: 144: Hoare triple {33168#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; {33168#false} is VALID [2018-11-23 12:30:10,939 INFO L273 TraceCheckUtils]: 145: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:10,939 INFO L273 TraceCheckUtils]: 146: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:10,939 INFO L273 TraceCheckUtils]: 147: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:10,939 INFO L273 TraceCheckUtils]: 148: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:10,939 INFO L273 TraceCheckUtils]: 149: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:10,939 INFO L273 TraceCheckUtils]: 150: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:10,939 INFO L273 TraceCheckUtils]: 151: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:10,939 INFO L273 TraceCheckUtils]: 152: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:10,940 INFO L273 TraceCheckUtils]: 153: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:10,940 INFO L273 TraceCheckUtils]: 154: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:10,940 INFO L273 TraceCheckUtils]: 155: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:10,940 INFO L273 TraceCheckUtils]: 156: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:10,940 INFO L273 TraceCheckUtils]: 157: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:10,940 INFO L273 TraceCheckUtils]: 158: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:10,940 INFO L273 TraceCheckUtils]: 159: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:10,940 INFO L273 TraceCheckUtils]: 160: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:10,940 INFO L273 TraceCheckUtils]: 161: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:10,941 INFO L273 TraceCheckUtils]: 162: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:10,941 INFO L273 TraceCheckUtils]: 163: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:10,941 INFO L273 TraceCheckUtils]: 164: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:10,941 INFO L273 TraceCheckUtils]: 165: Hoare triple {33168#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33168#false} is VALID [2018-11-23 12:30:10,941 INFO L273 TraceCheckUtils]: 166: Hoare triple {33168#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33168#false} is VALID [2018-11-23 12:30:10,941 INFO L273 TraceCheckUtils]: 167: Hoare triple {33168#false} assume !(~i~2 < 99999); {33168#false} is VALID [2018-11-23 12:30:10,941 INFO L273 TraceCheckUtils]: 168: Hoare triple {33168#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {33168#false} is VALID [2018-11-23 12:30:10,941 INFO L256 TraceCheckUtils]: 169: Hoare triple {33168#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {33168#false} is VALID [2018-11-23 12:30:10,941 INFO L273 TraceCheckUtils]: 170: Hoare triple {33168#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33168#false} is VALID [2018-11-23 12:30:10,941 INFO L273 TraceCheckUtils]: 171: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,942 INFO L273 TraceCheckUtils]: 172: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,942 INFO L273 TraceCheckUtils]: 173: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,942 INFO L273 TraceCheckUtils]: 174: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,942 INFO L273 TraceCheckUtils]: 175: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,942 INFO L273 TraceCheckUtils]: 176: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,942 INFO L273 TraceCheckUtils]: 177: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,942 INFO L273 TraceCheckUtils]: 178: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,942 INFO L273 TraceCheckUtils]: 179: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,942 INFO L273 TraceCheckUtils]: 180: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,942 INFO L273 TraceCheckUtils]: 181: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,943 INFO L273 TraceCheckUtils]: 182: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,943 INFO L273 TraceCheckUtils]: 183: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,943 INFO L273 TraceCheckUtils]: 184: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,943 INFO L273 TraceCheckUtils]: 185: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,943 INFO L273 TraceCheckUtils]: 186: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,943 INFO L273 TraceCheckUtils]: 187: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,943 INFO L273 TraceCheckUtils]: 188: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,943 INFO L273 TraceCheckUtils]: 189: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,943 INFO L273 TraceCheckUtils]: 190: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,943 INFO L273 TraceCheckUtils]: 191: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,944 INFO L273 TraceCheckUtils]: 192: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,944 INFO L273 TraceCheckUtils]: 193: Hoare triple {33168#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33168#false} is VALID [2018-11-23 12:30:10,944 INFO L273 TraceCheckUtils]: 194: Hoare triple {33168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33168#false} is VALID [2018-11-23 12:30:10,944 INFO L273 TraceCheckUtils]: 195: Hoare triple {33168#false} assume !(~i~0 < 100000); {33168#false} is VALID [2018-11-23 12:30:10,944 INFO L273 TraceCheckUtils]: 196: Hoare triple {33168#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {33168#false} is VALID [2018-11-23 12:30:10,944 INFO L273 TraceCheckUtils]: 197: Hoare triple {33168#false} assume true; {33168#false} is VALID [2018-11-23 12:30:10,944 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {33168#false} {33168#false} #74#return; {33168#false} is VALID [2018-11-23 12:30:10,944 INFO L273 TraceCheckUtils]: 199: Hoare triple {33168#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {33168#false} is VALID [2018-11-23 12:30:10,944 INFO L273 TraceCheckUtils]: 200: Hoare triple {33168#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {33168#false} is VALID [2018-11-23 12:30:10,945 INFO L273 TraceCheckUtils]: 201: Hoare triple {33168#false} assume !false; {33168#false} is VALID [2018-11-23 12:30:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:30:10,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:10,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:30:10,983 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-11-23 12:30:10,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:10,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:30:11,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:11,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:30:11,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:30:11,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:30:11,104 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2018-11-23 12:30:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:12,356 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2018-11-23 12:30:12,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:30:12,356 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-11-23 12:30:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:30:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:30:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:30:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:30:12,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 130 transitions. [2018-11-23 12:30:12,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:12,489 INFO L225 Difference]: With dead ends: 210 [2018-11-23 12:30:12,490 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 12:30:12,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:30:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 12:30:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-11-23 12:30:12,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:12,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 147 states. [2018-11-23 12:30:12,544 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 147 states. [2018-11-23 12:30:12,544 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 147 states. [2018-11-23 12:30:12,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:12,547 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:30:12,547 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:30:12,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:12,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:12,547 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 148 states. [2018-11-23 12:30:12,547 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 148 states. [2018-11-23 12:30:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:12,550 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:30:12,550 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:30:12,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:12,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:12,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:12,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 12:30:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2018-11-23 12:30:12,553 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 202 [2018-11-23 12:30:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:12,554 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2018-11-23 12:30:12,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:30:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-11-23 12:30:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-23 12:30:12,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:12,555 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:12,555 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:12,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:12,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1650436603, now seen corresponding path program 39 times [2018-11-23 12:30:12,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:12,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:12,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:12,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:12,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:13,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {34642#true} call ULTIMATE.init(); {34642#true} is VALID [2018-11-23 12:30:13,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {34642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34642#true} is VALID [2018-11-23 12:30:13,580 INFO L273 TraceCheckUtils]: 2: Hoare triple {34642#true} assume true; {34642#true} is VALID [2018-11-23 12:30:13,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34642#true} {34642#true} #66#return; {34642#true} is VALID [2018-11-23 12:30:13,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {34642#true} call #t~ret12 := main(); {34642#true} is VALID [2018-11-23 12:30:13,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {34642#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34644#(= main_~i~1 0)} is VALID [2018-11-23 12:30:13,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {34644#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34644#(= main_~i~1 0)} is VALID [2018-11-23 12:30:13,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {34644#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34645#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:13,582 INFO L273 TraceCheckUtils]: 8: Hoare triple {34645#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34645#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:13,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {34645#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34646#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:13,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {34646#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34646#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:13,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {34646#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34647#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:13,585 INFO L273 TraceCheckUtils]: 12: Hoare triple {34647#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34647#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:13,585 INFO L273 TraceCheckUtils]: 13: Hoare triple {34647#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34648#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:13,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {34648#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34648#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:13,586 INFO L273 TraceCheckUtils]: 15: Hoare triple {34648#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34649#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:13,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {34649#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34649#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:13,588 INFO L273 TraceCheckUtils]: 17: Hoare triple {34649#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34650#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:13,588 INFO L273 TraceCheckUtils]: 18: Hoare triple {34650#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34650#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:13,589 INFO L273 TraceCheckUtils]: 19: Hoare triple {34650#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34651#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:13,589 INFO L273 TraceCheckUtils]: 20: Hoare triple {34651#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34651#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:13,590 INFO L273 TraceCheckUtils]: 21: Hoare triple {34651#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34652#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:13,591 INFO L273 TraceCheckUtils]: 22: Hoare triple {34652#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34652#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:13,591 INFO L273 TraceCheckUtils]: 23: Hoare triple {34652#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34653#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:13,592 INFO L273 TraceCheckUtils]: 24: Hoare triple {34653#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34653#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:13,593 INFO L273 TraceCheckUtils]: 25: Hoare triple {34653#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34654#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:13,593 INFO L273 TraceCheckUtils]: 26: Hoare triple {34654#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34654#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:13,594 INFO L273 TraceCheckUtils]: 27: Hoare triple {34654#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34655#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:13,594 INFO L273 TraceCheckUtils]: 28: Hoare triple {34655#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34655#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:13,595 INFO L273 TraceCheckUtils]: 29: Hoare triple {34655#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34656#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:13,596 INFO L273 TraceCheckUtils]: 30: Hoare triple {34656#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34656#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:13,596 INFO L273 TraceCheckUtils]: 31: Hoare triple {34656#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34657#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:13,597 INFO L273 TraceCheckUtils]: 32: Hoare triple {34657#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34657#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:13,598 INFO L273 TraceCheckUtils]: 33: Hoare triple {34657#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34658#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:13,598 INFO L273 TraceCheckUtils]: 34: Hoare triple {34658#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34658#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:13,599 INFO L273 TraceCheckUtils]: 35: Hoare triple {34658#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34659#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:13,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {34659#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34659#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:13,600 INFO L273 TraceCheckUtils]: 37: Hoare triple {34659#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34660#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:13,601 INFO L273 TraceCheckUtils]: 38: Hoare triple {34660#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34660#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:13,601 INFO L273 TraceCheckUtils]: 39: Hoare triple {34660#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34661#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:13,602 INFO L273 TraceCheckUtils]: 40: Hoare triple {34661#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34661#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:13,602 INFO L273 TraceCheckUtils]: 41: Hoare triple {34661#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34662#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:13,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {34662#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34662#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:13,604 INFO L273 TraceCheckUtils]: 43: Hoare triple {34662#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34663#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:13,604 INFO L273 TraceCheckUtils]: 44: Hoare triple {34663#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34663#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:13,605 INFO L273 TraceCheckUtils]: 45: Hoare triple {34663#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34664#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:13,605 INFO L273 TraceCheckUtils]: 46: Hoare triple {34664#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34664#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:13,606 INFO L273 TraceCheckUtils]: 47: Hoare triple {34664#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34665#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:13,607 INFO L273 TraceCheckUtils]: 48: Hoare triple {34665#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34665#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:13,607 INFO L273 TraceCheckUtils]: 49: Hoare triple {34665#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34666#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:13,608 INFO L273 TraceCheckUtils]: 50: Hoare triple {34666#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34666#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:13,609 INFO L273 TraceCheckUtils]: 51: Hoare triple {34666#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34667#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:13,609 INFO L273 TraceCheckUtils]: 52: Hoare triple {34667#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34667#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:13,610 INFO L273 TraceCheckUtils]: 53: Hoare triple {34667#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34668#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:13,610 INFO L273 TraceCheckUtils]: 54: Hoare triple {34668#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34668#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:13,611 INFO L273 TraceCheckUtils]: 55: Hoare triple {34668#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34669#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:13,612 INFO L273 TraceCheckUtils]: 56: Hoare triple {34669#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34669#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:13,612 INFO L273 TraceCheckUtils]: 57: Hoare triple {34669#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34670#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:13,613 INFO L273 TraceCheckUtils]: 58: Hoare triple {34670#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34670#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:13,614 INFO L273 TraceCheckUtils]: 59: Hoare triple {34670#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34671#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:13,614 INFO L273 TraceCheckUtils]: 60: Hoare triple {34671#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34671#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:13,615 INFO L273 TraceCheckUtils]: 61: Hoare triple {34671#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34672#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:13,615 INFO L273 TraceCheckUtils]: 62: Hoare triple {34672#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34672#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:13,616 INFO L273 TraceCheckUtils]: 63: Hoare triple {34672#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34673#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:13,617 INFO L273 TraceCheckUtils]: 64: Hoare triple {34673#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34673#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:13,617 INFO L273 TraceCheckUtils]: 65: Hoare triple {34673#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34674#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:13,618 INFO L273 TraceCheckUtils]: 66: Hoare triple {34674#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34674#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:13,619 INFO L273 TraceCheckUtils]: 67: Hoare triple {34674#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34675#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:13,619 INFO L273 TraceCheckUtils]: 68: Hoare triple {34675#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34675#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:13,620 INFO L273 TraceCheckUtils]: 69: Hoare triple {34675#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34676#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:13,620 INFO L273 TraceCheckUtils]: 70: Hoare triple {34676#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34676#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:13,621 INFO L273 TraceCheckUtils]: 71: Hoare triple {34676#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34677#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:13,621 INFO L273 TraceCheckUtils]: 72: Hoare triple {34677#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34677#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:13,622 INFO L273 TraceCheckUtils]: 73: Hoare triple {34677#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34678#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:13,623 INFO L273 TraceCheckUtils]: 74: Hoare triple {34678#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34678#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:13,623 INFO L273 TraceCheckUtils]: 75: Hoare triple {34678#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34679#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:13,624 INFO L273 TraceCheckUtils]: 76: Hoare triple {34679#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34679#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:13,625 INFO L273 TraceCheckUtils]: 77: Hoare triple {34679#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34680#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:13,625 INFO L273 TraceCheckUtils]: 78: Hoare triple {34680#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34680#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:13,626 INFO L273 TraceCheckUtils]: 79: Hoare triple {34680#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34681#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:13,626 INFO L273 TraceCheckUtils]: 80: Hoare triple {34681#(<= main_~i~1 37)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34681#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:13,627 INFO L273 TraceCheckUtils]: 81: Hoare triple {34681#(<= main_~i~1 37)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34682#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:13,628 INFO L273 TraceCheckUtils]: 82: Hoare triple {34682#(<= main_~i~1 38)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34682#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:13,628 INFO L273 TraceCheckUtils]: 83: Hoare triple {34682#(<= main_~i~1 38)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34683#(<= main_~i~1 39)} is VALID [2018-11-23 12:30:13,629 INFO L273 TraceCheckUtils]: 84: Hoare triple {34683#(<= main_~i~1 39)} assume !(~i~1 < 100000); {34643#false} is VALID [2018-11-23 12:30:13,629 INFO L256 TraceCheckUtils]: 85: Hoare triple {34643#false} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {34642#true} is VALID [2018-11-23 12:30:13,629 INFO L273 TraceCheckUtils]: 86: Hoare triple {34642#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34642#true} is VALID [2018-11-23 12:30:13,630 INFO L273 TraceCheckUtils]: 87: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,630 INFO L273 TraceCheckUtils]: 88: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,630 INFO L273 TraceCheckUtils]: 89: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,630 INFO L273 TraceCheckUtils]: 90: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,630 INFO L273 TraceCheckUtils]: 91: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,630 INFO L273 TraceCheckUtils]: 92: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,631 INFO L273 TraceCheckUtils]: 93: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,631 INFO L273 TraceCheckUtils]: 94: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,631 INFO L273 TraceCheckUtils]: 95: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,631 INFO L273 TraceCheckUtils]: 96: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,631 INFO L273 TraceCheckUtils]: 97: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,632 INFO L273 TraceCheckUtils]: 98: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,632 INFO L273 TraceCheckUtils]: 99: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,632 INFO L273 TraceCheckUtils]: 100: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,632 INFO L273 TraceCheckUtils]: 101: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,632 INFO L273 TraceCheckUtils]: 102: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,632 INFO L273 TraceCheckUtils]: 103: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,633 INFO L273 TraceCheckUtils]: 104: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,633 INFO L273 TraceCheckUtils]: 105: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,633 INFO L273 TraceCheckUtils]: 106: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,633 INFO L273 TraceCheckUtils]: 107: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,633 INFO L273 TraceCheckUtils]: 108: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,634 INFO L273 TraceCheckUtils]: 109: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,634 INFO L273 TraceCheckUtils]: 110: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,634 INFO L273 TraceCheckUtils]: 111: Hoare triple {34642#true} assume !(~i~0 < 100000); {34642#true} is VALID [2018-11-23 12:30:13,634 INFO L273 TraceCheckUtils]: 112: Hoare triple {34642#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {34642#true} is VALID [2018-11-23 12:30:13,634 INFO L273 TraceCheckUtils]: 113: Hoare triple {34642#true} assume true; {34642#true} is VALID [2018-11-23 12:30:13,634 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {34642#true} {34643#false} #70#return; {34643#false} is VALID [2018-11-23 12:30:13,634 INFO L273 TraceCheckUtils]: 115: Hoare triple {34643#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); {34643#false} is VALID [2018-11-23 12:30:13,634 INFO L256 TraceCheckUtils]: 116: Hoare triple {34643#false} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {34642#true} is VALID [2018-11-23 12:30:13,635 INFO L273 TraceCheckUtils]: 117: Hoare triple {34642#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34642#true} is VALID [2018-11-23 12:30:13,635 INFO L273 TraceCheckUtils]: 118: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,635 INFO L273 TraceCheckUtils]: 119: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,635 INFO L273 TraceCheckUtils]: 120: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,635 INFO L273 TraceCheckUtils]: 121: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,635 INFO L273 TraceCheckUtils]: 122: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,635 INFO L273 TraceCheckUtils]: 123: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,635 INFO L273 TraceCheckUtils]: 124: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,635 INFO L273 TraceCheckUtils]: 125: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,635 INFO L273 TraceCheckUtils]: 126: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,636 INFO L273 TraceCheckUtils]: 127: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,636 INFO L273 TraceCheckUtils]: 128: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,636 INFO L273 TraceCheckUtils]: 129: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,636 INFO L273 TraceCheckUtils]: 130: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,636 INFO L273 TraceCheckUtils]: 131: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,636 INFO L273 TraceCheckUtils]: 132: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,636 INFO L273 TraceCheckUtils]: 133: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,636 INFO L273 TraceCheckUtils]: 134: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,636 INFO L273 TraceCheckUtils]: 135: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,636 INFO L273 TraceCheckUtils]: 136: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,637 INFO L273 TraceCheckUtils]: 137: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,637 INFO L273 TraceCheckUtils]: 138: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,637 INFO L273 TraceCheckUtils]: 139: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,637 INFO L273 TraceCheckUtils]: 140: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,637 INFO L273 TraceCheckUtils]: 141: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,637 INFO L273 TraceCheckUtils]: 142: Hoare triple {34642#true} assume !(~i~0 < 100000); {34642#true} is VALID [2018-11-23 12:30:13,637 INFO L273 TraceCheckUtils]: 143: Hoare triple {34642#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {34642#true} is VALID [2018-11-23 12:30:13,637 INFO L273 TraceCheckUtils]: 144: Hoare triple {34642#true} assume true; {34642#true} is VALID [2018-11-23 12:30:13,637 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {34642#true} {34643#false} #72#return; {34643#false} is VALID [2018-11-23 12:30:13,637 INFO L273 TraceCheckUtils]: 146: Hoare triple {34643#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; {34643#false} is VALID [2018-11-23 12:30:13,638 INFO L273 TraceCheckUtils]: 147: Hoare triple {34643#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34643#false} is VALID [2018-11-23 12:30:13,638 INFO L273 TraceCheckUtils]: 148: Hoare triple {34643#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34643#false} is VALID [2018-11-23 12:30:13,638 INFO L273 TraceCheckUtils]: 149: Hoare triple {34643#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34643#false} is VALID [2018-11-23 12:30:13,638 INFO L273 TraceCheckUtils]: 150: Hoare triple {34643#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34643#false} is VALID [2018-11-23 12:30:13,638 INFO L273 TraceCheckUtils]: 151: Hoare triple {34643#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34643#false} is VALID [2018-11-23 12:30:13,638 INFO L273 TraceCheckUtils]: 152: Hoare triple {34643#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34643#false} is VALID [2018-11-23 12:30:13,638 INFO L273 TraceCheckUtils]: 153: Hoare triple {34643#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34643#false} is VALID [2018-11-23 12:30:13,638 INFO L273 TraceCheckUtils]: 154: Hoare triple {34643#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34643#false} is VALID [2018-11-23 12:30:13,638 INFO L273 TraceCheckUtils]: 155: Hoare triple {34643#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34643#false} is VALID [2018-11-23 12:30:13,638 INFO L273 TraceCheckUtils]: 156: Hoare triple {34643#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34643#false} is VALID [2018-11-23 12:30:13,639 INFO L273 TraceCheckUtils]: 157: Hoare triple {34643#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34643#false} is VALID [2018-11-23 12:30:13,639 INFO L273 TraceCheckUtils]: 158: Hoare triple {34643#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34643#false} is VALID [2018-11-23 12:30:13,639 INFO L273 TraceCheckUtils]: 159: Hoare triple {34643#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34643#false} is VALID [2018-11-23 12:30:13,639 INFO L273 TraceCheckUtils]: 160: Hoare triple {34643#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34643#false} is VALID [2018-11-23 12:30:13,639 INFO L273 TraceCheckUtils]: 161: Hoare triple {34643#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34643#false} is VALID [2018-11-23 12:30:13,639 INFO L273 TraceCheckUtils]: 162: Hoare triple {34643#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34643#false} is VALID [2018-11-23 12:30:13,639 INFO L273 TraceCheckUtils]: 163: Hoare triple {34643#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34643#false} is VALID [2018-11-23 12:30:13,639 INFO L273 TraceCheckUtils]: 164: Hoare triple {34643#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34643#false} is VALID [2018-11-23 12:30:13,639 INFO L273 TraceCheckUtils]: 165: Hoare triple {34643#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34643#false} is VALID [2018-11-23 12:30:13,640 INFO L273 TraceCheckUtils]: 166: Hoare triple {34643#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34643#false} is VALID [2018-11-23 12:30:13,640 INFO L273 TraceCheckUtils]: 167: Hoare triple {34643#false} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34643#false} is VALID [2018-11-23 12:30:13,640 INFO L273 TraceCheckUtils]: 168: Hoare triple {34643#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34643#false} is VALID [2018-11-23 12:30:13,640 INFO L273 TraceCheckUtils]: 169: Hoare triple {34643#false} assume !(~i~2 < 99999); {34643#false} is VALID [2018-11-23 12:30:13,640 INFO L273 TraceCheckUtils]: 170: Hoare triple {34643#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {34643#false} is VALID [2018-11-23 12:30:13,640 INFO L256 TraceCheckUtils]: 171: Hoare triple {34643#false} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {34642#true} is VALID [2018-11-23 12:30:13,640 INFO L273 TraceCheckUtils]: 172: Hoare triple {34642#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34642#true} is VALID [2018-11-23 12:30:13,640 INFO L273 TraceCheckUtils]: 173: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,640 INFO L273 TraceCheckUtils]: 174: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,640 INFO L273 TraceCheckUtils]: 175: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,641 INFO L273 TraceCheckUtils]: 176: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,641 INFO L273 TraceCheckUtils]: 177: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,641 INFO L273 TraceCheckUtils]: 178: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,641 INFO L273 TraceCheckUtils]: 179: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,641 INFO L273 TraceCheckUtils]: 180: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,641 INFO L273 TraceCheckUtils]: 181: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,641 INFO L273 TraceCheckUtils]: 182: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,641 INFO L273 TraceCheckUtils]: 183: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,641 INFO L273 TraceCheckUtils]: 184: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,641 INFO L273 TraceCheckUtils]: 185: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,642 INFO L273 TraceCheckUtils]: 186: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,642 INFO L273 TraceCheckUtils]: 187: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,642 INFO L273 TraceCheckUtils]: 188: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,642 INFO L273 TraceCheckUtils]: 189: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,642 INFO L273 TraceCheckUtils]: 190: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,642 INFO L273 TraceCheckUtils]: 191: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,642 INFO L273 TraceCheckUtils]: 192: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,642 INFO L273 TraceCheckUtils]: 193: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,642 INFO L273 TraceCheckUtils]: 194: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,642 INFO L273 TraceCheckUtils]: 195: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:13,643 INFO L273 TraceCheckUtils]: 196: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:13,643 INFO L273 TraceCheckUtils]: 197: Hoare triple {34642#true} assume !(~i~0 < 100000); {34642#true} is VALID [2018-11-23 12:30:13,643 INFO L273 TraceCheckUtils]: 198: Hoare triple {34642#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {34642#true} is VALID [2018-11-23 12:30:13,643 INFO L273 TraceCheckUtils]: 199: Hoare triple {34642#true} assume true; {34642#true} is VALID [2018-11-23 12:30:13,643 INFO L268 TraceCheckUtils]: 200: Hoare quadruple {34642#true} {34643#false} #74#return; {34643#false} is VALID [2018-11-23 12:30:13,643 INFO L273 TraceCheckUtils]: 201: Hoare triple {34643#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {34643#false} is VALID [2018-11-23 12:30:13,643 INFO L273 TraceCheckUtils]: 202: Hoare triple {34643#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {34643#false} is VALID [2018-11-23 12:30:13,643 INFO L273 TraceCheckUtils]: 203: Hoare triple {34643#false} assume !false; {34643#false} is VALID [2018-11-23 12:30:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:30:13,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:13,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:30:13,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:30:14,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-23 12:30:14,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:14,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:15,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {34642#true} call ULTIMATE.init(); {34642#true} is VALID [2018-11-23 12:30:15,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {34642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34642#true} is VALID [2018-11-23 12:30:15,234 INFO L273 TraceCheckUtils]: 2: Hoare triple {34642#true} assume true; {34642#true} is VALID [2018-11-23 12:30:15,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34642#true} {34642#true} #66#return; {34642#true} is VALID [2018-11-23 12:30:15,235 INFO L256 TraceCheckUtils]: 4: Hoare triple {34642#true} call #t~ret12 := main(); {34642#true} is VALID [2018-11-23 12:30:15,235 INFO L273 TraceCheckUtils]: 5: Hoare triple {34642#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34642#true} is VALID [2018-11-23 12:30:15,235 INFO L273 TraceCheckUtils]: 6: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,236 INFO L273 TraceCheckUtils]: 8: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,236 INFO L273 TraceCheckUtils]: 9: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,236 INFO L273 TraceCheckUtils]: 10: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,236 INFO L273 TraceCheckUtils]: 11: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,236 INFO L273 TraceCheckUtils]: 12: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,236 INFO L273 TraceCheckUtils]: 13: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,237 INFO L273 TraceCheckUtils]: 14: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,237 INFO L273 TraceCheckUtils]: 15: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,237 INFO L273 TraceCheckUtils]: 16: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,237 INFO L273 TraceCheckUtils]: 17: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,237 INFO L273 TraceCheckUtils]: 18: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,237 INFO L273 TraceCheckUtils]: 19: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,237 INFO L273 TraceCheckUtils]: 21: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,238 INFO L273 TraceCheckUtils]: 22: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,238 INFO L273 TraceCheckUtils]: 23: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,238 INFO L273 TraceCheckUtils]: 24: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,238 INFO L273 TraceCheckUtils]: 25: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,238 INFO L273 TraceCheckUtils]: 26: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,238 INFO L273 TraceCheckUtils]: 27: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,238 INFO L273 TraceCheckUtils]: 28: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,238 INFO L273 TraceCheckUtils]: 29: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,238 INFO L273 TraceCheckUtils]: 30: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,238 INFO L273 TraceCheckUtils]: 31: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,239 INFO L273 TraceCheckUtils]: 32: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,239 INFO L273 TraceCheckUtils]: 33: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,239 INFO L273 TraceCheckUtils]: 34: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,239 INFO L273 TraceCheckUtils]: 35: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,239 INFO L273 TraceCheckUtils]: 36: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,239 INFO L273 TraceCheckUtils]: 37: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,239 INFO L273 TraceCheckUtils]: 38: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,239 INFO L273 TraceCheckUtils]: 39: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,239 INFO L273 TraceCheckUtils]: 40: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,239 INFO L273 TraceCheckUtils]: 41: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,240 INFO L273 TraceCheckUtils]: 42: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,240 INFO L273 TraceCheckUtils]: 43: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,240 INFO L273 TraceCheckUtils]: 44: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,240 INFO L273 TraceCheckUtils]: 45: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,240 INFO L273 TraceCheckUtils]: 46: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,240 INFO L273 TraceCheckUtils]: 47: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,240 INFO L273 TraceCheckUtils]: 48: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,240 INFO L273 TraceCheckUtils]: 49: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,240 INFO L273 TraceCheckUtils]: 50: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,240 INFO L273 TraceCheckUtils]: 51: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,241 INFO L273 TraceCheckUtils]: 52: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,241 INFO L273 TraceCheckUtils]: 53: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,241 INFO L273 TraceCheckUtils]: 54: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,241 INFO L273 TraceCheckUtils]: 55: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,241 INFO L273 TraceCheckUtils]: 56: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,241 INFO L273 TraceCheckUtils]: 57: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,241 INFO L273 TraceCheckUtils]: 58: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,241 INFO L273 TraceCheckUtils]: 59: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,241 INFO L273 TraceCheckUtils]: 60: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,241 INFO L273 TraceCheckUtils]: 61: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,242 INFO L273 TraceCheckUtils]: 62: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,242 INFO L273 TraceCheckUtils]: 63: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,242 INFO L273 TraceCheckUtils]: 64: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,242 INFO L273 TraceCheckUtils]: 65: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,242 INFO L273 TraceCheckUtils]: 66: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,242 INFO L273 TraceCheckUtils]: 67: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,242 INFO L273 TraceCheckUtils]: 68: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,242 INFO L273 TraceCheckUtils]: 69: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,242 INFO L273 TraceCheckUtils]: 70: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,243 INFO L273 TraceCheckUtils]: 71: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,243 INFO L273 TraceCheckUtils]: 72: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,243 INFO L273 TraceCheckUtils]: 73: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,243 INFO L273 TraceCheckUtils]: 74: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,243 INFO L273 TraceCheckUtils]: 75: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,243 INFO L273 TraceCheckUtils]: 76: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,243 INFO L273 TraceCheckUtils]: 77: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,243 INFO L273 TraceCheckUtils]: 78: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,243 INFO L273 TraceCheckUtils]: 79: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,243 INFO L273 TraceCheckUtils]: 80: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,244 INFO L273 TraceCheckUtils]: 81: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,244 INFO L273 TraceCheckUtils]: 82: Hoare triple {34642#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34642#true} is VALID [2018-11-23 12:30:15,244 INFO L273 TraceCheckUtils]: 83: Hoare triple {34642#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34642#true} is VALID [2018-11-23 12:30:15,244 INFO L273 TraceCheckUtils]: 84: Hoare triple {34642#true} assume !(~i~1 < 100000); {34642#true} is VALID [2018-11-23 12:30:15,244 INFO L256 TraceCheckUtils]: 85: Hoare triple {34642#true} call #t~ret4 := mapavg(~#x~0.base, ~#x~0.offset); {34642#true} is VALID [2018-11-23 12:30:15,244 INFO L273 TraceCheckUtils]: 86: Hoare triple {34642#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34642#true} is VALID [2018-11-23 12:30:15,244 INFO L273 TraceCheckUtils]: 87: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,244 INFO L273 TraceCheckUtils]: 88: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,244 INFO L273 TraceCheckUtils]: 89: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,244 INFO L273 TraceCheckUtils]: 90: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,245 INFO L273 TraceCheckUtils]: 91: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,245 INFO L273 TraceCheckUtils]: 92: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,245 INFO L273 TraceCheckUtils]: 93: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,245 INFO L273 TraceCheckUtils]: 94: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,245 INFO L273 TraceCheckUtils]: 95: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,245 INFO L273 TraceCheckUtils]: 96: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,245 INFO L273 TraceCheckUtils]: 97: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,245 INFO L273 TraceCheckUtils]: 98: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,245 INFO L273 TraceCheckUtils]: 99: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,245 INFO L273 TraceCheckUtils]: 100: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,246 INFO L273 TraceCheckUtils]: 101: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,246 INFO L273 TraceCheckUtils]: 102: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,246 INFO L273 TraceCheckUtils]: 103: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,246 INFO L273 TraceCheckUtils]: 104: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,246 INFO L273 TraceCheckUtils]: 105: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,246 INFO L273 TraceCheckUtils]: 106: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,246 INFO L273 TraceCheckUtils]: 107: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,246 INFO L273 TraceCheckUtils]: 108: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,246 INFO L273 TraceCheckUtils]: 109: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,246 INFO L273 TraceCheckUtils]: 110: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,247 INFO L273 TraceCheckUtils]: 111: Hoare triple {34642#true} assume !(~i~0 < 100000); {34642#true} is VALID [2018-11-23 12:30:15,247 INFO L273 TraceCheckUtils]: 112: Hoare triple {34642#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {34642#true} is VALID [2018-11-23 12:30:15,247 INFO L273 TraceCheckUtils]: 113: Hoare triple {34642#true} assume true; {34642#true} is VALID [2018-11-23 12:30:15,247 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {34642#true} {34642#true} #70#return; {34642#true} is VALID [2018-11-23 12:30:15,247 INFO L273 TraceCheckUtils]: 115: Hoare triple {34642#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); {34642#true} is VALID [2018-11-23 12:30:15,247 INFO L256 TraceCheckUtils]: 116: Hoare triple {34642#true} call #t~ret7 := mapavg(~#x~0.base, ~#x~0.offset); {34642#true} is VALID [2018-11-23 12:30:15,247 INFO L273 TraceCheckUtils]: 117: Hoare triple {34642#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34642#true} is VALID [2018-11-23 12:30:15,247 INFO L273 TraceCheckUtils]: 118: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,247 INFO L273 TraceCheckUtils]: 119: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,247 INFO L273 TraceCheckUtils]: 120: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,248 INFO L273 TraceCheckUtils]: 121: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,248 INFO L273 TraceCheckUtils]: 122: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,248 INFO L273 TraceCheckUtils]: 123: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,248 INFO L273 TraceCheckUtils]: 124: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,248 INFO L273 TraceCheckUtils]: 125: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,248 INFO L273 TraceCheckUtils]: 126: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,248 INFO L273 TraceCheckUtils]: 127: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,248 INFO L273 TraceCheckUtils]: 128: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,248 INFO L273 TraceCheckUtils]: 129: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,249 INFO L273 TraceCheckUtils]: 130: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,249 INFO L273 TraceCheckUtils]: 131: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,249 INFO L273 TraceCheckUtils]: 132: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,249 INFO L273 TraceCheckUtils]: 133: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,249 INFO L273 TraceCheckUtils]: 134: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,249 INFO L273 TraceCheckUtils]: 135: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,249 INFO L273 TraceCheckUtils]: 136: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,249 INFO L273 TraceCheckUtils]: 137: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,249 INFO L273 TraceCheckUtils]: 138: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,249 INFO L273 TraceCheckUtils]: 139: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,250 INFO L273 TraceCheckUtils]: 140: Hoare triple {34642#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34642#true} is VALID [2018-11-23 12:30:15,250 INFO L273 TraceCheckUtils]: 141: Hoare triple {34642#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34642#true} is VALID [2018-11-23 12:30:15,250 INFO L273 TraceCheckUtils]: 142: Hoare triple {34642#true} assume !(~i~0 < 100000); {34642#true} is VALID [2018-11-23 12:30:15,250 INFO L273 TraceCheckUtils]: 143: Hoare triple {34642#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {34642#true} is VALID [2018-11-23 12:30:15,250 INFO L273 TraceCheckUtils]: 144: Hoare triple {34642#true} assume true; {34642#true} is VALID [2018-11-23 12:30:15,250 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {34642#true} {34642#true} #72#return; {34642#true} is VALID [2018-11-23 12:30:15,250 INFO L273 TraceCheckUtils]: 146: Hoare triple {34642#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; {34642#true} is VALID [2018-11-23 12:30:15,250 INFO L273 TraceCheckUtils]: 147: Hoare triple {34642#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34642#true} is VALID [2018-11-23 12:30:15,250 INFO L273 TraceCheckUtils]: 148: Hoare triple {34642#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34642#true} is VALID [2018-11-23 12:30:15,250 INFO L273 TraceCheckUtils]: 149: Hoare triple {34642#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34642#true} is VALID [2018-11-23 12:30:15,251 INFO L273 TraceCheckUtils]: 150: Hoare triple {34642#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34642#true} is VALID [2018-11-23 12:30:15,251 INFO L273 TraceCheckUtils]: 151: Hoare triple {34642#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34642#true} is VALID [2018-11-23 12:30:15,251 INFO L273 TraceCheckUtils]: 152: Hoare triple {34642#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34642#true} is VALID [2018-11-23 12:30:15,251 INFO L273 TraceCheckUtils]: 153: Hoare triple {34642#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34642#true} is VALID [2018-11-23 12:30:15,251 INFO L273 TraceCheckUtils]: 154: Hoare triple {34642#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34642#true} is VALID [2018-11-23 12:30:15,251 INFO L273 TraceCheckUtils]: 155: Hoare triple {34642#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34642#true} is VALID [2018-11-23 12:30:15,251 INFO L273 TraceCheckUtils]: 156: Hoare triple {34642#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34642#true} is VALID [2018-11-23 12:30:15,251 INFO L273 TraceCheckUtils]: 157: Hoare triple {34642#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34642#true} is VALID [2018-11-23 12:30:15,251 INFO L273 TraceCheckUtils]: 158: Hoare triple {34642#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34642#true} is VALID [2018-11-23 12:30:15,251 INFO L273 TraceCheckUtils]: 159: Hoare triple {34642#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34642#true} is VALID [2018-11-23 12:30:15,252 INFO L273 TraceCheckUtils]: 160: Hoare triple {34642#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34642#true} is VALID [2018-11-23 12:30:15,252 INFO L273 TraceCheckUtils]: 161: Hoare triple {34642#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34642#true} is VALID [2018-11-23 12:30:15,252 INFO L273 TraceCheckUtils]: 162: Hoare triple {34642#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34642#true} is VALID [2018-11-23 12:30:15,252 INFO L273 TraceCheckUtils]: 163: Hoare triple {34642#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34642#true} is VALID [2018-11-23 12:30:15,252 INFO L273 TraceCheckUtils]: 164: Hoare triple {34642#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34642#true} is VALID [2018-11-23 12:30:15,252 INFO L273 TraceCheckUtils]: 165: Hoare triple {34642#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34642#true} is VALID [2018-11-23 12:30:15,252 INFO L273 TraceCheckUtils]: 166: Hoare triple {34642#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34642#true} is VALID [2018-11-23 12:30:15,252 INFO L273 TraceCheckUtils]: 167: Hoare triple {34642#true} assume !!(~i~2 < 99999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34642#true} is VALID [2018-11-23 12:30:15,252 INFO L273 TraceCheckUtils]: 168: Hoare triple {34642#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34642#true} is VALID [2018-11-23 12:30:15,252 INFO L273 TraceCheckUtils]: 169: Hoare triple {34642#true} assume !(~i~2 < 99999); {34642#true} is VALID [2018-11-23 12:30:15,253 INFO L273 TraceCheckUtils]: 170: Hoare triple {34642#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {34642#true} is VALID [2018-11-23 12:30:15,253 INFO L256 TraceCheckUtils]: 171: Hoare triple {34642#true} call #t~ret11 := mapavg(~#x~0.base, ~#x~0.offset); {34642#true} is VALID [2018-11-23 12:30:15,253 INFO L273 TraceCheckUtils]: 172: Hoare triple {34642#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {35203#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:30:15,254 INFO L273 TraceCheckUtils]: 173: Hoare triple {35203#(<= mapavg_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35203#(<= mapavg_~i~0 0)} is VALID [2018-11-23 12:30:15,254 INFO L273 TraceCheckUtils]: 174: Hoare triple {35203#(<= mapavg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35210#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:30:15,254 INFO L273 TraceCheckUtils]: 175: Hoare triple {35210#(<= mapavg_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35210#(<= mapavg_~i~0 1)} is VALID [2018-11-23 12:30:15,255 INFO L273 TraceCheckUtils]: 176: Hoare triple {35210#(<= mapavg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35217#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:30:15,255 INFO L273 TraceCheckUtils]: 177: Hoare triple {35217#(<= mapavg_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35217#(<= mapavg_~i~0 2)} is VALID [2018-11-23 12:30:15,255 INFO L273 TraceCheckUtils]: 178: Hoare triple {35217#(<= mapavg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35224#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:30:15,256 INFO L273 TraceCheckUtils]: 179: Hoare triple {35224#(<= mapavg_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35224#(<= mapavg_~i~0 3)} is VALID [2018-11-23 12:30:15,256 INFO L273 TraceCheckUtils]: 180: Hoare triple {35224#(<= mapavg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35231#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:30:15,257 INFO L273 TraceCheckUtils]: 181: Hoare triple {35231#(<= mapavg_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35231#(<= mapavg_~i~0 4)} is VALID [2018-11-23 12:30:15,258 INFO L273 TraceCheckUtils]: 182: Hoare triple {35231#(<= mapavg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35238#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:30:15,258 INFO L273 TraceCheckUtils]: 183: Hoare triple {35238#(<= mapavg_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35238#(<= mapavg_~i~0 5)} is VALID [2018-11-23 12:30:15,259 INFO L273 TraceCheckUtils]: 184: Hoare triple {35238#(<= mapavg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35245#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:30:15,259 INFO L273 TraceCheckUtils]: 185: Hoare triple {35245#(<= mapavg_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35245#(<= mapavg_~i~0 6)} is VALID [2018-11-23 12:30:15,260 INFO L273 TraceCheckUtils]: 186: Hoare triple {35245#(<= mapavg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35252#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:30:15,261 INFO L273 TraceCheckUtils]: 187: Hoare triple {35252#(<= mapavg_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35252#(<= mapavg_~i~0 7)} is VALID [2018-11-23 12:30:15,261 INFO L273 TraceCheckUtils]: 188: Hoare triple {35252#(<= mapavg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35259#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:30:15,262 INFO L273 TraceCheckUtils]: 189: Hoare triple {35259#(<= mapavg_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35259#(<= mapavg_~i~0 8)} is VALID [2018-11-23 12:30:15,263 INFO L273 TraceCheckUtils]: 190: Hoare triple {35259#(<= mapavg_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35266#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:30:15,263 INFO L273 TraceCheckUtils]: 191: Hoare triple {35266#(<= mapavg_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35266#(<= mapavg_~i~0 9)} is VALID [2018-11-23 12:30:15,264 INFO L273 TraceCheckUtils]: 192: Hoare triple {35266#(<= mapavg_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35273#(<= mapavg_~i~0 10)} is VALID [2018-11-23 12:30:15,264 INFO L273 TraceCheckUtils]: 193: Hoare triple {35273#(<= mapavg_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35273#(<= mapavg_~i~0 10)} is VALID [2018-11-23 12:30:15,265 INFO L273 TraceCheckUtils]: 194: Hoare triple {35273#(<= mapavg_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35280#(<= mapavg_~i~0 11)} is VALID [2018-11-23 12:30:15,265 INFO L273 TraceCheckUtils]: 195: Hoare triple {35280#(<= mapavg_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {35280#(<= mapavg_~i~0 11)} is VALID [2018-11-23 12:30:15,266 INFO L273 TraceCheckUtils]: 196: Hoare triple {35280#(<= mapavg_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35287#(<= mapavg_~i~0 12)} is VALID [2018-11-23 12:30:15,267 INFO L273 TraceCheckUtils]: 197: Hoare triple {35287#(<= mapavg_~i~0 12)} assume !(~i~0 < 100000); {34643#false} is VALID [2018-11-23 12:30:15,267 INFO L273 TraceCheckUtils]: 198: Hoare triple {34643#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 100000 then 1 + ~ret~0 / 100000 else ~ret~0 / 100000) % 4294967296 - 4294967296); {34643#false} is VALID [2018-11-23 12:30:15,267 INFO L273 TraceCheckUtils]: 199: Hoare triple {34643#false} assume true; {34643#false} is VALID [2018-11-23 12:30:15,267 INFO L268 TraceCheckUtils]: 200: Hoare quadruple {34643#false} {34642#true} #74#return; {34643#false} is VALID [2018-11-23 12:30:15,268 INFO L273 TraceCheckUtils]: 201: Hoare triple {34643#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {34643#false} is VALID [2018-11-23 12:30:15,268 INFO L273 TraceCheckUtils]: 202: Hoare triple {34643#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {34643#false} is VALID [2018-11-23 12:30:15,268 INFO L273 TraceCheckUtils]: 203: Hoare triple {34643#false} assume !false; {34643#false} is VALID [2018-11-23 12:30:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 632 proven. 144 refuted. 0 times theorem prover too weak. 2249 trivial. 0 not checked. [2018-11-23 12:30:15,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:15,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 55 [2018-11-23 12:30:15,307 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-11-23 12:30:15,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:15,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 12:30:15,489 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:30:15,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 12:30:15,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 12:30:15,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:30:15,491 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 55 states. [2018-11-23 12:30:17,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:17,266 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2018-11-23 12:30:17,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 12:30:17,267 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-11-23 12:30:17,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:30:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 162 transitions. [2018-11-23 12:30:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:30:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 162 transitions. [2018-11-23 12:30:17,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 162 transitions. [2018-11-23 12:30:17,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:17,435 INFO L225 Difference]: With dead ends: 215 [2018-11-23 12:30:17,435 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 12:30:17,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:30:17,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 12:30:17,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-11-23 12:30:17,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:17,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 151 states. [2018-11-23 12:30:17,491 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 151 states. [2018-11-23 12:30:17,492 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 151 states. [2018-11-23 12:30:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:17,495 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-23 12:30:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:30:17,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:17,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:17,496 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 153 states. [2018-11-23 12:30:17,496 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 153 states. [2018-11-23 12:30:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:17,499 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-23 12:30:17,499 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:30:17,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:17,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:17,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:17,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-23 12:30:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2018-11-23 12:30:17,501 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 204 [2018-11-23 12:30:17,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:17,502 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2018-11-23 12:30:17,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-23 12:30:17,502 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2018-11-23 12:30:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-23 12:30:17,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:17,503 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:17,503 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:17,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:17,503 INFO L82 PathProgramCache]: Analyzing trace with hash -796212677, now seen corresponding path program 40 times [2018-11-23 12:30:17,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:17,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:17,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:17,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:17,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat